10 template <
typename K,
typename V,
typename _defaultContainer = tnmap<K, V>>
17 typedef typename super::iter
iter;
18 typedef typename super::iteration
iteration;
26 explicit tnchain(
const super&
org,
const me& next);
27 explicit tnchain(std::initializer_list<std::pair<K, V*>>
elems);
32 nbool in(
const K& key)
const override;
35 ncnt len()
const override;
36 ncnt chainLen()
const;
39 V* get(
const K& key)
override;
43 nbool add(
const K& key,
const V&
val)
override;
76 super& getContainer();
77 const super& getContainer()
const;
137 void _getAll(
const K& key,
narr&
tray)
const override;
145 void _eachChain(std::function<
void(me&)>
closure);
Scripted array container for byeol language
Definition arr.hpp:15
func closure with captured object scope
Definition closure.hpp:20
Definition tnbicontainer.hpp:8
Definition tnchain.hpp:11
static T * wrap(const super &toShallowWrap)
Definition tnchain.hpp:105
const me * getPrev() const BY_CONST_FUNC(getPrev()) me *getTail()
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 ...
const me * getTail() const BY_CONST_FUNC(getTail()) void onCloneDeep(const clonable &from) override
nbool del(const K &key) override
me * cloneChain(const super *until) const
Bidirectional iterator for key-value containers
Definition biter.hpp:10
Definition biteration.hpp:5
Chain iteration implementation
Definition nchainIteration.hpp:8