DataMuseum.dk

Presents historical artifacts from the history of:

Rational R1000/400 Tapes

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 Tapes

Excavated with: AutoArchaeologist - Free & Open Source Software. 

top - download
Index: ┃ B T ┃

⟦eb422359e⟧ TextFile

    Length: 786 (0x312)
    Types: TextFile
    Names: »B«

Derivation

└─⟦a7d1ea751⟧ Bits:30000550 8mm tape, Rational 1000, !users!projects 94_04_11
    └─ ⟦129cab021⟧ »DATA« 
        └─⟦this⟧

TextFile

with Text_Io;
with Binary_Tree;
procedure Test_Binary_Tree is
    N1, N2, N3, N4 : Binary_Tree.Node;
    Col : Integer := 1;
begin
    Text_Io.Put_Line ("merde");
    N1 := new Binary_Tree.Node_Structure;
    Text_Io.Put_Line ("toto");
    N2 := new Binary_Tree.Node_Structure;
    N3 := new Binary_Tree.Node_Structure;
    N4 := new Binary_Tree.Node_Structure;
    Text_Io.Put_Line ("titi");
    N1.Left_Son := N2;
    N1.Right_Son := N3;
    N3.Left_Son := N4;
    N1.The_Type := Binary_Tree.Liste_Type;
    N2.The_Type := Binary_Tree.Si_Type;
    N3.The_Type := Binary_Tree.Sinon_Type;
    N4.The_Type := Binary_Tree.Selon_Type;
    N1.S := new String'("salut...");
    N4.S := new String'("go...");
    Text_Io.Put_Line ("tutu");
    Binary_Tree.Put_Node (N1);
end Test_Binary_Tree;