diff options
| author | Sean Silva <silvas@purdue.edu> | 2013-03-29 21:57:47 +0000 |
|---|---|---|
| committer | Sean Silva <silvas@purdue.edu> | 2013-03-29 21:57:47 +0000 |
| commit | 4991289b33f04f308bf5495a51518f850aa31cfa (patch) | |
| tree | d54145152d7d5b547269e120be243f3b2a21377a /lib/Support/SmallPtrSet.cpp | |
| parent | 7d21a64abfd3ad3d8587fa698bc3859acf765502 (diff) | |
| download | llvm-4991289b33f04f308bf5495a51518f850aa31cfa.tar.gz llvm-4991289b33f04f308bf5495a51518f850aa31cfa.tar.bz2 llvm-4991289b33f04f308bf5495a51518f850aa31cfa.tar.xz | |
[docs] The STL "binary search" has a non-obvious name.
std::lower_bound is the canonical "binary search" in the STL
(std::binary_search generally is not what you want). The name actually
makes a lot of sense (and also has a beautiful symmetry with the
std::upper_bound algorithm). The name is nonetheless non-obvious.
Also, remove mention of "radix search". It's not even clear how that
would work in the context of a sorted vector. AFAIK "radix search" only
makes sense when you have a trie-like data structure.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@178376 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'lib/Support/SmallPtrSet.cpp')
0 files changed, 0 insertions, 0 deletions