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

⟦bff892d54⟧ Ada Source

    Length: 5120 (0x1400)
    Types: Ada Source
    Notes: 03_class, FILE, R1k_Segment, e3_tag, package body Search_Top_With_Upper_Limit_Rule, seg_04bf83, 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_With_Upper_Limit_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.Exist ((Request_Name => Is_Equal (Move_Request_Name),
                            Answer       => Is_Equal (Negative_Answer)))  
            );
    end Premiss;


    procedure Action (Objects : Fact_Collection) is
        use Fruit_Frames_5;
        use Slot;  
        The_Label_Answer_Fact    : Fact_Name renames Objects (6);
        The_Negative_Answer_Fact : Fact_Name renames Objects (8);  
    begin  
        Output_Stream.New_Line (Output_Stream.Standard_Output);
        Output_Stream.Put_Line ("***************************************",
                                Output_Stream.Standard_Output);
        Output_Stream.Put_Line ("search top rule with upper limit",
                                Output_Stream.Standard_Output);
        Output_Stream.Put_Line ("***************************************",
                                Output_Stream.Standard_Output);
        Output_Stream.New_Line (Output_Stream.Standard_Output);  
        Markers.Add ((Marker_Name => Top_Block_Marker_Name));
        Answers.Delete ((The_Label_Answer_Fact));
        Answers.Delete ((The_Negative_Answer_Fact));
    end Action;
end Search_Top_With_Upper_Limit_Rule;

E3 Meta Data

    nblk1=4
    nid=2
    hdr6=6
        [0x00] rec0=18 rec1=00 rec2=01 rec3=058
        [0x01] rec0=14 rec1=00 rec2=04 rec3=04c
        [0x02] rec0=06 rec1=00 rec2=03 rec3=000
        [0x03] rec0=05 rec1=1a rec2=45 rec3=542
    tail 0x21751ba8286926234b676 0x42a00088462063c03
Free Block Chain:
  0x2: 0000  00 00 00 ff 80 14 2e 53 74 61 6e 64 61 72 64 5f  ┆      .Standard_┆