Sawyer::Container::Map< K, T, Cmp, Alloc >::Node Class Reference

Description

template<class K, class T, class Cmp = std::less<K>, class Alloc = std::allocator<std::pair<const K, T> >>
class Sawyer::Container::Map< K, T, Cmp, Alloc >::Node

Type for stored nodes.

A storage node contains the immutable key and its associated value.

Definition at line 89 of file Sawyer/Map.h.

#include <Map.h>

Inheritance diagram for Sawyer::Container::Map< K, T, Cmp, Alloc >::Node:

Collaboration diagram for Sawyer::Container::Map< K, T, Cmp, Alloc >::Node:

Public Member Functions
	Node (const std::pair< const Key, Value > &pair)
	Node (const Key &key, Value &value)
const Key &	key () const
	Key part of key/value node. More...
Value &	value ()
	Value part of key/value node. More...
const Value &	value () const
	Value part of key/value node. More...

Member Function Documentation

key()

template<class K , class T , class Cmp = std::less<K>, class Alloc = std::allocator<std::pair<const K, T> >>

const Key& Sawyer::Container::Map< K, T, Cmp, Alloc >::Node::key ( ) const

inline

Key part of key/value node.

Returns the key part of a key/value node. Keys are not mutable when they are part of a map.

Definition at line 98 of file Sawyer/Map.h.

Referenced by Sawyer::Container::AddressMap< A, T >::changeAccess(), Sawyer::Container::AddressMap< A, T >::checkConsistency(), Sawyer::Container::IntervalSetMap< I, S >::erase(), Sawyer::Container::IntervalMap< Interval, int >::erase(), Sawyer::Container::IntervalMap< Interval, int >::findFirstOverlapImpl(), Sawyer::Container::IntervalSetMap< I, S >::getIntersection(), Sawyer::Container::IntervalMap< Interval, int >::greatest(), Sawyer::Container::IntervalSetMap< I, S >::insert(), Sawyer::Container::IntervalMap< Interval, int >::insert(), Sawyer::Container::AddressMap< A, T >::keep(), Sawyer::Container::IntervalMap< Interval, int >::least(), Sawyer::Container::AddressMap< A, T >::prune(), Sawyer::Container::AddressMap< A, T >::read(), Sawyer::Container::AddressMap< A, T >::traverse(), Sawyer::Container::IntervalMap< Interval, int >::upperBound(), and Sawyer::Container::AddressMap< A, T >::write().

Here is the caller graph for this function:

value() [1/2]

template<class K , class T , class Cmp = std::less<K>, class Alloc = std::allocator<std::pair<const K, T> >>

Value& Sawyer::Container::Map< K, T, Cmp, Alloc >::Node::value ( )

inline

Value part of key/value node.

Returns a reference to the value part of a key/value node.

Definition at line 105 of file Sawyer/Map.h.

Referenced by Sawyer::Container::AddressMap< A, T >::changeAccess(), Sawyer::Container::AddressMap< A, T >::checkConsistency(), Sawyer::Container::DistinctList< T, Cmp >::erase(), Sawyer::Container::IntervalMap< Interval, int >::erase(), Sawyer::Container::IntervalSetMap< I, S >::existsAnywhere(), Sawyer::Container::IntervalSetMap< I, S >::existsEverywhere(), Sawyer::Container::IntervalMap< Interval, int >::get(), Sawyer::Container::IntervalMap< Interval, int >::getOptional(), Sawyer::Container::IntervalMap< Interval, int >::getOrDefault(), Sawyer::Container::IntervalMap< Interval, int >::getOrElse(), Sawyer::Container::IntervalSetMap< I, S >::getUnion(), Sawyer::Container::IntervalMap< Interval, int >::insert(), Sawyer::Container::IntervalMap< Interval, int >::operator[](), Sawyer::Container::AddressMap< A, T >::read(), and Sawyer::Container::AddressMap< A, T >::write().

Here is the caller graph for this function:

value() [2/2]

template<class K , class T , class Cmp = std::less<K>, class Alloc = std::allocator<std::pair<const K, T> >>

const Value& Sawyer::Container::Map< K, T, Cmp, Alloc >::Node::value ( ) const

inline

Value part of key/value node.

Returns a reference to the value part of a key/value node.

Definition at line 106 of file Sawyer/Map.h.

---

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

• Sawyer/Map.h