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

⟦a5125f8d6⟧ Ada Source

    Length: 6144 (0x1800)
    Types: Ada Source
    Notes: 03_class, FILE, R1k_Segment, e3_tag, package body Brick_New, seg_011e96

Derivation

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

with Expertsystem;
use Expertsystem;

package body Brick_New is

    type Struct_Brick is
        record
            His_Size  : Tsize  := 1;
            His_Color : Tcolor := Rose;
            His_Place : Tplace := Tas;
            His_Box   : Tbox;
        end record;


    package Behavior is new Classbehavior (Struct_Brick, "BRIQUES   ");

------------------------------------------------------------------------------
    function All_Bricks return Collection.Object is
    begin
        return Behavior.Allinstances;
    end All_Bricks;

------------------------------------------------------------------------------
    function Is_The_Place
                (Of_Brick : Object; The_Place : Tplace) return Boolean is
    begin
        return Behavior.Get (Of_Brick).His_Place = The_Place;
    end Is_The_Place;

------------------------------------------------------------------------------
    function Size (Of_Brick : Object) return Tsize is
    begin
        return Behavior.Get (Of_Brick).His_Size;
    end Size;

------------------------------------------------------------------------------
    function Color (Of_Brick : Object) return Tcolor is
    begin
        return Behavior.Get (Of_Brick).His_Color;
    end Color;

------------------------------------------------------------------------------
    procedure Create is
    begin
        -- for I in 10 .. 30 loop
        --     Behavior.Allocate (Struct_Brick'(Tsize (I), Rose, Tas, Tbox (1)));
        -- end loop;
        Behavior.Allocate (Struct_Brick'(Tsize (100), Grise, Tas, Tbox (1)));
        Behavior.Allocate (Struct_Brick'(Tsize (200), Blanche, Tas, Tbox (1)));
        Behavior.Allocate (Struct_Brick'(Tsize (300), Rose, Tas, Tbox (1)));
        Behavior.Allocate (Struct_Brick'(Tsize (5), Blanche, Tas, Tbox (1)));
        Behavior.Allocate (Struct_Brick'(Tsize (150), Grise, Tas, Tbox (1)));
        Behavior.Allocate (Struct_Brick'(Tsize (15), Grise, Tas, Tbox (1)));
        Put_Line (" ");
        Put (" Nb briques : ");
        Put (Behavior.Cardinality);
        Put_Line ("  ");
    end Create;

------------------------------------------------------------------------------
    procedure Modify (The_Brick : Object; The_Place : Tplace) is
        A_Brick : Struct_Brick;
    begin
        A_Brick           := Behavior.Get (The_Brick);
        A_Brick.His_Place := The_Place;
        Behavior.Set (The_Brick, A_Brick);
    end Modify;

------------------------------------------------------------------------------
    procedure Modify (The_Brick : Object; The_Box : Tbox) is
        A_Brick : Struct_Brick;
    begin
        A_Brick         := Behavior.Get (The_Brick);
        A_Brick.His_Box := The_Box;
        Behavior.Set (The_Brick, A_Brick);
    end Modify;


------------------------------------------------------------------------------

    function On_Heap (R : Object) return Boolean is
    begin
        return Behavior.Get (R).His_Place = Tas;
    end On_Heap;

    function Brick_On_Heap is new Collection.Restrict (On_Heap);

    function Greatest (R, Any : Object) return Boolean is
    begin
        return Behavior.Get (R).His_Size > Behavior.Get (Any).His_Size;
    end Greatest;

    function The_Greatest is new Collection.Themost (Greatest);

    function The_Greatest_On_Heap (Brick : Object) return Boolean is
    begin
        return Behavior.Get (Brick).His_Size =
                  Behavior.Get
                     (The_Greatest (Brick_On_Heap (Behavior.Instances))).
                  His_Size;
    end The_Greatest_On_Heap;



end Brick_New;

    nblk1=5
    nid=0
    hdr6=a
        [0x00] rec0=20 rec1=00 rec2=01 rec3=06a
        [0x01] rec0=01 rec1=00 rec2=05 rec3=006
        [0x02] rec0=15 rec1=00 rec2=02 rec3=068
        [0x03] rec0=1c rec1=00 rec2=03 rec3=062
        [0x04] rec0=1b rec1=00 rec2=04 rec3=001
    tail 0x2170df0ca82466d01c55f 0x42a00088462063c03