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: ┃ H T

⟦363636b18⟧ TextFile

    Length: 2375 (0x947)
    Types: TextFile
    Names: »HIERARCHY«

Derivation

└─⟦149519bd4⟧ Bits:30000546 8mm tape, Rational 1000, !projects 93-07-13
    └─ ⟦124ff5788⟧ »DATA« 
        └─⟦this⟧ 
└─⟦a7d1ea751⟧ Bits:30000550 8mm tape, Rational 1000, !users!projects 94_04_11
    └─ ⟦129cab021⟧ »DATA« 
        └─⟦this⟧ 
└─⟦f64eaa120⟧ Bits:30000752 8mm tape, Rational 1000, !projects 93 02 16
    └─ ⟦6f12a12be⟧ »DATA« 
        └─⟦this⟧ 
└─⟦a7d1ea751⟧ Bits:30000550 8mm tape, Rational 1000, !users!projects 94_04_11
    └─ ⟦129cab021⟧ »DATA« 
        └─⟦bb25a46d4⟧ 
└─⟦f64eaa120⟧ Bits:30000752 8mm tape, Rational 1000, !projects 93 02 16
    └─ ⟦6f12a12be⟧ »DATA« 
        └─⟦bb25a46d4⟧ 
└─⟦2f6cfab89⟧ Bits:30000547 8mm tape, Rational 1000, !projects 94-01-04
    └─ ⟦d65440be7⟧ »DATA« 
        └─⟦bb25a46d4⟧ 
            └─⟦this⟧ 
└─⟦2f6cfab89⟧ Bits:30000547 8mm tape, Rational 1000, !projects 94-01-04
    └─ ⟦d65440be7⟧ »DATA« 
        └─⟦this⟧ 

TextFile

--
-- This script returns an output file describing the hierarchy of the
-- specified model.  The syntax of this file is as follows:
--
--    A   -- model identifier
--    M   -- A's node number
--    ... -- A's comments
--    ... -- requirements 1 to 9 for A 
--    2   -- number of sons of A
--    B   -- identifier of A's first son
--    M1  -- B's node number    
--    ... -- B's comments
--    ... -- requirements 1 to 9 for B 
--    0   -- number of sons of B
--    C   -- identifier of A's second son
--    M2  -- C's node number
--    ... -- C's comments
--    ... -- requirements 1 to 9 for C 
--    1   -- number of sons of C
--    D   -- identifier of C's unique son
--    M21 -- D's node number
--    ... -- D's comments
--    ... -- requirements 1 to 9 for D 
--    0   -- number of sons of D
--           
-- This syntax has been chosen to make sure that we can parse the module
-- identifiers even if they contain funny characters.  This information
-- will be used to create the following gateway structure:
--
--    A
--      .B
--      .C
--         .D
--    
outfile : output;
root : Tmodule;
--
feature (Tmodule) annotation (s : string) is
local
do  
   if current.is_valued (s) then
      outfile.fprint_f ("%s\n", current.stgann (s));
   else
      outfile.fprint_f ("\n");
   end;
end;
--
feature (Tmodule) hierarchy () is
local
   sons : set [Tmodule];
   son  : Tmodule;
do                               
   outfile.fprint_f ("%s\n", current.ident);
   outfile.fprint_f ("%s\n", current.node);
   outfile.fprint_f ("%s\n", current.comment);
   current.annotation ("requirement_1");
   current.annotation ("requirement_2");
   current.annotation ("requirement_3");
   current.annotation ("requirement_4");
   current.annotation ("requirement_5");
   current.annotation ("requirement_6");
   current.annotation ("requirement_7");
   current.annotation ("requirement_8");
   current.annotation ("requirement_9");
   sons := current.sons;
   outfile.fprint_f ("%d\n", sons.card);
   for son in sons do
      son.hierarchy;
   end;
end;                                          
--             
outfile.create ("**OUTPUT**");
outfile.open_write;
root := modelc_load ("**MODEL**",
                     "**ANNOTATIONS**",
                     "**ANNOTATION_TYPES**",
                     "M",
                     false);
root.hierarchy;
outfile.close;