DataMuseum.dk

Presents historical artifacts from the history of:

Rational R1000/400

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

Excavated with: AutoArchaeologist - Free & Open Source Software. 

top - download

⟦97071f349⟧ Ada Source

    Length: 4096 (0x1000)
    Types: Ada Source
    Notes: 03_class, FILE, R1k_Segment, e3_tag, package body Ct_Hierarchy, seg_0043e7

Derivation

└─⟦8527c1e9b⟧ Bits:30000544 8mm tape, Rational 1000, Arrival backup of disks in PAM's R1000
    └─ ⟦cfc2e13cd⟧ »Space Info Vol 2« 
        └─⟦this⟧

E3 Source Code



with Directory_Tools;
package body Ct_Hierarchy is


    function Image (Of_This_Element : Ada_Program.Element)
                   return Ub_Strings.Variable_String is
    begin
        return Ub_Strings.Value
                  (Directory_Tools.Naming.Ada_Name
                      (Ada_Program.Conversion.Get_Name (Of_This_Element)));
    end Image;




    function Conversion (Of_This_Map : Hierarchy.Map) return Display_Map is
        The_Map : Display_Map (Of_This_Map.Size);
    begin  
        The_Map.Num_Parents := Of_This_Map.Num_Parents;
        for This_Parent in 1 .. The_Map.Num_Parents loop
            The_Map.Parents (This_Parent) :=
               Object'(Of_This_Map.Parents (This_Parent),
                       Image (Of_This_Map.Parents (This_Parent)),
                       This_Parent + 1, 11);
        end loop;


        The_Map.Element := Object'(Of_This_Map.Current,
                                   Image (Of_This_Map.Current),
                                   The_Map.Num_Parents + 6, 4);


        The_Map.Return_Option :=
           Object'(Ada_Program.Nil_Element, Ub_Strings.Value ("Quit"),
                   The_Map.Num_Parents + 6,
                   10 + Ub_Strings.Length (The_Map.Element.Name));


        The_Map.Num_Children := Of_This_Map.Num_Children;
        for This_Child in 1 .. The_Map.Num_Children loop
            The_Map.Children (This_Child) :=
               Object'(Of_This_Map.Children (This_Child),  
                       Image (Of_This_Map.Children (This_Child)),
                       The_Map.Element.Line + 4 + This_Child, 11);
        end loop;


        return The_Map;
    end Conversion;


    procedure Put (This_Map : Display_Map; In_This_Window : Window) is separate;


    function Get_Next (This_Map : Display_Map; In_This_Window : Window)
                      return Ada_Program.Element is separate;

    function Conversion (Of_This_Tree : Call_Tree_Queues.Queue)
                        return Hierarchy.Hier is separate;
end Ct_Hierarchy;

E3 Meta Data

    nblk1=3
    nid=0
    hdr6=6
        [0x00] rec0=1e rec1=00 rec2=01 rec3=07a
        [0x01] rec0=1d rec1=00 rec2=02 rec3=048
        [0x02] rec0=03 rec1=00 rec2=03 rec3=000
    tail 0x217001692815c6348d5e4 0x42a00088462061e03