Datasets:
thechaingamer
/
ada-git-code

Dataset card Data Studio Files
xet
 Community
text
stringlengths
0
234
Ignore : Integer := 0;
begin
if Self.Local_Changes > 0 and then Self.Exists (Prev) then
Mark_Deleted_Children (Self);
end if;
Versioned_Booleans.Set
(Self => Self.NC,
Value => Self.Nested_Changes > 0,
Time => Self.Document.History.Changing,
Changes => Ignore);
Node_With_Parent (Self).On_Commit (Parent);
for J in Self.Kids'Range loop
Child := Self.Child (J, Now);
if Child.Nested_Errors (Now) or else Child.Local_Errors (Now) then
Errors := True;
exit;
end if;
end loop;
Versioned_Booleans.Set (Self.NE, Errors, Now, Ignore);
end On_Commit;
---------------
-- Set_Child --
---------------
overriding procedure Set_Child
(Self : aliased in out Joint;
Index : Positive;
Value : Node_Access)
is
Diff : Integer := 0;
Now : constant Version_Trees.Version := Self.Document.History.Changing;
Old : constant Node_Access := Self.Child (Index, Now);
begin
if Old /= null then
Old.Set_Parent (null);
end if;
Versioned_Nodes.Set (Self.Kids (Index), Value, Now, Diff);
Self.Update_Local_Changes (Diff);
if Value /= null then
declare
Parent : constant Node_Access := Value.Parent (Now);
begin
if Parent /= null then
declare
Index : constant Natural :=
Parent.Child_Index (Constant_Node_Access (Value), Now);
begin
Value.Set_Parent (null);
Parent.Set_Child (Index, null);
Value.Set_Parent (Self'Unchecked_Access);
Function Definition: procedure Right_Breakdown;
Function Body: procedure Recover (LA : out Nodes.Node_Access);
procedure Recover_2 (LA : out Nodes.Node_Access);
Stack : Parser_Stack;
State : Parser_State := 1;
Now : constant Version_Trees.Version := Document.History.Changing;
Previous : constant Version_Trees.Version :=
Document.History.Parent (Now);
Next_Action : constant Action_Table_Access := Provider.Actions;
Next_State : constant State_Table_Access := Provider.States;
Counts : constant Parts_Count_Table_Access := Provider.Part_Counts;
procedure Clear (Self : out Parser_Stack) is
begin
Self.Top := 0;
end Clear;
--------------
-- Do_Shift --
--------------
procedure Do_Shift (Node : Nodes.Node_Access) is
begin
if Node.Is_Token then
-- Next_Action should be shift
On_Shift (State, Next_Action (State, Node.Kind).State, Node);
else
On_Shift (State, Next_State (State, Node.Kind), Node);
end if;
end Do_Shift;
--------------------
-- Left_Breakdown --
--------------------
function Left_Breakdown
(Node : Nodes.Node_Access) return Nodes.Node_Access is
begin
if Node.Arity > 0 then