diff options
Diffstat (limited to 'gcc/ada/a-cihase.adb')
| -rw-r--r-- | gcc/ada/a-cihase.adb | 30 |
1 files changed, 14 insertions, 16 deletions
diff --git a/gcc/ada/a-cihase.adb b/gcc/ada/a-cihase.adb index 9d96b6c6452..bae3ecc3897 100644 --- a/gcc/ada/a-cihase.adb +++ b/gcc/ada/a-cihase.adb @@ -255,9 +255,8 @@ package body Ada.Containers.Indefinite_Hashed_Sets is L : Natural renames HT.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; @@ -683,7 +682,7 @@ package body Ada.Containers.Indefinite_Hashed_Sets is L_Node : Node_Access) return Boolean is R_Index : constant Hash_Type := - Element_Keys.Index (R_HT, L_Node.Element.all); + Element_Keys.Index (R_HT, L_Node.Element.all); R_Node : Node_Access := R_HT.Buckets (R_Index); @@ -710,7 +709,7 @@ package body Ada.Containers.Indefinite_Hashed_Sets is L_Node : Node_Access) return Boolean is R_Index : constant Hash_Type := - Element_Keys.Index (R_HT, L_Node.Element.all); + Element_Keys.Index (R_HT, L_Node.Element.all); R_Node : Node_Access := R_HT.Buckets (R_Index); @@ -1119,8 +1118,8 @@ package body Ada.Containers.Indefinite_Hashed_Sets is B : Natural renames Container'Unrestricted_Access.all.HT.Busy; begin return It : constant Iterator := - Iterator'(Limited_Controlled with - Container => Container'Unrestricted_Access) + Iterator'(Limited_Controlled with + Container => Container'Unrestricted_Access) do B := B + 1; end return; @@ -1322,7 +1321,7 @@ package body Ada.Containers.Indefinite_Hashed_Sets is New_Item : Element_Type) is Node : constant Node_Access := - Element_Keys.Find (Container.HT, New_Item); + Element_Keys.Find (Container.HT, New_Item); X : Element_Access; pragma Warnings (Off, X); @@ -1566,7 +1565,7 @@ package body Ada.Containers.Indefinite_Hashed_Sets is declare Size : constant Hash_Type := - Prime_Numbers.To_Prime (Left.Length + Right.Length); + Prime_Numbers.To_Prime (Left.Length + Right.Length); begin Buckets := HT_Ops.New_Buckets (Length => Size); end; @@ -1768,7 +1767,7 @@ package body Ada.Containers.Indefinite_Hashed_Sets is declare Size : constant Hash_Type := - Prime_Numbers.To_Prime (Left.Length + Right.Length); + Prime_Numbers.To_Prime (Left.Length + Right.Length); begin Buckets := HT_Ops.New_Buckets (Length => Size); end; @@ -1990,7 +1989,7 @@ package body Ada.Containers.Indefinite_Hashed_Sets is Key : Key_Type) return Constant_Reference_Type is Node : constant Node_Access := - Key_Keys.Find (Container.HT, Key); + Key_Keys.Find (Container.HT, Key); begin if Node = null then @@ -2007,9 +2006,8 @@ package body Ada.Containers.Indefinite_Hashed_Sets is L : Natural renames HT.Lock; begin return R : constant Constant_Reference_Type := - (Element => Node.Element.all'Access, - Control => - (Controlled with Container'Unrestricted_Access)) + (Element => Node.Element.all'Access, + Control => (Controlled with Container'Unrestricted_Access)) do B := B + 1; L := L + 1; @@ -2176,7 +2174,7 @@ package body Ada.Containers.Indefinite_Hashed_Sets is Key : Key_Type) return Reference_Type is Node : constant Node_Access := - Key_Keys.Find (Container.HT, Key); + Key_Keys.Find (Container.HT, Key); begin if Node = null then @@ -2204,7 +2202,7 @@ package body Ada.Containers.Indefinite_Hashed_Sets is New_Item : Element_Type) is Node : constant Node_Access := - Key_Keys.Find (Container.HT, Key); + Key_Keys.Find (Container.HT, Key); begin if Node = null then |