ContainerTraits< M, IF_is_map< M > > Struct Template Reference

Description

template<typename M>
struct lib::diff::anonymous_namespace{tree-mutator-collection-binding.hpp}::ContainerTraits< M, IF_is_map< M > >

Definition at line 150 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...

Member Function Documentation

recentElmRawIter()

static auto recentElmRawIter ( Map &  map )

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 163 of file tree-mutator-collection-binding.hpp.

Collaboration diagram for ContainerTraits< M, IF_is_map< M > >:

---

The documentation for this struct was generated from the following file:

• tree-mutator-collection-binding.hpp