|
DataMuseum.dkPresents historical artifacts from the history of: Rational R1000/400 |
This is an automatic "excavation" of a thematic subset of
See our Wiki for more about Rational R1000/400 Excavated with: AutoArchaeologist - Free & Open Source Software. |
top - metrics - download
Length: 7168 (0x1c00)
Types: Ada Source
Notes: 03_class, FILE, R1k_Segment, e3_tag, package body Take_Biggest_Brick_From_Heap_Rule, seg_04a3f1, separate Br_Rule_Bundle
└─⟦8527c1e9b⟧ Bits:30000544 8mm tape, Rational 1000, Arrival backup of disks in PAM's R1000
└─⟦cfc2e13cd⟧ »Space Info Vol 2«
└─⟦this⟧
separate (Br_Rule_Bundle)
package body Take_Biggest_Brick_From_Heap_Rule is
function Premiss return Br_Kbs.Kbs.Fact_Queries is
The_Size : constant Alias.Name := Alias.S;
begin
return (Br_Frames.Robots.Exist
((Br_Frames.Action => Br_Kbs.Kbs.Fact_Base.Predicate.
System_Defined_Predicate.Is_Equal
(Br_Frames.Taking_Action),
Br_Frames.Box => Br_Kbs.Kbs.Fact_Base.Predicate.
System_Defined_Predicate.Is_Any)),
Br_Frames.Bricks.Exist
((Br_Frames.Name => Br_Kbs.Kbs.Fact_Base.Predicate.
System_Defined_Predicate.Is_Any,
Br_Frames.Size =>
Br_Kbs.Kbs.Fact_Base.Predicate.Define_As (The_Size),
Br_Frames.Place => Br_Kbs.Kbs.Fact_Base.Predicate.
System_Defined_Predicate.Is_Equal
(Br_Frames.On_Heap_Place))),
Br_Frames.Bricks.Absent
((Br_Frames.Name => Br_Kbs.Kbs.Fact_Base.Predicate.
System_Defined_Predicate.Is_Any,
Br_Frames.Size =>
Br_Kbs.Kbs.Fact_Base.Predicate.
System_Defined_Predicate.Is_Greater (The_Size),
Br_Frames.Place => Br_Kbs.Kbs.Fact_Base.Predicate.
System_Defined_Predicate.Is_Equal
(Br_Frames.On_Heap_Place))));
end Premiss;
procedure Action (Objects : Br_Kbs.Kbs.Fact_Collection) is
The_Biggest_Brick : Br_Kbs.Kbs.Fact_Name renames Objects (2);
On_Screen : Output_Stream.Object := Output_Stream.Standard_Output;
begin
Output_Stream.New_Line (On_Screen);
Output_Stream.Put_Line
(" --------------------------------------------------------",
On_Screen);
Output_Stream.Put_Line
(" -- THE ROBOT TAKES THE BIGGEST BRICK FROM HEAP --", On_Screen);
Output_Stream.Put_Line
(" --------------------------------------------------------",
On_Screen);
Output_Stream.New_Line (On_Screen);
Br_Frames.Bricks.Change (The_Biggest_Brick, Br_Frames.Place,
Br_Frames.In_Pliers_Place);
Output_Stream.New_Line (On_Screen);
Output_Stream.Put_Line ("THE BIGGEST BRICK IS : ", On_Screen);
Br_Frames.Put (The_Biggest_Brick, On_Screen);
Output_Stream.New_Line (On_Screen);
end Action;
end Take_Biggest_Brick_From_Heap_Rule;
nblk1=6
nid=5
hdr6=6
[0x00] rec0=16 rec1=00 rec2=01 rec3=07a
[0x01] rec0=15 rec1=00 rec2=06 rec3=008
[0x02] rec0=18 rec1=00 rec2=03 rec3=000
[0x03] rec0=04 rec1=e7 rec2=2c rec3=242
[0x04] rec0=c0 rec1=00 rec2=00 rec3=100
[0x05] rec0=43 rec1=34 rec2=3c rec3=359
tail 0x2174eb154866f3e878018 0x42a00088462063c03
Free Block Chain:
0x5: 0000 00 02 03 33 80 05 62 65 67 69 6e 05 00 2b 20 20 ┆ 3 begin + ┆
0x2: 0000 00 04 03 fb 80 10 3a 20 53 6c 6f 74 2e 4f 62 6a ┆ : Slot.Obj┆
0x4: 0000 00 00 02 ae 80 4a 20 20 20 20 20 20 20 20 20 20 ┆ J ┆