Loading...
Searching...
No Matches
by::dumScope Class Reference
Dummy scope implementation that ignores additions. More...
#include <dumScope.hpp>
Inheritance diagram for by::dumScope:
Public Member Functions | |
| dumScope (const scope::super &org) | |
| nbool | add (const std::string &key, const node &val) override |
 Public Member Functions inherited from by::tnchain< std::string, node, tnmap< std::string, node, immutableTactic > > | |
| tnchain (const super &arr) | |
| tnchain (const super &org, const me &next) | |
| tnchain (std::initializer_list< std::pair< std::string, node * > > elems) | |
| nbool | in (const std::string &key) const override |
| ncnt | len () const override |
| ncnt | chainLen () const |
| node * | get (const std::string &key) override |
| nbool | add (const std::string &key, const node &val) 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 std::string &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 |
| Public Member Functions inherited from by::tbicontainable< K, V > | |
| V & | operator[] (const K &key) |
| const V & | operator[] (const K &key) const |
| ncnt | isEmpty () const |
| virtual nbool | in (const K &key) const =0 |
| 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 |
| virtual V * | get (const K &key)=0 |
| 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)) |
| virtual nbool | add (const K &key, const V &val)=0 |
| 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) |
| virtual nbool | del (const K &key)=0 |
| 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) |
Static Public Member Functions | |
| static me & | singleton () |
| Static Public Member Functions inherited from by::tnchain< std::string, node, tnmap< std::string, node, immutableTactic > > | |
| static T * | wrap (const super &toShallowWrap) |
| static T * | wrap (const super *it) BY_SIDE_FUNC(it |
| static me * | wrap (const super &toShallowWrap) |
| static me * | wrap (const super *it) BY_SIDE_FUNC(wrap) |
Additional Inherited Members | |
| Public Types inherited from by::tnchain< std::string, node, tnmap< std::string, node, immutableTactic > > | |
| typedef super::iter | iter |
| typedef super::iteration | iteration |
| typedef tnmap< std::string, node, immutableTactic > | defaultContainer |
| Public Attributes inherited from by::tnchain< std::string, node, tnmap< std::string, node, immutableTactic > > | |
| static T wrap< T > | it |
| static T wrap< T > | nullptr |
| Public Attributes inherited from by::tbicontainable< K, V > | |
| template<typename V1 > | |
| const V1 *get(const K *key) const BY_CONST_FUNC(get< V1 >(key)) template< typename V1 > V1 *get(std V | get )(std::function< nbool(const K &, const V &)> l) |
| template<typename V1 > | |
| const V1 *get(std::function< nbool(const K &, const V1 &)> l) const BY_CONST_FUNC(get(l)) const V *get(std tnarr< V, strTactic | getAll )(const K *it) const BY_SIDE_FUNC(getAll) |
| template<typename V1 > | |
| void each(std::function< nbool(const K &, const V1 &)> l) const BY_CONST_FUNC(each(l)) void each(std ite | begin )(const K &key) const |
| iter begin | it |
| iter rbegin | it |
| iter iterate | it |
| iter iterate | key |
| iter riterate | it |
| iter riterate | key |
| nbool add | key |
| nbool add | false |
| nbool | false |
| nbool del | from |
| nbool del | false |
| Protected Member Functions inherited from by::tnchain< std::string, node, tnmap< std::string, node, immutableTactic > > | |
| iteration * | _onMakeIteration (const std::string *key, nbool isReversed, ncnt step, nbool isBoundary) const override |
| void | _getAll (const std::string &key, narr &tray) const override |
| Protected Member Functions inherited from by::tbicontainable< K, V > | |
| virtual iteration * | _onMakeIteration (const K *key, nbool isReversed, ncnt step, nbool isBoundary) const =0 |
| virtual void | _getAll (const K &key, narr &tray) const =0 |
Detailed Description
Dummy scope implementation that ignores additions.
No-op scope used when scope operations should be ignored.
The documentation for this class was generated from the following file:
- /home/runner/work/byeol/byeol/module/core/ast/dumScope.hpp