Back to index

texmacs  1.0.7.15
Private Member Functions
rel_hashmap< T, U > Class Template Reference

#include <rel_hashmap.hpp>

Inheritance diagram for rel_hashmap< T, U >:
Inheritance graph
[legend]

List of all members.

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)
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

template<class T, class U>
TMPL rel_hashmap< T, U >::rel_hashmap ( init) [inline, private]

Definition at line 49 of file rel_hashmap.hpp.

template<class T, class U>
TMPL rel_hashmap< T, U >::rel_hashmap ( hashmap< T, U >  item) [inline, private]

Definition at line 51 of file rel_hashmap.hpp.

template<class T, class U>
TMPL rel_hashmap< T, U >::rel_hashmap ( hashmap< T, U >  item,
rel_hashmap< T, U >  next 
) [inline, private]

Definition at line 54 of file rel_hashmap.hpp.

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

Member Function Documentation

template<class T, class U>
rel_hashmap< T, U >::CONCRETE_NULL_TEMPLATE_2 ( rel_hashmap< T, U >  ,
T  ,
 
) [private]
template<class T, class U >
U & rel_hashmap< T, U >::operator() ( T  x) [private]

Definition at line 29 of file rel_hashmap.cpp.

                                  {
  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);
}

Here is the call graph for this function:

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

Definition at line 22 of file rel_hashmap.cpp.

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

Here is the call graph for this function:


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