aboutsummaryrefslogtreecommitdiff
path: root/gcc
diff options
context:
space:
mode:
authorRobert Dewar <dewar@adacore.com>2008-07-31 09:51:32 +0200
committerArnaud Charlet <charlet@gcc.gnu.org>2008-07-31 09:51:32 +0200
commit5b2a132a13035edc6217e2c3e8f828b4d4672d8c (patch)
treee4b5a19d1f0271f584b3fc705951c9fa29146ed9 /gcc
parent844ae01db8ad6b8e57daa9575efbe1ff167f816e (diff)
downloadgcc-5b2a132a13035edc6217e2c3e8f828b4d4672d8c.zip
gcc-5b2a132a13035edc6217e2c3e8f828b4d4672d8c.tar.gz
gcc-5b2a132a13035edc6217e2c3e8f828b4d4672d8c.tar.bz2
g-pehage.adb, [...]: Minor reformatting
2008-07-31 Robert Dewar <dewar@adacore.com> * g-pehage.adb, g-pehage.ads: Minor reformatting From-SVN: r138356
Diffstat (limited to 'gcc')
-rw-r--r--gcc/ada/g-pehage.adb12
-rw-r--r--gcc/ada/g-pehage.ads28
2 files changed, 20 insertions, 20 deletions
diff --git a/gcc/ada/g-pehage.adb b/gcc/ada/g-pehage.adb
index c779fac..7707094 100644
--- a/gcc/ada/g-pehage.adb
+++ b/gcc/ada/g-pehage.adb
@@ -49,8 +49,8 @@ package body GNAT.Perfect_Hash_Generators is
-- h (w) = (g (f1 (w)) + g (f2 (w))) mod m
- -- where f1 and f2 are functions that map strings into integers, and g is a
- -- function that maps integers into [0, m-1]. h can be order preserving.
+ -- where f1 and f2 are functions that map strings into integers, and g is
+ -- a function that maps integers into [0, m-1]. h can be order preserving.
-- For instance, let W = {w_0, ..., w_i, ..., w_m-1}, h can be defined
-- such that h (w_i) = i.
@@ -132,10 +132,10 @@ package body GNAT.Perfect_Hash_Generators is
package WT is new GNAT.Table (Word_Type, Word_Id, 0, 32, 32);
package IT is new GNAT.Table (Integer, Integer, 0, 32, 32);
-- The two main tables. WT is used to store the words in their initial
- -- version and in their reduced version (that is words reduced to
- -- their significant characters). As an instance of GNAT.Table, WT does
- -- not initialize string pointers to null. This initialization has to be
- -- done manually when the table is allocated. IT is used to store several
+ -- version and in their reduced version (that is words reduced to their
+ -- significant characters). As an instance of GNAT.Table, WT does not
+ -- initialize string pointers to null. This initialization has to be done
+ -- manually when the table is allocated. IT is used to store several
-- tables of components containing only integers.
function Image (Int : Integer; W : Natural := 0) return String;
diff --git a/gcc/ada/g-pehage.ads b/gcc/ada/g-pehage.ads
index 277a2a4..8b75f2e 100644
--- a/gcc/ada/g-pehage.ads
+++ b/gcc/ada/g-pehage.ads
@@ -99,18 +99,18 @@ package GNAT.Perfect_Hash_Generators is
K_To_V : Float := Default_K_To_V;
Optim : Optimization := CPU_Time;
Tries : Positive := Default_Tries);
- -- Initialize the generator and its internal structures. Set the
- -- ratio of vertices over keys in the random graphs. This value
- -- has to be greater than 2.0 in order for the algorithm to
- -- succeed. The word set is not modified (in particular when it is
- -- already set). For instance, it is possible to run several times
- -- the generator with different settings on the same words.
-
- -- A classical way of doing is to Insert all the words and then to
- -- invoke Initialize and Compute. If Compute fails to find a
- -- perfect hash function, invoke Initialize another time with
- -- other configuration parameters (probably with a greater K_To_V
- -- ratio). Once successful, invoke Produce and Finalize.
+ -- Initialize the generator and its internal structures. Set the ratio of
+ -- vertices over keys in the random graphs. This value has to be greater
+ -- than 2.0 in order for the algorithm to succeed. The word set is not
+ -- modified (in particular when it is already set). For instance, it is
+ -- possible to run several times the generator with different settings on
+ -- the same words.
+ --
+ -- A classical way of doing is to Insert all the words and then to invoke
+ -- Initialize and Compute. If Compute fails to find a perfect hash
+ -- function, invoke Initialize another time with other configuration
+ -- parameters (probably with a greater K_To_V ratio). Once successful,
+ -- invoke Produce and Finalize.
procedure Finalize;
-- Deallocate the internal structures and the words table
@@ -219,8 +219,8 @@ package GNAT.Perfect_Hash_Generators is
Length_2 : out Natural);
-- Return the definition of the table Name. This includes the length of
-- dimensions 1 and 2 and the size of an unsigned integer item. When
- -- Length_2 is zero, the table has only one dimension. All the ranges start
- -- from zero.
+ -- Length_2 is zero, the table has only one dimension. All the ranges
+ -- start from zero.
function Value
(Name : Table_Name;