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 - metrics - download

⟦272369ded⟧ Ada Source

    Length: 3072 (0xc00)
    Types: Ada Source
    Notes: 03_class, FILE, R1k_Segment, e3_tag, package body Arbres, seg_0421bf, seg_04528c, seg_0452a1, seg_049428

Derivation

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

package body Arbres is
    type Noeud is
        record
            L_Element : Element;
            Sous_Arbre_Gauche : Arbre;
            Sous_Arbre_Droit : Arbre;
        end record;

    function Arbre_Vide (Un_Arbre : in Arbre) return Boolean is
    begin
        return (Un_Arbre = null);
    exception
        when others =>
            raise Arbre_Inexistant;
    end Arbre_Vide;

    function Consulter (Un_Arbre : in Arbre) return Element is
    begin
        return Un_Arbre.L_Element;
    exception
        when others => --constraint error
            raise Arbre_Est_Vide;
    end Consulter;

    function Gauche (Un_Arbre : Arbre) return Arbre is
    begin
        return Un_Arbre.Sous_Arbre_Gauche;
    end Gauche;

    function Droit (Un_Arbre : Arbre) return Arbre is
    begin
        return Un_Arbre.Sous_Arbre_Droit;
    end Droit;

    procedure Construire (L_Element : in Element;
                          L_Arbre : in out Arbre;
                          Le_Fils : Fils) is
    begin
        if Le_Fils = Gauche then
            L_Arbre := new Noeud'(L_Element => L_Element,
                                  Sous_Arbre_Gauche => L_Arbre,
                                  Sous_Arbre_Droit => null);
        else
            L_Arbre := new Noeud'(L_Element => L_Element,
                                  Sous_Arbre_Gauche => null,
                                  Sous_Arbre_Droit => L_Arbre);
        end if;
    exception
        when Storage_Error =>
            raise Debordement;
    end Construire;

end Arbres;

    nblk1=2
    nid=0
    hdr6=4
        [0x00] rec0=25 rec1=00 rec2=01 rec3=050
        [0x01] rec0=13 rec1=00 rec2=02 rec3=001
    tail 0x2153c1ae886215da1f14f 0x42a00088462060003