|
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 - download
Length: 4096 (0x1000) Types: Ada Source Notes: 03_class, FILE, R1k_Segment, e3_tag, package Symbols, seg_04196e
└─⟦8527c1e9b⟧ Bits:30000544 8mm tape, Rational 1000, Arrival backup of disks in PAM's R1000 └─ ⟦5a81ac88f⟧ »Space Info Vol 1« └─⟦this⟧
with Dynamic_Object, Text_Io, Bounded_String, Binary_Trees_Pkg; package Symbols is Error_Symbol_Store : exception; Error_Symbol_Index : exception; Error_Symbol_Search : exception; type Object is limited private; type Symbol_Index is limited private; Max_Symbol_String : constant := 32; --Creation procedure Create (D : in out Object); --Access function Has_Symbol (D : in Object; Name : in String) return Boolean; function Get_Symbol_Type_By_Name (D : Object; Name : String) return String; procedure Get_Symbol_Value_By_Name (D : Object; Name : String; F : in out Dynamic_Object.Dynamic_Object); procedure Dump_Symbols (D : in Object); procedure Dump_Number_Of_Symbol (D : in Object); --Modification procedure Store_Symbol (D : in out Object; Aname : String; Atype : String; F : Dynamic_Object.Dynamic_Object); --Liberation procedure Dispose_Object (D : in out Object); --Iteration procedure Open_Symbol_Indexation (D : Object; I : in out Symbol_Index); procedure Next_Symbol_Index (I : in out Symbol_Index); function Get_Indexed_Symbol_Name (I : Symbol_Index) return String; function Get_Indexed_Symbol_Type (I : Symbol_Index) return String; procedure Get_Indexed_Symbol_Value (I : Symbol_Index; F : in out Dynamic_Object.Dynamic_Object); function No_More_Symbols (I : Symbol_Index) return Boolean; private type Symbol is record Symbol_Name : Bounded_String.Variable_String (Max_Symbol_String); Symbol_Type : Bounded_String.Variable_String (Max_Symbol_String); Symbol_Value : Dynamic_Object.Dynamic_Object; end record; function Compare (A, B : Symbol) return Integer; package Symbols_Tree is new Binary_Trees_Pkg (Symbol, Compare); type Object is record Node : Symbols_Tree.Tree; end record; type Symbol_Index is record Node : Symbols_Tree.Iterator; end record; end Symbols;
nblk1=3 nid=0 hdr6=6 [0x00] rec0=20 rec1=00 rec2=01 rec3=016 [0x01] rec0=1b rec1=00 rec2=02 rec3=04e [0x02] rec0=0d rec1=00 rec2=03 rec3=001 tail 0x2153c7880862656c4d74c 0x42a00088462060003