aboutsummaryrefslogtreecommitdiff
path: root/src/tutorial/C-code
diff options
context:
space:
mode:
authorVadim B. Mikheev <vadim4o@yahoo.com>1997-09-18 14:41:56 +0000
committerVadim B. Mikheev <vadim4o@yahoo.com>1997-09-18 14:41:56 +0000
commitb0ccd78479bc936599088b555654b39c006d5c84 (patch)
treee010763a8b05472fcb5072538a95aa9e64988cc5 /src/tutorial/C-code
parent8f1e1b4551c07c48fc59682d606ec5957b9d9178 (diff)
downloadpostgresql-b0ccd78479bc936599088b555654b39c006d5c84.tar.gz
postgresql-b0ccd78479bc936599088b555654b39c006d5c84.zip
Don't limit number of tuples in leftist trees!
Use qsort to sort array of tuples for nextrun when current run is done and put into leftist tree from sorted array! It's much faster and creates non-bushy tree - this is ve-e-ery good for perfomance!
Diffstat (limited to 'src/tutorial/C-code')
0 files changed, 0 insertions, 0 deletions