projects / users / hanada / postgres.git / commit
? search:
summary | shortlog | log | commit | commitdiff | tree
(parent: 1b68a88) | patch
Teach predtest.c how to reason about ScalarArrayOpExpr clauses as though
authorTom Lane <tgl@sss.pgh.pa.us>
Sun, 27 Nov 2005 22:15:42 +0000 (22:15 +0000)
committerTom Lane <tgl@sss.pgh.pa.us>
Sun, 27 Nov 2005 22:15:42 +0000 (22:15 +0000)
commit8a9acd3c410c1365f9f16e32910b8c942aeceef2
tree144a0a15dcd34974835bf79fb2eacb2e86ee167dtree
parent1b68a88f2226d9646f50116b2422f1dc32d07735commit | diff
Teach predtest.c how to reason about ScalarArrayOpExpr clauses as though
they were broken-out AND or OR lists.  The least grotty way to do this
seemed to be to set up a general mechanism for handling nodes as though
they were ANDs or ORs.  There's no other immediate use for it, but perhaps
we might want to use the mechanism someday for things like BETWEEN
SYMMETRIC.
src/backend/optimizer/util/predtest.c diff | blob | blame | history
Hanada's development tree.