diff options
| author | Alvaro Herrera <alvherre@alvh.no-ip.org> | 2015-05-15 17:03:16 -0300 |
|---|---|---|
| committer | Alvaro Herrera <alvherre@alvh.no-ip.org> | 2015-05-15 17:03:16 -0300 |
| commit | 26df7066cc229887d4defdf1d105c0a22b8a88fb (patch) | |
| tree | 5b9cd2cefa7c52d703f9d51a48426f9820118f03 /src/backend/optimizer/util/predtest.c | |
| parent | 1e98fa0bf8de9d25d97fb346755a9c9c17bba549 (diff) | |
Move strategy numbers to include/access/stratnum.h
For upcoming BRIN opclasses, it's convenient to have strategy numbers
defined in a single place. Since there's nothing appropriate, create
it. The StrategyNumber typedef now lives there, as well as existing
strategy numbers for B-trees (from skey.h) and R-tree-and-friends (from
gist.h). skey.h is forced to include stratnum.h because of the
StrategyNumber typedef, but gist.h is not; extensions that currently
rely on gist.h for rtree strategy numbers might need to add a new
A few .c files can stop including skey.h and/or gist.h, which is a nice
side benefit.
Per discussion:
https://www.postgresql.org/message-id/20150514232132.GZ2523@alvh.no-ip.org
Authored by Emre Hasegeli and Álvaro.
(It's not clear to me why bootscanner.l has any #include lines at all.)
Diffstat (limited to 'src/backend/optimizer/util/predtest.c')
| -rw-r--r-- | src/backend/optimizer/util/predtest.c | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/src/backend/optimizer/util/predtest.c b/src/backend/optimizer/util/predtest.c index cd34766c9a7..d9e49d127e1 100644 --- a/src/backend/optimizer/util/predtest.c +++ b/src/backend/optimizer/util/predtest.c @@ -1248,7 +1248,7 @@ list_member_strip(List *list, Expr *datum) * Define "operator implication tables" for btree operators ("strategies"), * and similar tables for refutation. * - * The strategy numbers defined by btree indexes (see access/skey.h) are: + * The strategy numbers defined by btree indexes (see access/stratnum.h) are: * 1 < 2 <= 3 = 4 >= 5 > * and in addition we use 6 to represent <>. <> is not a btree-indexable * operator, but we assume here that if an equality operator of a btree |