Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to content

Commit 5344945

Browse files
committed
Avoid saying "random" when randomness is not actually meant.
Per Thom Brown.
1 parent a481ff7 commit 5344945

File tree

2 files changed

+4
-4
lines changed

2 files changed

+4
-4
lines changed

doc/src/sgml/ddl.sgml

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,4 @@
1-
<!-- $PostgreSQL: pgsql/doc/src/sgml/ddl.sgml,v 1.94 2010/07/29 19:34:40 petere Exp $ -->
1+
<!-- $PostgreSQL: pgsql/doc/src/sgml/ddl.sgml,v 1.95 2010/08/20 13:59:45 tgl Exp $ -->
22

33
<chapter id="ddl">
44
<title>Data Definition</title>
@@ -36,7 +36,7 @@
3636
is fixed, and each column has a name. The number of rows is
3737
variable &mdash; it reflects how much data is stored at a given moment.
3838
SQL does not make any guarantees about the order of the rows in a
39-
table. When a table is read, the rows will appear in random order,
39+
table. When a table is read, the rows will appear in an unspecified order,
4040
unless sorting is explicitly requested. This is covered in <xref
4141
linkend="queries">. Furthermore, SQL does not assign unique
4242
identifiers to rows, so it is possible to have several completely

doc/src/sgml/textsearch.sgml

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,4 @@
1-
<!-- $PostgreSQL: pgsql/doc/src/sgml/textsearch.sgml,v 1.57 2010/07/29 19:34:40 petere Exp $ -->
1+
<!-- $PostgreSQL: pgsql/doc/src/sgml/textsearch.sgml,v 1.58 2010/08/20 13:59:45 tgl Exp $ -->
22

33
<chapter id="textsearch">
44
<title>Full Text Search</title>
@@ -3270,7 +3270,7 @@ CREATE INDEX <replaceable>name</replaceable> ON <replaceable>table</replaceable>
32703270
(<productname>PostgreSQL</productname> does this automatically when needed.)
32713271
GiST indexes are lossy because each document is represented in the
32723272
index by a fixed-length signature. The signature is generated by hashing
3273-
each word into a random bit in an n-bit string, with all these bits OR-ed
3273+
each word into a single bit in an n-bit string, with all these bits OR-ed
32743274
together to produce an n-bit document signature. When two words hash to
32753275
the same bit position there will be a false match. If all words in
32763276
the query have matches (real or false) then the table row must be

0 commit comments

Comments
 (0)