| Trees | Indices | Help |
|
|---|
|
|
object --+
|
HashSet
A simple implementation of a hash table using a dictionary. The table is a set, since it does not store duplicate entries.
Stores pointers both in a hash table (dictionary) and a list, so that the values can be retreived quickly.
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
Inherited from |
|||
|
|||
|
Inherited from |
|||
|
|||
x.__init__(...) initializes x; see help(type(x)) for signature
|
When a value already exists in the table, this is called instead of adding the value. By default, it does nothing (i.e. drops the new value), but you can override it if you want to do something else to combine the values. Note that your custom methods must only modify the sign that's already
in the set ( |
Appends the new entry to the set if it's not already there. Returns true if the entry is added, false otherwise. |
Appends each of the given entries to the set. Returns true if any of them is added, false otherwise. |
| Trees | Indices | Help |
|
|---|
| Generated by Epydoc 3.0.1 on Mon Nov 26 16:04:56 2012 | http://epydoc.sourceforge.net |