SDSL 3.0.1
Succinct Data Structure Library
|
Classes | |
struct | node_type |
struct | precomp |
struct | precomp< 16 > |
struct | precomp< 2 > |
struct | precomp< 4 > |
struct | precomp< 8 > |
class | range_iterator |
class | top_k_iterator |
Typedefs | |
typedef std::complex< uint64_t > | t_p |
typedef t_p | point_type |
typedef t_p | range_type |
Functions | |
bool | contained (const point_type p, const point_type &p1, const point_type &p2) |
Check if point x is contained in the rectangle (p1,p2) | |
template<uint8_t t_k> | |
bool | 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) | |
template<uint8_t t_k> | |
bool | 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. | |
typedef t_p sdsl::k2_treap_ns::point_type |
Definition at line 94 of file k2_treap_helper.hpp.
typedef t_p sdsl::k2_treap_ns::range_type |
Definition at line 95 of file k2_treap_helper.hpp.
typedef std::complex<uint64_t> sdsl::k2_treap_ns::t_p |
Definition at line 93 of file k2_treap_helper.hpp.
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)
Definition at line 43 of file k2_treap_algorithm.hpp.
|
inline |
Check if point x is contained in the rectangle (p1,p2)
p | Point. |
Lower | left corner of the rectangle. |
Upper | right corner of the rectangle. |
Definition at line 36 of file k2_treap_algorithm.hpp.
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.
Definition at line 53 of file k2_treap_algorithm.hpp.