hashset.ipp File Reference

#include "hashset.hpp"

Include dependency graph for hashset.ipp:

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

Go to the source code of this file.

Macros
#define	HASHSET_CC

Functions
template<class T >
static T *	search (list< T > l, T x)
template<class T >
hashset< T >	copy (hashset< T > h)
template<class T >
bool	operator<= (hashset< T > h1, hashset< T > h2)
	Less-than-or-equal-to comparison operator for hash sets.
template<class T >
bool	operator< (hashset< T > h1, hashset< T > h2)
	Less-than comparison operator for hash sets.
template<class T >
bool	operator== (hashset< T > h1, hashset< T > h2)
	Equality comparison operator for hash sets.
template<class T >
tm_ostream &	operator<< (tm_ostream &out, hashset< T > h)
template<class T >
hashset< T > &	operator<< (hashset< T > &h, T x)
	Insert an item into a hash set.

Macro Definition Documentation

HASHSET_CC

#define HASHSET_CC

Definition at line 13 of file hashset.ipp.

Function Documentation

search()

template<class T >

static T * search ( list< T > l, T x )

static

Definition at line 37 of file hashset.ipp.

                        {
  while (!is_nil (l)) {
    if (l->item == x) return &(l->item);
    l= l->next;
  }
  return NULL;
}

copy()

template<class T >

hashset< T > copy

(

hashset< T >

h

)

Definition at line 77 of file hashset.ipp.

                    {
  int        i, n= h->n;
  hashset<T> h2 (n, h->max);
  h2->size= h->size;
  for (i= 0; i < n; i++)
    h2->a[i]= copy (h->a[i]);
  return h2;
}

operator<=()

template<class T >

bool operator<=	(	hashset< T >	h1,
		hashset< T >	h2 )

Less-than-or-equal-to comparison operator for hash sets.

Template Parameters

T	The type of the data stored in the hash sets.

Parameters

h1	The first hash set to be compared.
h2	The second hash set to be compared.

Returns

true if the first hash set is less than or equal to the second hash set, false otherwise.

Definition at line 87 of file hashset.ipp.

                                          {
  int i= 0, j= 0, n= h1->n;
  if (N (h1) > N (h2)) return false;
  for (; i < n; i++) {
    list<T> l= h1->a[i];
    for (; !is_nil (l); l= l->next, j++)
      if (!h2->contains (l->item)) return false;
  }
  return true;
}

operator<()

template<class T >

bool operator<	(	hashset< T >	h1,
		hashset< T >	h2 )

Less-than comparison operator for hash sets.

Template Parameters

T	The type of the data stored in the hash sets.

Parameters

h1	The first hash set to be compared.
h2	The second hash set to be compared.

Returns

true if the first hash set is less than the second hash set, false otherwise.

Definition at line 100 of file hashset.ipp.

                                         {
  return (N (h1) < N (h2)) && (h1 <= h2);
}

operator==()

template<class T >

bool operator==	(	hashset< T >	h1,
		hashset< T >	h2 )

Equality comparison operator for hash sets.

Template Parameters

T	The type of the data stored in the hash sets.

Parameters

h1	The first hash set to be compared.
h2	The second hash set to be compared.

Returns

true if the hash sets are equal, false otherwise.

Definition at line 107 of file hashset.ipp.

                                          {
  return (N (h1) == N (h2)) && (h1 <= h2);
}

operator<<() [1/2]

template<class T >

tm_ostream & operator<<	(	tm_ostream &	out,
		hashset< T >	h )

Definition at line 112 of file hashset.ipp.

                                           {
  int i= 0, j= 0, n= h->n, size= h->size;
  out << "{ ";
  for (; i < n; i++) {
    list<T> 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 >

hashset< T > & operator<<	(	hashset< T > &	h,
		T	x )

Insert an item into a hash set.

Template Parameters

T	The type of the data stored in the hash set *

Parameters

h	The hash set to insert into.
x	The item to insert.

Returns

hashset<T>& A reference to the modified hash set.

Definition at line 112 of file hashset.ipp.

                                {
  h->insert (x);
  return h;
}