|
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: 6144 (0x1800)
Types: Ada Source
Notes: 03_class, FILE, R1k_Segment, e3_tag, package body Discrete_Value_Manager, seg_004626
└─⟦8527c1e9b⟧ Bits:30000544 8mm tape, Rational 1000, Arrival backup of disks in PAM's R1000
└─ ⟦cfc2e13cd⟧ »Space Info Vol 2«
└─⟦this⟧
package body Discrete_Value_Manager is
procedure Init_Values (Values : out Value_List; Lo, Hi : Long_Integer) is
begin
Discrete_Hole_Manager.Init_Holes (Values.Holes, Lo, Hi);
Values.Constraint_Lower_Bound := Lo;
Values.Constraint_Upper_Bound := Hi;
end Init_Values;
procedure Add_Value_Range (Values : in out Value_List;
Lo, Hi : Long_Integer;
Success : out Boolean) is
begin
Discrete_Hole_Manager.Delete_Hole (Values.Holes, Lo, Hi, Success);
end Add_Value_Range;
procedure Init_Iteration (Values : in out Value_List) is
Hole_Low, Hole_High : Long_Integer;
begin
if Discrete_Hole_Manager.More_Holes (Values.Holes) then
Discrete_Hole_Manager.Next_Hole (Values.Holes, Hole_Low, Hole_High);
if Hole_Low = Values.Constraint_Lower_Bound then
Values.Current_Lower := Hole_High + 1;
if Discrete_Hole_Manager.More_Holes (Values.Holes) then
Discrete_Hole_Manager.Next_Hole
(Values.Holes, Hole_Low, Hole_High);
Values.Current_Upper := Hole_Low - 1;
Values.Next_Low := Hole_High;
else
Values.Current_Upper := Values.Constraint_Upper_Bound;
Values.Next_Low := Hole_Low;
end if;
else
Values.Current_Lower := Values.Constraint_Lower_Bound;
Values.Current_Upper := Hole_Low - 1;
Values.Next_Low := Hole_High;
end if;
else
Values.Current_Lower := Values.Constraint_Lower_Bound;
Values.Current_Upper := Values.Constraint_Upper_Bound;
Values.Next_Low := Values.Constraint_Lower_Bound;
end if;
end Init_Iteration;
function More_Values (Values : Value_List) return Boolean is
begin
return Values.Current_Upper /= Values.Constraint_Upper_Bound or
Values.Next_Low /= Values.Constraint_Upper_Bound;
end More_Values;
procedure Next_Range (Values : in out Value_List;
Lo, Hi : out Long_Integer) is
Hole_Low, Hole_High : Long_Integer;
begin
Lo := Values.Current_Lower;
Hi := Values.Current_Upper;
if Values.Next_Low = Values.Constraint_Upper_Bound then
Values.Current_Upper := Values.Constraint_Upper_Bound;
elsif Values.Current_Upper = Values.Constraint_Upper_Bound then
Values.Next_Low := Values.Constraint_Upper_Bound;
else
if Discrete_Hole_Manager.More_Holes (Values.Holes) then
Discrete_Hole_Manager.Next_Hole
(Values.Holes, Hole_Low, Hole_High);
Values.Current_Lower := Values.Next_Low + 1;
Values.Current_Upper := Hole_Low - 1;
Values.Next_Low := Hole_High;
else
Values.Current_Lower := Values.Next_Low + 1;
Values.Current_Upper := Values.Constraint_Upper_Bound;
end if;
end if;
end Next_Range;
end Discrete_Value_Manager;
nblk1=5
nid=0
hdr6=a
[0x00] rec0=18 rec1=00 rec2=01 rec3=066
[0x01] rec0=19 rec1=00 rec2=02 rec3=02a
[0x02] rec0=00 rec1=00 rec2=05 rec3=028
[0x03] rec0=18 rec1=00 rec2=03 rec3=028
[0x04] rec0=0a rec1=00 rec2=04 rec3=000
tail 0x217002470815c65df40eb 0x42a00088462061e03