Commit5344945

committed

Avoid saying "random" when randomness is not actually meant.

Per Thom Brown.

1 parenta481ff7 commit5344945Copy full SHA for 5344945

File tree

-4

lines changed

-4

lines changed

Lines changed: 2 additions & 2 deletions

Original file line number	Diff line number	Diff 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 $ -->`
`2`	`2`
`3`	`3`	`<chapter id="ddl">`
`4`	`4`	`<title>Data Definition</title>`
`@@ -36,7 +36,7 @@`
`36`	`36`	`is fixed, and each column has a name. The number of rows is`
`37`	`37`	`variable — it reflects how much data is stored at a given moment.`
`38`	`38`	`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 inrandom order,`
	`39`	`+ table. When a table is read, the rows will appear inan unspecified order,`
`40`	`40`	`unless sorting is explicitly requested. This is covered in <xref`
`41`	`41`	`linkend="queries">. Furthermore, SQL does not assign unique`
`42`	`42`	`identifiers to rows, so it is possible to have several completely`

Lines changed: 2 additions & 2 deletions

Original file line number	Diff line number	Diff 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 $ -->`
`2`	`2`
`3`	`3`	`<chapter id="textsearch">`
`4`	`4`	`<title>Full Text Search</title>`
`@@ -3270,7 +3270,7 @@ CREATE INDEX <replaceable>name</replaceable> ON <replaceable>table</replaceable>`
`3270`	`3270`	`(<productname>PostgreSQL</productname> does this automatically when needed.)`
`3271`	`3271`	`GiST indexes are lossy because each document is represented in the`
`3272`	`3272`	`index by a fixed-length signature. The signature is generated by hashing`
`3273`		`- each word into arandom bit in an n-bit string, with all these bits OR-ed`
	`3273`	`+ each word into asingle bit in an n-bit string, with all these bits OR-ed`
`3274`	`3274`	`together to produce an n-bit document signature. When two words hash to`
`3275`	`3275`	`the same bit position there will be a false match. If all words in`
`3276`	`3276`	`the query have matches (real or false) then the table row must be`

Comments

(0)