#include <algorithm>
#include <cstddef>
#include <cassert>
#include <stdint.h>
Go to the source code of this file.
Classes | |
class | util::IdentityAccessor< T > |
struct | util::Pivot64 |
struct | util::Pivot32 |
struct | util::PivotSelect< 8 > |
struct | util::PivotSelect< 4 > |
struct | util::PivotSelect< 2 > |
Namespaces | |
namespace | util |
Functions | |
template<class Iterator , class Accessor > | |
bool | util::BinaryFind (const Accessor &accessor, Iterator begin, Iterator end, const typename Accessor::Key key, Iterator &out) |
template<class Iterator , class Accessor , class Pivot > | |
bool | util::BoundedSortedUniformFind (const Accessor &accessor, Iterator before_it, typename Accessor::Key before_v, Iterator after_it, typename Accessor::Key after_v, const typename Accessor::Key key, Iterator &out) |
template<class Iterator , class Accessor , class Pivot > | |
bool | util::SortedUniformFind (const Accessor &accessor, Iterator begin, Iterator end, const typename Accessor::Key key, Iterator &out) |