rel_hashmap< T, U > Class Template Reference

#include <rel_hashmap.hpp>

Private Member Functions
	CONCRETE_NULL_TEMPLATE_2 (rel_hashmap, T, U)
	rel_hashmap (U init)
	rel_hashmap (hashmap< T, U > item)
	rel_hashmap (hashmap< T, U > item, rel_hashmap< T, U > next)
U	operator[] (T x)
U &	operator() (T x)

Detailed Description

template<class T, class U>
class rel_hashmap< T, U >

Definition at line 20 of file rel_hashmap.hpp.

Constructor & Destructor Documentation

rel_hashmap() [1/3]

template<class T , class U >

rel_hashmap< T, U >::rel_hashmap ( U init )

inlineprivate

Definition at line 49 of file rel_hashmap.hpp.

    : rep (tm_new<rel_hashmap_rep<T, U>> (hashmap<T, U> (init),
                                          rel_hashmap<T, U> ())) {}

rel_hashmap() [2/3]

template<class T , class U >

rel_hashmap< T, U >::rel_hashmap ( hashmap< T, U > item )

inlineprivate

Definition at line 52 of file rel_hashmap.hpp.

    : rep (tm_new<rel_hashmap_rep<T, U>> (item, rel_hashmap<T, U> ())) {}

rel_hashmap() [3/3]

template<class T , class U >

rel_hashmap< T, U >::rel_hashmap ( hashmap< T, U > item, rel_hashmap< T, U > next )

inlineprivate

Definition at line 54 of file rel_hashmap.hpp.

    : rep (tm_new<rel_hashmap_rep<T, U>> (item, next)) {}

Member Function Documentation

CONCRETE_NULL_TEMPLATE_2()

template<class T , class U >

rel_hashmap< T, U >::CONCRETE_NULL_TEMPLATE_2 ( rel_hashmap< T, U > , T , U  )

private

operator[]()

template<class T , class U >

U rel_hashmap< T, U >::operator[] ( T x )

private

Definition at line 23 of file rel_hashmap.ipp.

                                  {
  ASSERT (rep != NULL, "invalid relative hashmap");
  if (rep->item->contains (x) || is_nil (rep->next)) return rep->item[x];
  return rep->next[x];
}

operator()()

template<class T , class U >

U & rel_hashmap< T, U >::operator() ( T x )

private

Definition at line 31 of file rel_hashmap.ipp.

                                  {
  ASSERT (rep != NULL, "invalid relative hashmap");
  if (rep->item->contains (x)) return rep->item (x);
  if ((!is_nil (rep->next)) && rep->next->contains (x))
    rep->item (x)= copy (rep->next[x]);
  return rep->item (x);
}

---

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

• hashmap.hpp
• rel_hashmap.hpp
• rel_hashmap.ipp