aboutsummaryrefslogtreecommitdiff
path: root/gcc/ada/a-cfhase.ads
diff options
context:
space:
mode:
authorRobert Dewar <dewar@adacore.com>2011-08-02 09:50:34 +0000
committerArnaud Charlet <charlet@gcc.gnu.org>2011-08-02 11:50:34 +0200
commite51537ff6cdf7a85ed58883511d00ee309c21bd9 (patch)
tree37ae65204ed46299ee18afc572349f390a7fecdd /gcc/ada/a-cfhase.ads
parent83fa09c5beeee4a76ec6910e1ca38577d5373a60 (diff)
downloadgcc-e51537ff6cdf7a85ed58883511d00ee309c21bd9.zip
gcc-e51537ff6cdf7a85ed58883511d00ee309c21bd9.tar.gz
gcc-e51537ff6cdf7a85ed58883511d00ee309c21bd9.tar.bz2
a-cfdlli.ads, [...]: Remove unneeded with of Ada.Containers Remove commented out pragma Inline's...
2011-08-02 Robert Dewar <dewar@adacore.com> * a-cfdlli.ads, a-cfhase.ads, a-cforma.ads, a-cfhama.ads, a-cforse.ads: Remove unneeded with of Ada.Containers Remove commented out pragma Inline's Move specifications of new subprograms to the actual specs From-SVN: r177114
Diffstat (limited to 'gcc/ada/a-cfhase.ads')
-rw-r--r--gcc/ada/a-cfhase.ads26
1 files changed, 11 insertions, 15 deletions
diff --git a/gcc/ada/a-cfhase.ads b/gcc/ada/a-cfhase.ads
index b9da734e..ecc70e4 100644
--- a/gcc/ada/a-cfhase.ads
+++ b/gcc/ada/a-cfhase.ads
@@ -49,23 +49,11 @@
-- function Left (Container : Set; Position : Cursor) return Set;
-- function Right (Container : Set; Position : Cursor) return Set;
--- Strict_Equal returns True if the containers are physically equal,
--- meaning that they are structurally equal (function "=" returns True)
--- and that they have the same set of cursors.
-
--- Left returns a container containing all elements preceding Position
--- (excluded) in Container. Right returns a container containing all
--- elements following Position (included) in Container. These two new
--- functions are useful to express invariant properties in loops which
--- iterate over containers. Left returns the part of the container already
--- scanned and Right the part not scanned yet.
+-- See detailed specifications for these subprograms
private with Ada.Containers.Hash_Tables;
private with Ada.Streams;
-with Ada.Containers;
-use Ada.Containers;
-
generic
type Element_Type is private;
@@ -242,10 +230,18 @@ package Ada.Containers.Formal_Hashed_Sets is
end Generic_Keys;
function Strict_Equal (Left, Right : Set) return Boolean;
+ -- Strict_Equal returns True if the containers are physically equal, i.e.
+ -- they are structurally equal (function "=" returns True) and that they
+ -- have the same set of cursors.
- function Left (Container : Set; Position : Cursor) return Set;
-
+ function Left (Container : Set; Position : Cursor) return Set;
function Right (Container : Set; Position : Cursor) return Set;
+ -- Left returns a container containing all elements preceding Position
+ -- (excluded) in Container. Right returns a container containing all
+ -- elements following Position (included) in Container. These two new
+ -- functions can be used to express invariant properties in loops which
+ -- iterate over containers. Left returns the part of the container already
+ -- scanned and Right the part not scanned yet.
private