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 | c9fbd23621e7d7c94e26642d9348d532155aaadf (patch) | |
| tree | dee4ec031a21edfecf2decf14f4973bd9a48f213 /llvm/lib/Support/SmallPtrSet.cpp | |
| parent | 64a5cf5617285a32191075c895ede9deca6f4ee7 (diff) | |
| download | llvm-c9fbd23621e7d7c94e26642d9348d532155aaadf.zip llvm-c9fbd23621e7d7c94e26642d9348d532155aaadf.tar.gz llvm-c9fbd23621e7d7c94e26642d9348d532155aaadf.tar.bz2 | |
[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.
llvm-svn: 178376
Diffstat (limited to 'llvm/lib/Support/SmallPtrSet.cpp')
0 files changed, 0 insertions, 0 deletions