|
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 - download
Length: 5120 (0x1400) Types: Ada Source Notes: 03_class, FILE, R1k_Segment, e3_tag, generic, package Generic_String_Sort_Array, seg_0477ff
└─⟦8527c1e9b⟧ Bits:30000544 8mm tape, Rational 1000, Arrival backup of disks in PAM's R1000 └─ ⟦5a81ac88f⟧ »Space Info Vol 1« └─⟦this⟧
generic type Element is private; Max_Element_Number : Natural := 100; Null_Element : Element; with procedure Show_Element (Item : Element); with function Get_Key (Item : Element) return String; package Generic_String_Sort_Array is type Object is private; subtype Element_Index is Natural range 0 .. Max_Element_Number; procedure Put (Collection : in out Object; Item : in Element; Ok : out Boolean); procedure Put (Collection : in out Object; Item : in Element); -- procedure Put (Collection : in out Object; --- Item : in Element; -- Index : in Positive; -- Ok : out Boolean); procedure Get (Collection : in Object; Item : out Element; Key : in String; Ok : out Boolean); procedure Get (Collection : in Object; Item : out Element; Key : in Element_Index; Ok : out Boolean); procedure Show (Collection : in Object); function Is_Empty (Collection : in Object) return Boolean; function Index (Collection : in Object; Key : in String) return Element_Index; function Belong (Collection : in Object; Key : in String) return Boolean; function Number_Of (Collection : in Object) return Element_Index; type Iterator is private; procedure Init (Collection : in Object; An_Iterator : in out Iterator); function Done (An_Iterator : in Iterator) return Boolean; function Value (An_Iterator : in Iterator) return Element; -- function Index (An_Iterator : in Iterator) return Natural; procedure Next (An_Iterator : in out Iterator); Null_Iterator : constant Iterator; Null_Object : constant Object; private type Unconstraint_Array is array (Element_Index range <>) of Element; Null_Unconstraint_Array : constant Unconstraint_Array (1 .. 0) := (others => Null_Element); type Variable_Array (Length : Element_Index := 0) is record Inner : Unconstraint_Array (1 .. Length); end record; type Object is record Object : Variable_Array; end record; type Iterator is record Collection : Object := Null_Object; Index : Element_Index := 0; end record; Null_Object : constant Object := (Object => (Length => 0, Inner => Null_Unconstraint_Array)); Null_Iterator : constant Iterator := (Collection => Null_Object, Index => 0); end Generic_String_Sort_Array;
nblk1=4 nid=2 hdr6=6 [0x00] rec0=1b rec1=00 rec2=01 rec3=026 [0x01] rec0=17 rec1=00 rec2=03 rec3=054 [0x02] rec0=1a rec1=00 rec2=04 rec3=000 [0x03] rec0=19 rec1=00 rec2=03 rec3=000 tail 0x2154491b086546027c4d8 0x42a00088462060003 Free Block Chain: 0x2: 0000 00 00 02 d7 80 18 74 72 61 69 6e 74 5f 41 72 72 ┆ traint_Arr┆