rel_hashmap_rep< T, U > Class Template Reference

#include <rel_hashmap.hpp>

Inheritance diagram for rel_hashmap_rep< T, U >:

Collaboration diagram for rel_hashmap_rep< T, U >:

Public Member Functions
	rel_hashmap_rep (hashmap< T, U > item2, rel_hashmap< T, U > next2)
bool	contains (T x)
void	extend ()
void	shorten ()
void	merge ()
void	find_changes (hashmap< T, U > &CH)
void	find_differences (hashmap< T, U > &CH)
void	change (hashmap< T, U > CH)

Public Attributes
hashmap< T, U >	item
rel_hashmap< T, U >	next

Friends
class	rel_hashmap< T, U >

Additional Inherited Members
Private Member Functions inherited from concrete_struct
	concrete_struct ()
	Default constructor for the concrete object. Increments the reference count.
virtual	~concrete_struct ()
	Virtual destructor for the concrete object. Decrements the reference count.
Private Attributes inherited from concrete_struct
int	ref_count
	The reference count for the concrete object.

Detailed Description

template<class T, class U>
class rel_hashmap_rep< T, U >

Definition at line 29 of file rel_hashmap.hpp.

Constructor & Destructor Documentation

rel_hashmap_rep()

template<class T , class U >

rel_hashmap_rep< T, U >::rel_hashmap_rep ( hashmap< T, U > item2, rel_hashmap< T, U > next2 )

inline

Definition at line 32 of file rel_hashmap.hpp.

      : item (item2), next (next2) {}

Member Function Documentation

contains()

template<class T , class U >

bool rel_hashmap_rep< T, U >::contains

(

T

x

)

Definition at line 41 of file rel_hashmap.ipp.

                                    {
  if (item->contains (x)) return true;
  if (is_nil (next)) return false;
  return next->contains (x);
}

extend()

template<class T , class U >

void rel_hashmap_rep< T, U >::extend

(

)

Definition at line 49 of file rel_hashmap.ipp.

                               {
  next= rel_hashmap<T, U> (item, next);
  item= hashmap<T, U> (item->init);
}

shorten()

template<class T , class U >

void rel_hashmap_rep< T, U >::shorten

(

)

Definition at line 56 of file rel_hashmap.ipp.

                                {
  ASSERT (!is_nil (next), "relative hashmap cannot be shortened");
  item= next->item;
  next= next->next;
}

merge()

template<class T , class U >

void rel_hashmap_rep< T, U >::merge

(

)

Definition at line 64 of file rel_hashmap.ipp.

                              {
  ASSERT (!is_nil (next), "relative hashmap cannot be merged");
  next->change (item);
  shorten ();
}

find_changes()

template<class T , class U >

void rel_hashmap_rep< T, U >::find_changes

(

hashmap< T, U > &

CH

)

Definition at line 72 of file rel_hashmap.ipp.

                                                      {
  int                   i;
  rel_hashmap<T, U>     h (item, next);
  list<hashentry<T, U>> remove;
  for (i= 0; i < CH->n; i++) {
    list<hashentry<T, U>> l (CH->a[i]);
    while (!is_nil (l)) {
      if (h[l->item.key] == l->item.im)
        remove= list<hashentry<T, U>> (l->item, remove);
      l= l->next;
    }
  }
  while (!is_nil (remove)) {
    CH->reset (remove->item.key);
    remove= remove->next;
  }
}

find_differences()

template<class T , class U >

void rel_hashmap_rep< T, U >::find_differences

(

hashmap< T, U > &

CH

)

Definition at line 92 of file rel_hashmap.ipp.

                                                          {
  int                   i;
  list<hashentry<T, U>> add;
  for (i= 0; i < item->n; i++) {
    list<hashentry<T, U>> l (item->a[i]);
    while (!is_nil (l)) {
      if (!CH->contains (l->item.key))
        add= list<hashentry<T, U>> (l->item, add);
      l= l->next;
    }
  }
  while (!is_nil (add)) {
    CH (add->item.key)= next[add->item.key];
    add               = add->next;
  }
  find_changes (CH);
}

change()

template<class T , class U >

void rel_hashmap_rep< T, U >::change

(

hashmap< T, U >

CH

)

Definition at line 112 of file rel_hashmap.ipp.

                                               {
  int i;
  for (i= 0; i < CH->n; i++) {
    list<hashentry<T, U>> l (CH->a[i]);
    while (!is_nil (l)) {
      item (l->item.key)= l->item.im;
      l                 = l->next;
    }
  }
}

Friends And Related Symbol Documentation

rel_hashmap< T, U >

template<class T , class U >

friend class rel_hashmap< T, U >

friend

Definition at line 42 of file rel_hashmap.hpp.

Member Data Documentation

item

template<class T , class U >

hashmap<T, U> rel_hashmap_rep< T, U >::item

Definition at line 31 of file rel_hashmap.hpp.

next

template<class T , class U >

rel_hashmap<T, U> rel_hashmap_rep< T, U >::next

Definition at line 32 of file rel_hashmap.hpp.

---

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

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