|
|
| tndumChain (const super &rhs) |
| |
| nbool | add (const K &key, const V &val) override |
| |
|
nbool | link (const typename super::iter &new1) override |
| |
|
| tnchain (const super &arr) |
| |
|
| tnchain (const super &org, const me &next) |
| |
|
| tnchain (std::initializer_list< std::pair< K, V * > > elems) |
| |
| nbool | in (const K &key) const override |
| |
| ncnt | len () const override |
| |
|
ncnt | chainLen () const |
| |
| V * | get (const K &key) override |
| |
| virtual nbool | link (const iter &portion) |
| | link to another chain instance. if iterator is not the begin of another chain, this chain won't link unaccessible elements via given iterator. using this point, you can choose which elements to link and which elements not. even if you specified a reverse iterator to link, this chain will only traverse in reverse way for that container refered by the reversed iterator.
|
| |
|
nbool | link (const me &new1) |
| |
|
nbool | link (const me *it) BY_SIDE_FUNC(link) |
| |
|
nbool | unlink () |
| |
| nbool | del (const K &key) override |
| |
|
nbool | del (const iter &at) override |
| |
|
nbool | del (const iter &from, const iter &end) override |
| |
| void | rel () override |
| |
|
super & | getContainer () |
| |
|
const super & | getContainer () const |
| |
|
me * | getNext () |
| |
|
const me * | getNext () const BY_CONST_FUNC(getNext()) me *getPrev() |
| |
| const me * | getPrev () const BY_CONST_FUNC(getPrev()) me *getTail() |
| |
| const me * | getTail () const BY_CONST_FUNC(getTail()) void onCloneDeep(const clonable &from) override |
| |
| me * | cloneChain (const super *until) const |
| |
|
me * | cloneChain (const me *until) const |
| |
| me * | cloneChain () const |
| |
|
V & | operator[] (const K &key) |
| |
|
const V & | operator[] (const K &key) const |
| |
|
ncnt | isEmpty () const |
| |
|
nbool | in (const K *it) const BY_SIDE_FUNC(in) |
| |
|
nbool | in (const V &val) const |
| |
|
nbool | in (const V *it) const BY_SIDE_FUNC(in) |
| |
|
nbool | in (std::function< nbool(const K &key, const V &val)> l) const |
| |
|
template<typename V1 > |
| nbool | in (std::function< nbool(const K &key, const V1 &val)> l) const |
| |
|
const V * | get (const K &key) const BY_CONST_FUNC(get(key)) V *get(const K *it) BY_SIDE_FUNC(get) |
| |
|
template<typename V1 > |
| V1 * | get () |
| |
|
template<typename V1 > |
| const V1 * | get () const BY_CONST_FUNC(get< V1 >()) template< typename V1 > V1 *get(const K &key) |
| |
|
template<typename V1 > |
| const V1 * | get (const K &key) const BY_CONST_FUNC(get< V1 >(key)) template< typename V1 > V1 *get(const K *it) BY_SIDE_FUNC(get< V1 >) |
| |
|
template<typename V1 > |
| tnarr< V1, strTactic > | getAll () const |
| |
|
template<typename V1 > |
| tnarr< V1, strTactic > | getAll (std::function< nbool(const K &, const V1 &)> l) const |
| |
|
tnarr< V, strTactic > | getAll (std::function< nbool(const K &, const V &)> l) const |
| |
|
template<typename V1 > |
| void | each (std::function< nbool(const K &, V1 &)> l) |
| |
|
void | each (std::function< nbool(const K &, V &)> l) |
| |
|
iter | begin (const K *it) const BY_SIDE_FUNC(it |
| |
|
iter begin | iterate (0)) |
| |
|
iter | rbegin () const |
| |
|
iter | rbegin (const K &key) const |
| |
|
iter | rbegin (const K *it) const BY_SIDE_FUNC(it |
| |
|
iter rbegin | riterate (0)) |
| |
|
virtual iter | end () const |
| |
|
virtual iter | rend () const |
| |
|
virtual iter | last () const |
| |
|
iter | iterate (ncnt step) const |
| |
| iter | iterate (ncnt step, nbool isBoundary) const |
| |
|
iter | iterate (const K &key) const |
| |
|
iter | iterate (const K *it) const BY_SIDE_FUNC(it |
| |
|
iter iterate | begin ()) |
| |
|
iter | iterate (const K &key, nbool isBoundary) const |
| |
|
iter | iterate (const K *key, nbool isBoundary) const BY_SIDE_FUNC(key |
| |
|
iter iterate | iterate (0, isBoundary)) |
| |
|
iter | riterate (ncnt step) const |
| |
|
iter | riterate (ncnt step, nbool isBoundary) const |
| |
|
iter | riterate (const K &key) const |
| |
|
iter | riterate (const K *it) const BY_SIDE_FUNC(it |
| |
|
iter riterate | rbegin ()) |
| |
|
iter | riterate (const K &key, nbool isBoundary) const |
| |
|
iter | riterate (const K *key, nbool isBoundary) const BY_SIDE_FUNC(key |
| |
|
iter riterate | riterate (0, isBoundary)) |
| |
|
nbool | add (const K *key, const V &val) BY_SIDE_FUNC(key |
| |
|
nbool | add (const K &key, const V *val) BY_SIDE_FUNC(val |
| |
|
nbool | add (key, *val) |
| |
|
nbool | add (const K *key, const V *val) BY_SIDE_FUNC(key||val |
| |
|
ncnt | add (const iter &from, const iter &to) |
| |
|
ncnt | add (const tbicontainable &rhs) |
| |
|
ncnt | add (const tbicontainable *it) BY_SIDE_FUNC(add) |
| |
|
nbool | del (const K *it) BY_SIDE_FUNC(del) |
| |
|
virtual nbool | del (const iter &at)=0 |
| |
|
nbool | del (const iter *it) BY_SIDE_FUNC(del) |
| |
|
virtual nbool | del (const iter &from, const iter &end)=0 |
| |
|
nbool | del (const iter *from, const iter &end) BY_SIDE_FUNC(from |
| |
|
nbool | del (const iter &from, const iter *end) BY_SIDE_FUNC(end |
| |
|
nbool | del (from, *end) |
| |
|
nbool | del (const iter *from, const iter *end) BY_SIDE_FUNC(from &&end |
| |
|
nbool | del (const tbicontainable &rhs) |
| |
|
nbool | del (const tbicontainable *it) BY_SIDE_FUNC(del) |
| |