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 - download

⟦b73604896⟧ Ada Source

    Length: 4096 (0x1000)
    Types: Ada Source
    Notes: 03_class, FILE, R1k_Segment, e3_tag, procedure Test_Table, seg_0310d5, seg_031108

Derivation

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

with Scanner;
with String_Map_Generic;
with Text_Io;
procedure Test_Table is

    package String_Map is
       new String_Map_Generic
              (Size => 50, Range_Type => Scanner.Token, Ignore_Case => True);
    Table : String_Map.Map;
    Cur_Token : Scanner.Token;
    Is_In_Table : Boolean := False;

    Traverse : String_Map.Iterator;
begin
    String_Map.Initialize (The_Map => Table);
    Cur_Token := Scanner.Pour;
    String_Map.Define
       (The_Map => Table, D => "pour", R => Cur_Token, Trap_Multiples => False);  
    String_Map.Define (The_Map => Table,
                       D => "prendre",
                       R => Scanner.Prendre,
                       Trap_Multiples => False);
    String_Map.Define (The_Map => Table,
                       D => "renvoyer",
                       R => Scanner.Renvoyer,
                       Trap_Multiples => False);
    String_Map.Define (The_Map => Table,
                       D => "Avec",
                       R => Scanner.Avec,
                       Trap_Multiples => False);
    String_Map.Find
       (The_Map => Table, D => "avec", R => Cur_Token, Success => Is_In_Table);
    if Is_In_Table then
        Text_Io.Put ("1:trouve dans la table");
        Text_Io.New_Line;
    else
        Text_Io.Put ("1:Non trouve dans la table");
    end if;
    String_Map.Undefine (Table, "avec");
    String_Map.Find
       (The_Map => Table, D => "avec", R => Cur_Token, Success => Is_In_Table);
    if Is_In_Table then
        Text_Io.Put ("2:trouve dans la table");
        Text_Io.New_Line;
    else
        Text_Io.Put ("2: Non trouve dans la table");
    end if;

    String_Map.Init (Iter => Traverse, The_Map => Table);
    while not String_Map.Done (Traverse) loop
        Text_Io.Put (String_Map.Value (Traverse));
        Text_Io.New_Line;
        String_Map.Next (Traverse);
    end loop;
    String_Map.Define (The_Map => Table,
                       D => "renvoyer",
                       R => Scanner.Renvoyer,
                       Trap_Multiples => False);

    Text_Io.New_Line;
    Text_Io.Put ("2eme iteration");
    String_Map.Init (Iter => Traverse, The_Map => Table);
    while not String_Map.Done (Traverse) loop
        Text_Io.Put (String_Map.Value (Traverse));
        Text_Io.New_Line;
        String_Map.Next (Traverse);
    end loop;

end Test_Table;

    nblk1=3
    nid=0
    hdr6=6
        [0x00] rec0=1d rec1=00 rec2=01 rec3=046
        [0x01] rec0=1c rec1=00 rec2=02 rec3=01e
        [0x02] rec0=0e rec1=00 rec2=03 rec3=000
    tail 0x2172ad82a84ba6964d6d2 0x42a00088462060003