mirror of
https://github.com/ldqk/Masuit.Tools.git
synced 2026-10-26 19:00:00 +08:00
379 lines
7.4 KiB
C#
379 lines
7.4 KiB
C#
using System;
|
|
using System.Collections;
|
|
using System.Collections.Generic;
|
|
using System.Runtime.Serialization;
|
|
using System.Threading;
|
|
|
|
namespace Masuit.Tools.Systems;
|
|
|
|
/// <summary>
|
|
/// 并发HashSet
|
|
/// </summary>
|
|
/// <typeparam name="T"></typeparam>
|
|
public sealed class ConcurrentHashSet<T> : ISet<T>, IDisposable
|
|
{
|
|
private readonly ReaderWriterLockSlim _lock = new(LockRecursionPolicy.SupportsRecursion);
|
|
|
|
private readonly HashSet<T> _hashSet = new();
|
|
|
|
public int Count
|
|
{
|
|
get
|
|
{
|
|
_lock.EnterWriteLock();
|
|
try
|
|
{
|
|
return _hashSet.Count;
|
|
}
|
|
finally
|
|
{
|
|
if (_lock.IsWriteLockHeld)
|
|
{
|
|
_lock.ExitWriteLock();
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
public bool IsReadOnly => false;
|
|
|
|
public ConcurrentHashSet()
|
|
{
|
|
}
|
|
|
|
public ConcurrentHashSet(IEqualityComparer<T> comparer)
|
|
{
|
|
_hashSet = new HashSet<T>(comparer);
|
|
}
|
|
|
|
public ConcurrentHashSet(IEnumerable<T> collection)
|
|
{
|
|
_hashSet = new HashSet<T>(collection);
|
|
}
|
|
|
|
public ConcurrentHashSet(IEnumerable<T> collection, IEqualityComparer<T> comparer)
|
|
{
|
|
_hashSet = new HashSet<T>(collection, comparer);
|
|
}
|
|
|
|
public ConcurrentHashSet(SerializationInfo info, StreamingContext context)
|
|
{
|
|
_hashSet = new HashSet<T>();
|
|
var iSerializable = (ISerializable)_hashSet;
|
|
iSerializable.GetObjectData(info, context);
|
|
}
|
|
|
|
public void OnDeserialization(object sender)
|
|
{
|
|
_hashSet.OnDeserialization(sender);
|
|
}
|
|
|
|
public void GetObjectData(SerializationInfo info, StreamingContext context)
|
|
{
|
|
_hashSet.GetObjectData(info, context);
|
|
}
|
|
|
|
IEnumerator IEnumerable.GetEnumerator()
|
|
{
|
|
return GetEnumerator();
|
|
}
|
|
|
|
public IEnumerator<T> GetEnumerator()
|
|
{
|
|
return _hashSet.GetEnumerator();
|
|
}
|
|
|
|
public void Add(T item)
|
|
{
|
|
_lock.EnterWriteLock();
|
|
try
|
|
{
|
|
_hashSet.Add(item);
|
|
}
|
|
finally
|
|
{
|
|
if (_lock.IsWriteLockHeld)
|
|
{
|
|
_lock.ExitWriteLock();
|
|
}
|
|
}
|
|
}
|
|
|
|
public void UnionWith(IEnumerable<T> other)
|
|
{
|
|
_lock.EnterWriteLock();
|
|
_lock.EnterReadLock();
|
|
try
|
|
{
|
|
_hashSet.UnionWith(other);
|
|
}
|
|
finally
|
|
{
|
|
if (_lock.IsWriteLockHeld)
|
|
{
|
|
_lock.ExitWriteLock();
|
|
}
|
|
|
|
if (_lock.IsReadLockHeld)
|
|
{
|
|
_lock.ExitReadLock();
|
|
}
|
|
}
|
|
}
|
|
|
|
public void IntersectWith(IEnumerable<T> other)
|
|
{
|
|
_lock.EnterWriteLock();
|
|
_lock.EnterReadLock();
|
|
try
|
|
{
|
|
_hashSet.IntersectWith(other);
|
|
}
|
|
finally
|
|
{
|
|
if (_lock.IsWriteLockHeld)
|
|
{
|
|
_lock.ExitWriteLock();
|
|
}
|
|
|
|
if (_lock.IsReadLockHeld)
|
|
{
|
|
_lock.ExitReadLock();
|
|
}
|
|
}
|
|
}
|
|
|
|
public void ExceptWith(IEnumerable<T> other)
|
|
{
|
|
_lock.EnterWriteLock();
|
|
_lock.EnterReadLock();
|
|
try
|
|
{
|
|
_hashSet.ExceptWith(other);
|
|
}
|
|
finally
|
|
{
|
|
if (_lock.IsWriteLockHeld)
|
|
{
|
|
_lock.ExitWriteLock();
|
|
}
|
|
|
|
if (_lock.IsReadLockHeld)
|
|
{
|
|
_lock.ExitReadLock();
|
|
}
|
|
}
|
|
}
|
|
|
|
public void SymmetricExceptWith(IEnumerable<T> other)
|
|
{
|
|
_lock.EnterWriteLock();
|
|
try
|
|
{
|
|
_hashSet.SymmetricExceptWith(other);
|
|
}
|
|
finally
|
|
{
|
|
if (_lock.IsWriteLockHeld)
|
|
{
|
|
_lock.ExitWriteLock();
|
|
}
|
|
}
|
|
}
|
|
|
|
public bool IsSubsetOf(IEnumerable<T> other)
|
|
{
|
|
_lock.EnterWriteLock();
|
|
try
|
|
{
|
|
return _hashSet.IsSubsetOf(other);
|
|
}
|
|
finally
|
|
{
|
|
if (_lock.IsWriteLockHeld)
|
|
{
|
|
_lock.ExitWriteLock();
|
|
}
|
|
}
|
|
}
|
|
|
|
public bool IsSupersetOf(IEnumerable<T> other)
|
|
{
|
|
_lock.EnterWriteLock();
|
|
try
|
|
{
|
|
return _hashSet.IsSupersetOf(other);
|
|
}
|
|
finally
|
|
{
|
|
if (_lock.IsWriteLockHeld)
|
|
{
|
|
_lock.ExitWriteLock();
|
|
}
|
|
}
|
|
}
|
|
|
|
public bool IsProperSupersetOf(IEnumerable<T> other)
|
|
{
|
|
_lock.EnterWriteLock();
|
|
try
|
|
{
|
|
return _hashSet.IsProperSupersetOf(other);
|
|
}
|
|
finally
|
|
{
|
|
if (_lock.IsWriteLockHeld)
|
|
{
|
|
_lock.ExitWriteLock();
|
|
}
|
|
}
|
|
}
|
|
|
|
public bool IsProperSubsetOf(IEnumerable<T> other)
|
|
{
|
|
_lock.EnterWriteLock();
|
|
try
|
|
{
|
|
return _hashSet.IsProperSubsetOf(other);
|
|
}
|
|
finally
|
|
{
|
|
if (_lock.IsWriteLockHeld)
|
|
{
|
|
_lock.ExitWriteLock();
|
|
}
|
|
}
|
|
}
|
|
|
|
public bool Overlaps(IEnumerable<T> other)
|
|
{
|
|
_lock.EnterWriteLock();
|
|
try
|
|
{
|
|
return _hashSet.Overlaps(other);
|
|
}
|
|
finally
|
|
{
|
|
if (_lock.IsWriteLockHeld)
|
|
{
|
|
_lock.ExitWriteLock();
|
|
}
|
|
}
|
|
}
|
|
|
|
public bool SetEquals(IEnumerable<T> other)
|
|
{
|
|
_lock.EnterWriteLock();
|
|
try
|
|
{
|
|
return _hashSet.SetEquals(other);
|
|
}
|
|
finally
|
|
{
|
|
if (_lock.IsWriteLockHeld)
|
|
{
|
|
_lock.ExitWriteLock();
|
|
}
|
|
}
|
|
}
|
|
|
|
bool ISet<T>.Add(T item)
|
|
{
|
|
_lock.EnterWriteLock();
|
|
try
|
|
{
|
|
return _hashSet.Add(item);
|
|
}
|
|
finally
|
|
{
|
|
if (_lock.IsWriteLockHeld)
|
|
{
|
|
_lock.ExitWriteLock();
|
|
}
|
|
}
|
|
}
|
|
|
|
public void Clear()
|
|
{
|
|
_lock.EnterWriteLock();
|
|
try
|
|
{
|
|
_hashSet.Clear();
|
|
}
|
|
finally
|
|
{
|
|
if (_lock.IsWriteLockHeld)
|
|
{
|
|
_lock.ExitWriteLock();
|
|
}
|
|
}
|
|
}
|
|
|
|
public bool Contains(T item)
|
|
{
|
|
_lock.EnterWriteLock();
|
|
try
|
|
{
|
|
return _hashSet.Contains(item);
|
|
}
|
|
finally
|
|
{
|
|
if (_lock.IsWriteLockHeld)
|
|
{
|
|
_lock.ExitWriteLock();
|
|
}
|
|
}
|
|
}
|
|
|
|
public void CopyTo(T[] array, int arrayIndex)
|
|
{
|
|
_lock.EnterWriteLock();
|
|
try
|
|
{
|
|
_hashSet.CopyTo(array, arrayIndex);
|
|
}
|
|
finally
|
|
{
|
|
if (_lock.IsWriteLockHeld)
|
|
{
|
|
_lock.ExitWriteLock();
|
|
}
|
|
}
|
|
}
|
|
|
|
public bool Remove(T item)
|
|
{
|
|
_lock.EnterWriteLock();
|
|
try
|
|
{
|
|
return _hashSet.Remove(item);
|
|
}
|
|
finally
|
|
{
|
|
if (_lock.IsWriteLockHeld)
|
|
{
|
|
_lock.ExitWriteLock();
|
|
}
|
|
}
|
|
}
|
|
|
|
public void Dispose()
|
|
{
|
|
Dispose(true);
|
|
GC.SuppressFinalize(this);
|
|
}
|
|
|
|
private void Dispose(bool disposing)
|
|
{
|
|
if (disposing && _lock != null)
|
|
{
|
|
_lock.Dispose();
|
|
}
|
|
}
|
|
|
|
~ConcurrentHashSet()
|
|
{
|
|
Dispose(false);
|
|
}
|
|
}
|