aboutsummaryrefslogtreecommitdiff
path: root/src/tutorial/funcs.source
diff options
context:
space:
mode:
authorTom Lane <tgl@sss.pgh.pa.us>2006-01-23 22:31:41 +0000
committerTom Lane <tgl@sss.pgh.pa.us>2006-01-23 22:31:41 +0000
commit7ccaf13a06b8e1f70b26ab049fdb4f8c8dece3f8 (patch)
treecb33521c65e04bb3f7a7d28439c15fd49ac5d2d0 /src/tutorial/funcs.source
parentf6f43e7ee33696191d11014028b08d03bb8ab778 (diff)
downloadpostgresql-7ccaf13a06b8e1f70b26ab049fdb4f8c8dece3f8.tar.gz
postgresql-7ccaf13a06b8e1f70b26ab049fdb4f8c8dece3f8.zip
Instead of using a numberOfRequiredKeys count to distinguish required
and non-required keys in a btree index scan, mark the required scankeys with private flag bits SK_BT_REQFWD and/or SK_BT_REQBKWD. This seems at least marginally clearer to me, and it eliminates a wired-into-the- data-structure assumption that required keys are consecutive. Even though that assumption will remain true for the foreseeable future, having it in there makes the code seem more complex than necessary.
Diffstat (limited to 'src/tutorial/funcs.source')
0 files changed, 0 insertions, 0 deletions