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: 3604 (0xe14) Types: TextFile Names: »V«
└─⟦5829e5ed5⟧ Bits:30000534 8mm tape, Rational 1000, RCI 2_0_5 └─ ⟦c9a165082⟧ »DATA« └─⟦2162db02b⟧ └─⟦this⟧
generic Size : Integer; -- number of buckets type Domain_Type is private; type Range_Type is private; -- both types are pure values -- no initialization or finalization is necessary -- = and := can be used for equality and copy with function Hash (Key : Domain_Type) return Integer is <>; -- for efficiency, spread hash over an interval at least as great as size pragma Must_Be_Constrained (Yes => Domain_Type, Range_Type); package Concurrent_Map_Generic is type Map is private; type Pair is record D : Domain_Type; R : Range_Type; end record; function Eval (The_Map : Map; D : Domain_Type) return Range_Type; procedure Find (The_Map : Map; D : Domain_Type; R : in out Range_Type; Success : out Boolean); procedure Find (The_Map : Map; D : Domain_Type; P : in out Pair; Success : out Boolean); procedure Define (The_Map : in out Map; D : Domain_Type; R : Range_Type; Trap_Multiples : Boolean := False); procedure Undefine (The_Map : in out Map; D : Domain_Type); procedure Initialize (The_Map : out Map); function Is_Empty (The_Map : Map) return Boolean; procedure Make_Empty (The_Map : in out Map); procedure Copy (Target : in out Map; Source : Map); type Iterator is private; procedure Init (Iter : out Iterator; The_Map : Map); procedure Next (Iter : in out Iterator); function Value (Iter : Iterator) return Domain_Type; function Done (Iter : Iterator) return Boolean; Undefined : exception; -- raised by eval if the domain value in not in the map Multiply_Defined : exception; -- raised by define if the domain value is already defined and -- the trap_multiples flag has been specified (ie. is true) function Nil return Map; function Is_Nil (The_Map : Map) return Boolean; function Cardinality (The_Map : Map) return Natural; ------------------------------------------------------ -- Implementation Notes and Non-Standard Operations -- ------------------------------------------------------ -- := and = operate on references -- := implies sharing (introduces an alias) -- = means is the same map, not the same value of type map -- Initializing a map also makes it empty -- Maps must be initialized before use. -- garbage may be generated -- Concurrent Properties -- any number of find/eval/is_empty/copy may be safely done while one -- define/undefine/make_empty is taking place. -- Define/undefine/make_empty operations are serialized. -- Iterators may be used asynchronously, however the sequence of values -- yielded may never have been in the map at any one time. private type Node; type Set is access Node; type Node is record Value : Pair; Link : Set; end record; type Map_Data; type Map is access Map_Data; type Iterator is record The_Map : Map; Index_Value : Natural; Set_Iter : Set; Done : Boolean; end record; subtype Index is Integer range 0 .. Size - 1; type Table is array (Index) of Set; type Map_Data is record Cache : Set; -- of at most one node Bucket : Table; Size : Natural := 0; end record; end Concurrent_Map_Generic;