hashmap.ipp File Reference

#include "hashmap.hpp"

Include dependency graph for hashmap.ipp:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Macros
#define	HASHMAP_CC
#define	TMPL   template <class T, class U>
#define	H   hashentry<T, U>

Functions
template<class T , class U >
tm_ostream &	operator<< (tm_ostream &out, H h)
template<class T , class U >
bool	operator== (H h1, H h2)
template<class T , class U >
bool	operator!= (H h1, H h2)
template<class T , class U >
tm_ostream &	operator<< (tm_ostream &out, hashmap< T, U > h)
template<class T , class U >
bool	operator== (hashmap< T, U > h1, hashmap< T, U > h2)
template<class T , class U >
bool	operator!= (hashmap< T, U > h1, hashmap< T, U > h2)

Macro Definition Documentation

HASHMAP_CC

#define HASHMAP_CC

Definition at line 13 of file hashmap.ipp.

TMPL

#define TMPL   template <class T, class U>

Definition at line 16 of file hashmap.ipp.

H

#define H   hashentry<T, U>

Definition at line 17 of file hashmap.ipp.

Function Documentation

operator<<() [1/2]

template<class T , class U >

tm_ostream & operator<<	(	tm_ostream &	out,
		H	h )

Definition at line 27 of file hashmap.ipp.

                                  {
  out << h.key << "->" << h.im;
  return out;
}

operator==() [1/2]

template<class T , class U >

bool operator==	(	H	h1,
		H	h2 )

Definition at line 34 of file hashmap.ipp.

                        {
  return (h1.code == h2.code) && (h1.key == h2.key) && (h1.im == h2.im);
}

operator!=() [1/2]

template<class T , class U >

bool operator!=	(	H	h1,
		H	h2 )

Definition at line 39 of file hashmap.ipp.

                        {
  return (h1.code != h2.code) || (h1.key != h2.key) || (h1.im != h2.im);
}

operator<<() [2/2]

template<class T , class U >

tm_ostream & operator<<	(	tm_ostream &	out,
		hashmap< T, U >	h )

Definition at line 134 of file hashmap.ipp.

                                              {
  int i= 0, j= 0, n= h->n, size= h->size;
  out << "{ ";
  for (; i < n; i++) {
    list<hashentry<T, U>> l= h->a[i];
    for (; !is_nil (l); l= l->next, j++) {
      out << l->item;
      if (j != size - 1) out << ", ";
    }
  }
  out << " }";
  return out;
}

operator==() [2/2]

template<class T , class U >

bool operator==	(	hashmap< T, U >	h1,
		hashmap< T, U >	h2 )

Definition at line 160 of file hashmap.ipp.

                                                {
  if (h1->size != h2->size) return false;
  int i= 0, n= h1->n;
  for (; i < n; i++) {
    list<hashentry<T, U>> l= h1->a[i];
    for (; !is_nil (l); l= l->next)
      if (h2[l->item.key] != l->item.im) return false;
  }
  return true;
}

operator!=() [2/2]

template<class T , class U >

bool operator!=	(	hashmap< T, U >	h1,
		hashmap< T, U >	h2 )

Definition at line 172 of file hashmap.ipp.

                                                {
  return !(h1 == h2);
}