chunkedseq
container library for large in-memory data sets
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Modules Pages
Classes | Public Types | Public Member Functions | Static Public Member Functions | Public Attributes | List of all members
pasl::data::ftree::ftree< Top_item_base, Chunk_capacity, Cached_measure, Top_item_deleter, Top_item_copier, Chunk_struct, Size_access > Class Template Reference

#include <ftree.hpp>

Classes

class  branch_node
 
class  digit
 
class  leaf_node
 
class  node
 
struct  split_rec_type
 
struct  split_type
 

Public Types

using cache_type = Cached_measure
 
using measured_type = typename cache_type::measured_type
 
using algebra_type = typename cache_type::algebra_type
 
using measure_type = typename cache_type::measure_type
 
using node_p = node *
 
using leaf_node_p = leaf_node *
 
using ftree_p = ftree *
 
using branch_node_p = branch_node *
 
using size_type = size_t
 
using leaf_node_type = leaf_node
 
using leaf_item_type = Top_item_base *
 

Public Member Functions

bool single () const
 
bool deep () const
 
void refresh_cache ()
 
void initialize ()
 
ftree_p take_middle ()
 
void make_deep_copy (const ftree &other)
 
 ftree (digit fr, ftree_p middle, digit bk)
 
 ftree (digit d)
 
bool empty () const
 
node_p _back () const
 
node_p _front () const
 
void _push_back (node_p x)
 
void _push_front (node_p x)
 
void _pop_back ()
 
void _pop_front ()
 
void _push_back (digit d)
 
void _push_front (digit d)
 
bool is_front (const digit *d) const
 
bool is_back (const digit *d) const
 
leaf_node_type * __back () const
 
leaf_node_type * __front () const
 
template<class Body >
void _for_each (const Body &body) const
 
void ___push_back (leaf_node_type *x)
 
void ___push_front (leaf_node_type *x)
 
void ___pop_back ()
 
void ___pop_front ()
 
 ftree ()
 
 ftree (const ftree &other)
 
 ~ftree ()
 
measured_type get_cached () const
 

Static Public Member Functions

static node * make_deep_copy_tree (node *n)
 
template<class Body >
static void node_for_each (const Body &body, const node *n)
 
static ftree_p app3 (ftree_p fr, digit m, ftree_p bk)
 
template<typename Pred >
static split_rec_type split_rec (const Pred &p, measured_type i, ftree_p f)
 
template<class Pred >
static const digit * down (const ftree *ft, const Pred &p, measured_type &prefix)
 
template<class Pred >
static const leaf_node * search_aux (const Pred &p, const ftree *start, measured_type &prefix)
 
template<typename Pred >
static split_type split_aux (const Pred &p, measured_type prefix, ftree *f)
 
static ftree * concatenate (ftree *fr, ftree *bk)
 

Public Attributes

measured_type cached
 
digit fr
 
ftree_p middle
 
digit bk
 

Detailed Description

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 >

Definition at line 38 of file ftree.hpp.

Member Typedef Documentation

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>
using pasl::data::ftree::ftree< Top_item_base, Chunk_capacity, Cached_measure, Top_item_deleter, Top_item_copier, Chunk_struct, Size_access >::algebra_type = typename cache_type::algebra_type

Definition at line 43 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>
using pasl::data::ftree::ftree< Top_item_base, Chunk_capacity, Cached_measure, Top_item_deleter, Top_item_copier, Chunk_struct, Size_access >::branch_node_p = branch_node*

Definition at line 61 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>
using pasl::data::ftree::ftree< Top_item_base, Chunk_capacity, Cached_measure, Top_item_deleter, Top_item_copier, Chunk_struct, Size_access >::cache_type = Cached_measure

Definition at line 41 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>
using pasl::data::ftree::ftree< Top_item_base, Chunk_capacity, Cached_measure, Top_item_deleter, Top_item_copier, Chunk_struct, Size_access >::ftree_p = ftree*

Definition at line 60 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>
using pasl::data::ftree::ftree< Top_item_base, Chunk_capacity, Cached_measure, Top_item_deleter, Top_item_copier, Chunk_struct, Size_access >::leaf_item_type = Top_item_base*

Definition at line 65 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>
using pasl::data::ftree::ftree< Top_item_base, Chunk_capacity, Cached_measure, Top_item_deleter, Top_item_copier, Chunk_struct, Size_access >::leaf_node_p = leaf_node*

Definition at line 59 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>
using pasl::data::ftree::ftree< Top_item_base, Chunk_capacity, Cached_measure, Top_item_deleter, Top_item_copier, Chunk_struct, Size_access >::leaf_node_type = leaf_node

Definition at line 64 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>
using pasl::data::ftree::ftree< Top_item_base, Chunk_capacity, Cached_measure, Top_item_deleter, Top_item_copier, Chunk_struct, Size_access >::measure_type = typename cache_type::measure_type

Definition at line 44 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>
using pasl::data::ftree::ftree< Top_item_base, Chunk_capacity, Cached_measure, Top_item_deleter, Top_item_copier, Chunk_struct, Size_access >::measured_type = typename cache_type::measured_type

Definition at line 42 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>
using pasl::data::ftree::ftree< Top_item_base, Chunk_capacity, Cached_measure, Top_item_deleter, Top_item_copier, Chunk_struct, Size_access >::node_p = node*

Definition at line 58 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>
using pasl::data::ftree::ftree< Top_item_base, Chunk_capacity, Cached_measure, Top_item_deleter, Top_item_copier, Chunk_struct, Size_access >::size_type = size_t

Definition at line 63 of file ftree.hpp.

Constructor & Destructor Documentation

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 >::ftree ( digit  fr,
ftree_p  middle,
digit  bk 
)
inline

Definition at line 528 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 >::ftree ( digit  d)
inline

Definition at line 533 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 >::ftree ( )
inline

Definition at line 874 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 >::ftree ( const ftree< Top_item_base, Chunk_capacity, Cached_measure, Top_item_deleter, Top_item_copier, Chunk_struct, Size_access > &  other)
inline

Definition at line 879 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 >::~ftree ( )
inline

Definition at line 883 of file ftree.hpp.

Member Function Documentation

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 >::___pop_back ( )
inline

Definition at line 837 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>
void pasl::data::ftree::ftree< Top_item_base, Chunk_capacity, Cached_measure, Top_item_deleter, Top_item_copier, Chunk_struct, Size_access >::___pop_front ( )
inline

Definition at line 843 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>
void pasl::data::ftree::ftree< Top_item_base, Chunk_capacity, Cached_measure, Top_item_deleter, Top_item_copier, Chunk_struct, Size_access >::___push_back ( leaf_node_type *  x)
inline

Definition at line 829 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>
void pasl::data::ftree::ftree< Top_item_base, Chunk_capacity, Cached_measure, Top_item_deleter, Top_item_copier, Chunk_struct, Size_access >::___push_front ( leaf_node_type *  x)
inline

Definition at line 833 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>
leaf_node_type* pasl::data::ftree::ftree< Top_item_base, Chunk_capacity, Cached_measure, Top_item_deleter, Top_item_copier, Chunk_struct, Size_access >::__back ( ) const
inline

Definition at line 808 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>
leaf_node_type* pasl::data::ftree::ftree< Top_item_base, Chunk_capacity, Cached_measure, Top_item_deleter, Top_item_copier, Chunk_struct, Size_access >::__front ( ) const
inline

Definition at line 812 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>
node_p pasl::data::ftree::ftree< Top_item_base, Chunk_capacity, Cached_measure, Top_item_deleter, Top_item_copier, Chunk_struct, Size_access >::_back ( ) const
inline

Definition at line 564 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>
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 >::_for_each ( const Body &  body) const
inline

Definition at line 817 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>
node_p pasl::data::ftree::ftree< Top_item_base, Chunk_capacity, Cached_measure, Top_item_deleter, Top_item_copier, Chunk_struct, Size_access >::_front ( ) const
inline

Definition at line 571 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>
void pasl::data::ftree::ftree< Top_item_base, Chunk_capacity, Cached_measure, Top_item_deleter, Top_item_copier, Chunk_struct, Size_access >::_pop_back ( )
inline

Definition at line 618 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>
void pasl::data::ftree::ftree< Top_item_base, Chunk_capacity, Cached_measure, Top_item_deleter, Top_item_copier, Chunk_struct, Size_access >::_pop_front ( )
inline

Definition at line 648 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>
void pasl::data::ftree::ftree< Top_item_base, Chunk_capacity, Cached_measure, Top_item_deleter, Top_item_copier, Chunk_struct, Size_access >::_push_back ( node_p  x)
inline

Definition at line 576 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>
void pasl::data::ftree::ftree< Top_item_base, Chunk_capacity, Cached_measure, Top_item_deleter, Top_item_copier, Chunk_struct, Size_access >::_push_back ( digit  d)
inline

Definition at line 675 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>
void pasl::data::ftree::ftree< Top_item_base, Chunk_capacity, Cached_measure, Top_item_deleter, Top_item_copier, Chunk_struct, Size_access >::_push_front ( node_p  x)
inline

Definition at line 595 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>
void pasl::data::ftree::ftree< Top_item_base, Chunk_capacity, Cached_measure, Top_item_deleter, Top_item_copier, Chunk_struct, Size_access >::_push_front ( digit  d)
inline

Definition at line 680 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>
static ftree_p pasl::data::ftree::ftree< Top_item_base, Chunk_capacity, Cached_measure, Top_item_deleter, Top_item_copier, Chunk_struct, Size_access >::app3 ( ftree_p  fr,
digit  m,
ftree_p  bk 
)
inlinestatic

Definition at line 685 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>
static ftree* pasl::data::ftree::ftree< Top_item_base, Chunk_capacity, Cached_measure, Top_item_deleter, Top_item_copier, Chunk_struct, Size_access >::concatenate ( ftree< Top_item_base, Chunk_capacity, Cached_measure, Top_item_deleter, Top_item_copier, Chunk_struct, Size_access > *  fr,
ftree< Top_item_base, Chunk_capacity, Cached_measure, Top_item_deleter, Top_item_copier, Chunk_struct, Size_access > *  bk 
)
inlinestatic

Definition at line 865 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>
bool pasl::data::ftree::ftree< Top_item_base, Chunk_capacity, Cached_measure, Top_item_deleter, Top_item_copier, Chunk_struct, Size_access >::deep ( ) const
inline

Definition at line 497 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>
template<class Pred >
static const digit* pasl::data::ftree::ftree< Top_item_base, Chunk_capacity, Cached_measure, Top_item_deleter, Top_item_copier, Chunk_struct, Size_access >::down ( const ftree< Top_item_base, Chunk_capacity, Cached_measure, Top_item_deleter, Top_item_copier, Chunk_struct, Size_access > *  ft,
const Pred &  p,
measured_type &  prefix 
)
inlinestatic

Definition at line 787 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>
bool pasl::data::ftree::ftree< Top_item_base, Chunk_capacity, Cached_measure, Top_item_deleter, Top_item_copier, Chunk_struct, Size_access >::empty ( ) const
inline

Definition at line 560 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>
measured_type pasl::data::ftree::ftree< Top_item_base, Chunk_capacity, Cached_measure, Top_item_deleter, Top_item_copier, Chunk_struct, Size_access >::get_cached ( ) const
inline

Definition at line 888 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>
void pasl::data::ftree::ftree< Top_item_base, Chunk_capacity, Cached_measure, Top_item_deleter, Top_item_copier, Chunk_struct, Size_access >::initialize ( )
inline

Definition at line 509 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>
bool pasl::data::ftree::ftree< Top_item_base, Chunk_capacity, Cached_measure, Top_item_deleter, Top_item_copier, Chunk_struct, Size_access >::is_back ( const digit *  d) const
inline

Definition at line 721 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>
bool pasl::data::ftree::ftree< Top_item_base, Chunk_capacity, Cached_measure, Top_item_deleter, Top_item_copier, Chunk_struct, Size_access >::is_front ( const digit *  d) const
inline

Definition at line 717 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>
void pasl::data::ftree::ftree< Top_item_base, Chunk_capacity, Cached_measure, Top_item_deleter, Top_item_copier, Chunk_struct, Size_access >::make_deep_copy ( const ftree< Top_item_base, Chunk_capacity, Cached_measure, Top_item_deleter, Top_item_copier, Chunk_struct, Size_access > &  other)
inline

Definition at line 519 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>
static node* pasl::data::ftree::ftree< Top_item_base, Chunk_capacity, Cached_measure, Top_item_deleter, Top_item_copier, Chunk_struct, Size_access >::make_deep_copy_tree ( node *  n)
inlinestatic

Definition at line 272 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>
template<class Body >
static void pasl::data::ftree::ftree< Top_item_base, Chunk_capacity, Cached_measure, Top_item_deleter, Top_item_copier, Chunk_struct, Size_access >::node_for_each ( const Body &  body,
const node *  n 
)
inlinestatic

Definition at line 284 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>
void pasl::data::ftree::ftree< Top_item_base, Chunk_capacity, Cached_measure, Top_item_deleter, Top_item_copier, Chunk_struct, Size_access >::refresh_cache ( )
inline

Definition at line 501 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>
template<class Pred >
static const leaf_node* pasl::data::ftree::ftree< Top_item_base, Chunk_capacity, Cached_measure, Top_item_deleter, Top_item_copier, Chunk_struct, Size_access >::search_aux ( const Pred &  p,
const ftree< Top_item_base, Chunk_capacity, Cached_measure, Top_item_deleter, Top_item_copier, Chunk_struct, Size_access > *  start,
measured_type &  prefix 
)
inlinestatic

Definition at line 850 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>
bool pasl::data::ftree::ftree< Top_item_base, Chunk_capacity, Cached_measure, Top_item_deleter, Top_item_copier, Chunk_struct, Size_access >::single ( ) const
inline

Definition at line 493 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>
template<typename Pred >
static split_type pasl::data::ftree::ftree< Top_item_base, Chunk_capacity, Cached_measure, Top_item_deleter, Top_item_copier, Chunk_struct, Size_access >::split_aux ( const Pred &  p,
measured_type  prefix,
ftree< Top_item_base, Chunk_capacity, Cached_measure, Top_item_deleter, Top_item_copier, Chunk_struct, Size_access > *  f 
)
inlinestatic

Definition at line 858 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>
template<typename Pred >
static split_rec_type pasl::data::ftree::ftree< Top_item_base, Chunk_capacity, Cached_measure, Top_item_deleter, Top_item_copier, Chunk_struct, Size_access >::split_rec ( const Pred &  p,
measured_type  i,
ftree_p  f 
)
inlinestatic

Definition at line 732 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>
ftree_p pasl::data::ftree::ftree< Top_item_base, Chunk_capacity, Cached_measure, Top_item_deleter, Top_item_copier, Chunk_struct, Size_access >::take_middle ( )
inline

Definition at line 513 of file ftree.hpp.

Member Data Documentation

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>
digit pasl::data::ftree::ftree< Top_item_base, Chunk_capacity, Cached_measure, Top_item_deleter, Top_item_copier, Chunk_struct, Size_access >::bk

Definition at line 491 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>
measured_type pasl::data::ftree::ftree< Top_item_base, Chunk_capacity, Cached_measure, Top_item_deleter, Top_item_copier, Chunk_struct, Size_access >::cached

Definition at line 488 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>
digit pasl::data::ftree::ftree< Top_item_base, Chunk_capacity, Cached_measure, Top_item_deleter, Top_item_copier, Chunk_struct, Size_access >::fr

Definition at line 489 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>
ftree_p pasl::data::ftree::ftree< Top_item_base, Chunk_capacity, Cached_measure, Top_item_deleter, Top_item_copier, Chunk_struct, Size_access >::middle

Definition at line 490 of file ftree.hpp.

The documentation for this class was generated from the following file:
Generated on Mon Mar 9 2015 22:07:09 for chunkedseq by   doxygen 1.8.8