FastConcurrentIntSet
A FastConcurrentIntSet is an alternate implementation of a HashSet. It is implemented as a hashtable with external linking, that uses primes as the table size in order to reduce the danger of funneling.
Constructors
| Constructor | Description |
new()
Signature: unit -> unit
|
Create a FastConcurrentIntSet that autmatically grows and shrinks as necessary. |
new(initialCapacity)
Signature: initialCapacity:int -> unit
|
Create a FastConcurrentIntSet that autmatically grows and shrinks as necessary, but also specify an initial capacity. |
new(items)
Signature: items:IEnumerable<int> -> unit
|
Create a FastConcurrentIntSet and initialize it to contain the supplied items. |
Instance members
| Instance member | Description |
Add(key)
Signature: key:int -> bool
Modifiers: abstract |
Add the item with the supplied key to the FastConcurrentIntSet. |
AddObject(objkey)
Signature: objkey:obj -> bool
Modifiers: abstract |
Add the item with supplied key both supplied as generic objects, to the FastConcurrentIntSet. Note that the supplied key and value are cast to the concrete type of the keys and values used in the FastConcurrentIntSet and this will fail if they are of different types. |
AddRange(keys)
Signature: keys:IEnumerable<int> -> unit
|
Add the supplied keys to the FastConcurrentIntSet. |
Clear()
Signature: unit -> unit
Modifiers: abstract |
Remove all items. Capacity remains unchanged. |
Contains(key)
Signature: key:int -> bool
Modifiers: abstract |
Returns true if the FastConcurrentIntSet contains the item with the supplied key. |
CopyTo(array, index)
Signature: (array:int [] * index:int) -> unit
|
Copies all keys in the dictionary to the supplied array starting at the supplied index. This may throw a ConcurrentDataModifiedException if data is modified by another task during the operation. |
Count
Signature: int
Modifiers: abstract |
Returns the number of items currently contained in the FastConcurrentIntSet. |
GetEnumerator()
Signature: unit -> IEnumerator<int>
Modifiers: abstract |
|
Items
Signature: IEnumerable<int>
Modifiers: abstract |
|
Keys
Signature: IEnumerable<int>
|
Returns all keys in the dictionary. This may throw a ConcurrentDataModifiedException if data is modified by another task during the enumeration. |
KeyType
Signature: Type
Modifiers: abstract |
|
LongCount
Signature: int64
Modifiers: abstract |
Returns the number of items currently contained in the FastConcurrentIntSet as long. |
MaxFillFactor()
Signature: unit -> unit
|
Setting the maximal fill factor makes it possible to fine-tune the performance for certain applications. Normally this should not be necessary. |
MinFillFactor()
Signature: unit -> unit
|
Setting the minimal fill factor makes it possible to influence the shrinking behaviour of the FastConcurrentIntSet. Normally this should be set to a quater of the maximal fill factor. In order to completely prevent shrinking it can also be set to 0.0f. |
Objects
Signature: IEnumerable<obj>
Modifiers: abstract |
|
Remove(key)
Signature: key:int -> bool
Modifiers: abstract |
Remove the item with the supplied key from the FastConcurrentIntSet. Returns true if the value was removed. |
ToArray()
Signature: unit -> int []
|
Returns all keys in the dictionary as an array. This may throw a ConcurrentDataModifiedException if data is modified by another task during the operation. |
TryAdd(key)
Signature: key:int -> bool
|
Add the item with the supplied key to the FastConcurrentIntSet. |
TryRemove(key)
Signature: key:int -> bool
|
Try to reomve the item with the supplied key. If multipe entries have the same key, the one that was inserted last is removed. Returns true if the item was found. |
