Skip to content
GitLab
Explore
Sign in
Register
Primary navigation
Search or go to…
Project
P
postgres-lambda-diff
Manage
Activity
Members
Labels
Plan
Issues
Issue boards
Milestones
Wiki
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Snippets
Build
Pipelines
Jobs
Pipeline schedules
Artifacts
Deploy
Releases
Container registry
Model registry
Operate
Environments
Monitor
Incidents
Analyze
Value stream analytics
Contributor analytics
CI/CD analytics
Repository analytics
Model experiments
Help
Help
Support
GitLab documentation
Compare GitLab plans
Community forum
Contribute to GitLab
Provide feedback
Keyboard shortcuts
?
Snippets
Groups
Projects
Show more breadcrumbs
Jakob Huber
postgres-lambda-diff
Commits
9dc12ef5
Commit
9dc12ef5
authored
25 years ago
by
Tom Lane
Browse files
Options
Downloads
Patches
Plain Diff
Oops, missed some < and > that need to be < and > ...
parent
0fb864f1
No related branches found
No related tags found
No related merge requests found
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
doc/src/sgml/xindex.sgml
+6
-6
6 additions, 6 deletions
doc/src/sgml/xindex.sgml
with
6 additions
and
6 deletions
doc/src/sgml/xindex.sgml
+
6
−
6
View file @
9dc12ef5
<!--
$Header: /cvsroot/pgsql/doc/src/sgml/xindex.sgml,v 1.
9
2000/03/28 02:5
3:02
tgl Exp $
$Header: /cvsroot/pgsql/doc/src/sgml/xindex.sgml,v 1.
10
2000/03/28 02:5
9:55
tgl Exp $
Postgres documentation
-->
...
...
@@ -107,7 +107,7 @@ SELECT oid FROM pg_am WHERE amname = 'btree';
impose a strict ordering on keys, lesser to greater. Since
<productname>Postgres</productname> allows the user to define operators,
<productname>Postgres</productname> cannot look at the name of an operator
(eg, "
>
" or "
<
") and tell what kind of comparison it is. In fact,
(eg, "
>
" or "
<
") and tell what kind of comparison it is. In fact,
some access methods don't impose any ordering at all. For example,
<acronym>R-tree</acronym>s express a rectangle-containment relationship,
whereas a hashed data structure expresses only bitwise similarity based
...
...
@@ -115,7 +115,7 @@ SELECT oid FROM pg_am WHERE amname = 'btree';
needs some consistent way of taking a qualification in your query,
looking at the operator and then deciding if a usable index exists. This
implies that <productname>Postgres</productname> needs to know, for
example, that the "
<
=" and "
>
" operators partition a
example, that the "
<
=" and "
>
" operators partition a
<acronym>B-tree</acronym>. <productname>Postgres</productname>
uses strategies to express these relationships between
operators and the way they can be used to scan indices.
...
...
@@ -203,7 +203,7 @@ SELECT oid FROM pg_am WHERE amname = 'btree';
<note>
<para>
Strictly speaking, this routine can return a negative
number (
<
0), 0, or a non-zero positive number (
>
0).
number (
<
0), 0, or a non-zero positive number (
>
0).
</para>
</note>
</para>
...
...
@@ -427,11 +427,11 @@ CREATE OPERATOR = (
FROM pg_am am, pg_opclass opcl, complex_ops_tmp c
WHERE amname = 'btree' AND
opcname = 'complex_abs_ops' AND
c.oprname = '
<
';
c.oprname = '
<
';
</programlisting>
Now do this for the other operators substituting for the "1" in the
third line above and the "
<
" in the last line. Note the order:
third line above and the "
<
" in the last line. Note the order:
"less than" is 1, "less than or equal" is 2, "equal" is 3, "greater
than or equal" is 4, and "greater than" is 5.
</para>
...
...
This diff is collapsed.
Click to expand it.
Preview
0%
Loading
Try again
or
attach a new file
.
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Save comment
Cancel
Please
register
or
sign in
to comment