|
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 - download
Length: 9216 (0x2400)
Types: Ada Source
Notes: 03_class, FILE, R1k_Segment, e3_tag, package body Search_Free_Action_Rule, seg_04bedf, separate Fruit_Rule_Bundle_4
└─⟦8527c1e9b⟧ Bits:30000544 8mm tape, Rational 1000, Arrival backup of disks in PAM's R1000
└─ ⟦cfc2e13cd⟧ »Space Info Vol 2«
└─⟦this⟧
separate (Fruit_Rule_Bundle_4)
package body Search_Free_Action_Rule is
function Premiss return Fact_Queries is
use Fact_Base.Predicate;
use Fruit_Frames_4;
use Kbs.Expression;
use Kbs.Expression.System_Defined_Expression;
The_Marker_Name : constant Alias.Name := Alias.M;
The_X_Pos : constant Alias.Name := Alias.X;
The_Y_Pos : constant Alias.Name := Alias.Y;
begin
return (Requests.Exist
((Request_Name => Is_Equal (Search_Free_Request_Name),
Marker_Name => Define_As (The_Marker_Name),
Argument1 => Is_Any,
Argument2 => Is_Any)),
Visual_Markers.Exist
((Marker_Name => Is_Equal (The_Marker_Name),
Position_X => Is_Any,
Position_Y => Is_Any)),
Visual_Blocks.Exist
((Label => Is_Any,
Position_X => Define_As (The_X_Pos),
Position_Y => Define_As (The_Y_Pos) and Is_Less (Max_Y))),
Visual_Blocks.Absent
((Label => Is_Any,
Position_X => Is_Equal (The_X_Pos),
Position_Y => Is_Equal (Value (The_Y_Pos) + Value (1)))),
Visual_Markers.Absent
((Marker_Name => Is_Equal (Model_Marker_Name),
Position_X => Is_Equal (The_X_Pos),
Position_Y => Is_Any)),
Visual_Markers.Absent
((Marker_Name => Is_Equal (Top_Copied_Model_Marker_Name),
Position_X => Is_Equal (The_X_Pos),
Position_Y => Is_Any)),
Visual_Markers.Absent
((Marker_Name => Is_Equal (Selected_Block_Marker_Name),
Position_X => Is_Equal (The_X_Pos),
Position_Y => Is_Any)),
-- only validate if no place on table :
Visual_Blocks.Exist
((Label => Is_Any,
Position_X => Is_Greater (Min_X) and Is_Less (Max_X),
Position_Y => Is_Equal (Min_Y))),
Visual_Blocks.Exist
((Label => Is_Any,
Position_X => Is_Greater (Min_X) and Is_Less (Max_X),
Position_Y => Is_Equal (Min_Y))),
Visual_Blocks.Exist
((Label => Is_Any,
Position_X => Is_Greater (Min_X) and Is_Less (Max_X),
Position_Y => Is_Equal (Min_Y))),
Visual_Blocks.Exist
((Label => Is_Any,
Position_X => Is_Greater (Min_X) and Is_Less (Max_X),
Position_Y => Is_Equal (Min_Y))),
Visual_Blocks.Exist
((Label => Is_Any,
Position_X => Is_Greater (Min_X) and Is_Less (Max_X),
Position_Y => Is_Equal (Min_Y))),
Visual_Blocks.Exist
((Label => Is_Any,
Position_X => Is_Greater (Min_X) and Is_Less (Max_X),
Position_Y => Is_Equal (Min_Y))),
Visual_Blocks.Exist
((Label => Is_Any,
Position_X => Is_Greater (Min_X) and Is_Less (Max_X),
Position_Y => Is_Equal (Min_Y))),
Visual_Blocks.Exist
((Label => Is_Any,
Position_X => Is_Greater (Min_X) and Is_Less (Max_X),
Position_Y => Is_Equal (Min_Y))),
Visual_Blocks.Exist
((Label => Is_Any,
Position_X => Is_Greater (Min_X) and Is_Less (Max_X),
Position_Y => Is_Equal (Min_Y))),
Visual_Blocks.Exist
((Label => Is_Any,
Position_X => Is_Greater (Min_X) and Is_Less (Max_X),
Position_Y => Is_Equal (Min_Y))));
end Premiss;
procedure Action (Objects : Fact_Collection) is
use Fruit_Frames_4;
use Slot;
use Slot.Operators;
The_Request_Fact : Fact_Name renames Objects (1);
The_Marker_Fact : Fact_Name renames Objects (2);
The_Block_To_Put_On_Fact : Fact_Name renames Objects (3);
The_X_Pos : Slot.Object := Visual_Blocks.Get
(The_Block_To_Put_On_Fact, Position_X);
The_Y_Pos : Slot.Object := Visual_Blocks.Get
(The_Block_To_Put_On_Fact, Position_Y);
begin
Output_Stream.New_Line (Output_Stream.Standard_Output);
Output_Stream.Put_Line ("***************************************",
Output_Stream.Standard_Output);
Output_Stream.Put_Line ("search free action rule",
Output_Stream.Standard_Output);
Output_Stream.Put_Line ("***************************************",
Output_Stream.Standard_Output);
Output_Stream.New_Line (Output_Stream.Standard_Output);
Visual_Markers.Change (The_Marker_Fact, Position_X, The_X_Pos);
Visual_Markers.Change (The_Marker_Fact, Position_Y,
The_Y_Pos + Value (1));
Requests.Delete (The_Request_Fact);
end Action;
end Search_Free_Action_Rule;
nblk1=8
nid=7
hdr6=e
[0x00] rec0=19 rec1=00 rec2=01 rec3=02c
[0x01] rec0=12 rec1=00 rec2=08 rec3=00c
[0x02] rec0=13 rec1=00 rec2=06 rec3=016
[0x03] rec0=12 rec1=00 rec2=03 rec3=048
[0x04] rec0=0a rec1=00 rec2=04 rec3=01a
[0x05] rec0=11 rec1=00 rec2=05 rec3=040
[0x06] rec0=09 rec1=00 rec2=02 rec3=000
[0x07] rec0=c8 rec1=68 rec2=f5 rec3=2db
tail 0x217519fe886923d3dc46b 0x42a00088462063c03
Free Block Chain:
0x7: 0000 00 00 01 0a 80 1c 20 20 20 20 20 20 20 20 20 20 ┆ ┆