diff options
| author | Arnaud Charlet <charlet@adacore.com> | 2012-10-01 09:41:22 +0000 |
|---|---|---|
| committer | Arnaud Charlet <charlet@gcc.gnu.org> | 2012-10-01 11:41:22 +0200 |
| commit | 15f0f591b8799b6987321777a82c26a9bbb8af78 (patch) | |
| tree | 294ac05591df8b0f8f0566cc44e4720f184af059 /gcc/ada/a-cborse.adb | |
| parent | cf427f02bb7cc5a0103f5821e7b4f042c9275320 (diff) | |
| download | gcc-15f0f591b8799b6987321777a82c26a9bbb8af78.tar.gz | |
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
Diffstat (limited to 'gcc/ada/a-cborse.adb')
| -rw-r--r-- | gcc/ada/a-cborse.adb | 24 |
1 files changed, 11 insertions, 13 deletions
diff --git a/gcc/ada/a-cborse.adb b/gcc/ada/a-cborse.adb index 62417f36b11..3131de13700 100644 --- a/gcc/ada/a-cborse.adb +++ b/gcc/ada/a-cborse.adb @@ -6,7 +6,7 @@ -- -- -- B o d y -- -- -- --- Copyright (C) 2004-2011, Free Software Foundation, Inc. -- +-- Copyright (C) 2004-2012, Free Software Foundation, Inc. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- @@ -378,7 +378,7 @@ package body Ada.Containers.Bounded_Ordered_Sets is function Ceiling (Container : Set; Item : Element_Type) return Cursor is Node : constant Count_Type := - Element_Keys.Ceiling (Container, Item); + Element_Keys.Ceiling (Container, Item); begin return (if Node = 0 then No_Element else Cursor'(Container'Unrestricted_Access, Node)); @@ -720,7 +720,7 @@ package body Ada.Containers.Bounded_Ordered_Sets is function Ceiling (Container : Set; Key : Key_Type) return Cursor is Node : constant Count_Type := - Key_Keys.Ceiling (Container, Key); + Key_Keys.Ceiling (Container, Key); begin return (if Node = 0 then No_Element else Cursor'(Container'Unrestricted_Access, Node)); @@ -1334,9 +1334,9 @@ package body Ada.Containers.Bounded_Ordered_Sets is -- for a reverse iterator, Container.Last is the beginning. return It : constant Iterator := - Iterator'(Limited_Controlled with - Container => Container'Unrestricted_Access, - Node => 0) + Iterator'(Limited_Controlled with + Container => Container'Unrestricted_Access, + Node => 0) do B := B + 1; end return; @@ -1382,9 +1382,9 @@ package body Ada.Containers.Bounded_Ordered_Sets is -- is a forward or reverse iteration.) return It : constant Iterator := - Iterator'(Limited_Controlled with - Container => Container'Unrestricted_Access, - Node => Start.Node) + Iterator'(Limited_Controlled with + Container => Container'Unrestricted_Access, + Node => Start.Node) do B := B + 1; end return; @@ -1487,7 +1487,7 @@ package body Ada.Containers.Bounded_Ordered_Sets is declare Node : constant Count_Type := - Tree_Operations.Next (Position.Container.all, Position.Node); + Tree_Operations.Next (Position.Container.all, Position.Node); begin if Node = 0 then @@ -1548,9 +1548,7 @@ package body Ada.Containers.Bounded_Ordered_Sets is declare Node : constant Count_Type := - Tree_Operations.Previous - (Position.Container.all, - Position.Node); + Tree_Operations.Previous (Position.Container.all, Position.Node); begin return (if Node = 0 then No_Element else Cursor'(Position.Container, Node)); |