|
|
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: 11264 (0x2c00)
Types: Ada Source
Notes: 03_class, FILE, R1k_Segment, e3_tag, package body Data_Client, seg_04ad8c
└─⟦8527c1e9b⟧ Bits:30000544 8mm tape, Rational 1000, Arrival backup of disks in PAM's R1000
└─⟦5a81ac88f⟧ »Space Info Vol 1«
└─⟦this⟧
with Set_Generic;
with String_Map_Generic;
with Text_Io;
with Transport_Stream;
with Unbounded_String;
use Text_Io;
package body Data_Client is
type Iterator_Implementation is new Client_Memory.Iterator;
package Subs is new String_Map_Generic (Size => 100,
Range_Type => Set,
Ignore_Case => True);
package Servers is
new String_Map_Generic
(Size => 100, Range_Type => Set, Ignore_Case => True);
Subs_Map : Subs.Map;
Servers_Map : Servers.Map;
Status : Boolean;
function Create (Stream : Transport_Stream.Stream_Id;
Number_Request : Natural) return Object is
The_Object : Object;
begin
The_Object.Number_Request := Number_Request;
The_Object.Stream := Stream;
return The_Object;
end Create;
function Identifie (The : Object) return Natural is
begin
return The.Number_Request;
end Identifie;
function Streamer (The : Object) return Transport_Stream.Stream_Id is
begin
return The.Stream;
end Streamer;
procedure Initialize (S : out Set) is
begin
Client_Memory.Initialize (S => S);
end Initialize;
procedure Plus (Element : Data_Client.Object; S : in out Set) is
begin
Client_Memory.Add (S => S, X => Element);
end Plus;
procedure Minus (Element : Object; S : in out Set) is
begin
Client_Memory.Delete (S => S, X => Element);
end Minus;
function Give (Number : Natural; S : Set) return Object is
Rest : Set := S;
begin
while Rest /= null loop
if Data_Client.Identifie (Rest.Value) = Number then
return Rest.Value;
end if;
Rest := Rest.Link;
end loop;
end Give;
procedure Next (Iter : Iterator) is
begin
Client_Memory.Next (Iter => Client_Memory.Iterator (Iter.all));
end Next;
function Value (Iter : Iterator) return Object is
begin
return Client_Memory.Value (Client_Memory.Iterator (Iter.all));
end Value;
function Is_Done (Iter : Iterator) return Boolean is
begin
if Iter = null then
return True;
end if;
return Client_Memory.Done (Client_Memory.Iterator (Iter.all));
end Is_Done;
end Data_Client;
nblk1=a
nid=3
hdr6=6
[0x00] rec0=22 rec1=00 rec2=01 rec3=06e
[0x01] rec0=27 rec1=00 rec2=05 rec3=036
[0x02] rec0=19 rec1=00 rec2=09 rec3=000
[0x03] rec0=1c rec1=00 rec2=05 rec3=018
[0x04] rec0=21 rec1=00 rec2=07 rec3=000
[0x05] rec0=24 rec1=00 rec2=0a rec3=018
[0x06] rec0=20 rec1=00 rec2=06 rec3=000
[0x07] rec0=19 rec1=00 rec2=09 rec3=000
[0x08] rec0=20 rec1=00 rec2=09 rec3=006
[0x09] rec0=03 rec1=00 rec2=04 rec3=001
tail 0x2154804e286776866a889 0x42a00088462060003
Free Block Chain:
0x3: 0000 00 07 02 86 80 09 65 73 74 2e 4c 69 6e 6b 3b 09 ┆ est.Link; ┆
0x7: 0000 00 06 00 21 80 02 65 3b 02 00 00 00 00 00 00 00 ┆ ! e; ┆
0x6: 0000 00 0a 03 fc 80 2c 20 20 20 70 72 6f 63 65 64 75 ┆ , procedu┆
0xa: 0000 00 02 00 0a 80 07 20 20 20 20 20 20 20 07 20 20 ┆ ┆
0x2: 0000 00 08 00 16 80 13 65 66 69 6e 65 20 28 54 68 65 ┆ efine (The┆
0x8: 0000 00 04 03 60 80 09 6d 65 6e 74 20 74 68 65 6e 09 ┆ ` ment then ┆
0x4: 0000 00 00 00 49 80 2d 20 53 65 72 76 65 72 73 2e 49 ┆ I - Servers.I┆