Lumiera
0.pre.03
»edit your freedom«
|
Definition at line 141 of file tree-mutator-collection-binding.hpp.
Public Types | |
using | Elm = std::pair< const Key, Val > |
using | Key = typename Map::key_type |
using | Map = _AsMap< M > |
using | Val = typename Map::mapped_type |
Static Public Member Functions | |
static void | append (Map &map, Elm &&elm) |
static auto | recentElmRawIter (Map &map) |
heuristic for std::map : lookup via reverse iterator. More... | |
|
inlinestatic |
heuristic for std::map
: lookup via reverse iterator.
Since std::map iterates in key order, the most recently inserted element is likely also the largest element. If this guess fails, there will always be a second try by searching over all elements.
Definition at line 154 of file tree-mutator-collection-binding.hpp.