summaryrefslogtreecommitdiff
path: root/gcc/ada/a-cimutr.adb
diff options
context:
space:
mode:
Diffstat (limited to 'gcc/ada/a-cimutr.adb')
-rw-r--r--gcc/ada/a-cimutr.adb31
1 files changed, 14 insertions, 17 deletions
diff --git a/gcc/ada/a-cimutr.adb b/gcc/ada/a-cimutr.adb
index e249c6a68d6..15f1640e867 100644
--- a/gcc/ada/a-cimutr.adb
+++ b/gcc/ada/a-cimutr.adb
@@ -504,9 +504,8 @@ package body Ada.Containers.Indefinite_Multiway_Trees is
L : Natural renames C.Lock;
begin
return R : constant Constant_Reference_Type :=
- (Element => Position.Node.Element.all'Access,
- Control =>
- (Controlled with Container'Unrestricted_Access))
+ (Element => Position.Node.Element.all'Access,
+ Control => (Controlled with Container'Unrestricted_Access))
do
B := B + 1;
L := L + 1;
@@ -1049,7 +1048,7 @@ package body Ada.Containers.Indefinite_Multiway_Trees is
Item : Element_Type) return Cursor
is
N : constant Tree_Node_Access :=
- Find_In_Children (Root_Node (Container), Item);
+ Find_In_Children (Root_Node (Container), Item);
begin
if N = null then
@@ -1534,9 +1533,9 @@ package body Ada.Containers.Indefinite_Multiway_Trees is
end if;
return It : constant Child_Iterator :=
- Child_Iterator'(Limited_Controlled with
- Container => C,
- Subtree => Parent.Node)
+ Child_Iterator'(Limited_Controlled with
+ Container => C,
+ Subtree => Parent.Node)
do
B := B + 1;
end return;
@@ -1562,9 +1561,9 @@ package body Ada.Containers.Indefinite_Multiway_Trees is
B : Natural renames Position.Container.Busy;
begin
return It : constant Subtree_Iterator :=
- (Limited_Controlled with
- Container => Position.Container,
- Subtree => Position.Node)
+ (Limited_Controlled with
+ Container => Position.Container,
+ Subtree => Position.Node)
do
B := B + 1;
end return;
@@ -2023,13 +2022,11 @@ package body Ada.Containers.Indefinite_Multiway_Trees is
(Parent : Tree_Node_Access) return Tree_Node_Access
is
Element : constant Element_Access :=
- new Element_Type'(Element_Type'Input (Stream));
+ new Element_Type'(Element_Type'Input (Stream));
Subtree : constant Tree_Node_Access :=
- new Tree_Node_Type'
- (Parent => Parent,
- Element => Element,
- others => <>);
+ new Tree_Node_Type'
+ (Parent => Parent, Element => Element, others => <>);
begin
Read_Count := Read_Count + 1;
@@ -2126,8 +2123,8 @@ package body Ada.Containers.Indefinite_Multiway_Trees is
L : Natural renames C.Lock;
begin
return R : constant Reference_Type :=
- (Element => Position.Node.Element.all'Access,
- Control => (Controlled with Position.Container))
+ (Element => Position.Node.Element.all'Access,
+ Control => (Controlled with Position.Container))
do
B := B + 1;
L := L + 1;