smjg.libs.util.hashset.HashSet< T >.HashSet Class Reference

The HashSet class implements a set using a hash table. More...

List of all members.

Public Member Functions

typedef smjg.libs.util.setbase. Set (T) Set
 this (T[] elements...)
override bool opIn_r (T elem)
override void add (T elem)
override void remove (T elem)
override void removeCurrent ()
 Removes the element currently active in the innermost active foreach loop on this set.
override size_t length ()
override HashSet dup ()
override T[] data ()
override int opApply (int public override(*dg)(inout T))
 Iterates through the elements of the set.
override HashSet opAnd (Set s)
override HashSet opOr (Set s)
override HashSet opSub (Set s)
override HashSet opAnd (bool public override(*dg)(T))
override HashSet opSub (bool public override(*dg)(T))
override HashSet opXor (Set s)
override HashSet opAndAssign (Set s)
override HashSet opOrAssign (Set s)
override HashSet opSubAssign (Set s)
override HashSet opXorAssign (Set s)
override HashSet opAndAssign (bool public override(*dg)(T))
override HashSet opSubAssign (bool public override(*dg)(T))
Properties
HashSet rehash ()
 Rehashes the set in place.


Detailed Description

The HashSet class implements a set using a hash table.

Constructor & Destructor Documentation

smjg.libs.util.hashset.HashSet< T >.HashSet.this ( T[]  elements...  ) 


Member Function Documentation

typedef smjg.libs.util.setbase. smjg.libs.util.hashset.HashSet< T >.HashSet.Set (  ) 

override bool smjg.libs.util.hashset.HashSet< T >.HashSet.opIn_r ( elem  ) 

override void smjg.libs.util.hashset.HashSet< T >.HashSet.add ( elem  ) 

override void smjg.libs.util.hashset.HashSet< T >.HashSet.remove ( elem  ) 

override void smjg.libs.util.hashset.HashSet< T >.HashSet.removeCurrent (  ) 

Removes the element currently active in the innermost active foreach loop on this set.

Precondition:
A foreach loop must be active on this set.
Warning:
The removal doesn't take effect until the iteration of the foreach loop exits. A nested foreach loop on the same set must not be started after removeCurrent before the end of the iteration, since this is likely to cause the wrong element to be removed.

override size_t smjg.libs.util.hashset.HashSet< T >.HashSet.length (  ) 

override HashSet smjg.libs.util.hashset.HashSet< T >.HashSet.dup (  ) 

override T [] smjg.libs.util.hashset.HashSet< T >.HashSet.data (  ) 

override int smjg.libs.util.hashset.HashSet< T >.HashSet.opApply ( int public override(*)(inout T)  dg  ) 

Iterates through the elements of the set.

(Implementation of foreach (T; HashSet).)

override HashSet smjg.libs.util.hashset.HashSet< T >.HashSet.opAnd ( Set  s  ) 

override HashSet smjg.libs.util.hashset.HashSet< T >.HashSet.opOr ( Set  s  ) 

override HashSet smjg.libs.util.hashset.HashSet< T >.HashSet.opSub ( Set  s  ) 

override HashSet smjg.libs.util.hashset.HashSet< T >.HashSet.opAnd ( bool public override(*)(T)  dg  ) 

override HashSet smjg.libs.util.hashset.HashSet< T >.HashSet.opSub ( bool public override(*)(T)  dg  ) 

override HashSet smjg.libs.util.hashset.HashSet< T >.HashSet.opXor ( Set  s  ) 

override HashSet smjg.libs.util.hashset.HashSet< T >.HashSet.opAndAssign ( Set  s  ) 

override HashSet smjg.libs.util.hashset.HashSet< T >.HashSet.opOrAssign ( Set  s  ) 

override HashSet smjg.libs.util.hashset.HashSet< T >.HashSet.opSubAssign ( Set  s  ) 

override HashSet smjg.libs.util.hashset.HashSet< T >.HashSet.opXorAssign ( Set  s  ) 

override HashSet smjg.libs.util.hashset.HashSet< T >.HashSet.opAndAssign ( bool public override(*)(T)  dg  ) 

override HashSet smjg.libs.util.hashset.HashSet< T >.HashSet.opSubAssign ( bool public override(*)(T)  dg  ) 

HashSet smjg.libs.util.hashset.HashSet< T >.HashSet.rehash (  ) 

Rehashes the set in place.

Returns:
the array.


The documentation for this class was generated from the following file:
Generated on Sun Sep 13 19:50:38 2009 for Stewart's Utility Library by  doxygen 1.5.4