Datasets:
thechaingamer
/
ada-git-code

Dataset card Data Studio Files
xet
Community
text
stringlengths
0
234
Initial_Routine_State
else
Element (C));
end Extract_Work_Data;
begin
if T /= Node_Tag then
if T /= No_Tag then
Update_Map_With_Work_Data;
end if;
Extract_Work_Data;
end if;
end Switch_Key_If_Needed;
-----------------------------------------------------
procedure Reset_Routine_State (Node_Tag : Tag;
Routine_Index : Test_Routine_Index) is
begin
Switch_Key_If_Needed (Node_Tag);
S := Initial_Routine_State (Routine_Index);
end Reset_Routine_State;
-----------------------------------------------------
procedure Increment_Assert_Count (Node_Tag : Tag) is
begin
Switch_Key_If_Needed (Node_Tag);
Prot_Test_Assert_Count.Inc (S.Assert_Count);
end Increment_Assert_Count;
-----------------------------------------------------
procedure Set_Failed_Outcome (Node_Tag : Tag) is
begin
Switch_Key_If_Needed (Node_Tag);
S.Assert_Outcome := Failed;
end Set_Failed_Outcome;
-----------------------------------------------------
procedure Get_Assert_Count (Node_Tag : Tag;
Routine_Index : out Test_Routine_Index;
Count : out O_P_I_Test_Assert_Count)
is
begin
Switch_Key_If_Needed (Node_Tag);
Routine_Index := S.Routine_Index;
Count := S.Assert_Count;
end Get_Assert_Count;
-----------------------------------------------------
procedure Get_Assert_Outcome (Node_Tag : Tag;
Outcome : out Test_Outcome) is
begin
Switch_Key_If_Needed (Node_Tag);
Outcome := S.Assert_Outcome;
end Get_Assert_Outcome;
-----------------------------------------------------
procedure Delete (Node_Tag : Tag) is
use Routine_State_Hashed_Maps;
begin
if M.Length = 0 then
T := No_Tag;
else
declare
C : Cursor := M.Find (Node_Tag);
begin
if C /= No_Element then
M.Delete (C);
end if;