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

⟦6feeab40c⟧ Ada Source

    Length: 3072 (0xc00)
    Types: Ada Source
    Notes: 03_class, FILE, R1k_Segment, e3_tag, procedure Test_Tree, seg_02f778

Derivation

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

with Text_Io;
with Binary_Tree;  
with Bounded_String;

procedure Test_Tree is

    Lexeme_Size : constant Positive := 80;
    subtype Lexeme is Bounded_String.Variable_String (Lexeme_Size);

    procedure Handle (The_Element : in Lexeme) is
    begin
        Text_Io.Put_Line (Bounded_String.Image (The_Element));
    end Handle;

    function Less_Than (Left, Right : Lexeme) return Boolean is
    begin
        if Bounded_String.Image (Left) < Bounded_String.Image (Right) then
            return True;
        else
            return False;
        end if;
    end Less_Than;

    package Tree is new Binary_Tree  
                           (Element => Lexeme, "<" => Less_Than);


    procedure Test is  
        Root_1, Root_2 : Tree.Object;
    begin
        Tree.Clear_Out (Root_1);
        Tree.Clear_Out (Root_2);

        Tree.Insert (Bounded_String.Value ("<", Lexeme_Size), Root_1);
        Tree.Insert (Bounded_String.Value ("expr1", Lexeme_Size), Root_1);
        Tree.Insert (Bounded_String.Value ("expr2", Lexeme_Size), Root_1);
        Tree.Insert (Bounded_String.Value ("28723", Lexeme_Size), Root_1);
        Tree.Visit_Lrr (Root_1);
    end Test;


begin
    Test;
end Test_Tree;

    nblk1=2
    nid=0
    hdr6=4
        [0x00] rec0=24 rec1=00 rec2=01 rec3=062
        [0x01] rec0=0a rec1=00 rec2=02 rec3=001
    tail 0x217286c2a849072b0317f 0x42a00088462060003