a-catizo.adb, [...]: Minor reformatting.

2012-10-01  Arnaud Charlet  <charlet@adacore.com>

	* a-catizo.adb, a-stwiun.adb, a-cdlili.adb, a-cihama.adb, a-direct.adb,
	a-coinve.adb, a-calend.adb, a-ciorse.adb, a-coorma.adb, a-cfdlli.adb,
	a-stzunb-shared.adb, a-cfhase.adb, bindgen.adb, ceinfo.adb, a-tags.adb,
	einfo.adb, checks.adb, eval_fat.adb, a-cborma.adb, a-stwifi.adb,
	a-tifiio.adb, a-textio.adb, a-cidlli.adb, a-strunb-shared.adb,
	a-cimutr.adb, a-calcon.adb, a-exexpr-gcc.adb, a-ciormu.adb,
	a-stzunb.adb, a-stzsea.adb, a-ngelfu.adb, a-stzfix.adb,
	a-cihase.adb, a-cohama.adb, a-exetim-posix.adb, a-dirval-vms.adb,
	a-caldel-vms.adb, a-coorse.adb, errout.adb,
	a-except.adb, butil.adb, a-dirval-mingw.adb, a-cforma.adb,
	a-except-2005.adb, a-wtedit.adb, cstand.adb, a-stwiun-shared.adb,
	a-cbhama.adb, a-direio.adb, clean.adb, a-cborse.adb, back_end.adb,
	binde.adb, a-exexda.adb, a-comutr.adb, a-ciorma.adb, a-cobove.adb,
	a-coormu.adb, a-teioed.adb, a-convec.adb, a-wtenau.adb, exp_aggr.adb,
	a-ztedit.adb, a-cohase.adb, a-exetim-mingw.adb, bcheck.adb,
	a-dynpri.adb, a-cfhama.adb, a-calfor.adb, a-cbdlli.adb,
	a-crdlli.adb, a-cbmutr.adb, a-sequio.adb, a-ngcoar.adb, a-cforse.adb,
	a-strunb.adb, a-calend-vms.adb, a-clrefi.adb, a-cofove.adb,
	a-ztenau.adb, a-strfix.adb, a-cbhase.adb, a-stzsup.adb: Minor
	reformatting.

From-SVN: r191905

1 files changed, 14 insertions, 16 deletions

diff --git a/gcc/ada/a-cihase.adb b/gcc/ada/a-cihase.adb
index 9d96b6c..bae3ecc 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