SDSL 3.0.2
Succinct Data Structure Library
Loading...
Searching...
No Matches
k2_treap_algorithm.hpp File Reference

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

#include <array>
#include <complex>
#include <cstdint>
#include <iosfwd>
#include <queue>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#include <sdsl/config.hpp>
#include <sdsl/int_vector_buffer.hpp>
#include <sdsl/k2_treap_helper.hpp>
#include <sdsl/ram_fs.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

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

Functions

bool sdsl::k2_treap_ns::contained (const point_type p, point_type const &p1, point_type const &p2)
 Check if point x is contained in the rectangle (p1,p2)
 
template<uint8_t t_k>
bool sdsl::k2_treap_ns::contained (point_type const &p1, point_type const &p2, node_type const &v)
 Check if the rectangle of node v is contained in the rectangle (p1,p2)
 
template<uint8_t t_k>
bool sdsl::k2_treap_ns::overlap (point_type const &p1, point_type const &p2, node_type const &v)
 Check if rectangle (p1,p2) and the area of node v overlap.
 
template<typename t_k2_treap >
k2_treap_ns::top_k_iterator< t_k2_treap > sdsl::top_k (t_k2_treap const &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.
 
template<typename t_k2_treap >
k2_treap_ns::range_iterator< t_k2_treap > sdsl::range_3d (t_k2_treap const &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.
 
template<typename t_k2_treap >
uint64_t sdsl::__count (t_k2_treap const &, typename t_k2_treap::node_type)
 
template<typename t_k2_treap >
uint64_t sdsl::_count (t_k2_treap const &, 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 (t_k2_treap const &treap, k2_treap_ns::point_type p1, k2_treap_ns::point_type p2)
 Count how many points are in the rectangle (p1,p2)
 
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.
 
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.
 

Detailed Description

k2_treap_algorithm.hpp contains k^2-treap algorithms.

Author
Simon Gog

Definition in file k2_treap_algorithm.hpp.