algorithm.h File Reference

#include <cassert>
#include <functional>
#include <queue>
#include <set>
#include <vector>

Go to the source code of this file.

Namespaces
namespace	liph

Functions
template<class T >
void	liph::erase (std::vector< T > &v, const std::set< size_t > &idx)
	Erases the specified elements from v, according to index in idx. More...
template<class T >
std::vector< T >	liph::topk (const std::vector< T > &data, size_t k)
template<class T >
T	liph::find_kth (const std::vector< T > &data, size_t k)
template<class T >
int	liph::binary_search (T a[], int n, T val)