@@ -1,4 +1,4 @@
#nullable dis able
#nullable en able
#pragma warning disable
// License MIT
// Source: https://github.com/i3arnon/ConcurrentHashSet
@@ -7,433 +7,23 @@ using System.Diagnostics;
namespace System.Collections.Generic ;
/// <summary>
/// Represents a thread-safe hash-based unique collection.
/// </summary>
/// <typeparam name="T">The type of the items in the collection.</typeparam>
/// <remarks>
/// All public members of <see cref="ConcurrentHashSet{T}" /> are thread-safe and may be used
/// concurrently from multiple threads.
/// </remarks>
[DebuggerDisplay("Count = {Count}")]
[DebuggerDisplay("{_backingStore.Count}")]
public sealed class ConcurrentHashSet < T > : IReadOnlyCollection < T > , ICollection < T >
{
private const int DEFAULT_CAPACITY = 31 ;
private const int MAX_LOCK_NUMBER = 1024 ;
private static int DefaultConcurrencyLevel
= > PlatformHelper . ProcessorCount ;
/// <summary>
/// Gets a value that indicates whether the <see cref="ConcurrentHashSet{T}" /> is empty.
/// </summary>
/// <value>
/// true if the <see cref="ConcurrentHashSet{T}" /> is empty; otherwise,
/// false.
/// </value>
public bool IsEmpty
{
get
{
var acquiredLocks = 0 ;
try
{
AcquireAllLocks ( ref acquiredLocks ) ;
for ( var i = 0 ; i < tables . CountPerLock . Length ; i + + )
{
if ( tables . CountPerLock [ i ] ! = 0 )
return false ;
}
}
finally
{
ReleaseLocks ( 0 , acquiredLocks ) ;
}
return true ;
}
}
bool ICollection < T > . IsReadOnly
= > false ;
/// <summary>
/// Gets the number of items contained in the
/// <see
/// cref="ConcurrentHashSet{T}" />
/// .
/// </summary>
/// <value>
/// The number of items contained in the
/// <see
/// cref="ConcurrentHashSet{T}" />
/// .
/// </value>
/// <remarks>
/// Count has snapshot semantics and represents the number of items in the
/// <see
/// cref="ConcurrentHashSet{T}" />
/// at the moment when Count was accessed.
/// </remarks>
public int Count
{
get
{
var count = 0 ;
var acquiredLocks = 0 ;
try
{
AcquireAllLocks ( ref acquiredLocks ) ;
for ( var i = 0 ; i < tables . CountPerLock . Length ; i + + )
count + = tables . CountPerLock [ i ] ;
}
finally
{
ReleaseLocks ( 0 , acquiredLocks ) ;
}
return count ;
}
}
private readonly IEqualityComparer < T > _comparer ;
private readonly bool _growLockArray ;
private int budget ;
private volatile Tables tables ;
/// <summary>
/// Initializes a new instance of the
/// <see
/// cref="ConcurrentHashSet{T}" />
/// class that is empty, has the default concurrency level, has the default initial capacity, and
/// uses the default comparer for the item type.
/// </summary>
private readonly ConcurrentDictionary < T , bool > _backingStore ;
public ConcurrentHashSet ( )
: this ( DefaultConcurrencyLevel , DEFAULT_CAPACITY , true , EqualityComparer < T > . Default )
{
}
= > _backingStore = new ( ) ;
/// <summary>
/// Initializes a new instance of the
/// <see
/// cref="ConcurrentHashSet{T}" />
/// class that is empty, has the specified concurrency level and capacity, and uses the default
/// comparer for the item type.
/// </summary>
/// <param name="concurrencyLevel">
/// The estimated number of threads that will update the
/// <see cref="ConcurrentHashSet{T}" /> concurrently.
/// </param>
/// <param name="capacity">
/// The initial number of elements that the
/// <see
/// cref="ConcurrentHashSet{T}" />
/// can contain.
/// </param>
/// <exception cref="T:System.ArgumentOutOfRangeException">
/// <paramref name="concurrencyLevel" /> is
/// less than 1.
/// </exception>
/// <exception cref="T:System.ArgumentOutOfRangeException">
/// <paramref name="capacity" /> is less than
/// 0.
/// </exception>
public ConcurrentHashSet ( int concurrencyLevel , int capacity )
: this ( concurrencyLevel , capacity , false , EqualityComparer < T > . Default )
{
}
public ConcurrentHashSet ( IEnumerable < T > values , IEqualityComparer < T > ? comparer = null )
= > _backingStore = new ( values . Select ( x = > new KeyValuePair < T , bool > ( x , true ) ) , comparer ) ;
/// <summary>
/// Initializes a new instance of the <see cref="ConcurrentHashSet{T}" />
/// class that contains elements copied from the specified
/// <see
/// cref="T:System.Collections.IEnumerable{T}" />
/// , has the default concurrency
/// level, has the default initial capacity, and uses the default comparer for the item type.
/// </summary>
/// <param name="collection">
/// The
/// <see
/// cref="T:System.Collections.IEnumerable{T}" />
/// whose elements are copied to
/// the new
/// <see cref="ConcurrentHashSet{T}" />.
/// </param>
/// <exception cref="T:System.ArgumentNullException"><paramref name="collection" /> is a null reference.</exception>
public ConcurrentHashSet ( IEnumerable < T > collection )
: this ( collection , EqualityComparer < T > . Default )
{
}
/// <summary>
/// Initializes a new instance of the <see cref="ConcurrentHashSet{T}" />
/// class that is empty, has the specified concurrency level and capacity, and uses the specified
/// <see cref="T:System.Collections.Generic.IEqualityComparer{T}" />.
/// </summary>
/// <param name="comparer">
/// The <see cref="T:System.Collections.Generic.IEqualityComparer{T}" />
/// implementation to use when comparing items.
/// </param>
/// <exception cref="T:System.ArgumentNullException"><paramref name="comparer" /> is a null reference.</exception>
public ConcurrentHashSet ( IEqualityComparer < T > comparer )
: this ( DefaultConcurrencyLevel , DEFAULT_CAPACITY , true , comparer )
{
}
/// <summary>
/// Initializes a new instance of the <see cref="ConcurrentHashSet{T}" />
/// class that contains elements copied from the specified
/// <see
/// cref="T:System.Collections.IEnumerable" />
/// , has the default concurrency level, has the default
/// initial capacity, and uses the specified
/// <see cref="T:System.Collections.Generic.IEqualityComparer{T}" />.
/// </summary>
/// <param name="collection">
/// The
/// <see
/// cref="T:System.Collections.IEnumerable{T}" />
/// whose elements are copied to
/// the new
/// <see cref="ConcurrentHashSet{T}" />.
/// </param>
/// <param name="comparer">
/// The <see cref="T:System.Collections.Generic.IEqualityComparer{T}" />
/// implementation to use when comparing items.
/// </param>
/// <exception cref="T:System.ArgumentNullException">
/// <paramref name="collection" /> is a null reference
/// (Nothing in Visual Basic). -or-
/// <paramref name="comparer" /> is a null reference (Nothing in Visual Basic).
/// </exception>
public ConcurrentHashSet ( IEnumerable < T > collection , IEqualityComparer < T > comparer )
: this ( comparer )
{
if ( collection is null )
throw new ArgumentNullException ( nameof ( collection ) ) ;
InitializeFromCollection ( collection ) ;
}
/// <summary>
/// Initializes a new instance of the <see cref="ConcurrentHashSet{T}" />
/// class that contains elements copied from the specified <see cref="T:System.Collections.IEnumerable" />,
/// has the specified concurrency level, has the specified initial capacity, and uses the specified
/// <see cref="T:System.Collections.Generic.IEqualityComparer{T}" />.
/// </summary>
/// <param name="concurrencyLevel">
/// The estimated number of threads that will update the
/// <see cref="ConcurrentHashSet{T}" /> concurrently.
/// </param>
/// <param name="collection">
/// The <see cref="T:System.Collections.IEnumerable{T}" /> whose elements are copied to the new
/// <see cref="ConcurrentHashSet{T}" />.
/// </param>
/// <param name="comparer">
/// The <see cref="T:System.Collections.Generic.IEqualityComparer{T}" /> implementation to use
/// when comparing items.
/// </param>
/// <exception cref="T:System.ArgumentNullException">
/// <paramref name="collection" /> is a null reference.
/// -or-
/// <paramref name="comparer" /> is a null reference.
/// </exception>
/// <exception cref="T:System.ArgumentOutOfRangeException">
/// <paramref name="concurrencyLevel" /> is less than 1.
/// </exception>
public ConcurrentHashSet ( int concurrencyLevel , IEnumerable < T > collection , IEqualityComparer < T > comparer )
: this ( concurrencyLevel , DEFAULT_CAPACITY , false , comparer )
{
if ( collection is null )
throw new ArgumentNullException ( nameof ( collection ) ) ;
if ( comparer is null )
throw new ArgumentNullException ( nameof ( comparer ) ) ;
InitializeFromCollection ( collection ) ;
}
/// <summary>
/// Initializes a new instance of the <see cref="ConcurrentHashSet{T}" />
/// class that is empty, has the specified concurrency level, has the specified initial capacity, and
/// uses the specified <see cref="T:System.Collections.Generic.IEqualityComparer{T}" />.
/// </summary>
/// <param name="concurrencyLevel">
/// The estimated number of threads that will update the
/// <see cref="ConcurrentHashSet{T}" /> concurrently.
/// </param>
/// <param name="capacity">
/// The initial number of elements that the
/// <see
/// cref="ConcurrentHashSet{T}" />
/// can contain.
/// </param>
/// <param name="comparer">
/// The <see cref="T:System.Collections.Generic.IEqualityComparer{T}" />
/// implementation to use when comparing items.
/// </param>
/// <exception cref="T:System.ArgumentOutOfRangeException">
/// <paramref name="concurrencyLevel" /> is less than 1. -or-
/// <paramref name="capacity" /> is less than 0.
/// </exception>
/// <exception cref="T:System.ArgumentNullException"><paramref name="comparer" /> is a null reference.</exception>
public ConcurrentHashSet ( int concurrencyLevel , int capacity , IEqualityComparer < T > comparer )
: this ( concurrencyLevel , capacity , false , comparer )
{
}
private ConcurrentHashSet (
int concurrencyLevel ,
int capacity ,
bool growLockArray ,
IEqualityComparer < T > comparer )
{
if ( concurrencyLevel < 1 )
throw new ArgumentOutOfRangeException ( nameof ( concurrencyLevel ) ) ;
if ( capacity < 0 )
throw new ArgumentOutOfRangeException ( nameof ( capacity ) ) ;
// The capacity should be at least as large as the concurrency level. Otherwise, we would have locks that don't guard
// any buckets.
if ( capacity < concurrencyLevel )
capacity = concurrencyLevel ;
var locks = new object [ concurrencyLevel ] ;
for ( var i = 0 ; i < locks . Length ; i + + )
locks [ i ] = new ( ) ;
var countPerLock = new int [ locks . Length ] ;
var buckets = new Node [ capacity ] ;
tables = new ( buckets , locks , countPerLock ) ;
_growLockArray = growLockArray ;
budget = buckets . Length / locks . Length ;
_comparer = comparer ? ? throw new ArgumentNullException ( nameof ( comparer ) ) ;
}
/// <summary>
/// Removes all items from the <see cref="ConcurrentHashSet{T}" />.
/// </summary>
public void Clear ( )
{
var locksAcquired = 0 ;
try
{
AcquireAllLocks ( ref locksAcquired ) ;
var newTables = new Tables ( new Node [ DEFAULT_CAPACITY ] , tables . Locks , new int [ tables . CountPerLock . Length ] ) ;
tables = newTables ;
budget = Math . Max ( 1 , newTables . Buckets . Length / newTables . Locks . Length ) ;
}
finally
{
ReleaseLocks ( 0 , locksAcquired ) ;
}
}
/// <summary>
/// Determines whether the <see cref="ConcurrentHashSet{T}" /> contains the specified
/// item.
/// </summary>
/// <param name="item">The item to locate in the <see cref="ConcurrentHashSet{T}" />.</param>
/// <returns>true if the <see cref="ConcurrentHashSet{T}" /> contains the item; otherwise, false.</returns>
public bool Contains ( T item )
{
var hashcode = _comparer . GetHashCode ( item ! ) ;
// We must capture the _buckets field in a local variable. It is set to a new table on each table resize.
var localTables = tables ;
var bucketNo = GetBucket ( hashcode , localTables . Buckets . Length ) ;
// We can get away w/out a lock here.
// The Volatile.Read ensures that the load of the fields of 'n' doesn't move before the load from buckets[i].
var current = Volatile . Read ( ref localTables . Buckets [ bucketNo ] ) ;
while ( current is not null )
{
if ( hashcode = = current . Hashcode & & _comparer . Equals ( current . Item , item ) )
return true ;
current = current . Next ;
}
return false ;
}
void ICollection < T > . Add ( T item )
= > Add ( item ) ;
void ICollection < T > . CopyTo ( T [ ] array , int arrayIndex )
{
if ( array is null )
throw new ArgumentNullException ( nameof ( array ) ) ;
if ( arrayIndex < 0 )
throw new ArgumentOutOfRangeException ( nameof ( arrayIndex ) ) ;
var locksAcquired = 0 ;
try
{
AcquireAllLocks ( ref locksAcquired ) ;
var count = 0 ;
for ( var i = 0 ; i < tables . Locks . Length & & count > = 0 ; i + + )
count + = tables . CountPerLock [ i ] ;
if ( array . Length - count < arrayIndex | | count < 0 ) //"count" itself or "count + arrayIndex" can overflow
{
throw new ArgumentException (
"The index is equal to or greater than the length of the array, or the number of elements in the set is greater than the available space from index to the end of the destination array." ) ;
}
CopyToItems ( array , arrayIndex ) ;
}
finally
{
ReleaseLocks ( 0 , locksAcquired ) ;
}
}
bool ICollection < T > . Remove ( T item )
= > TryRemove ( item ) ;
public IEnumerator < T > GetEnumerator ( )
= > _backingStore . Keys . GetEnumerator ( ) ;
IEnumerator IEnumerable . GetEnumerator ( )
= > GetEnumerator ( ) ;
/// <summary>
/// Returns an enumerator that iterates through the
/// <see
/// cref="ConcurrentHashSet{T}" />
/// .
/// </summary>
/// <returns>An enumerator for the <see cref="ConcurrentHashSet{T}" />.</returns>
/// <remarks>
/// The enumerator returned from the collection is safe to use concurrently with
/// reads and writes to the collection, however it does not represent a moment-in-time snapshot
/// of the collection. The contents exposed through the enumerator may contain modifications
/// made to the collection after <see cref="GetEnumerator" /> was called.
/// </remarks>
public IEnumerator < T > GetEnumerator ( )
{
var buckets = tables . Buckets ;
for ( var i = 0 ; i < buckets . Length ; i + + )
{
// The Volatile.Read ensures that the load of the fields of 'current' doesn't move before the load from buckets[i].
var current = Volatile . Read ( ref buckets [ i ] ) ;
while ( current is not null )
{
yield return current . Item ;
current = current . Next ;
}
}
}
/// <summary>
/// Adds the specified item to the <see cref="ConcurrentHashSet{T}" />.
/// </summary>
@@ -447,375 +37,57 @@ public sealed class ConcurrentHashSet<T> : IReadOnlyCollection<T>, ICollection<T
/// contains too many items.
/// </exception>
public bool Add ( T item )
= > AddInternal ( item , _compa rer . GetHashCode ( item ) true ) ;
= > _backingSto re. TryAdd ( item , true ) ;
void ICollection < T > . Add ( T item )
= > Add ( item ) ;
public void Clear ( )
= > _backingStore . Clear ( ) ;
public bool Contains ( T item )
= > _backingStore . ContainsKey ( item ) ;
public void CopyTo ( T [ ] array , int arrayIndex )
{
ArgumentNullException . ThrowIfNull ( array ) ;
if ( arrayIndex < 0 )
throw new ArgumentOutOfRangeException ( nameof ( arrayIndex ) ) ;
if ( arrayIndex > = array . Length )
throw new ArgumentOutOfRangeException ( nameof ( arrayIndex ) ) ;
CopyToInternal ( array , arrayIndex ) ;
}
private void CopyToInternal ( T [ ] array , int arrayIndex )
{
var len = array . Length ;
foreach ( var ( k , _ ) in _backingStore )
{
if ( arrayIndex > = len )
throw new IndexOutOfRangeException ( nameof ( arrayIndex ) ) ;
array [ arrayIndex + + ] = k ;
}
}
bool ICollection < T > . Remove ( T item )
= > TryRemove ( item ) ;
/// <summary>
/// Attempts to remove the item from the <see cref="ConcurrentHashSet{T}" />.
/// </summary>
/// <param name="item">The item to remove.</param>
/// <returns>true if an item was removed successfully; otherwise, false.</returns>
public bool TryRemove ( T item )
= > _backingStore . TryRemove ( item , out _ ) ;
public void RemoveWhere ( Func < T , bool > predicate )
{
var hashcode = _comparer . GetHashCode ( i tem ) ;
whil e ( true )
{
var localTables = tables ;
GetBucketAndLockNo ( hashcode ,
out var bucketNo ,
out var lockNo ,
localTables . Buckets . Length ,
localTables . Locks . Length ) ;
lock ( localTables . Locks [ lockNo ] )
{
// If the table just got resized, we may not be holding the right lock, and must retry.
// This should be a rare occurrence.
if ( localTables ! = tables )
continue ;
Node previous = null ;
for ( var current = localTables . Buckets [ bucketNo ] ; current is not null ; current = current . Next )
{
Debug . Assert ( ( previous is null & & current = = localTables . Buckets [ bucketNo ] )
| | previous ! . Next = = current ) ;
if ( hashcode = = current . Hashcode & & _comparer . Equals ( current . Item , item ) )
{
if ( previous is null )
Volatile . Write ( ref localTables . Buckets [ bucketNo ] , current . Next ) ;
else
previous . Next = current . Next ;
localTables . CountPerLock [ lockNo ] - - ;
return true ;
}
previous = current ;
}
}
return false ;
}
foreach ( var elem in this . Where ( predica te) )
TryRemov e ( elem ) ;
}
private void InitializeFromCollection ( IEnumerable < T > collection )
{
foreach ( var item in collection )
AddInternal ( item , _comparer . GetHashCode ( item ) , false ) ;
public int Count
= > _backingStore . Count ;
if ( budget = = 0 )
budget = tables . Buckets . Length / tables . Locks . Length ;
}
private bool AddInternal ( T item , int hashcode , bool acquireLock )
{
while ( true )
{
var localTables = tables ;
GetBucketAndLockNo ( hashcode ,
out var bucketNo ,
out var lockNo ,
localTables . Buckets . Length ,
localTables . Locks . Length ) ;
var resizeDesired = false ;
var lockTaken = false ;
try
{
if ( acquireLock )
Monitor . Enter ( localTables . Locks [ lockNo ] , ref lockTaken ) ;
// If the table just got resized, we may not be holding the right lock, and must retry.
// This should be a rare occurrence.
if ( localTables ! = tables )
continue ;
// Try to find this item in the bucket
Node previous = null ;
for ( var current = localTables . Buckets [ bucketNo ] ; current is not null ; current = current . Next )
{
Debug . Assert ( ( previous is null & & current = = localTables . Buckets [ bucketNo ] )
| | previous ! . Next = = current ) ;
if ( hashcode = = current . Hashcode & & _comparer . Equals ( current . Item , item ) )
return false ;
previous = current ;
}
// The item was not found in the bucket. Insert the new item.
Volatile . Write ( ref localTables . Buckets [ bucketNo ] , new ( item , hashcode , localTables . Buckets [ bucketNo ] ) ) ;
checked
{
localTables . CountPerLock [ lockNo ] + + ;
}
//
// If the number of elements guarded by this lock has exceeded the budget, resize the bucket table.
// It is also possible that GrowTable will increase the budget but won't resize the bucket table.
// That happens if the bucket table is found to be poorly utilized due to a bad hash function.
//
if ( localTables . CountPerLock [ lockNo ] > budget )
resizeDesired = true ;
}
finally
{
if ( lockTaken )
Monitor . Exit ( localTables . Locks [ lockNo ] ) ;
}
//
// The fact that we got here means that we just performed an insertion. If necessary, we will grow the table.
//
// Concurrency notes:
// - Notice that we are not holding any locks at when calling GrowTable. This is necessary to prevent deadlocks.
// - As a result, it is possible that GrowTable will be called unnecessarily. But, GrowTable will obtain lock 0
// and then verify that the table we passed to it as the argument is still the current table.
//
if ( resizeDesired )
GrowTable ( localTables ) ;
return true ;
}
}
private static int GetBucket ( int hashcode , int bucketCount )
{
var bucketNo = ( hashcode & 0x7fffffff ) % bucketCount ;
Debug . Assert ( bucketNo > = 0 & & bucketNo < bucketCount ) ;
return bucketNo ;
}
private static void GetBucketAndLockNo (
int hashcode ,
out int bucketNo ,
out int lockNo ,
int bucketCount ,
int lockCount )
{
bucketNo = ( hashcode & 0x7fffffff ) % bucketCount ;
lockNo = bucketNo % lockCount ;
Debug . Assert ( bucketNo > = 0 & & bucketNo < bucketCount ) ;
Debug . Assert ( lockNo > = 0 & & lockNo < lockCount ) ;
}
private void GrowTable ( Tables localTables )
{
const int maxArrayLength = 0X7FEFFFFF ;
var locksAcquired = 0 ;
try
{
// The thread that first obtains _locks[0] will be the one doing the resize operation
AcquireLocks ( 0 , 1 , ref locksAcquired ) ;
// Make sure nobody resized the table while we were waiting for lock 0:
if ( localTables ! = tables )
// We assume that since the table reference is different, it was already resized (or the budget
// was adjusted). If we ever decide to do table shrinking, or replace the table for other reasons,
// we will have to revisit this logic.
return ;
// Compute the (approx.) total size. Use an Int64 accumulation variable to avoid an overflow.
long approxCount = 0 ;
for ( var i = 0 ; i < localTables . CountPerLock . Length ; i + + )
approxCount + = localTables . CountPerLock [ i ] ;
//
// If the bucket array is too empty, double the budget instead of resizing the table
//
if ( approxCount < localTables . Buckets . Length / 4 )
{
budget = 2 * budget ;
if ( budget < 0 )
budget = int . MaxValue ;
return ;
}
// Compute the new table size. We find the smallest integer larger than twice the previous table size, and not divisible by
// 2,3,5 or 7. We can consider a different table-sizing policy in the future.
var newLength = 0 ;
var maximizeTableSize = false ;
try
{
checked
{
// Double the size of the buckets table and add one, so that we have an odd integer.
newLength = ( localTables . Buckets . Length * 2 ) + 1 ;
// Now, we only need to check odd integers, and find the first that is not divisible
// by 3, 5 or 7.
while ( newLength % 3 = = 0 | | newLength % 5 = = 0 | | newLength % 7 = = 0 )
newLength + = 2 ;
Debug . Assert ( newLength % 2 ! = 0 ) ;
if ( newLength > maxArrayLength )
maximizeTableSize = true ;
}
}
catch ( OverflowException )
{
maximizeTableSize = true ;
}
if ( maximizeTableSize )
{
newLength = maxArrayLength ;
// We want to make sure that GrowTable will not be called again, since table is at the maximum size.
// To achieve that, we set the budget to int.MaxValue.
//
// (There is one special case that would allow GrowTable() to be called in the future:
// calling Clear() on the ConcurrentHashSet will shrink the table and lower the budget.)
budget = int . MaxValue ;
}
// Now acquire all other locks for the table
AcquireLocks ( 1 , localTables . Locks . Length , ref locksAcquired ) ;
var newLocks = localTables . Locks ;
// Add more locks
if ( _growLockArray & & localTables . Locks . Length < MAX_LOCK_NUMBER )
{
newLocks = new object [ localTables . Locks . Length * 2 ] ;
Array . Copy ( localTables . Locks , 0 , newLocks , 0 , localTables . Locks . Length ) ;
for ( var i = localTables . Locks . Length ; i < newLocks . Length ; i + + )
newLocks [ i ] = new ( ) ;
}
var newBuckets = new Node [ newLength ] ;
var newCountPerLock = new int [ newLocks . Length ] ;
// Copy all data into a new table, creating new nodes for all elements
for ( var i = 0 ; i < localTables . Buckets . Length ; i + + )
{
var current = localTables . Buckets [ i ] ;
while ( current is not null )
{
var next = current . Next ;
GetBucketAndLockNo ( current . Hashcode ,
out var newBucketNo ,
out var newLockNo ,
newBuckets . Length ,
newLocks . Length ) ;
newBuckets [ newBucketNo ] = new ( current . Item , current . Hashcode , newBuckets [ newBucketNo ] ) ;
checked
{
newCountPerLock [ newLockNo ] + + ;
}
current = next ;
}
}
// Adjust the budget
budget = Math . Max ( 1 , newBuckets . Length / newLocks . Length ) ;
// Replace tables with the new versions
tables = new ( newBuckets , newLocks , newCountPerLock ) ;
}
finally
{
// Release all locks that we took earlier
ReleaseLocks ( 0 , locksAcquired ) ;
}
}
public int RemoveWhere ( Func < T , bool > predicate )
{
var elems = this . Where ( predicate ) ;
var removed = 0 ;
foreach ( var elem in elems )
{
if ( TryRemove ( elem ) )
removed + + ;
}
return removed ;
}
private void AcquireAllLocks ( ref int locksAcquired )
{
// First, acquire lock 0
AcquireLocks ( 0 , 1 , ref locksAcquired ) ;
// Now that we have lock 0, the _locks array will not change (i.e., grow),
// and so we can safely read _locks.Length.
AcquireLocks ( 1 , tables . Locks . Length , ref locksAcquired ) ;
Debug . Assert ( locksAcquired = = tables . Locks . Length ) ;
}
private void AcquireLocks ( int fromInclusive , int toExclusive , ref int locksAcquired )
{
Debug . Assert ( fromInclusive < = toExclusive ) ;
var locks = tables . Locks ;
for ( var i = fromInclusive ; i < toExclusive ; i + + )
{
var lockTaken = false ;
try
{
Monitor . Enter ( locks [ i ] , ref lockTaken ) ;
}
finally
{
if ( lockTaken )
locksAcquired + + ;
}
}
}
private void ReleaseLocks ( int fromInclusive , int toExclusive )
{
Debug . Assert ( fromInclusive < = toExclusive ) ;
for ( var i = fromInclusive ; i < toExclusive ; i + + )
Monitor . Exit ( tables . Locks [ i ] ) ;
}
private void CopyToItems ( T [ ] array , int index )
{
var buckets = tables . Buckets ;
for ( var i = 0 ; i < buckets . Length ; i + + )
for ( var current = buckets [ i ] ; current is not null ; current = current . Next )
{
array [ index ] = current . Item ;
index + + ; //this should never flow, CopyToItems is only called when there's no overflow risk
}
}
private sealed class Tables
{
public readonly Node [ ] Buckets ;
public readonly object [ ] Locks ;
public volatile int [ ] CountPerLock ;
public Tables ( Node [ ] buckets , object [ ] locks , int [ ] countPerLock )
{
Buckets = buckets ;
Locks = locks ;
CountPerLock = countPerLock ;
}
}
private sealed class Node
{
public readonly int Hashcode ;
public readonly T Item ;
public volatile Node Next ;
public Node ( T item , int hashcode , Node next )
{
Item = item ;
Hashcode = hashcode ;
Next = next ;
}
}
public bool IsReadOnly
= > false ;
}
Kwoth