DataMuseum.dk

Presents historical artifacts from the history of:

Rational R1000/400

This is an automatic "excavation" of a thematic subset of
artifacts from Datamuseum.dk's BitArchive.

See our Wiki for more about Rational R1000/400

Excavated with: AutoArchaeologist - Free & Open Source Software. 

top - metrics - download

⟦6a423bbf5⟧ Ada Source

    Length: 5120 (0x1400)
    Types: Ada Source
    Notes: 03_class, FILE, R1k_Segment, e3_tag, package body Search_Top_Rule, seg_04bfe5, separate Fruit_Display_Gourou_Rule_Bundle_5

Derivation

└─⟦8527c1e9b⟧ Bits:30000544 8mm tape, Rational 1000, Arrival backup of disks in PAM's R1000
    └─⟦cfc2e13cd⟧ »Space Info Vol 2« 
        └─⟦this⟧

E3 Source Code



separate (Fruit_Display_Gourou_Rule_Bundle_5)

package body Search_Top_Rule is


    function Premiss return Fact_Queries is
        use Fruit_Frames_5;
    begin
        return (Requests.Absent ((Request_Name => Is_Any,
                                  Marker_Name  => Is_Any,
                                  Argument1    => Is_Any,
                                  Argument2    => Is_Any)),
                Markers.Exist ((Marker_Name => Is_Equal (Model_Marker_Name))),
                Markers.Exist ((Marker_Name =>
                                   Is_Equal (Top_Copied_Model_Marker_Name))),  
                Markers.Exist ((Marker_Name =>
                                   Is_Equal (Selected_Block_Marker_Name))),
                Markers.Exist ((Marker_Name =>
                                   Is_Equal (Search_Top_Block_Marker_Name))),
                Answers.Exist ((Request_Name =>
                                   Is_Equal (Get_Label_Request_Name),
                                Answer       => Is_Any)),
                Markers.Absent ((Marker_Name =>
                                    Is_Equal (Top_Block_Marker_Name))),
                Answers.Absent ((Request_Name => Is_Equal (Move_Request_Name),
                                 Answer       => Is_Any)));
    end Premiss;


    procedure Action (Objects : Fact_Collection) is
        use Fruit_Frames_5;
        use Slot;
        The_Answer_Fact : Fact_Name renames Objects (6);
        The_Label       : Slot.Object := Answers.Get (The_Answer_Fact, Answer);
    begin  
        Output_Stream.New_Line (Output_Stream.Standard_Output);
        Output_Stream.Put_Line ("***************************************",
                                Output_Stream.Standard_Output);
        Output_Stream.Put_Line ("search top rule",
                                Output_Stream.Standard_Output);
        Output_Stream.Put_Line ("***************************************",
                                Output_Stream.Standard_Output);
        Output_Stream.New_Line (Output_Stream.Standard_Output);
        if (The_Label = Null_Object) then
            Requests.Add ((Request_Name => Move_Request_Name,
                           Marker_Name  => Search_Top_Block_Marker_Name,
                           Argument1    => Down_Direction,
                           Argument2    => Value (1)));
            Markers.Add ((Marker_Name => Top_Block_Marker_Name));
        else  
            Requests.Add ((Request_Name => Move_Request_Name,
                           Marker_Name  => Search_Top_Block_Marker_Name,
                           Argument1    => Up_Direction,
                           Argument2    => Value (1)));
        end if;  
        Answers.Delete ((The_Answer_Fact));
    end Action;


end Search_Top_Rule;

E3 Meta Data

    nblk1=4
    nid=3
    hdr6=6
        [0x00] rec0=17 rec1=00 rec2=01 rec3=006
        [0x01] rec0=14 rec1=00 rec2=04 rec3=008
        [0x02] rec0=13 rec1=00 rec2=02 rec3=000
        [0x03] rec0=05 rec1=15 rec2=a0 rec3=142
    tail 0x21751d864869278626ea2 0x42a00088462063c03
Free Block Chain:
  0x3: 0000  00 00 03 84 80 06 2a 2a 2a 2a 22 2c 06 00 3f 20  ┆      ****",  ? ┆