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

⟦7fbdb14af⟧ Ada Source

    Length: 5120 (0x1400)
    Types: Ada Source
    Notes: 03_class, FILE, R1k_Segment, e3_tag, procedure Test_Enumeration, seg_041157

Derivation

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

with Identifier, Text_Io, Enumeration;
use Text_Io;
procedure Test_Enumeration is

    use Enumeration.Visible;

    Couleur : Enumeration.Object;
    L1, L2, L3, L4, L5, L6 : Identifier.Object;
    L_Couleur : Identifier_Array.Object;
    An_Iterator : Identifier_Array.Iterator;
    Found : Boolean;

begin
    Put_Line (Item => "-- enumeration.name (vide) --");
    Put_Line (Item => Enumeration.Name (Item => Couleur));

    Put_Line (Item => "-- enumeration.put --");
    Enumeration.Put (Item => Couleur, Name => "couleur");

    Put_Line (Item => "-- enumeration.name --");
    Put_Line (Item => Enumeration.Name (Item => Couleur));

    Put_Line (Item => "-- identifier.name (vide) --");
    Put_Line (Item => Identifier.Value (Item => L1));

    Put_Line ("-- identifier.put --");
    Identifier.Put (L1, "rouge");

    Put_Line ("-- identifier.name --");
    Put_Line (Identifier.Value (L1));

    Put_Line ("--- enumeration.put avec found --");
    Identifier_Array.Put (Collection => L_Couleur, Item => L1, Found => Found);
    if Found then
        Put_Line ("Element deja dans la table");
    end if;

    Put_Line ("-- iteration --");
    Identifier_Array.Create (Collection => L_Couleur,
                             An_Iterator => An_Iterator);
    while not Identifier_Array.Is_At_End (An_Iterator => An_Iterator) loop
        Put_Line (Identifier.Value (Item => Identifier_Array.Value
                                               (An_Iterator => An_Iterator)));
        Identifier_Array.Next (An_Iterator => An_Iterator);
    end loop;


    Identifier_Array.Put (L_Couleur, L1, Found);
    if Found then
        Put_Line ("Element deja dans la table");
    end if;

    Identifier.Put (L2, "bleu");
    Identifier.Put (L3, "vert");
    Identifier.Put (L4, "gris");
    Identifier.Put (L5, "blanc");
    Identifier.Put (L6, "noir");
    Identifier_Array.Put (L_Couleur, L2, Found);
    Identifier_Array.Put (L_Couleur, L3, Found);
    Identifier_Array.Put (L_Couleur, L4, Found);
    Identifier_Array.Put (L_Couleur, L5, Found);
    Identifier_Array.Put (L_Couleur, L6, Found);


    Put_Line ("-- iteration --");
    Identifier_Array.Create (L_Couleur, An_Iterator);
    while not Identifier_Array.Is_At_End (An_Iterator) loop
        Put_Line (Identifier.Value (Identifier_Array.Value (An_Iterator)));
        Identifier_Array.Next (An_Iterator);
    end loop;

    Enumeration.Put (Item => Couleur, The_Array => L_Couleur);

    Enumeration.Image (Item => Couleur);

end Test_Enumeration;

    nblk1=4
    nid=3
    hdr6=6
        [0x00] rec0=21 rec1=00 rec2=01 rec3=060
        [0x01] rec0=1b rec1=00 rec2=02 rec3=018
        [0x02] rec0=13 rec1=00 rec2=04 rec3=000
        [0x03] rec0=0c rec1=00 rec2=02 rec3=000
    tail 0x2174156608613437344ae 0x42a00088462060003
Free Block Chain:
  0x3: 0000  00 00 02 7b 80 20 72 72 61 79 2e 50 75 74 20 28  ┆   {  rray.Put (┆