|
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: 3072 (0xc00) Types: Ada Source Notes: 03_class, FILE, R1k_Segment, e3_tag, generic, package Queue_Generic, seg_014210
└─⟦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; pragma Must_Be_Constrained (Yes => Element); package Queue_Generic is type Queue is private; procedure Initialize (Q : out Queue); function Is_Empty (Q : Queue) return Boolean; procedure Make_Empty (Q : in out Queue); procedure Copy (Target : in out Queue; Source : Queue); procedure Add (Q : in out Queue; X : Element); procedure Delete (Q : in out Queue); function First (Q : Queue) return Element; -- on calls to delete and first, not is_empty(q) is assumed -- constraint error will be raises is is_empty(q) type Iterator is private; procedure Init (Iter : out Iterator; Q : Queue); procedure Next (Iter : in out Iterator); function Value (Iter : Iterator) return Element; function Done (Iter : Iterator) return Boolean; ------------------------------------------------------ -- Implementation Notes and Non-Standard Operations -- ------------------------------------------------------ -- variables of type queue are initially empty -- therefore, the call to initialize is optional -- := and = are meaningless -- := implies sharing (introduces an alias) for sub-structures -- garbage may be generated private type Node; type Pointer is access Node; type Node is record Value : Element; Link : Pointer; end record; type Queue is record Head : Pointer; Tail : Pointer; end record; type Iterator is new Queue; end Queue_Generic;
nblk1=2 nid=0 hdr6=4 [0x00] rec0=20 rec1=00 rec2=01 rec3=074 [0x01] rec0=1f rec1=00 rec2=02 rec3=000 tail 0x2150ef45a83127f655c31 0x42a00088462060003