DataMuseum.dk

Presents historical artifacts from the history of:

Rational R1000/400 Tapes

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 Tapes

Excavated with: AutoArchaeologist - Free & Open Source Software. 

top - download
Index: ┃ B T ┃

⟦9362bde07⟧ TextFile

    Length: 2348 (0x92c)
    Types: TextFile
    Names: »B«

Derivation

└─⟦a7d1ea751⟧ Bits:30000550 8mm tape, Rational 1000, !users!projects 94_04_11
    └─ ⟦129cab021⟧ »DATA« 
        └─⟦this⟧ 
└─⟦2f6cfab89⟧ Bits:30000547 8mm tape, Rational 1000, !projects 94-01-04
    └─ ⟦d65440be7⟧ »DATA« 
        └─⟦this⟧

TextFile

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;