weak_value_map< K, V, C >::element_proxy Class Reference

#include <weakmap.h>

Public Member Functions
value_pointer &	operator= (value_pointer &v)
V &	operator* () const
	Support: *map[k].
V *	operator-> () const
	Support: map[k]->mem.
	operator value_pointer () const
	Support: value_pointer V(map[k]).
bool	operator== (const value_pointer &v) const
bool	operator!= (const value_pointer &v) const

Friends
class	weak_value_map

Detailed Description

template<typename K, typename V, typename C = std::less<K>>
class weak_value_map< K, V, C >::element_proxy

proxy class for lookup of non-const Supports assignment and deref. implicitly castable to value_pointer (aka shared_ptr<V>)

Definition at line 155 of file weakmap.h.

Constructor & Destructor Documentation

~element_proxy()

template<typename K, typename V, typename C = std::less<K>>

weak_value_map< K, V, C >::element_proxy::~element_proxy ( )

inline

Definition at line 162 of file weakmap.h.

{}

Member Function Documentation

operator value_pointer()

template<typename K, typename V, typename C = std::less<K>>

weak_value_map< K, V, C >::element_proxy::operator value_pointer ( ) const

inline

Support: value_pointer V(map[k]).

Definition at line 184 of file weakmap.h.

        {
            value_pointer ret = M.find(k);
            if(!ret)
                throw std::runtime_error("Bad key");
            return ret;
        }

operator!=()

template<typename K, typename V, typename C = std::less<K>>

bool weak_value_map< K, V, C >::element_proxy::operator!= ( const value_pointer & v ) const

inline

Definition at line 195 of file weakmap.h.

        {
            return !(*this==v);
        }

operator*()

template<typename K, typename V, typename C = std::less<K>>

V & weak_value_map< K, V, C >::element_proxy::operator* ( ) const

inline

Support: *map[k].

Definition at line 176 of file weakmap.h.

                                    {
            return *value_pointer(*this);
        }

operator->()

template<typename K, typename V, typename C = std::less<K>>

V * weak_value_map< K, V, C >::element_proxy::operator-> ( ) const

inline

Support: map[k]->mem.

Definition at line 180 of file weakmap.h.

                                     {
            return value_pointer(*this).get();
        }

operator=()

template<typename K, typename V, typename C = std::less<K>>

value_pointer & weak_value_map< K, V, C >::element_proxy::operator= ( value_pointer & v )

inline

Support: map[k] = v The value_pointer passed in will be replaced with a wrapped reference

Returns

the argument

Definition at line 166 of file weakmap.h.

        {
            if(!v.unique())
                throw std::invalid_argument("Only unique() references may be inserted");
            value_pointer chainptr(v.get(), dtor(M._data, k, v));
            M._data->store[k] = chainptr;
            v.swap(chainptr);
            return v;
        }

operator==()

template<typename K, typename V, typename C = std::less<K>>

bool weak_value_map< K, V, C >::element_proxy::operator== ( const value_pointer & v ) const

inline

Definition at line 191 of file weakmap.h.

        {
            return M.find(k)==v;
        }

Friends And Related Symbol Documentation

weak_value_map

template<typename K, typename V, typename C = std::less<K>>

friend class weak_value_map

friend

Definition at line 158 of file weakmap.h.

---

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

• p2pApp/weakmap.h