Revise _bt_binsrch() so that its binary search loop takes

Tom Lane <tgl@sss.pgh.pa.us>

Commit: bc9236bc014aea08e06d52516e47abed6fdcaa53
Author: Tom Lane <tgl@sss.pgh.pa.us>
Date: 1999-07-16T22:17:06Z
Releases: 7.1.1
Revise _bt_binsrch() so that its binary search loop takes
care of equal-key cases, eliminating bt_firsteq().  The linear search
formerly done by bt_firsteq() took a lot of time in the case where many
equal keys appear on the same page.

Files

PathChange+/−
src/backend/access/nbtree/nbtsearch.c modified +85 −123