|
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_Binary_Tree, seg_04689c
└─⟦8527c1e9b⟧ Bits:30000544 8mm tape, Rational 1000, Arrival backup of disks in PAM's R1000
└─ ⟦5a81ac88f⟧ »Space Info Vol 1«
└─⟦this⟧
with Generic_Stack;
generic
type Element is private;
with function "<" (Obj1, Obj2 : Element) return Boolean;
with function Are_Equal (Obj1, Obj2 : Element) return Boolean;
with procedure Deep_Copy (Source : in Element; Target : in out Element);
package Generic_Binary_Tree is
--gestion de l'arbre
Value_Does_Not_Exist : exception;
Value_Already_Exists : exception;
Iterator_Is_Not_Opened : exception;
type Object is limited private;
procedure Purge (The_Tree : in out Object);
function Is_Empty (The_Tree : in Object) return Boolean;
procedure Insert (The_Tree : in out Object; What : Element);
procedure Get_Value (The_Tree : in Object; What : in out Element);
function Exists (The_Tree : in Object; What : in Element) return Boolean;
procedure Update (The_Tree : in Object; What : in Element);
procedure Light_Copy (Source : in Object; Target : in out Object);
procedure Deep_Copy (Source : in Object; Target : in out Object);
-- gestion de l'iterateur
type Iterator is limited private;
procedure Open (It : in out Iterator; The_Tree : Object);
procedure Next (It : in out Iterator);
function At_End (It : in Iterator) return Boolean;
function Consult (It : Iterator) return Element;
private
-- gestion de l'arbre
type Node;
type Object is access Node;
type Node is
record
Content : Element;
Left : Object := null;
Right : Object := null;
end record;
-- gestion de l'iterateur
package Stack is new Generic_Stack (Object);
type Iterator is
record
Current : Object;
The_Stack : Stack.Object;
Is_Opened : Boolean := False;
end record;
end Generic_Binary_Tree;
nblk1=4
nid=2
hdr6=4
[0x00] rec0=1b rec1=00 rec2=01 rec3=03c
[0x01] rec0=26 rec1=00 rec2=04 rec3=001
[0x02] rec0=0a rec1=00 rec2=00 rec3=004
[0x03] rec0=03 rec1=88 rec2=d9 rec3=442
tail 0x215433c5486515c56d097 0x42a00088462060003
Free Block Chain:
0x2: 0000 00 03 03 fc 80 1f 74 20 49 74 65 72 61 74 6f 72 ┆ t Iterator┆
0x3: 0000 00 00 00 06 00 00 00 00 00 00 58 dd 17 d3 db 97 ┆ X ┆