|
|
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: 12288 (0x3000)
Types: Ada Source
Notes: 03_class, FILE, R1k_Segment, e3_tag, package body Robotetbrique, procedure Ne_Travailler, seg_011ea6
└─⟦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;
with Ne_Robot, Brique;
use Ne_Robot, Brique;
procedure Ne_Travailler is
package Robotetbrique is
procedure Miseenboite;
end Robotetbrique;
package body Robotetbrique is
function Peutmettreenboite return Boolean is
begin
Reglesaisir:
declare
Rb : Tuple.Object;
Unebrique, Unrobot : Reference;
function Match (R, B : Reference) return Boolean is
begin
return Peutprendre (R) and then
not Tientbrique (R) and then
Surtas (B) and then Laplusgrandedutas (B);
end Match;
function Robotsaisir is new Tuplecollection.Join2 (Match);
begin
Rb := Tuplecollection.First
(Robotsaisir (All_Robots, Lesbriques));
if Tuple.Isnotnull (Rb) then
Unrobot := Tuple.First (Rb);
Unebrique := Tuple.Second (Rb);
Ne_Robot.Modifierpince (Unrobot, True);
Brique.Modifierlieu (Unebrique, Pince);
Put ("Le ");
Put (Ne_Robot.Nom (Unrobot));
Put (" prend la plus grande brique (taille=");
Put (Integer (Brique.Taille (Unebrique)));
Put_Line (") du tas dans sa pince ");
return True;
end if;
end Reglesaisir;
Regletenir:
declare
Rb : Tuple.Object;
Unrobot : Reference;
function Match (R, B : Reference) return Boolean is
begin
return Peutprendre (R) and then Tientbrique (R) and then
Danspince (B) and then
Un_Plus_Ancien_Robot (R);
end Match;
function Robottenir is new Tuplecollection.Join2 (Match);
begin
Rb := Tuplecollection.First
(Robottenir (All_Robots, Lesbriques));
if Tuple.Isnotnull (Rb) then
Unrobot := Tuple.First (Rb);
Ne_Robot.Modifiertache (Unrobot, Deposer);
Ne_Robot.Modifieranc (Unrobot, Ne_Robot.Anciennete);
Put ("Le ");
Put (Ne_Robot.Nom (Unrobot));
Put_Line (" va deposer la brique ");
return True;
end if;
end Regletenir;
Reglecaser:
declare
Rb : Tuple.Object;
Unebrique, Unrobot : Reference;
function Match (R, B : Reference) return Boolean is
begin
return Peutdeposer (R) and then Danspince (B) and then
Un_Plus_Ancien_Robot (R);
end Match;
function Robotcaser is new Tuplecollection.Join2 (Match);
begin
Rb := Tuplecollection.First
(Robotcaser (All_Robots, Lesbriques));
if Tuple.Isnotnull (Rb) then
Unrobot := Tuple.First (Rb);
Unebrique := Tuple.Second (Rb);
Brique.Modifierlieu (Unebrique, Boite);
Ne_Robot.Modifiertache (Unrobot, Prendre);
Ne_Robot.Modifierboite (Unrobot,
Ne_Robot.Derniereboite);
Brique.Modifierboite (Unebrique,
Ne_Robot.Numeroboite (Unrobot));
Ne_Robot.Modifieranc (Unrobot, Ne_Robot.Anciennete);
Put ("Le ");
Put (Ne_Robot.Nom (Unrobot));
Put (" depose la brique dans la case");
Put (Integer (Ne_Robot.Numeroboite (Unrobot)));
Put_Line ("");
Ne_Robot.Modifierpince (Unrobot, False);
return True;
end if;
end Reglecaser;
Reglearreter:
declare
Rb : Tuple.Object;
Unrobot : Reference;
function Match (R, B : Reference) return Boolean is
begin
return Peutprendre (R) and then
not Tientbrique (R) and then not Surtas (B);
end Match;
function Robotarreter is new Tuplecollection.Join2 (Match);
begin
Rb := Tuplecollection.First
(Robotarreter (All_Robots, Lesbriques));
if not Tuple.Isnull (Rb) then
Unrobot := Tuple.First (Rb);
Put ("Le ");
Put (Ne_Robot.Nom (Unrobot));
Put_Line (" se suicide (plus de briques)");
Ne_Robot.Sesuicide (Unrobot);
return True;
end if;
end Reglearreter;
return False;
end Peutmettreenboite;
procedure Mettreenboite is
begin
loop
exit when not Peutmettreenboite;
end loop;
end Mettreenboite;
procedure Miseenboite is
begin
Ne_Robot.Creer;
Brique.Creer;
loop
Mettreenboite;
-- autres contextes a traiter
exit;
end loop;
end Miseenboite;
end Robotetbrique;
begin
Robotetbrique.Miseenboite;
end Ne_Travailler;
nblk1=b
nid=0
hdr6=16
[0x00] rec0=1e rec1=00 rec2=01 rec3=03e
[0x01] rec0=00 rec1=00 rec2=0b rec3=020
[0x02] rec0=19 rec1=00 rec2=02 rec3=040
[0x03] rec0=00 rec1=00 rec2=0a rec3=00e
[0x04] rec0=19 rec1=00 rec2=03 rec3=01a
[0x05] rec0=14 rec1=00 rec2=04 rec3=05c
[0x06] rec0=00 rec1=00 rec2=09 rec3=024
[0x07] rec0=19 rec1=00 rec2=05 rec3=02e
[0x08] rec0=00 rec1=00 rec2=08 rec3=00a
[0x09] rec0=1e rec1=00 rec2=06 rec3=018
[0x0a] rec0=12 rec1=00 rec2=07 rec3=000
tail 0x2170df1aa82466d112334 0x42a00088462063c03