[Top][All Lists]

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

binary search cleanup

From: Joe Neeman
Subject: binary search cleanup
Date: Thu, 07 Sep 2006 16:34:49 +1000

This removes our re-implementation of binary search and uses the STL
version. The main change is to remove strcmp-like comparison functions
and replace them with binary "less than" predicates.

I also include wrappers for lower_bound and upper_bound. I use these in
my working copy, but that patch isn't ready yet.

If this patch is OK, I want to do the same thing for vector_sort next.

2006-09-07  Joe Neeman  <address@hidden>

        * lily/ (find_broken_piece): 
        * lily/ (get_columns): 
        * lily/ (get_line): 
        * lily/ (get_column_description): 
        * lily/ (lookup): 
        use the new binary search.

        * flower/include/std-vector.hh: replace binary_search with
        a more STL-like version

reply via email to

[Prev in Thread] Current Thread [Next in Thread]