summaryrefslogtreecommitdiff
path: root/src/backend/access/gist/gist.c
diff options
context:
space:
mode:
authorTom Lane <tgl@sss.pgh.pa.us>2009-05-11 17:56:14 +0000
committerTom Lane <tgl@sss.pgh.pa.us>2009-05-11 17:56:14 +0000
commitdd60bca4b0f21e11db9f46619fca4df8581be894 (patch)
treef937a176b4a986c3687c6933263f9a834a229961 /src/backend/access/gist/gist.c
parentb6ecee27db964eb5929c85ec5521704969625684 (diff)
Partially revert my patch of 2008-11-12 that installed a limit on the number
of AND/OR clause branches that predtest.c would attempt to deal with. As noted in bug #4721, that change disabled proof attempts for sizes of problems that people are actually expecting it to work for. The original complaint it was trying to solve was O(N^2) behavior for long IN-lists, so let's try applying the limit to just ScalarArrayOpExprs rather than everything. Another case of "foolish consistency" I fear. Back-patch to 8.2, same as the previous patch was.
Diffstat (limited to 'src/backend/access/gist/gist.c')
0 files changed, 0 insertions, 0 deletions