youmuliu/stgsharp
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

daily update on 20240206 by nitload youmu, token parser change to use regex generator

Browse Source
This commit is contained in:
Nitload
2025-02-06 07:45:06 +08:00
parent 4e5a1b0dfb
commit 7d0470d50b
104 changed files with 2752 additions and 3134 deletions
Download Patch File Download Diff File Expand all files Collapse all files
内核源代码/StgSharp.Common/Collections/BidirectionalDictionary.cs
+57 -73
View File
@@ -49,55 +49,47 @@ namespace StgSharp.Commom.Collections
_reverse = new Dictionary<TSecond, TFirst>();
}
public TFirst this[TSecond key]
public TFirst this[ TSecond key ]
{
get
{
if (_reverse.TryGetValue(key, out TFirst value))
{
if( _reverse.TryGetValue( key, out TFirst value ) ) {
return value;
}
throw new ArgumentException(
$"Cannot find key {key!.ToString()} in dictionary.");
$"Cannot find key {key!.ToString()} in dictionary." );
}
set
{
if (_reverse.TryGetValue(key, out TFirst origin))
{
_reverse[key] = value;
_forward.Remove(origin);
if( _reverse.TryGetValue( key, out TFirst origin ) ) {
_reverse[ key ] = value;
_forward.Remove( origin );
} else {
_reverse.Add( key, value );
}
else
{
_reverse.Add(key, value);
}
_forward.Add(value, key);
_forward.Add( value, key );
}
}
public TSecond this[TFirst key]
public TSecond this[ TFirst key ]
{
get
{
if (_forward.TryGetValue(key, out TSecond value))
{
if( _forward.TryGetValue( key, out TSecond value ) ) {
return value;
}
throw new ArgumentException(
$"Cannot find key {key!.ToString()} in dictionary.");
$"Cannot find key {key!.ToString()} in dictionary." );
}
set
{
if (_forward.TryGetValue(key, out TSecond origin))
{
_forward[key] = value;
_reverse.Remove(origin);
if( _forward.TryGetValue( key, out TSecond origin ) ) {
_forward[ key ] = value;
_reverse.Remove( origin );
} else {
_forward.Add( key, value );
}
else
{
_forward.Add(key, value);
}
_reverse.Add(value, key);
_reverse.Add( value, key );
}
}
@@ -110,30 +102,28 @@ namespace StgSharp.Commom.Collections
public int Count => _forward.Count;
public IReadOnlyDictionary<TFirst, TSecond> Forward => new ReadOnlyDictionary<TFirst, TSecond>(
_forward);
_forward );
public IReadOnlyDictionary<TSecond, TFirst> Reverse => new ReadOnlyDictionary<TSecond, TFirst>(
_reverse);
_reverse );
public void Add(KeyValuePair<TFirst, TSecond> item)
public void Add( KeyValuePair<TFirst, TSecond> item )
{
if (_forward.ContainsKey(item.Key) || _reverse.ContainsKey(
item.Value))
{
throw new ArgumentException("Duplicate key or value.");
if( _forward.ContainsKey( item.Key ) || _reverse.ContainsKey(
item.Value ) ) {
throw new ArgumentException( "Duplicate key or value." );
}
_forward.Add(item.Key, item.Value);
_reverse.Add(item.Value, item.Key);
_forward.Add( item.Key, item.Value );
_reverse.Add( item.Value, item.Key );
}
public void Add(TFirst key, TSecond value)
public void Add( TFirst key, TSecond value )
{
if (_forward.ContainsKey(key) || _reverse.ContainsKey(value))
{
throw new ArgumentException("Duplicate key or value.");
if( _forward.ContainsKey( key ) || _reverse.ContainsKey( value ) ) {
throw new ArgumentException( "Duplicate key or value." );
}
_forward.Add(key, value);
_reverse.Add(value, key);
_forward.Add( key, value );
_reverse.Add( value, key );
}
public void Clear()
@@ -142,76 +132,70 @@ namespace StgSharp.Commom.Collections
_reverse.Clear();
}
public bool Contains(KeyValuePair<TFirst, TSecond> item)
public bool Contains( KeyValuePair<TFirst, TSecond> item )
{
return _forward.Contains(item) && _reverse.TryGetValue(
item.Value, out TFirst var) && var!.Equals(item.Key);
return _forward.Contains( item ) && _reverse.TryGetValue(
item.Value, out TFirst var ) && var!.Equals( item.Key );
}
public bool Contains(TSecond key)
public bool Contains( TSecond key )
{
return _reverse.ContainsKey(key);
return _reverse.ContainsKey( key );
}
public bool Contains(TFirst key)
public bool Contains( TFirst key )
{
return _forward.ContainsKey(key);
return _forward.ContainsKey( key );
}
public void CopyTo(
KeyValuePair<TFirst, TSecond>[] array,
int arrayIndex)
KeyValuePair<TFirst, TSecond>[] array,
int arrayIndex )
{
if (array == null)
{
throw new ArgumentNullException(nameof(array));
if( array == null ) {
throw new ArgumentNullException( nameof( array ) );
}
if (arrayIndex < 0 || arrayIndex > array.Length)
{
throw new ArgumentOutOfRangeException(nameof(arrayIndex));
if( arrayIndex < 0 || arrayIndex > array.Length ) {
throw new ArgumentOutOfRangeException( nameof( arrayIndex ) );
}
if (array.Length - arrayIndex < _forward.Count)
{
if( array.Length - arrayIndex < _forward.Count ) {
throw new ArgumentException(
"The array is too small to copy the elements.");
"The array is too small to copy the elements." );
}
foreach (KeyValuePair<TFirst, TSecond> pair in _forward)
{
array[arrayIndex++] = pair;
foreach( KeyValuePair<TFirst, TSecond> pair in _forward ) {
array[ arrayIndex++ ] = pair;
}
}
public IEnumerator<KeyValuePair<TFirst, TSecond>> GetEnumerator()
{
foreach (KeyValuePair<TFirst, TSecond> pair in _forward)
{
foreach( KeyValuePair<TFirst, TSecond> pair in _forward ) {
yield return pair;
}
}
public bool Remove(TFirst key)
public bool Remove( TFirst key )
{
throw new NotImplementedException();
}
public bool Remove(KeyValuePair<TFirst, TSecond> item)
public bool Remove( KeyValuePair<TFirst, TSecond> item )
{
if (_forward.Remove(item.Key))
{
return _reverse.Remove(item.Value);
if( _forward.Remove( item.Key ) ) {
return _reverse.Remove( item.Value );
}
return false;
}
public bool TryGetValue(TFirst key, out TSecond value)
public bool TryGetValue( TFirst key, out TSecond value )
{
return _forward.TryGetValue(key, out value);
return _forward.TryGetValue( key, out value );
}
public bool TryGetValue(TSecond key, out TFirst value)
public bool TryGetValue( TSecond key, out TFirst value )
{
return _reverse.TryGetValue(key, out value);
return _reverse.TryGetValue( key, out value );
}
IEnumerator IEnumerable.GetEnumerator()
内核源代码/StgSharp.Common/Collections/CachePool.cs
+51 -15
View File
@@ -1,4 +1,34 @@
using StgSharp.Graphics.OpenGL;
//-----------------------------------------------------------------------
//-----------------------------------------------------------------------
// file="CachePool.cs"
// Project: StgSharp
// AuthorGroup: Nitload Space
// Copyright (c) Nitload Space. All rights reserved.
//
// Permission is hereby granted, free of charge, to any person
// obtaining a copy of this software and associated documentation
// files (the “Software”), to deal in the Software without restriction,
// including without limitation the rights to use, copy, modify, merge,
// publish, distribute, sublicense, and/or sell copies of the Software,
// and to permit persons to whom the Software is furnished to do so,
// subject to the following conditions:
//
// The above copyright notice and
// this permission notice shall be included in all copies
// or substantial portions of the Software.
//
// THE SOFTWARE IS PROVIDED “AS IS”,
// WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED,
// INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
// IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,
// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,
// ARISING FROM, OUT OF OR IN CONNECTION WITH
// THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
//
//-----------------------------------------------------------------------
//-----------------------------------------------------------------------
using StgSharp.Graphics.OpenGL;
using System;
using System.Collections;
@@ -10,34 +40,47 @@ namespace StgSharp.Commom.Collections
{
public interface IPoolable
{
public int ID { get; }
public int ID
{
get;
}
}
public class CacheIndexPool<T> : IEnumerable<T> where T : IPoolable
public class CacheIndexPool<T> : IEnumerable<T> where T: IPoolable
{
private ConcurrentDictionary<int, T> _cache;
private Func<T> _defaultCreater;
public CacheIndexPool(Func<T> defaultCreater)
public CacheIndexPool( Func<T> defaultCreater )
{
_cache = new ConcurrentDictionary<int, T>();
_defaultCreater = defaultCreater;
}
public T this[int index]
public T this[ int index ]
{
get
{
if (_cache.TryGetValue(index, out T value))
{
if( _cache.TryGetValue( index, out T value ) ) {
return value;
}
T newValue = _defaultCreater();
_cache.TryAdd(index, newValue);
_cache.TryAdd( index, newValue );
return newValue;
}
}
public T CreateObject()
{
T _new = _defaultCreater();
_cache.AddOrUpdate( 1, _new, static( _, origin ) => origin );
throw new NotImplementedException();
return _new;
}
public IEnumerator<T> GetEnumerator()
{
return _cache.Values.GetEnumerator();
@@ -48,12 +91,5 @@ namespace StgSharp.Commom.Collections
return GetEnumerator();
}
public T CreateObject()
{
T _new = _defaultCreater();
_cache.AddOrUpdate(1, _new,static (_,origin)=>origin);
throw new NotImplementedException();
return _new;
}
}
}
内核源代码/StgSharp.Common/Collections/CapacityFixedList.cs
+36 -49
View File
@@ -38,28 +38,26 @@ namespace StgSharp.Commom.Collections
{
internal class CapacityFixedList<T> : IList<T>
{
private T[] values;
private int capacity, _index;
public CapacityFixedList(int size)
public CapacityFixedList( int size )
{
values = new T[size];
}
public T this[int index]
public T this[ int index ]
{
get => index < _index ?
values[index] : throw new ArgumentOutOfRangeException(
nameof(index));
values[ index ] : throw new ArgumentOutOfRangeException(
nameof( index ) );
set
{
if (index < _index)
{
values[index] = value;
}
else
{
throw new ArgumentOutOfRangeException(nameof(index));
if( index < _index ) {
values[ index ] = value;
} else {
throw new ArgumentOutOfRangeException( nameof( index ) );
}
}
}
@@ -68,12 +66,11 @@ namespace StgSharp.Commom.Collections
public int Count => _index + 1;
public void Add(T item)
public void Add( T item )
{
if (_index < capacity - 1)
{
if( _index < capacity - 1 ) {
_index++;
this[_index] = item;
this[ _index ] = item;
}
}
@@ -83,52 +80,45 @@ namespace StgSharp.Commom.Collections
_index = 0;
}
public bool Contains(T item)
public bool Contains( T item )
{
for (int i = 0; i <= _index; i++)
{
if (item.Equals(values[i]))
{
for( int i = 0; i <= _index; i++ ) {
if( item.Equals( values[ i ] ) ) {
return true;
}
}
return false;
}
public void CopyTo(T[] array, int arrayIndex)
public void CopyTo( T[] array, int arrayIndex )
{
values.CopyTo(array, arrayIndex);
values.CopyTo( array, arrayIndex );
}
public IEnumerator<T> GetEnumerator()
{
for (int i = 0; i <= _index; i++)
{
yield return values[i];
for( int i = 0; i <= _index; i++ ) {
yield return values[ i ];
}
}
public int IndexOf(T item)
public int IndexOf( T item )
{
T v;
for (int i = 0; i <= _index; i++)
{
if ((v = values[i]) != null && v.Equals(item))
{
for( int i = 0; i <= _index; i++ ) {
if( ( v = values[ i ] ) != null && v.Equals( item ) ) {
return i;
}
}
return -1;
}
public bool Remove(T item)
public bool Remove( T item )
{
T v;
for (int i = 0; i <= _index; i++)
{
if ((v = values[i]) != null && v.Equals(item))
{
values[i] = values[_index];
for( int i = 0; i <= _index; i++ ) {
if( ( v = values[ i ] ) != null && v.Equals( item ) ) {
values[ i ] = values[ _index ];
_index--;
return true;
}
@@ -136,30 +126,27 @@ namespace StgSharp.Commom.Collections
return false;
}
public void RemoveAll(Predicate<T> predicate)
public void RemoveAll( Predicate<T> predicate )
{
for (int i = _index; i > 0; i--)
{
if (predicate(values[i]))
{
values[i] = values[_index];
for( int i = _index; i > 0; i-- ) {
if( predicate( values[ i ] ) ) {
values[ i ] = values[ _index ];
_index--;
}
}
}
public void RemoveAt(int index)
public void RemoveAt( int index )
{
if (index <= _index)
{
values[index] = values[_index];
if( index <= _index ) {
values[ index ] = values[ _index ];
_index--;
}
}
public void Resize(int newSize)
public void Resize( int newSize )
{
Array.Resize(ref values, newSize);
Array.Resize( ref values, newSize );
}
IEnumerator IEnumerable.GetEnumerator()
@@ -167,7 +154,7 @@ namespace StgSharp.Commom.Collections
yield return GetEnumerator();
}
void IList<T>.Insert(int index, T item)
void IList<T>.Insert( int index, T item )
{
throw new NotSupportedException();
}
内核源代码/StgSharp.Common/Collections/IBidrirectionalDictionary.cs
+7 -7
View File
@@ -38,7 +38,7 @@ namespace StgSharp.Commom.Collections
public interface IBidirectionalDictionary<TFirst, TSecond> : IDictionary<TFirst, TSecond>
{
public TFirst this[TSecond key]
public TFirst this[ TSecond key ]
{
get;
set;
@@ -73,7 +73,7 @@ namespace StgSharp.Commom.Collections
/// true if the <see cref="IBidirectionalDictionary{TFirst, TSecond}" /> contains an element
/// with the specified key; otherwise, false.
/// </returns>
public bool Contains(TSecond key);
public bool Contains( TSecond key );
/// <summary>
/// Determines whether the <see cref="IBidirectionalDictionary{TFirst, TSecond}" /> contains
@@ -84,17 +84,17 @@ namespace StgSharp.Commom.Collections
/// true if the <see cref="IBidirectionalDictionary{TFirst, TSecond}" /> contains an element
/// with the specified key; otherwise, false.
/// </returns>
public bool Contains(TFirst key);
public bool Contains( TFirst key );
public bool TryGetValue(TSecond key, out TFirst value);
public bool TryGetValue( TSecond key, out TFirst value );
#pragma warning disable CA1033
#pragma warning disable CA1033
ICollection<TFirst> IDictionary<TFirst, TSecond>.Keys => FirstIndex;
ICollection<TSecond> IDictionary<TFirst, TSecond>.Values => SecondIndex;
bool IDictionary<TFirst, TSecond>.ContainsKey(TFirst key) => Contains(
key);
bool IDictionary<TFirst, TSecond>.ContainsKey( TFirst key ) => Contains(
key );
#pragma warning restore CA1033
}
}
内核源代码/StgSharp.Common/Collections/IStringHashMultiplexer.cs
+44 -5
View File
@@ -1,12 +1,51 @@
using System.Diagnostics.CodeAnalysis;
//-----------------------------------------------------------------------
//-----------------------------------------------------------------------
// file="IStringHashMultiplexer.cs"
// Project: StgSharp
// AuthorGroup: Nitload Space
// Copyright (c) Nitload Space. All rights reserved.
//
// Permission is hereby granted, free of charge, to any person
// obtaining a copy of this software and associated documentation
// files (the “Software”), to deal in the Software without restriction,
// including without limitation the rights to use, copy, modify, merge,
// publish, distribute, sublicense, and/or sell copies of the Software,
// and to permit persons to whom the Software is furnished to do so,
// subject to the following conditions:
//
// The above copyright notice and
// this permission notice shall be included in all copies
// or substantial portions of the Software.
//
// THE SOFTWARE IS PROVIDED “AS IS”,
// WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED,
// INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
// IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,
// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,
// ARISING FROM, OUT OF OR IN CONNECTION WITH
// THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
//
//-----------------------------------------------------------------------
//-----------------------------------------------------------------------
using System.Diagnostics.CodeAnalysis;
namespace StgSharp.Collections
{
public interface IStringHashMultiplexer
{
int RemainedMultiplexCount { get; set; }
void CacheHash(string obj, int count);
void ExtendCache(int count);
int ForceComputeHash([NotNull] string obj);
int RemainedMultiplexCount
{
get;
set;
}
void CacheHash( string obj, int count );
void ExtendCache( int count );
int ForceComputeHash( [NotNull] string obj );
}
}
内核源代码/StgSharp.Common/Collections/KeyMultiplexer.cs
+107 -52
View File
@@ -1,4 +1,34 @@
using System;
//-----------------------------------------------------------------------
//-----------------------------------------------------------------------
// file="KeyMultiplexer.cs"
// Project: StgSharp
// AuthorGroup: Nitload Space
// Copyright (c) Nitload Space. All rights reserved.
//
// Permission is hereby granted, free of charge, to any person
// obtaining a copy of this software and associated documentation
// files (the “Software”), to deal in the Software without restriction,
// including without limitation the rights to use, copy, modify, merge,
// publish, distribute, sublicense, and/or sell copies of the Software,
// and to permit persons to whom the Software is furnished to do so,
// subject to the following conditions:
//
// The above copyright notice and
// this permission notice shall be included in all copies
// or substantial portions of the Software.
//
// THE SOFTWARE IS PROVIDED “AS IS”,
// WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED,
// INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
// IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,
// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,
// ARISING FROM, OUT OF OR IN CONNECTION WITH
// THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
//
//-----------------------------------------------------------------------
//-----------------------------------------------------------------------
using System;
using System.Collections.Generic;
using System.Diagnostics.CodeAnalysis;
using System.Globalization;
@@ -8,10 +38,11 @@ using System.Threading;
namespace StgSharp.Collections
{
public class StringHashMultiplexer : IEqualityComparer<string>, IStringHashMultiplexer
public sealed class StringHashMultiplexer : IEqualityComparer<string>, IStringHashMultiplexer
{
private string _source, _sourceLast;
private int _initCount, _remainedCount, _hashCache, _hashLast;
private string _source, _sourceLast;
public int RemainedMultiplexCount
{
@@ -19,92 +50,116 @@ namespace StgSharp.Collections
set => _initCount = value;
}
public bool Equals(string x, string y)
public void CacheHash( string obj, int count )
{
return x == y;
}
public int GetHashCode(string obj)
{
if (_remainedCount > 0 && ReferenceEquals(_source, obj))
{
_remainedCount--;
return _hashCache;
}
if (ReferenceEquals(_sourceLast, obj))
{
return _hashLast;
}
_sourceLast = obj;
_hashLast = ForceComputeHash(obj);
return _hashLast;
}
public void CacheHash(string obj, int count)
{
_hashCache = ForceComputeHash(obj);
_hashCache = ForceComputeHash( obj );
_initCount = count;
_remainedCount = _initCount;
_source = obj;
}
public void ExtendCache(int count)
public bool Equals( string x, string y )
{
return x == y;
}
public void ExtendCache( int count )
{
_initCount += count;
_remainedCount += count;
}
[MethodImpl(MethodImplOptions.AggressiveInlining)]
public unsafe int ForceComputeHash([NotNull] string obj)
[MethodImpl( MethodImplOptions.AggressiveInlining )]
public unsafe int ForceComputeHash( [NotNull] string obj )
{
int hash;
fixed (char* cPtr = obj.AsSpan())
{
hash = InternalIO.Intrinsic.cityhash_simplify(cPtr, obj.Length);
fixed( char* cPtr = obj.AsSpan() ) {
hash = InternalIO.Intrinsic
.city_hash_simplify( cPtr, obj.Length );
}
return hash;
}
}
public class ConcurrentStringHashMultiplexer : IEqualityComparer<string>, IStringHashMultiplexer
{
private readonly ThreadLocal<StringHashMultiplexer> multiplexers =
new (()=>new StringHashMultiplexer());
public int RemainedMultiplexCount
{
get => multiplexers.Value.RemainedMultiplexCount;
set => multiplexers.Value.RemainedMultiplexCount = value;
public int GetHashCode( string obj )
{
if( _remainedCount > 0 && ReferenceEquals( _source, obj ) ) {
_remainedCount--;
return _hashCache;
}
if( ReferenceEquals( _sourceLast, obj ) ) {
return _hashLast;
}
_sourceLast = obj;
_hashLast = ForceComputeHash( obj );
return _hashLast;
}
public void CacheHash(string obj, int count)
}
public sealed class ConcurrentStringHashMultiplexer : IEqualityComparer<string>, IStringHashMultiplexer, IDisposable
{
private bool disposedValue;
private readonly ThreadLocal<StringHashMultiplexer> _multiplexers =
new( () => new StringHashMultiplexer() );
public int RemainedMultiplexCount
{
get => _multiplexers.Value.RemainedMultiplexCount;
set => _multiplexers.Value.RemainedMultiplexCount = value;
}
public void CacheHash( string obj, int count )
{
throw new NotImplementedException();
}
public bool Equals(string x, string y)
// ~ConcurrentStringHashMultiplexer()
// {
// Dispose(disposing: false);
// }
public void Dispose()
{
Dispose( disposing: true );
GC.SuppressFinalize( this );
}
public bool Equals( string x, string y )
{
return x == y;
}
public void ExtendCache(int count)
public void ExtendCache( int count )
{
multiplexers.Value.ExtendCache(count);
_multiplexers.Value.ExtendCache( count );
}
public unsafe int ForceComputeHash([NotNull] string obj)
public unsafe int ForceComputeHash( [NotNull] string obj )
{
int hash;
fixed (char* cPtr = obj.AsSpan())
{
hash = InternalIO.Intrinsic.cityhash_simplify(cPtr, obj.Length);
fixed( char* cPtr = obj.AsSpan() ) {
hash = InternalIO.Intrinsic
.city_hash_simplify( cPtr, obj.Length );
}
return hash;
}
public int GetHashCode(string obj)
public int GetHashCode( string obj )
{
return multiplexers.Value.GetHashCode(obj);
return _multiplexers.Value.GetHashCode( obj );
}
private void Dispose( bool disposing )
{
if( !disposedValue ) {
if( disposing ) {
_multiplexers.Dispose();
}
disposedValue = true;
}
}
}
}
内核源代码/StgSharp.Common/Collections/PartialDictionary.cs
+4 -3
View File
@@ -113,7 +113,8 @@ namespace StgSharp.Collections
public IEnumerator<KeyValuePair<TKey, TValue>> GetEnumerator()
{
foreach( TKey item in _keys ) {
yield return new KeyValuePair<TKey, TValue>(item, _source[item]);
yield return new KeyValuePair<TKey, TValue>(
item, _source[ item ] );
}
}
@@ -138,14 +139,14 @@ namespace StgSharp.Collections
throw new NotSupportedException();
}
bool ICollection<KeyValuePair<TKey, TValue>>.IsReadOnly => true;
bool ICollection<KeyValuePair<TKey, TValue>>.Remove(
KeyValuePair<TKey, TValue> item )
{
throw new NotSupportedException();
}
bool ICollection<KeyValuePair<TKey, TValue>>.IsReadOnly => true;
void IDictionary<TKey, TValue>.Add( TKey key, TValue value )
{
return;
内核源代码/StgSharp.Common/Collections/PartialDictionaryValues.cs
+16 -20
View File
@@ -53,22 +53,10 @@ namespace StgSharp.Collections
public int Count => _values.Count;
void ICollection<TValue>.Add( TValue item )
{
return;
}
void ICollection<TValue>.Clear()
{
return;
}
public bool Contains( TValue item )
{
foreach (var kvp in _values)
{
if (kvp.Value != null && kvp.Value.Equals(item))
{
foreach( KeyValuePair<TKey, TValue> kvp in _values ) {
if( kvp.Value != null && kvp.Value.Equals( item ) ) {
return true;
}
}
@@ -77,21 +65,29 @@ namespace StgSharp.Collections
public void CopyTo( TValue[] array, int arrayIndex )
{
foreach (var kvp in _values)
{
array[arrayIndex] = kvp.Value;
foreach( KeyValuePair<TKey, TValue> kvp in _values ) {
array[ arrayIndex ] = kvp.Value;
arrayIndex++;
}
}
public IEnumerator<TValue> GetEnumerator()
{
foreach (var key in _values._keys)
{
yield return _values._source[key];
foreach( TKey key in _values._keys ) {
yield return _values._source[ key ];
}
}
void ICollection<TValue>.Add( TValue item )
{
return;
}
void ICollection<TValue>.Clear()
{
return;
}
bool ICollection<TValue>.Remove( TValue item )
{
throw new NotSupportedException();