|
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 - metrics - download
Length: 13312 (0x3400)
Types: Ada Source
Notes: 03_class, FILE, R1k_Segment, e3_tag, generic, package Collection, seg_011809
└─⟦8527c1e9b⟧ Bits:30000544 8mm tape, Rational 1000, Arrival backup of disks in PAM's R1000
└─⟦5a81ac88f⟧ »Space Info Vol 1«
└─⟦this⟧
with Instance;
package Collection is
type Object is array (Positive range <>) of Instance.Reference;
function Null_Object return Collection.Object;
generic
with function Predicate
(With_Reference : Instance.Reference) return Boolean;
function Restrict (The_Collection : Collection.Object;
For_Quantity : Natural := Instance.Any)
return Collection.Object;
generic
with function Predicate
(With_Reference : Instance.Reference) return Boolean;
function Find_One (The_Collection : Collection.Object)
return Instance.Reference;
generic
with function Predicate
(With_Reference : Instance.Reference) return Boolean;
function Exist (The_Collection : Collection.Object) return Boolean;
generic
with function Predicate (The_Best : Instance.Reference;
Any_Other : Instance.Reference) return Boolean;
function The_Most (Of_Collection : Collection.Object)
return Instance.Reference;
function Cardinality (Of_Collection : Collection.Object) return Natural;
function Is_Null (The_Collection : Collection.Object) return Boolean;
function Add (In_Collection : Collection.Object;
The_Reference : Instance.Reference) return Collection.Object;
function Remove (In_Collection : Collection.Object;
The_Reference : Instance.Reference)
return Collection.Object;
procedure Clear (The_Collection : in out Collection.Object);
function Union (Collection1 : Collection.Object;
Collection2 : Collection.Object) return Collection.Object;
function "+" (Collection1 : Collection.Object;
Collection2 : Collection.Object) return Collection.Object
renames Union;
function Intersection (Collection1 : Collection.Object;
Collection2 : Collection.Object)
return Collection.Object;
function "*" (Collection1 : Collection.Object;
Collection2 : Collection.Object) return Collection.Object
renames Intersection;
function Difference (Collection1 : Collection.Object;
Collection2 : Collection.Object)
return Collection.Object;
function "-" (Collection1 : Collection.Object;
Collection2 : Collection.Object) return Collection.Object
renames Difference;
function Is_Member (Of_Collection : Collection.Object;
The_Reference : Instance.Reference) return Boolean;
function Is_Include (Collection1 : Collection.Object;
Collection2 : Collection.Object) return Boolean;
function "<" (Collection1 : Collection.Object;
Collection2 : Collection.Object) return Boolean
renames Is_Include;
function "<=" (Collection1 : Collection.Object;
Collection2 : Collection.Object) return Boolean
renames Is_Include;
function ">" (Collection1 : Collection.Object;
Collection2 : Collection.Object) return Boolean;
function ">=" (Collection1 : Collection.Object;
Collection2 : Collection.Object) return Boolean renames ">";
function Object_To_Collection
(The_Reference : Instance.Reference) return Collection.Object;
function Get (In_Collection : Collection.Object;
The_Position : Positive := 1) return Instance.Reference;
function Get (In_Collection : Collection.Object;
From_Position : Positive := 1;
To_Position : Positive)
return Collection.Object;
function First (Of_Collection : Collection.Object)
return Instance.Reference;
function Rest (Of_Collection : Collection.Object) return Collection.Object;
generic
with procedure Action (For_Reference : Instance.Reference);
procedure Do_For_All (The_Collection : Collection.Object);
generic
with function "<" (Left_Reference, Right_Reference : Instance.Reference)
return Boolean;
procedure Sort (The_Collection : in out Collection.Object);
Bad_Class : exception;
package Iterator is
Illegal_Access : exception;
type Iterator is private;
function Open (The_Collection : Collection.Object) return Iterator;
function Get (Of_Collection : Collection.Object;
The_Iterator : Iterator) return Instance.Reference;
function Next (Of_Collection : Collection.Object;
With_Iterator : Iterator) return Iterator;
function At_End (Of_Collection : Collection.Object;
With_Iterator : Iterator) return Boolean;
private
type Iterator is range Natural'First .. Natural'Last;
end Iterator;
end Collection;
nblk1=c
nid=9
hdr6=e
[0x00] rec0=24 rec1=00 rec2=01 rec3=056
[0x01] rec0=18 rec1=00 rec2=02 rec3=068
[0x02] rec0=06 rec1=00 rec2=07 rec3=032
[0x03] rec0=15 rec1=00 rec2=03 rec3=050
[0x04] rec0=1e rec1=00 rec2=05 rec3=018
[0x05] rec0=1b rec1=00 rec2=0a rec3=040
[0x06] rec0=06 rec1=00 rec2=06 rec3=000
[0x07] rec0=06 rec1=00 rec2=06 rec3=000
[0x08] rec0=06 rec1=00 rec2=0b rec3=000
[0x09] rec0=1b rec1=00 rec2=0b rec3=07a
[0x0a] rec0=10 rec1=00 rec2=04 rec3=000
[0x0b] rec0=00 rec1=80 rec2=00 rec3=000
tail 0x2150d02b0823d498bd805 0x42a00088462063c03
Free Block Chain:
0x9: 0000 00 0b 00 1b 80 18 20 20 20 66 75 6e 63 74 69 6f ┆ functio┆
0xb: 0000 00 08 00 32 00 11 20 20 20 20 65 6e 64 20 49 74 ┆ 2 end It┆
0x8: 0000 00 04 00 0c 80 09 65 72 65 6e 63 65 20 3a 20 09 ┆ erence : ┆
0x4: 0000 00 0c 00 11 80 0e 6e 63 74 69 6f 6e 20 4e 6f 74 ┆ nction Not┆
0xc: 0000 00 00 00 04 80 01 69 01 02 03 04 05 06 07 08 6f ┆ i o┆