The concrete implementation of KeylessHashtable{T}. Do not use directly; instead, call KeylessHashtable{T}.New(int).
More...
The concrete implementation of KeylessHashtable{T}. Do not use directly; instead, call KeylessHashtable{T}.New(int).
- Type Constraints
-
| Int | : | struct | |
| Int | : | IConvertible | |
| Math | : | struct | |
| Math | : | IMath<Int> | |
|
|
| KeylessHashtable (int numBuckets) |
| |
|
sealed override void | Add (uint hashCode, T value) |
| |
|
override bool | Remove (uint hashCode, T value) |
| |
|
sealed override int | Remove (uint hashCode, Predicate< T > shouldRemove, int maxToRemove) |
| |
|
sealed override void | Clear () |
| |
|
override IEnumerator< T > | GetEnumerator () |
| |
|
override IEnumerator< T > | Find (uint hashCode) |
| |
|
void | Add< K > (K key, T value) |
| |
|
bool | Remove< K > (K key, T value) |
| |
|
IEnumerator< T > | Find< K > (K key) |
| |