68 lines
1.6 KiB
C#
68 lines
1.6 KiB
C#
using System.Collections;
|
|
using System.Collections.Concurrent;
|
|
using System.Reactive.Disposables;
|
|
|
|
namespace Toolkit.Foundation;
|
|
|
|
public class Cache<TValue>(IDisposer disposer,
|
|
IComparer<TValue> comparer) :
|
|
ICache<TValue>
|
|
{
|
|
private readonly SortedSet<TValue> cache = new(comparer);
|
|
|
|
public void Add(TValue value)
|
|
{
|
|
if (value is null)
|
|
{
|
|
return;
|
|
}
|
|
|
|
disposer.Add(value, Disposable.Create(() => Remove(value)));
|
|
cache.Add(value);
|
|
}
|
|
|
|
public void Clear() => cache.Clear();
|
|
|
|
public IEnumerator<TValue> GetEnumerator() => cache.GetEnumerator();
|
|
|
|
IEnumerator IEnumerable.GetEnumerator() => GetEnumerator();
|
|
|
|
public bool Remove(TValue value) => cache.Remove(value);
|
|
}
|
|
|
|
public class Cache<TKey, TValue> :
|
|
ICache<TKey, TValue>
|
|
where TKey :
|
|
notnull
|
|
where TValue :
|
|
notnull
|
|
{
|
|
private readonly ConcurrentDictionary<TKey, TValue> cache = new();
|
|
|
|
public void Add(TKey key,
|
|
TValue value)
|
|
{
|
|
cache.TryAdd(key, value);
|
|
}
|
|
|
|
public void Clear() => cache.Clear();
|
|
|
|
public bool ContainsKey(TKey key) => cache.ContainsKey(key);
|
|
|
|
public IEnumerator<KeyValuePair<TKey, TValue>> GetEnumerator() => cache.GetEnumerator();
|
|
|
|
IEnumerator IEnumerable.GetEnumerator() => GetEnumerator();
|
|
|
|
public bool Remove(TKey key) => cache.Remove(key, out _);
|
|
|
|
public bool TryGetValue(TKey key, out TValue? value)
|
|
{
|
|
if (cache.TryGetValue(key, out value))
|
|
{
|
|
return true;
|
|
}
|
|
|
|
value = default;
|
|
return false;
|
|
}
|
|
} |