Defining_Identifier => Loop_Id,
Discrete_Subtype_Definition => L_Range));
- -- Build insertion statement. for a positional aggregate only
- -- the expression is needed. For a named aggregate the loop
- -- variable, whose type is that of the key, is an additional
- -- parameter for the insertion operation.
+ -- Build insertion statement. For a positional aggregate, only the
+ -- expression is needed. For a named aggregate, the loop variable,
+ -- whose type is that of the key, is an additional parameter for
+ -- the insertion operation.
if Present (Add_Unnamed_Subp) then
Stats := New_List
(Make_Procedure_Call_Statement (Loc,
- Name => New_Occurrence_Of (Entity (Add_Unnamed_Subp), Loc),
- Parameter_Associations =>
- New_List (New_Occurrence_Of (Temp, Loc),
+ Name => New_Occurrence_Of (Entity (Add_Unnamed_Subp), Loc),
+ Parameter_Associations =>
+ New_List (New_Occurrence_Of (Temp, Loc),
New_Copy_Tree (Expr))));
else
Stats := New_List
Name => New_Occurrence_Of (Entity (Add_Named_Subp), Loc),
Parameter_Associations =>
New_List (New_Occurrence_Of (Temp, Loc),
- New_Occurrence_Of (Loop_Id, Loc),
- New_Copy_Tree (Expr))));
+ New_Occurrence_Of (Loop_Id, Loc),
+ New_Copy_Tree (Expr))));
end if;
Loop_Stat := Make_Implicit_Loop_Statement
Name => New_Occurrence_Of (Insert, Loc),
Parameter_Associations =>
New_List (New_Occurrence_Of (Temp, Loc),
- New_Copy_Tree (Comp)));
+ New_Copy_Tree (Comp)));
Append (Stat, Aggr_Code);
Next (Comp);
end loop;
begin
Comp := First (Component_Associations (N));
- -- Each component association may contain several choices,
+ -- Each component association may contain several choices;
-- generate an insertion statement for each.
while Present (Comp) loop
Name => New_Occurrence_Of (Insert, Loc),
Parameter_Associations =>
New_List (New_Occurrence_Of (Temp, Loc),
- New_Copy_Tree (Key),
- New_Copy_Tree (Expression (Comp))));
+ New_Copy_Tree (Key),
+ New_Copy_Tree (Expression (Comp))));
Append (Stat, Aggr_Code);
Next (Key);
(Comp : Node_Id;
Key_Type : Entity_Id;
Elmt_Type : Entity_Id);
- -- Resolve choices and expression in an iterated component
- -- association. This is similar but not identical to the handling
- -- of this construct in an array aggregate.
+ -- Resolve choices and expression in an iterated component association.
+ -- This is similar but not identical to the handling of this construct
+ -- in an array aggregate.
-- For a named container, the type of each choice must be compatible
- -- with the key type. For a positional container the choice must be
+ -- with the key type. For a positional container, the choice must be
-- a subtype indication or an iterator specification that determines
-- an element type.