Aardvark.Base


ConcurrentIntSet

A ConcurrentIntSet 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

ConstructorDescription
new(dict)
Signature: dict:IntSet -> unit

A ConcurrentIntSet can only be concstructed by wrapping its non-concurrent counterpart.

Instance members

Instance memberDescription
Add(key)
Signature: key:int -> bool

Add the item with the supplied key to the ConcurrentIntSet.

AddObject(objkey)
Signature: objkey:obj -> bool

Add the item with supplied key both supplied as generic objects, to the ConcurrentIntSet. Note that the supplied key and value are cast to the concrete type of the keys and values used in the ConcurrentIntSet and this will fail if they are of different types.

AddRange(keys)
Signature: keys:IEnumerable<int> -> unit

Add the supplied keys to the ConcurrentIntSet.

Clear()
Signature: unit -> unit

Remove all items. Capacity remains unchanged.

Contains(key)
Signature: key:int -> bool

Returns true if the ConcurrentIntSet 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

Returns the number of items currently contained in the ConcurrentIntSet.

LongCount
Signature: int64

Returns the number of items currently contained in the ConcurrentIntSet as long.

NonConcurrent
Signature: IntSet

Return the non-concurrent contained ConcurrentIntSet.

Remove(key)
Signature: key:int -> bool

Remove the item with the supplied key from the ConcurrentIntSet. 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 ConcurrentIntSet.

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.

Fork me on GitHub