#include <ftree.hpp>
Inherits pasl::data::ftree::ftree< Top_item_base, Chunk_capacity, Cached_measure, Top_item_deleter, Top_item_copier, Chunk_struct, Size_access >::node.
|
| | branch_node (node_p t0, node_p t1) |
| |
| | branch_node (node_p t0, node_p t1, node_p t2) |
| |
| | branch_node (const branch_node &other) |
| |
| int | nb_branches () const |
| |
| node_p | get_branch (int i) const |
| |
| measured_type | get_cached () const |
| |
| void | clear () |
| |
| template<class Body > |
| void | for_each (const Body &body) const |
| |
| template<class Pred > |
const ftree< Top_item_base,
Chunk_capacity, Cached_measure,
Top_item_deleter,
Top_item_copier, Chunk_struct,
Size_access >::leaf_node_type * | down (const node *t, const Pred &p, measured_type &prefix) |
| |
template<class Top_item_base, int Chunk_capacity, class Cached_measure, class Top_item_deleter = chunkedseq::Pointer_deleter, class Top_item_copier = chunkedseq::Pointer_deep_copier, template< class Item, int Capacity, class Item_alloc > class Chunk_struct = fixedcapacity::heap_allocated::ringbuffer_ptr, class Size_access = chunkedseq::itemsearch::no_size_access>
class pasl::data::ftree::ftree< Top_item_base, Chunk_capacity, Cached_measure, Top_item_deleter, Top_item_copier, Chunk_struct, Size_access >::branch_node
Definition at line 189 of file ftree.hpp.
template<class Top_item_base , int Chunk_capacity, class Cached_measure , class Top_item_deleter = chunkedseq::Pointer_deleter, class Top_item_copier = chunkedseq::Pointer_deep_copier, template< class Item, int Capacity, class Item_alloc > class Chunk_struct = fixedcapacity::heap_allocated::ringbuffer_ptr, class Size_access = chunkedseq::itemsearch::no_size_access>
| pasl::data::ftree::ftree< Top_item_base, Chunk_capacity, Cached_measure, Top_item_deleter, Top_item_copier, Chunk_struct, Size_access >::branch_node::branch_node |
( |
node_p |
t0, |
|
|
node_p |
t1 |
|
) |
| |
|
inline |
template<class Top_item_base , int Chunk_capacity, class Cached_measure , class Top_item_deleter = chunkedseq::Pointer_deleter, class Top_item_copier = chunkedseq::Pointer_deep_copier, template< class Item, int Capacity, class Item_alloc > class Chunk_struct = fixedcapacity::heap_allocated::ringbuffer_ptr, class Size_access = chunkedseq::itemsearch::no_size_access>
template<class Top_item_base , int Chunk_capacity, class Cached_measure , class Top_item_deleter = chunkedseq::Pointer_deleter, class Top_item_copier = chunkedseq::Pointer_deep_copier, template< class Item, int Capacity, class Item_alloc > class Chunk_struct = fixedcapacity::heap_allocated::ringbuffer_ptr, class Size_access = chunkedseq::itemsearch::no_size_access>
| pasl::data::ftree::ftree< Top_item_base, Chunk_capacity, Cached_measure, Top_item_deleter, Top_item_copier, Chunk_struct, Size_access >::branch_node::branch_node |
( |
const branch_node & |
other | ) |
|
|
inline |
template<class Top_item_base , int Chunk_capacity, class Cached_measure , class Top_item_deleter = chunkedseq::Pointer_deleter, class Top_item_copier = chunkedseq::Pointer_deep_copier, template< class Item, int Capacity, class Item_alloc > class Chunk_struct = fixedcapacity::heap_allocated::ringbuffer_ptr, class Size_access = chunkedseq::itemsearch::no_size_access>
| void pasl::data::ftree::ftree< Top_item_base, Chunk_capacity, Cached_measure, Top_item_deleter, Top_item_copier, Chunk_struct, Size_access >::branch_node::clear |
( |
| ) |
|
|
inlinevirtual |
template<class Top_item_base , int Chunk_capacity, class Cached_measure , class Top_item_deleter = chunkedseq::Pointer_deleter, class Top_item_copier = chunkedseq::Pointer_deep_copier, template< class Item, int Capacity, class Item_alloc > class Chunk_struct = fixedcapacity::heap_allocated::ringbuffer_ptr, class Size_access = chunkedseq::itemsearch::no_size_access>
template<class Body >
| void pasl::data::ftree::ftree< Top_item_base, Chunk_capacity, Cached_measure, Top_item_deleter, Top_item_copier, Chunk_struct, Size_access >::branch_node::for_each |
( |
const Body & |
body | ) |
const |
|
inline |
template<class Top_item_base , int Chunk_capacity, class Cached_measure , class Top_item_deleter = chunkedseq::Pointer_deleter, class Top_item_copier = chunkedseq::Pointer_deep_copier, template< class Item, int Capacity, class Item_alloc > class Chunk_struct = fixedcapacity::heap_allocated::ringbuffer_ptr, class Size_access = chunkedseq::itemsearch::no_size_access>
| node_p pasl::data::ftree::ftree< Top_item_base, Chunk_capacity, Cached_measure, Top_item_deleter, Top_item_copier, Chunk_struct, Size_access >::branch_node::get_branch |
( |
int |
i | ) |
const |
|
inline |
template<class Top_item_base , int Chunk_capacity, class Cached_measure , class Top_item_deleter = chunkedseq::Pointer_deleter, class Top_item_copier = chunkedseq::Pointer_deep_copier, template< class Item, int Capacity, class Item_alloc > class Chunk_struct = fixedcapacity::heap_allocated::ringbuffer_ptr, class Size_access = chunkedseq::itemsearch::no_size_access>
template<class Top_item_base , int Chunk_capacity, class Cached_measure , class Top_item_deleter = chunkedseq::Pointer_deleter, class Top_item_copier = chunkedseq::Pointer_deep_copier, template< class Item, int Capacity, class Item_alloc > class Chunk_struct = fixedcapacity::heap_allocated::ringbuffer_ptr, class Size_access = chunkedseq::itemsearch::no_size_access>
| int pasl::data::ftree::ftree< Top_item_base, Chunk_capacity, Cached_measure, Top_item_deleter, Top_item_copier, Chunk_struct, Size_access >::branch_node::nb_branches |
( |
| ) |
const |
|
inline |
template<class Top_item_base , int Chunk_capacity, class Cached_measure , class Top_item_deleter = chunkedseq::Pointer_deleter, class Top_item_copier = chunkedseq::Pointer_deep_copier, template< class Item, int Capacity, class Item_alloc > class Chunk_struct = fixedcapacity::heap_allocated::ringbuffer_ptr, class Size_access = chunkedseq::itemsearch::no_size_access>
The documentation for this class was generated from the following file: