DataMuseum.dkPresents historical artifacts from the history of: Rational R1000/400 Tapes |
This is an automatic "excavation" of a thematic subset of
See our Wiki for more about Rational R1000/400 Tapes Excavated with: AutoArchaeologist - Free & Open Source Software. |
top - downloadIndex: ┃ T V ┃
Length: 1585 (0x631) Types: TextFile Names: »V«
└─⟦5829e5ed5⟧ Bits:30000534 8mm tape, Rational 1000, RCI 2_0_5 └─ ⟦c9a165082⟧ »DATA« └─⟦2162db02b⟧ └─⟦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;