SDSL  3.0.0
Succinct Data Structure Library
k2_treap_algorithm.hpp File Reference

k2_treap_algorithm.hpp contains k^2-treap algorithms. More...

#include <algorithm>
#include <array>
#include <climits>
#include <complex>
#include <iterator>
#include <queue>
#include <tuple>
#include <vector>
#include <sdsl/bits.hpp>
#include <sdsl/k2_treap_helper.hpp>
#include <sdsl/vectors.hpp>

Go to the source code of this file.

Classes

class  sdsl::k2_treap_ns::top_k_iterator< t_k2_treap >
 
class  sdsl::k2_treap_ns::range_iterator< t_k2_treap >
 

Namespaces

 sdsl
 Namespace for the succinct data structure library.
 
 sdsl::k2_treap_ns
 

Functions

bool sdsl::k2_treap_ns::contained (const point_type p, const point_type &p1, const point_type &p2)
 Check if point x is contained in the rectangle (p1,p2) More...
 
template<uint8_t t_k>
bool sdsl::k2_treap_ns::contained (const point_type &p1, const point_type &p2, const node_type &v)
 Check if the rectangle of node v is contained in the rectangle (p1,p2) More...
 
template<uint8_t t_k>
bool sdsl::k2_treap_ns::overlap (const point_type &p1, const point_type &p2, const node_type &v)
 Check if rectangle (p1,p2) and the area of node v overlap. More...
 
template<typename t_k2_treap >
k2_treap_ns::top_k_iterator< t_k2_treap > sdsl::top_k (const t_k2_treap &t, k2_treap_ns::point_type p1, k2_treap_ns::point_type p2)
 Get iterator for all heaviest points in rectangle (p1,p2) in decreasing order. More...
 
template<typename t_k2_treap >
k2_treap_ns::range_iterator< t_k2_treap > sdsl::range_3d (const t_k2_treap &t, k2_treap_ns::point_type p1, k2_treap_ns::point_type p2, k2_treap_ns::range_type range)
 Get iterator for all points in rectangle (p1,p2) with weights in range. More...
 
template<typename t_k2_treap >
uint64_t sdsl::__count (const t_k2_treap &, typename t_k2_treap::node_type)
 
template<typename t_k2_treap >
uint64_t sdsl::_count (const t_k2_treap &, k2_treap_ns::point_type, k2_treap_ns::point_type, typename t_k2_treap::node_type)
 
template<typename t_k2_treap >
uint64_t sdsl::count (const t_k2_treap &treap, k2_treap_ns::point_type p1, k2_treap_ns::point_type p2)
 Count how many points are in the rectangle (p1,p2) More...
 
template<uint8_t t_k, typename t_bv , typename t_rank , typename t_max_vec >
void sdsl::construct (k2_treap< t_k, t_bv, t_rank, t_max_vec > &idx, std::string file, cache_config &config)
 Specialized version of method ,,construct'' for k2_treaps. More...
 
template<uint8_t t_k, typename t_bv , typename t_rank , typename t_max_vec >
void sdsl::construct_im (k2_treap< t_k, t_bv, t_rank, t_max_vec > &idx, std::vector< std::array< uint64_t, 3 >> data)
 Specialized version of method ,,construct_im'' for k2_treaps. More...
 

Detailed Description

k2_treap_algorithm.hpp contains k^2-treap algorithms.

Author
Simon Gog

Definition in file k2_treap_algorithm.hpp.