纠正编译错误

Author: ChenHuajun

postgresql/doc/src/sgml/advanced.sgml

@@ -999,14 +999,14 @@ ____________________________________________________________________________-->
 CREATE TABLE capitals (
   name       text,
   population real,
-  elevation  int,    -- (in ft)
+  elevation  int,    -− (in ft)
   state      char(2)
 );
 
 CREATE TABLE non_capitals (
   name       text,
   population real,
-  elevation  int     -- (in ft)
+  elevation  int     -− (in ft)
 );
 
 CREATE VIEW cities AS
@@ -1053,7 +1053,7 @@ CREATE VIEW cities AS
 CREATE TABLE cities (
   name       text,
   population real,
-  elevation  int     -- (in ft)
+  elevation  int     -− (in ft)
 );
 
 CREATE TABLE capitals (

postgresql/doc/src/sgml/bloom.sgml

@@ -209,7 +209,7 @@ SELECT 10000000
 <programlisting>
 =# EXPLAIN ANALYZE SELECT * FROM tbloom WHERE i2 = 898732 AND i5 = 123451;
                                               QUERY PLAN                                              
--------------------------------------------------------------------&zwsp;-----------------------------------
+-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&zwsp;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-
  Seq Scan on tbloom  (cost=0.00..2137.14 rows=3 width=24) (actual time=15.480..15.480 rows=0 loops=1)
    Filter: ((i2 = 898732) AND (i5 = 123451))
    Rows Removed by Filter: 100000
@@ -243,12 +243,12 @@ ____________________________________________________________________________-->
 CREATE INDEX
 =# SELECT pg_size_pretty(pg_relation_size('btreeidx'));
  pg_size_pretty
-----------------
+-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;
  3976 kB
 (1 row)
 =# EXPLAIN ANALYZE SELECT * FROM tbloom WHERE i2 = 898732 AND i5 = 123451;
                                               QUERY PLAN                                              
--------------------------------------------------------------------&zwsp;-----------------------------------
+-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&zwsp;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-
  Seq Scan on tbloom  (cost=0.00..2137.00 rows=2 width=24) (actual time=12.604..12.604 rows=0 loops=1)
    Filter: ((i2 = 898732) AND (i5 = 123451))
    Rows Removed by Filter: 100000
@@ -282,18 +282,19 @@ CREATE INDEX
 
 <!--==========================orignal english content==========================
   <para>
-   Bloom is better than btree in handling this type of search:
+   Having the bloom index defined on the table is better than btree in
+   handling this type of search:
 <programlisting>
 =# CREATE INDEX bloomidx ON tbloom USING bloom (i1, i2, i3, i4, i5, i6);
 CREATE INDEX
 =# SELECT pg_size_pretty(pg_relation_size('bloomidx'));
  pg_size_pretty
-----------------
+-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;
  1584 kB
 (1 row)
 =# EXPLAIN ANALYZE SELECT * FROM tbloom WHERE i2 = 898732 AND i5 = 123451;
                                                      QUERY PLAN                                                      
--------------------------------------------------------------------&zwsp;--------------------------------------------------
+-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&zwsp;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;
  Bitmap Heap Scan on tbloom  (cost=1792.00..1799.69 rows=2 width=24) (actual time=0.384..0.384 rows=0 loops=1)
    Recheck Cond: ((i2 = 898732) AND (i5 = 123451))
    Rows Removed by Index Recheck: 26
@@ -352,7 +353,7 @@ CREATE INDEX
 CREATE INDEX
 =# EXPLAIN ANALYZE SELECT * FROM tbloom WHERE i2 = 898732 AND i5 = 123451;
                                                         QUERY PLAN                                                         
--------------------------------------------------------------------&zwsp;--------------------------------------------------------
+-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&zwsp;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;-&minus;
  Bitmap Heap Scan on tbloom  (cost=24.34..32.03 rows=2 width=24) (actual time=0.032..0.033 rows=0 loops=1)
    Recheck Cond: ((i5 = 123451) AND (i2 = 898732))
    -&gt;  BitmapAnd  (cost=24.34..24.34 rows=2 width=0) (actual time=0.029..0.030 rows=0 loops=1)

postgresql/doc/src/sgml/btree.sgml

@@ -1001,7 +1001,7 @@ ____________________________________________________________________________-->
   <para>
    当已有叶页不能适应传入元组时，新叶页将添加到B-Tree索引中。 
    <firstterm>page split</firstterm>操作通过将部分项目移动到新页面为最初属于溢出页上的项目提供空间。
-   页拆分还必须插入新的<<firstterm>downlink</firstterm>到父页中的新页，这可能会导致父页依次拆分。 
+   页拆分还必须插入新的<firstterm>downlink</firstterm>到父页中的新页，这可能会导致父页依次拆分。 
    页拆分<quote>cascade upwards</quote>以递归的方式。 
    当根页最终无法适合新的下行链接时，发生<firstterm>root page split</firstterm>操作。
    通过创建比原始根页高一个级别的新根页，为树结构添加新级别。
@@ -1332,4 +1332,4 @@ ____________________________________________________________________________-->
  </sect2>
 </sect1>
 
-</chapter>
+</chapter>

postgresql/doc/src/sgml/catalogs.sgml

@@ -4517,7 +4517,7 @@ ____________________________________________________________________________-->
        <structfield>collprovider</structfield> <type>char</type>
       </para>
       <para>
-       排序规则的提供者：<literal>d</literal> = 数据库默认，<literal>c</literal> = libc，<literal>i</literal> = icu</entry>
+       排序规则的提供者：<literal>d</literal> = 数据库默认，<literal>c</literal> = libc，<literal>i</literal> = icu
       </para></entry>
      </row>
 
@@ -8134,7 +8134,7 @@ ____________________________________________________________________________-->
        <structfield>indnkeyatts</structfield> <type>int2</type>
       </para>
       <para>
-       索引中<firstterm>键列</firstterm>的编号，不计入任何的<firstterm>内含列</firstterm>，它们只是被存储但不参与索引的语义</entry>
+       索引中<firstterm>键列</firstterm>的编号，不计入任何的<firstterm>内含列</firstterm>，它们只是被存储但不参与索引的语义
       </para></entry>
      </row>
 
@@ -8973,7 +8973,7 @@ ____________________________________________________________________________-->
        <structfield>lanpltrusted</structfield> <type>bool</type>
       </para>
       <para>
-       为真表示这是一种可信的语言，即它被相信不会向普通SQL执行环境之外的任何东西授予权限。只有超级用户可以在非可信语言中创建函数。</entry>
+       为真表示这是一种可信的语言，即它被相信不会向普通SQL执行环境之外的任何东西授予权限。只有超级用户可以在非可信语言中创建函数。
       </para></entry>
      </row>
 
@@ -10700,7 +10700,7 @@ ____________________________________________________________________________-->
        <literal>a</literal>表示<command>INSERT</command>，
        <literal>w</literal>表示<command>UPDATE</command>，
        <literal>d</literal>表示<command>DELETE</command>，
-       <literal>*</literal>表示所有命令类型</entry>
+       <literal>*</literal>表示所有命令类型
       </para></entry>
      </row>
 
@@ -14182,7 +14182,7 @@ ____________________________________________________________________________-->
        (references <link linkend="catalog-pg-statistic-ext"><structname>pg_statistic_ext</structname></link>.<structfield>oid</structfield>)
       </para>
       <para>
-       包含此数据定义的扩展统计信息对象<
+       包含此数据定义的扩展统计信息对象
       </para></entry>
      </row>