From: Eric Ford (eford_at_[hidden])
Date: 2001-07-05 12:15:15
--- In boost_at_y..., "Paul A. Bristow" <pbristow_at_h...> wrote:
> ds very useful when it can be used.
> Yes please.
I uploaded it to the files section in the "Binary Search With Hint"
folder. EbfAlgorithm.h has the relevant code. There are some
debugging lines that you require a few debugging support files (sorry
not "boost-ified" debugging lines) that can easily be commented out if
you'd rather. There's also an example/test program to see that it/how
Sorry the documentation's skimpy. The main thing you need to know is
you can call lower_bound_guess, upper_bound_guess, and
equal_range_guess. The syntax is the same except the third argument
is your "hint" iterator that tells it where to start looking. The
third argument and later obviously shifted to the fourth argument and
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk