diff options
author | charlet <charlet@138bc75d-0d04-0410-961f-82ee72b054a4> | 2011-08-29 13:42:00 +0000 |
---|---|---|
committer | charlet <charlet@138bc75d-0d04-0410-961f-82ee72b054a4> | 2011-08-29 13:42:00 +0000 |
commit | defcde112eae094b776169d9e2d62c17d052ae92 (patch) | |
tree | f20f4df300d64f5600c1039d02d785c133bb1250 /gcc/ada/a-cohama.adb | |
parent | 852b4cc2d9d0889a68adf7672a040e4451b1be1d (diff) | |
download | gcc-defcde112eae094b776169d9e2d62c17d052ae92.tar.gz |
2011-08-29 Robert Dewar <dewar@adacore.com>
* a-cdlili.adb, a-cdlili.ads, a-coinve.adb, a-coinve.ads,
sem_util.adb, sem_util.ads, a-cohama.adb, a-cohama.ads, a-coorse.adb,
a-coorse.ads, aspects.ads, sem_ch8.adb: Minor reformatting.
git-svn-id: svn+ssh://gcc.gnu.org/svn/gcc/trunk@178232 138bc75d-0d04-0410-961f-82ee72b054a4
Diffstat (limited to 'gcc/ada/a-cohama.adb')
-rw-r--r-- | gcc/ada/a-cohama.adb | 22 |
1 files changed, 13 insertions, 9 deletions
diff --git a/gcc/ada/a-cohama.adb b/gcc/ada/a-cohama.adb index fdf9696fd61..c06ba9e35e4 100644 --- a/gcc/ada/a-cohama.adb +++ b/gcc/ada/a-cohama.adb @@ -39,13 +39,15 @@ package body Ada.Containers.Hashed_Maps is type Iterator is new Map_Iterator_Interfaces.Forward_Iterator with record - Container : Map_Access; - Node : Node_Access; - end record; + Container : Map_Access; + Node : Node_Access; + end record; overriding function First (Object : Iterator) return Cursor; - overriding function Next (Object : Iterator; Position : Cursor) - return Cursor; + + overriding function Next + (Object : Iterator; + Position : Cursor) return Cursor; ----------------------- -- Local Subprograms -- @@ -599,8 +601,8 @@ package body Ada.Containers.Hashed_Maps is B := B - 1; end Iterate; - function Iterate (Container : Map) - return Map_Iterator_Interfaces.Forward_Iterator'class + function Iterate + (Container : Map) return Map_Iterator_Interfaces.Forward_Iterator'class is Node : constant Node_Access := HT_Ops.First (Container.HT); It : constant Iterator := (Container'Unrestricted_Access, Node); @@ -680,11 +682,13 @@ package body Ada.Containers.Hashed_Maps is Position := Next (Position); end Next; - function Next (Object : Iterator; Position : Cursor) return Cursor is + function Next + (Object : Iterator; + Position : Cursor) return Cursor + is begin if Position.Node = null then return No_Element; - else return (Object.Container, Next (Position).Node); end if; |