|
DataMuseum.dkPresents historical artifacts from the history of: Rational R1000/400 |
This is an automatic "excavation" of a thematic subset of
See our Wiki for more about Rational R1000/400 Excavated with: AutoArchaeologist - Free & Open Source Software. |
top - metrics - download
Length: 6144 (0x1800) Types: Ada Source Notes: 03_class, FILE, R1k_Segment, e3_tag, procedure Test_Verb_Table, seg_041251
└─⟦8527c1e9b⟧ Bits:30000544 8mm tape, Rational 1000, Arrival backup of disks in PAM's R1000 └─⟦cfc2e13cd⟧ »Space Info Vol 2« └─⟦this⟧
with Text_Io, Verb, Verb_Table; use Text_Io; procedure Test_Verb_Table is V1, V2, V3, V4, V5, V6, V7, V8 : Verb.Object; Found : Boolean; begin Verb.Initialize (V1, "marcher", "aller"); Verb.Initialize (V2, "aller", "aller"); Verb.Initialize (V3, "poser", "poser"); Verb.Initialize (V4, "jeter", "poser"); Verb.Initialize (V5, "lancer", "poser"); Verb.Initialize (V6, "courir", "aller"); Verb.Initialize (V7, "sauter", "aller"); Verb.Initialize (V8, "deposer", "poser"); -- Put_Line ("s : " & Verb.Synonyme (V1) & " v : " & Verb.Verbe (V1)); -- Put_Line ("s : " & Verb.Synonyme (V2) & " v : " & Verb.Verbe (V2)); -- Put_Line ("s : " & Verb.Synonyme (V3) & " v : " & Verb.Verbe (V3)); -- Put_Line ("s : " & Verb.Synonyme (V4) & " v : " & Verb.Verbe (V4)); -- Put_Line ("s : " & Verb.Synonyme (V5) & " v : " & Verb.Verbe (V5)); -- Put_Line ("s : " & Verb.Synonyme (V6) & " v : " & Verb.Verbe (V6)); -- Put_Line ("s : " & Verb.Synonyme (V7) & " v : " & Verb.Verbe (V7)); -- Put_Line ("s : " & Verb.Synonyme (V8) & " v : " & Verb.Verbe (V8)); Verb_Table.Create_Iterator; while not Verb_Table.Iterator_Is_At_End loop V1 := Verb_Table.Item_Value; Put_Line ("s : " & Verb.Synonyme (V1) & " v : " & Verb.Verbe (V1)); Verb_Table.Next_Item; end loop; Verb_Table.Show; Verb_Table.Put (V1, Found); Verb_Table.Show; Verb_Table.Put (V1, Found); if Found then Put_Line ("Element deja insere !"); end if; Verb_Table.Show; Verb_Table.Put (V2, Found); Verb_Table.Put (V3, Found); Verb_Table.Put (V4, Found); Verb_Table.Put (V5, Found); Verb_Table.Put (V6, Found); Verb_Table.Put (V7, Found); Verb_Table.Put (V8, Found); Verb_Table.Show; -- PENSER A FAIRE UN LOWER CASE AVANT LEX.GET_VALUE Verb_Table.Get ("lancer", V1, Found); if Found then Put_Line ("s : " & Verb.Synonyme (V1) & " v : " & Verb.Verbe (V1)); else Put_Line ("Element pas trouve !"); end if; Verb_Table.Get ("lance", V1, Found); if Found then Put_Line ("s : " & Verb.Synonyme (V1) & " v : " & Verb.Verbe (V1)); else Put_Line ("Element pas trouve !"); end if; Verb_Table.Get ("courir", V1, Found); if Found then Put_Line ("s : " & Verb.Synonyme (V1) & " v : " & Verb.Verbe (V1)); else Put_Line ("Element pas trouve !"); end if; Verb_Table.Get ("sauter", V1, Found); if Found then Put_Line ("s : " & Verb.Synonyme (V1) & " v : " & Verb.Verbe (V1)); else Put_Line ("Element pas trouve !"); end if; Verb_Table.Get (1, V1, Found); if Found then Put_Line ("s : " & Verb.Synonyme (V1) & " v : " & Verb.Verbe (V1)); else Put_Line ("Element pas trouve !"); end if; Verb_Table.Get (9, V1, Found); if Found then Put_Line ("s : " & Verb.Synonyme (V1) & " v : " & Verb.Verbe (V1)); else Put_Line ("Element pas trouve !"); end if; Verb_Table.Get (8, V1, Found); if Found then Put_Line ("s : " & Verb.Synonyme (V1) & " v : " & Verb.Verbe (V1)); else Put_Line ("Element pas trouve !"); end if; Verb_Table.Create_Iterator; while not Verb_Table.Iterator_Is_At_End loop V1 := Verb_Table.Item_Value; Put_Line ("s : " & Verb.Synonyme (V1) & " v : " & Verb.Verbe (V1)); Verb_Table.Next_Item; end loop; end Test_Verb_Table;
nblk1=5 nid=0 hdr6=a [0x00] rec0=1a rec1=00 rec2=01 rec3=094 [0x01] rec0=22 rec1=00 rec2=05 rec3=01e [0x02] rec0=08 rec1=00 rec2=03 rec3=03e [0x03] rec0=22 rec1=00 rec2=04 rec3=01c [0x04] rec0=11 rec1=00 rec2=02 rec3=000 tail 0x217416cae861352c4b93d 0x42a00088462060003