|
| cdeque () |
|
| ~cdeque () |
|
| cdeque (const self_type &other) |
|
void | swap (self_type &other) |
|
bool | empty () const |
|
measured_type | get_cached () const |
|
void | push_front (const top_measure_type &top_meas, const value_type &x) |
|
void | push_back (const top_measure_type &top_meas, const value_type &x) |
|
value_type | front () const |
|
value_type | back () const |
|
value_type | cback () const |
|
value_type | pop_front (const top_measure_type &) |
|
value_type | pop_back (const top_measure_type &) |
|
void | concat (const top_measure_type &, self_type &other) |
|
template<class Pred > |
measured_type | search_for_chunk (const Pred &p, measured_type prefix, const Top_item_base *&c) const |
|
template<class Pred > |
measured_type | split (const top_measure_type &, const Pred &p, measured_type prefix, value_type &x, self_type &other) |
|
template<class Pred > |
measured_type | split (const top_measure_type &meas, const Pred &p, measured_type prefix, self_type &other) |
|
template<class Body > |
void | for_each (const Body &f) const |
|
measure_type | get_measure () const |
|
void | push_front (const value_type &x, measured_type w) |
|
void | push_back (const value_type &x, measured_type w) |
|
value_type | pop_front () |
|
value_type | pop_back () |
|
void | concat (self_type &other) |
|
void | split (size_type n, self_type &other) |
|
void | check () |
|
template<class ItemPrinter > |
void | print () |
|
template<class Add_edge , class Process_chunk > |
void | reveal_internal_structure (const Add_edge &add_edge, const Process_chunk &process_chunk) const |
|
template<class Top_item_base, int Chunk_capacity = 32, class Cached_measure = cachedmeasure::trivial<Top_item_base*, size_t>, class Top_item_deleter = Pointer_deleter, class Top_item_copier = Pointer_deep_copier, template< class Item, int Capacity, class Item_alloc > class Chunk_struct = fixedcapacity::heap_allocated::ringbuffer_ptr, class Size_access = itemsearch::no_size_access>
class pasl::data::chunkedseq::bootchunkedseq::cdeque< Top_item_base, Chunk_capacity, Cached_measure, Top_item_deleter, Top_item_copier, Chunk_struct, Size_access >
Definition at line 67 of file bootchunkedseq.hpp.
template<class Top_item_base, int Chunk_capacity = 32, class Cached_measure = cachedmeasure::trivial<Top_item_base*, size_t>, class Top_item_deleter = Pointer_deleter, class Top_item_copier = Pointer_deep_copier, template< class Item, int Capacity, class Item_alloc > class Chunk_struct = fixedcapacity::heap_allocated::ringbuffer_ptr, class Size_access = itemsearch::no_size_access>
template<class Top_item_base, int Chunk_capacity = 32, class Cached_measure = cachedmeasure::trivial<Top_item_base*, size_t>, class Top_item_deleter = Pointer_deleter, class Top_item_copier = Pointer_deep_copier, template< class Item, int Capacity, class Item_alloc > class Chunk_struct = fixedcapacity::heap_allocated::ringbuffer_ptr, class Size_access = itemsearch::no_size_access>
template<class Top_item_base, int Chunk_capacity = 32, class Cached_measure = cachedmeasure::trivial<Top_item_base*, size_t>, class Top_item_deleter = Pointer_deleter, class Top_item_copier = Pointer_deep_copier, template< class Item, int Capacity, class Item_alloc > class Chunk_struct = fixedcapacity::heap_allocated::ringbuffer_ptr, class Size_access = itemsearch::no_size_access>
template<class Top_item_base, int Chunk_capacity = 32, class Cached_measure = cachedmeasure::trivial<Top_item_base*, size_t>, class Top_item_deleter = Pointer_deleter, class Top_item_copier = Pointer_deep_copier, template< class Item, int Capacity, class Item_alloc > class Chunk_struct = fixedcapacity::heap_allocated::ringbuffer_ptr, class Size_access = itemsearch::no_size_access>
template<class Top_item_base, int Chunk_capacity = 32, class Cached_measure = cachedmeasure::trivial<Top_item_base*, size_t>, class Top_item_deleter = Pointer_deleter, class Top_item_copier = Pointer_deep_copier, template< class Item, int Capacity, class Item_alloc > class Chunk_struct = fixedcapacity::heap_allocated::ringbuffer_ptr, class Size_access = itemsearch::no_size_access>
template<class Top_item_base, int Chunk_capacity = 32, class Cached_measure = cachedmeasure::trivial<Top_item_base*, size_t>, class Top_item_deleter = Pointer_deleter, class Top_item_copier = Pointer_deep_copier, template< class Item, int Capacity, class Item_alloc > class Chunk_struct = fixedcapacity::heap_allocated::ringbuffer_ptr, class Size_access = itemsearch::no_size_access>
template<class Top_item_base, int Chunk_capacity = 32, class Cached_measure = cachedmeasure::trivial<Top_item_base*, size_t>, class Top_item_deleter = Pointer_deleter, class Top_item_copier = Pointer_deep_copier, template< class Item, int Capacity, class Item_alloc > class Chunk_struct = fixedcapacity::heap_allocated::ringbuffer_ptr, class Size_access = itemsearch::no_size_access>
template<class Top_item_base, int Chunk_capacity = 32, class Cached_measure = cachedmeasure::trivial<Top_item_base*, size_t>, class Top_item_deleter = Pointer_deleter, class Top_item_copier = Pointer_deep_copier, template< class Item, int Capacity, class Item_alloc > class Chunk_struct = fixedcapacity::heap_allocated::ringbuffer_ptr, class Size_access = itemsearch::no_size_access>
template<class Top_item_base, int Chunk_capacity = 32, class Cached_measure = cachedmeasure::trivial<Top_item_base*, size_t>, class Top_item_deleter = Pointer_deleter, class Top_item_copier = Pointer_deep_copier, template< class Item, int Capacity, class Item_alloc > class Chunk_struct = fixedcapacity::heap_allocated::ringbuffer_ptr, class Size_access = itemsearch::no_size_access>
template<class Top_item_base, int Chunk_capacity = 32, class Cached_measure = cachedmeasure::trivial<Top_item_base*, size_t>, class Top_item_deleter = Pointer_deleter, class Top_item_copier = Pointer_deep_copier, template< class Item, int Capacity, class Item_alloc > class Chunk_struct = fixedcapacity::heap_allocated::ringbuffer_ptr, class Size_access = itemsearch::no_size_access>
template<class Top_item_base, int Chunk_capacity = 32, class Cached_measure = cachedmeasure::trivial<Top_item_base*, size_t>, class Top_item_deleter = Pointer_deleter, class Top_item_copier = Pointer_deep_copier, template< class Item, int Capacity, class Item_alloc > class Chunk_struct = fixedcapacity::heap_allocated::ringbuffer_ptr, class Size_access = itemsearch::no_size_access>
template<class Top_item_base, int Chunk_capacity = 32, class Cached_measure = cachedmeasure::trivial<Top_item_base*, size_t>, class Top_item_deleter = Pointer_deleter, class Top_item_copier = Pointer_deep_copier, template< class Item, int Capacity, class Item_alloc > class Chunk_struct = fixedcapacity::heap_allocated::ringbuffer_ptr, class Size_access = itemsearch::no_size_access>
template<class Top_item_base, int Chunk_capacity = 32, class Cached_measure = cachedmeasure::trivial<Top_item_base*, size_t>, class Top_item_deleter = Pointer_deleter, class Top_item_copier = Pointer_deep_copier, template< class Item, int Capacity, class Item_alloc > class Chunk_struct = fixedcapacity::heap_allocated::ringbuffer_ptr, class Size_access = itemsearch::no_size_access>
template<class Top_item_base, int Chunk_capacity = 32, class Cached_measure = cachedmeasure::trivial<Top_item_base*, size_t>, class Top_item_deleter = Pointer_deleter, class Top_item_copier = Pointer_deep_copier, template< class Item, int Capacity, class Item_alloc > class Chunk_struct = fixedcapacity::heap_allocated::ringbuffer_ptr, class Size_access = itemsearch::no_size_access>
template<class Top_item_base, int Chunk_capacity = 32, class Cached_measure = cachedmeasure::trivial<Top_item_base*, size_t>, class Top_item_deleter = Pointer_deleter, class Top_item_copier = Pointer_deep_copier, template< class Item, int Capacity, class Item_alloc > class Chunk_struct = fixedcapacity::heap_allocated::ringbuffer_ptr, class Size_access = itemsearch::no_size_access>
template<class Top_item_base, int Chunk_capacity = 32, class Cached_measure = cachedmeasure::trivial<Top_item_base*, size_t>, class Top_item_deleter = Pointer_deleter, class Top_item_copier = Pointer_deep_copier, template< class Item, int Capacity, class Item_alloc > class Chunk_struct = fixedcapacity::heap_allocated::ringbuffer_ptr, class Size_access = itemsearch::no_size_access>
template<class Body >
template<class Top_item_base, int Chunk_capacity = 32, class Cached_measure = cachedmeasure::trivial<Top_item_base*, size_t>, class Top_item_deleter = Pointer_deleter, class Top_item_copier = Pointer_deep_copier, template< class Item, int Capacity, class Item_alloc > class Chunk_struct = fixedcapacity::heap_allocated::ringbuffer_ptr, class Size_access = itemsearch::no_size_access>
template<class Top_item_base, int Chunk_capacity = 32, class Cached_measure = cachedmeasure::trivial<Top_item_base*, size_t>, class Top_item_deleter = Pointer_deleter, class Top_item_copier = Pointer_deep_copier, template< class Item, int Capacity, class Item_alloc > class Chunk_struct = fixedcapacity::heap_allocated::ringbuffer_ptr, class Size_access = itemsearch::no_size_access>
template<class Top_item_base, int Chunk_capacity = 32, class Cached_measure = cachedmeasure::trivial<Top_item_base*, size_t>, class Top_item_deleter = Pointer_deleter, class Top_item_copier = Pointer_deep_copier, template< class Item, int Capacity, class Item_alloc > class Chunk_struct = fixedcapacity::heap_allocated::ringbuffer_ptr, class Size_access = itemsearch::no_size_access>
template<class Top_item_base, int Chunk_capacity = 32, class Cached_measure = cachedmeasure::trivial<Top_item_base*, size_t>, class Top_item_deleter = Pointer_deleter, class Top_item_copier = Pointer_deep_copier, template< class Item, int Capacity, class Item_alloc > class Chunk_struct = fixedcapacity::heap_allocated::ringbuffer_ptr, class Size_access = itemsearch::no_size_access>
template<class Top_item_base, int Chunk_capacity = 32, class Cached_measure = cachedmeasure::trivial<Top_item_base*, size_t>, class Top_item_deleter = Pointer_deleter, class Top_item_copier = Pointer_deep_copier, template< class Item, int Capacity, class Item_alloc > class Chunk_struct = fixedcapacity::heap_allocated::ringbuffer_ptr, class Size_access = itemsearch::no_size_access>
template<class Top_item_base, int Chunk_capacity = 32, class Cached_measure = cachedmeasure::trivial<Top_item_base*, size_t>, class Top_item_deleter = Pointer_deleter, class Top_item_copier = Pointer_deep_copier, template< class Item, int Capacity, class Item_alloc > class Chunk_struct = fixedcapacity::heap_allocated::ringbuffer_ptr, class Size_access = itemsearch::no_size_access>
template<class Top_item_base, int Chunk_capacity = 32, class Cached_measure = cachedmeasure::trivial<Top_item_base*, size_t>, class Top_item_deleter = Pointer_deleter, class Top_item_copier = Pointer_deep_copier, template< class Item, int Capacity, class Item_alloc > class Chunk_struct = fixedcapacity::heap_allocated::ringbuffer_ptr, class Size_access = itemsearch::no_size_access>
template<class Top_item_base, int Chunk_capacity = 32, class Cached_measure = cachedmeasure::trivial<Top_item_base*, size_t>, class Top_item_deleter = Pointer_deleter, class Top_item_copier = Pointer_deep_copier, template< class Item, int Capacity, class Item_alloc > class Chunk_struct = fixedcapacity::heap_allocated::ringbuffer_ptr, class Size_access = itemsearch::no_size_access>
template<class ItemPrinter >
template<class Top_item_base, int Chunk_capacity = 32, class Cached_measure = cachedmeasure::trivial<Top_item_base*, size_t>, class Top_item_deleter = Pointer_deleter, class Top_item_copier = Pointer_deep_copier, template< class Item, int Capacity, class Item_alloc > class Chunk_struct = fixedcapacity::heap_allocated::ringbuffer_ptr, class Size_access = itemsearch::no_size_access>
template<class Top_item_base, int Chunk_capacity = 32, class Cached_measure = cachedmeasure::trivial<Top_item_base*, size_t>, class Top_item_deleter = Pointer_deleter, class Top_item_copier = Pointer_deep_copier, template< class Item, int Capacity, class Item_alloc > class Chunk_struct = fixedcapacity::heap_allocated::ringbuffer_ptr, class Size_access = itemsearch::no_size_access>
template<class Top_item_base, int Chunk_capacity = 32, class Cached_measure = cachedmeasure::trivial<Top_item_base*, size_t>, class Top_item_deleter = Pointer_deleter, class Top_item_copier = Pointer_deep_copier, template< class Item, int Capacity, class Item_alloc > class Chunk_struct = fixedcapacity::heap_allocated::ringbuffer_ptr, class Size_access = itemsearch::no_size_access>
template<class Top_item_base, int Chunk_capacity = 32, class Cached_measure = cachedmeasure::trivial<Top_item_base*, size_t>, class Top_item_deleter = Pointer_deleter, class Top_item_copier = Pointer_deep_copier, template< class Item, int Capacity, class Item_alloc > class Chunk_struct = fixedcapacity::heap_allocated::ringbuffer_ptr, class Size_access = itemsearch::no_size_access>
template<class Top_item_base, int Chunk_capacity = 32, class Cached_measure = cachedmeasure::trivial<Top_item_base*, size_t>, class Top_item_deleter = Pointer_deleter, class Top_item_copier = Pointer_deep_copier, template< class Item, int Capacity, class Item_alloc > class Chunk_struct = fixedcapacity::heap_allocated::ringbuffer_ptr, class Size_access = itemsearch::no_size_access>
template<class Add_edge , class Process_chunk >
void pasl::data::chunkedseq::bootchunkedseq::cdeque< Top_item_base, Chunk_capacity, Cached_measure, Top_item_deleter, Top_item_copier, Chunk_struct, Size_access >::reveal_internal_structure |
( |
const Add_edge & |
add_edge, |
|
|
const Process_chunk & |
process_chunk |
|
) |
| const |
|
inline |
template<class Top_item_base, int Chunk_capacity = 32, class Cached_measure = cachedmeasure::trivial<Top_item_base*, size_t>, class Top_item_deleter = Pointer_deleter, class Top_item_copier = Pointer_deep_copier, template< class Item, int Capacity, class Item_alloc > class Chunk_struct = fixedcapacity::heap_allocated::ringbuffer_ptr, class Size_access = itemsearch::no_size_access>
template<class Pred >
measured_type pasl::data::chunkedseq::bootchunkedseq::cdeque< Top_item_base, Chunk_capacity, Cached_measure, Top_item_deleter, Top_item_copier, Chunk_struct, Size_access >::search_for_chunk |
( |
const Pred & |
p, |
|
|
measured_type |
prefix, |
|
|
const Top_item_base *& |
c |
|
) |
| const |
|
inline |
template<class Top_item_base, int Chunk_capacity = 32, class Cached_measure = cachedmeasure::trivial<Top_item_base*, size_t>, class Top_item_deleter = Pointer_deleter, class Top_item_copier = Pointer_deep_copier, template< class Item, int Capacity, class Item_alloc > class Chunk_struct = fixedcapacity::heap_allocated::ringbuffer_ptr, class Size_access = itemsearch::no_size_access>
template<class Pred >
measured_type pasl::data::chunkedseq::bootchunkedseq::cdeque< Top_item_base, Chunk_capacity, Cached_measure, Top_item_deleter, Top_item_copier, Chunk_struct, Size_access >::split |
( |
const top_measure_type & |
, |
|
|
const Pred & |
p, |
|
|
measured_type |
prefix, |
|
|
value_type & |
x, |
|
|
self_type & |
other |
|
) |
| |
|
inline |
template<class Top_item_base, int Chunk_capacity = 32, class Cached_measure = cachedmeasure::trivial<Top_item_base*, size_t>, class Top_item_deleter = Pointer_deleter, class Top_item_copier = Pointer_deep_copier, template< class Item, int Capacity, class Item_alloc > class Chunk_struct = fixedcapacity::heap_allocated::ringbuffer_ptr, class Size_access = itemsearch::no_size_access>
template<class Pred >
template<class Top_item_base, int Chunk_capacity = 32, class Cached_measure = cachedmeasure::trivial<Top_item_base*, size_t>, class Top_item_deleter = Pointer_deleter, class Top_item_copier = Pointer_deep_copier, template< class Item, int Capacity, class Item_alloc > class Chunk_struct = fixedcapacity::heap_allocated::ringbuffer_ptr, class Size_access = itemsearch::no_size_access>
template<class Top_item_base, int Chunk_capacity = 32, class Cached_measure = cachedmeasure::trivial<Top_item_base*, size_t>, class Top_item_deleter = Pointer_deleter, class Top_item_copier = Pointer_deep_copier, template< class Item, int Capacity, class Item_alloc > class Chunk_struct = fixedcapacity::heap_allocated::ringbuffer_ptr, class Size_access = itemsearch::no_size_access>