Datasets:
thechaingamer
/
ada-git-code

Dataset card Data Studio Files
xet
 Community
text
stringlengths
0
234
Cellule.all.Sous_Arbre_Gauche := null;
Cellule.all.Donnee := Donnee;
Reg := Cellule;
end Initialiser_Reg;
function Est_Vide (Reg : T_Registre) return Boolean is
begin
return Reg = Null;
Function Definition: procedure Free is new Ada.Unchecked_Deallocation
Function Body: (Object => Test_Event_Base'Class,
Name => Test_Event_Access);
begin
N_E.Event.Clean_Up;
Free (N_E.Event);
end Clean_Up_Events;
-----------------------------------------------------
begin
Obj.Active_Node_Map.Clear;
Obj.Event_Vector.Iterate (Clean_Up_Events'Access);
Obj.Event_Vector.Clear;
Obj.Node_Data_Tree.Clear;
end Reset;
----------------------------------------------------------------------------
overriding
function Is_Active (Obj : Test_Reporter_Data;
Node_Tag : Tag) return Boolean
is (Obj.Active_Node_Map.Contains (Node_Tag));
----------------------------------------------------------------------------
overriding
procedure Include_Node (Obj : in out Test_Reporter_Data;
Node_Lineage : Tag_Array) is
C : Cursor := Root (Obj.Node_Data_Tree);
begin
for T of Node_Lineage loop
declare
Insertion_Required : Boolean := Is_Leaf (C);
begin
for Child_C in Obj.Node_Data_Tree.Iterate_Children (C) loop
if Element (Child_C).T = T then
C := Child_C;
exit;
end if;
Insertion_Required := Child_C = Last_Child (C);
end loop;
if Insertion_Required then
declare
Position : Cursor;
begin
Obj.Node_Data_Tree.Insert_Child
(Parent => C,
Before => No_Element,
New_Item => (T => T,
Event_Index_Vector => <>),
Position => Position);
C := Position;
Function Definition: procedure Update_Map_With_Work_Data is
Function Body: C : constant Cursor := M.Find (T);
begin
if C = No_Element then
M.Insert (Key => T,
New_Item => S);
else
M.Replace_Element (Position => C,
New_Item => S);
end if;
end Update_Map_With_Work_Data;
procedure Extract_Work_Data is
C : constant Cursor := M.Find (Node_Tag);
begin
T := Node_Tag;
S := (if C = No_Element then