diff options
author | Peter Eisentraut | 2010-07-29 19:34:41 +0000 |
---|---|---|
committer | Peter Eisentraut | 2010-07-29 19:34:41 +0000 |
commit | 66424a284879b5e0d456a1c7c1ec06b0b918a798 (patch) | |
tree | ec11d97b4bb1c04fc1ace6920fb1f38d612342eb /doc/src/sgml/indexam.sgml | |
parent | 984d56b80f5a945db2bfa80499b5ed913848242b (diff) |
Fix indentation of verbatim block elements
Block elements with verbatim formatting (literallayout, programlisting,
screen, synopsis) should be aligned at column 0 independent of the surrounding
SGML, because whitespace is significant, and indenting them creates erratic
whitespace in the output. The CSS stylesheets already take care of indenting
the output.
Assorted markup improvements to go along with it.
Diffstat (limited to 'doc/src/sgml/indexam.sgml')
-rw-r--r-- | doc/src/sgml/indexam.sgml | 22 |
1 files changed, 11 insertions, 11 deletions
diff --git a/doc/src/sgml/indexam.sgml b/doc/src/sgml/indexam.sgml index 93f3411a2d0..a9d08748a7a 100644 --- a/doc/src/sgml/indexam.sgml +++ b/doc/src/sgml/indexam.sgml @@ -1,4 +1,4 @@ -<!-- $PostgreSQL: pgsql/doc/src/sgml/indexam.sgml,v 2.33 2010/02/08 04:33:51 tgl Exp $ --> +<!-- $PostgreSQL: pgsql/doc/src/sgml/indexam.sgml,v 2.34 2010/07/29 19:34:40 petere Exp $ --> <chapter id="indexam"> <title>Index Access Method Interface Definition</title> @@ -1027,16 +1027,16 @@ amcostestimate (PlannerInfo *root, Compute the index access cost. A generic estimator might do this: <programlisting> - /* - * Our generic assumption is that the index pages will be read - * sequentially, so they cost seq_page_cost each, not random_page_cost. - * Also, we charge for evaluation of the indexquals at each index row. - * All the costs are assumed to be paid incrementally during the scan. - */ - cost_qual_eval(&index_qual_cost, indexQuals, root); - *indexStartupCost = index_qual_cost.startup; - *indexTotalCost = seq_page_cost * numIndexPages + - (cpu_index_tuple_cost + index_qual_cost.per_tuple) * numIndexTuples; +/* + * Our generic assumption is that the index pages will be read + * sequentially, so they cost seq_page_cost each, not random_page_cost. + * Also, we charge for evaluation of the indexquals at each index row. + * All the costs are assumed to be paid incrementally during the scan. + */ +cost_qual_eval(&index_qual_cost, indexQuals, root); +*indexStartupCost = index_qual_cost.startup; +*indexTotalCost = seq_page_cost * numIndexPages + + (cpu_index_tuple_cost + index_qual_cost.per_tuple) * numIndexTuples; </programlisting> However, the above does not account for amortization of index reads |