2008-04-05 Basile Starynkevitch <basile@starynkevitch.net>

	MELT branch merged with trunk r133930



git-svn-id: svn+ssh://gcc.gnu.org/svn/gcc/branches/melt-branch@133932 138bc75d-0d04-0410-961f-82ee72b054a4

1 files changed, 3 insertions, 3 deletions

diff --git a/gcc/ada/g-pehage.ads b/gcc/ada/g-pehage.ads
index 5ba3fc5d58c..b2aea490eed 100644
--- a/gcc/ada/g-pehage.ads
+++ b/gcc/ada/g-pehage.ads
@@ -62,7 +62,7 @@
 
 --  The functions generated by this package require the key set to be known in
 --  advance (they are "static" hash functions). The hash functions are also
---  order preservering. If w2 is inserted after w1 in the generator, then (w1)
+--  order preserving. If w2 is inserted after w1 in the generator, then (w1)
 --  < f (w2). These hashing functions are convenient for use with realtime
 --  applications.
 
@@ -71,7 +71,7 @@ package GNAT.Perfect_Hash_Generators is
    Default_K_To_V : constant Float  := 2.05;
    --  Default ratio for the algorithm. When K is the number of keys, V =
    --  (K_To_V) * K is the size of the main table of the hash function. To
-   --  converge, the algorithm requires K_To_V to be stricly greater than 2.0.
+   --  converge, the algorithm requires K_To_V to be strictly greater than 2.0.
 
    Default_Pkg_Name : constant String := "Perfect_Hash";
    --  Default package name in which the hash function is defined
@@ -113,7 +113,7 @@ package GNAT.Perfect_Hash_Generators is
    --  Insert a new key in the table
 
    Too_Many_Tries : exception;
-   --  Raised after Tries unsuccessfull runs
+   --  Raised after Tries unsuccessful runs
 
    procedure Compute (Position : String := Default_Position);
    --  Compute the hash function. Position allows to define selection of