| add_entry(Entry entry) | Aleph::RTree< Payload, MaxEntries, MinEntries, Variant > | inlineprivate |
| box_contains_box(const Rectangle &outer, const Rectangle &inner) | Aleph::RTree< Payload, MaxEntries, MinEntries, Variant > | inlineprivatestatic |
| choose_subtree(const Node &node, const Rectangle &bbox) | Aleph::RTree< Payload, MaxEntries, MinEntries, Variant > | inlineprivatestatic |
| clear() noexcept | Aleph::RTree< Payload, MaxEntries, MinEntries, Variant > | inline |
| clear_rstar_reinsert_state() noexcept | Aleph::RTree< Payload, MaxEntries, MinEntries, Variant > | inlineprivate |
| clone_node(const Node &node) | Aleph::RTree< Payload, MaxEntries, MinEntries, Variant > | inlineprivatestatic |
| collect_data_entries(Node &node, Array< Entry > &out) | Aleph::RTree< Payload, MaxEntries, MinEntries, Variant > | inlineprivatestatic |
| compute_mbr(const Node &node) | Aleph::RTree< Payload, MaxEntries, MinEntries, Variant > | inlineprivatestatic |
| data_entry_count(const Node &node) | Aleph::RTree< Payload, MaxEntries, MinEntries, Variant > | inlineprivatestatic |
| debug_snapshot() const | Aleph::RTree< Payload, MaxEntries, MinEntries, Variant > | inline |
| enlargement(const Rectangle &base, const Rectangle &added) | Aleph::RTree< Payload, MaxEntries, MinEntries, Variant > | inlineprivatestatic |
| entry_count(const Node &node) | Aleph::RTree< Payload, MaxEntries, MinEntries, Variant > | inlineprivatestatic |
| erase(const Rectangle &bbox, const Payload &value) | Aleph::RTree< Payload, MaxEntries, MinEntries, Variant > | inline |
| erase_descend(Node &node, const Rectangle &bbox, const Payload &value, Array< Entry > &orphans, bool &removed) | Aleph::RTree< Payload, MaxEntries, MinEntries, Variant > | inlineprivate |
| for_each_containing_rec(const Node &node, const Point &p, F &f) const | Aleph::RTree< Payload, MaxEntries, MinEntries, Variant > | inlineprivate |
| for_each_intersecting(const Rectangle &rect, F &&f) const | Aleph::RTree< Payload, MaxEntries, MinEntries, Variant > | inline |
| for_each_intersecting_rec(const Node &node, const Rectangle &rect, F &f) const | Aleph::RTree< Payload, MaxEntries, MinEntries, Variant > | inlineprivate |
| height() const noexcept | Aleph::RTree< Payload, MaxEntries, MinEntries, Variant > | inline |
| height_ | Aleph::RTree< Payload, MaxEntries, MinEntries, Variant > | private |
| insert(const Rectangle &bbox, const Payload &value) | Aleph::RTree< Payload, MaxEntries, MinEntries, Variant > | inline |
| insert(const Rectangle &bbox, Payload &&value) | Aleph::RTree< Payload, MaxEntries, MinEntries, Variant > | inline |
| insert_descend(Node &node, Entry entry) | Aleph::RTree< Payload, MaxEntries, MinEntries, Variant > | inlineprivate |
| insert_one(Entry entry) | Aleph::RTree< Payload, MaxEntries, MinEntries, Variant > | inlineprivate |
| is_empty() const noexcept | Aleph::RTree< Payload, MaxEntries, MinEntries, Variant > | inline |
| operator=(RTree &&other) noexcept | Aleph::RTree< Payload, MaxEntries, MinEntries, Variant > | inline |
| operator=(const RTree &other) | Aleph::RTree< Payload, MaxEntries, MinEntries, Variant > | inline |
| overlap_area(const Rectangle &a, const Rectangle &b) | Aleph::RTree< Payload, MaxEntries, MinEntries, Variant > | inlineprivatestatic |
| quadratic_split(Array< EntryT > &entries) | Aleph::RTree< Payload, MaxEntries, MinEntries, Variant > | inlineprivatestatic |
| reinsert_farthest(Node &node) | Aleph::RTree< Payload, MaxEntries, MinEntries, Variant > | inlineprivate |
| root_ | Aleph::RTree< Payload, MaxEntries, MinEntries, Variant > | private |
| rstar_choose_overlap(const Node &node, const Rectangle &bbox) | Aleph::RTree< Payload, MaxEntries, MinEntries, Variant > | inlineprivatestatic |
| rstar_reinsert_available_ | Aleph::RTree< Payload, MaxEntries, MinEntries, Variant > | private |
| rstar_reinsert_buffer_ | Aleph::RTree< Payload, MaxEntries, MinEntries, Variant > | private |
| rstar_split(Array< EntryT > &entries) | Aleph::RTree< Payload, MaxEntries, MinEntries, Variant > | inlineprivatestatic |
| RTree() noexcept=default | Aleph::RTree< Payload, MaxEntries, MinEntries, Variant > | |
| RTree(RTree &&other) noexcept | Aleph::RTree< Payload, MaxEntries, MinEntries, Variant > | inline |
| RTree(const RTree &other) | Aleph::RTree< Payload, MaxEntries, MinEntries, Variant > | inline |
| search_contains(const Point &p) const | Aleph::RTree< Payload, MaxEntries, MinEntries, Variant > | inline |
| search_intersects(const Rectangle &rect) const | Aleph::RTree< Payload, MaxEntries, MinEntries, Variant > | inline |
| size() const noexcept | Aleph::RTree< Payload, MaxEntries, MinEntries, Variant > | inline |
| size_ | Aleph::RTree< Payload, MaxEntries, MinEntries, Variant > | private |
| split_entries(Array< EntryT > &entries) | Aleph::RTree< Payload, MaxEntries, MinEntries, Variant > | inlineprivatestatic |
| union_bbox(const Rectangle &a, const Rectangle &b) | Aleph::RTree< Payload, MaxEntries, MinEntries, Variant > | inlineprivatestatic |
| verify() const | Aleph::RTree< Payload, MaxEntries, MinEntries, Variant > | inline |
| verify_rec(const Node &node, const size_t depth, const bool is_root, size_t &leaf_depth, size_t &count, Rectangle &out_mbr) const | Aleph::RTree< Payload, MaxEntries, MinEntries, Variant > | inlineprivate |
1.9.8