diff options
| author | charlet <charlet@138bc75d-0d04-0410-961f-82ee72b054a4> | 2014-11-07 13:51:20 +0000 |
|---|---|---|
| committer | charlet <charlet@138bc75d-0d04-0410-961f-82ee72b054a4> | 2014-11-07 13:51:20 +0000 |
| commit | 6a492be3423e4c39009a6e714a9a9e69a687c9d8 (patch) | |
| tree | 4550df1ec611f0fa0456eb8345bb6d218bdebd7f /gcc/ada/a-cfdlli.ads | |
| parent | 7d525f2616db39bd47d9c213de182abee3968213 (diff) | |
| download | gcc-6a492be3423e4c39009a6e714a9a9e69a687c9d8.tar.gz | |
2014-11-07 Robert Dewar <dewar@adacore.com>
* freeze.adb: Code clean up.
2014-11-07 Yannick Moy <moy@adacore.com>
* a-cfdlli.ads, a-cfhama.ads, a-cfhase.ads, a-cfinve.ads,
* a-cforma.ads, a-cforse.ads, a-cofove.ads: Mark First_To_Previous,
Current_To_Last and Strict_Equal as Ghost.
2014-11-07 Ed Schonberg <schonberg@adacore.com>
* sem_ch3.adb: Code clean up.
git-svn-id: svn+ssh://gcc.gnu.org/svn/gcc/trunk@217225 138bc75d-0d04-0410-961f-82ee72b054a4
Diffstat (limited to 'gcc/ada/a-cfdlli.ads')
| -rw-r--r-- | gcc/ada/a-cfdlli.ads | 6 |
1 files changed, 5 insertions, 1 deletions
diff --git a/gcc/ada/a-cfdlli.ads b/gcc/ada/a-cfdlli.ads index 98f28e4a8b1..0c028ef844b 100644 --- a/gcc/ada/a-cfdlli.ads +++ b/gcc/ada/a-cfdlli.ads @@ -6,7 +6,7 @@ -- -- -- S p e c -- -- -- --- Copyright (C) 2004-2013, Free Software Foundation, Inc. -- +-- Copyright (C) 2004-2014, Free Software Foundation, Inc. -- -- -- -- This specification is derived from the Ada Reference Manual for use with -- -- GNAT. The copyright notice above, and the license provisions that follow -- @@ -311,6 +311,7 @@ package Ada.Containers.Formal_Doubly_Linked_Lists is end Generic_Sorting; function Strict_Equal (Left, Right : List) return Boolean with + Ghost, Global => null; -- Strict_Equal returns True if the containers are physically equal, i.e. -- they are structurally equal (function "=" returns True) and that they @@ -318,10 +319,13 @@ package Ada.Containers.Formal_Doubly_Linked_Lists is function First_To_Previous (Container : List; Current : Cursor) return List with + Ghost, Global => null, Pre => Has_Element (Container, Current) or else Current = No_Element; + function Current_To_Last (Container : List; Current : Cursor) return List with + Ghost, Global => null, Pre => Has_Element (Container, Current) or else Current = No_Element; -- First_To_Previous returns a container containing all elements preceding |