#include "bit/exceptions.hh"#include "bit/base.hh"Go to the source code of this file.
Namespaces | |
| namespace | bit |
Functions | |
| template<class A> | |
| u32 | bit::max (const A &array) |
| Find the maximum element from an array. | |
| template<class A> | |
| u64 | bit::binary_search (const A &array, u32 value, u64 first, u64 limit) |
| Find the first index of a value from a sorted array. | |
| template<class A> | |
| u64 | bit::lower_bound (const A &array, u32 value, u64 first, u64 limit) |
Find the smallest index at which value could be inserted maintaining array in sorted order. | |
| template<class A> | |
| u64 | bit::last_leq (const A &array, u32 value) |
| From a sorted array, find the largest index that has a equal or smaller value than specified. | |
| template<class A> | |
| u64 | bit::last_leq (const A &array, u32 value, u64 first, u64 limit) |
| From a sorted array range, find the largest index that has a equal or smaller value than specified. | |
| template<class A> | |
| u64 | bit::last_leq_naive (const A &array, u32 value, u64 first, u64 limit) |
1.4.6