aboutsummaryrefslogtreecommitdiff
path: root/src/backend/utils/adt/arrayfuncs.c
diff options
context:
space:
mode:
authorTom Lane <tgl@sss.pgh.pa.us>2005-03-28 00:58:26 +0000
committerTom Lane <tgl@sss.pgh.pa.us>2005-03-28 00:58:26 +0000
commit5db2e83852cc3f25fdea48c4aa0da8696c88a826 (patch)
tree1b6db39b1a6af12052bb93f1a7892a46a0a504d7 /src/backend/utils/adt/arrayfuncs.c
parentbf3dbb5881e9b886ee9fe84bca2153c698eea885 (diff)
downloadpostgresql-5db2e83852cc3f25fdea48c4aa0da8696c88a826.tar.gz
postgresql-5db2e83852cc3f25fdea48c4aa0da8696c88a826.zip
Rethink the order of expression preprocessing: eval_const_expressions
really ought to run before canonicalize_qual, because it can now produce forms that canonicalize_qual knows how to improve (eg, NOT clauses). Also, because eval_const_expressions already knows about flattening nested ANDs and ORs into N-argument form, the initial flatten_andors pass in canonicalize_qual is now completely redundant and can be removed. This doesn't save a whole lot of code, but the time and palloc traffic eliminated is a useful gain on large expression trees.
Diffstat (limited to 'src/backend/utils/adt/arrayfuncs.c')
0 files changed, 0 insertions, 0 deletions