DataMuseum.dk

Presents historical artifacts from the history of:

Rational R1000/400 Tapes

This is an automatic "excavation" of a thematic subset of
artifacts from Datamuseum.dk's BitArchive.

See our Wiki for more about Rational R1000/400 Tapes

Excavated with: AutoArchaeologist - Free & Open Source Software.


top - download
Index: ┃ T V

⟦54a3c70d0⟧ TextFile

    Length: 1693 (0x69d)
    Types: TextFile
    Names: »V«

Derivation

└─⟦d10a02448⟧ Bits:30000409 8mm tape, Rational 1000, ENVIRONMENT, D_12_7_3
    └─ ⟦fc9b38f02⟧ »DATA« 
        └─⟦9b46a407a⟧ 
            └─⟦12c68c704⟧ 
                └─⟦this⟧ 
└─⟦5f3412b64⟧ Bits:30000745 8mm tape, Rational 1000, ENVIRONMENT 12_6_5 TOOLS 
    └─ ⟦91c658230⟧ »DATA« 
        └─⟦458657fb6⟧ 
            └─⟦220843204⟧ 
                └─⟦this⟧ 

TextFile

generic
    type Element is private;

    pragma Must_Be_Constrained (Yes => Element);

package Queue_Generic is
    pragma Subsystem (Abstract_Types, Private_Part => Open);
    pragma Module_Name (4, 712);

    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;