daily update on 20240202 by nitload youmu, keep on writing xpreeess compiler

内核源代码/StgSharp.Common/Collections/BidirectionalDictionary.cs

@@ -0,0 +1,223 @@
+//-----------------------------------------------------------------------
+//-----------------------------------------------------------------------
+//     file="BidirectionalDictionary.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;
+using System.Collections.Generic;
+using System.Collections.ObjectModel;
+using System.Diagnostics.CodeAnalysis;
+using System.Linq;
+
+namespace StgSharp.Commom.Collections
+{
+    public sealed class BidirectionalDictionary<TFirst, TSecond> : IBidirectionalDictionary<TFirst, TSecond>
+    {
+
+        private readonly Dictionary<TFirst, TSecond> _forward;
+        private readonly Dictionary<TSecond, TFirst> _reverse;
+
+        public BidirectionalDictionary()
+        {
+            _forward = new Dictionary<TFirst, TSecond>();
+            _reverse = new Dictionary<TSecond, TFirst>();
+        }
+
+        public TFirst this[TSecond key]
+        {
+            get
+            {
+                if (_reverse.TryGetValue(key, out TFirst value))
+                {
+                    return value;
+                }
+                throw new ArgumentException(
+                    $"Cannot find key {key!.ToString()} in dictionary.");
+            }
+            set
+            {
+                if (_reverse.TryGetValue(key, out TFirst origin))
+                {
+                    _reverse[key] = value;
+                    _forward.Remove(origin);
+                }
+                else
+                {
+                    _reverse.Add(key, value);
+                }
+                _forward.Add(value, key);
+            }
+        }
+
+        public TSecond this[TFirst key]
+        {
+            get
+            {
+                if (_forward.TryGetValue(key, out TSecond value))
+                {
+                    return value;
+                }
+                throw new ArgumentException(
+                    $"Cannot find key {key!.ToString()} in dictionary.");
+            }
+            set
+            {
+                if (_forward.TryGetValue(key, out TSecond origin))
+                {
+                    _forward[key] = value;
+                    _reverse.Remove(origin);
+                }
+                else
+                {
+                    _forward.Add(key, value);
+                }
+                _reverse.Add(value, key);
+            }
+        }
+
+        public bool IsReadOnly => false;
+
+        public ICollection<TFirst> FirstIndex => _forward.Keys;
+
+        public ICollection<TSecond> SecondIndex => _reverse.Keys;
+
+        public int Count => _forward.Count;
+
+        public IReadOnlyDictionary<TFirst, TSecond> Forward => new ReadOnlyDictionary<TFirst, TSecond>(
+            _forward);
+
+        public IReadOnlyDictionary<TSecond, TFirst> Reverse => new ReadOnlyDictionary<TSecond, TFirst>(
+            _reverse);
+
+        public void Add(KeyValuePair<TFirst, TSecond> item)
+        {
+            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);
+        }
+
+        public void Add(TFirst key, TSecond value)
+        {
+            if (_forward.ContainsKey(key) || _reverse.ContainsKey(value))
+            {
+                throw new ArgumentException("Duplicate key or value.");
+            }
+            _forward.Add(key, value);
+            _reverse.Add(value, key);
+        }
+
+        public void Clear()
+        {
+            _forward.Clear();
+            _reverse.Clear();
+        }
+
+        public bool Contains(KeyValuePair<TFirst, TSecond> item)
+        {
+            return _forward.Contains(item) && _reverse.TryGetValue(
+                item.Value, out TFirst var) && var!.Equals(item.Key);
+        }
+
+        public bool Contains(TSecond key)
+        {
+            return _reverse.ContainsKey(key);
+        }
+
+        public bool Contains(TFirst key)
+        {
+            return _forward.ContainsKey(key);
+        }
+
+        public void CopyTo(
+            KeyValuePair<TFirst, TSecond>[] array,
+            int arrayIndex)
+        {
+            if (array == null)
+            {
+                throw new ArgumentNullException(nameof(array));
+            }
+            if (arrayIndex < 0 || arrayIndex > array.Length)
+            {
+                throw new ArgumentOutOfRangeException(nameof(arrayIndex));
+            }
+            if (array.Length - arrayIndex < _forward.Count)
+            {
+                throw new ArgumentException(
+                    "The array is too small to copy the elements.");
+            }
+
+            foreach (KeyValuePair<TFirst, TSecond> pair in _forward)
+            {
+                array[arrayIndex++] = pair;
+            }
+        }
+
+        public IEnumerator<KeyValuePair<TFirst, TSecond>> GetEnumerator()
+        {
+            foreach (KeyValuePair<TFirst, TSecond> pair in _forward)
+            {
+                yield return pair;
+            }
+        }
+
+        public bool Remove(TFirst key)
+        {
+            throw new NotImplementedException();
+        }
+
+        public bool Remove(KeyValuePair<TFirst, TSecond> item)
+        {
+            if (_forward.Remove(item.Key))
+            {
+                return _reverse.Remove(item.Value);
+            }
+            return false;
+        }
+
+        public bool TryGetValue(TFirst key, out TSecond value)
+        {
+            return _forward.TryGetValue(key, out value);
+        }
+
+        public bool TryGetValue(TSecond key, out TFirst value)
+        {
+            return _reverse.TryGetValue(key, out value);
+        }
+
+        IEnumerator IEnumerable.GetEnumerator()
+        {
+            return GetEnumerator();
+        }
+
+    }
+}

内核源代码/StgSharp.Common/Collections/CachePool.cs

@@ -0,0 +1,59 @@
+using StgSharp.Graphics.OpenGL;
+
+using System;
+using System.Collections;
+using System.Collections.Concurrent;
+using System.Collections.Generic;
+using System.Text;
+
+namespace StgSharp.Commom.Collections
+{
+    public interface IPoolable
+    {
+        public int ID { get; }
+    }
+
+    public class CacheIndexPool<T> : IEnumerable<T> where T : IPoolable
+    {
+        private ConcurrentDictionary<int, T> _cache;
+        private Func<T> _defaultCreater;
+
+        public CacheIndexPool(Func<T> defaultCreater)
+        {
+            _cache = new ConcurrentDictionary<int, T>();
+            _defaultCreater = defaultCreater;
+        }
+
+        public T this[int index]
+        {
+            get
+            {
+                if (_cache.TryGetValue(index, out T value))
+                {
+                    return value;
+                }
+                T newValue = _defaultCreater();
+                _cache.TryAdd(index, newValue);
+                return newValue;
+            }
+        }
+
+        public IEnumerator<T> GetEnumerator()
+        {
+            return _cache.Values.GetEnumerator();
+        }
+
+        IEnumerator IEnumerable.GetEnumerator()
+        {
+            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

@@ -0,0 +1,176 @@
+//-----------------------------------------------------------------------
+//-----------------------------------------------------------------------
+//     file="CapacityFixedList.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;
+using System.Collections.Generic;
+using System.Reflection;
+using System.Text;
+
+namespace StgSharp.Commom.Collections
+{
+    internal class CapacityFixedList<T> : IList<T>
+    {
+        private T[] values;
+        private int capacity, _index;
+
+        public CapacityFixedList(int size)
+        {
+            values = new T[size];
+        }
+
+        public T this[int index]
+        {
+            get => index < _index ?
+            values[index] : throw new ArgumentOutOfRangeException(
+                nameof(index));
+            set
+            {
+                if (index < _index)
+                {
+                    values[index] = value;
+                }
+                else
+                {
+                    throw new ArgumentOutOfRangeException(nameof(index));
+                }
+            }
+        }
+
+        public bool IsReadOnly => false;
+
+        public int Count => _index + 1;
+
+        public void Add(T item)
+        {
+            if (_index < capacity - 1)
+            {
+                _index++;
+                this[_index] = item;
+            }
+        }
+
+        public void Clear()
+        {
+            values = new T[capacity];
+            _index = 0;
+        }
+
+        public bool Contains(T item)
+        {
+            for (int i = 0; i <= _index; i++)
+            {
+                if (item.Equals(values[i]))
+                {
+                    return true;
+                }
+            }
+            return false;
+        }
+
+        public void CopyTo(T[] array, int arrayIndex)
+        {
+            values.CopyTo(array, arrayIndex);
+        }
+
+        public IEnumerator<T> GetEnumerator()
+        {
+            for (int i = 0; i <= _index; i++)
+            {
+                yield return values[i];
+            }
+        }
+
+        public int IndexOf(T item)
+        {
+            T v;
+            for (int i = 0; i <= _index; i++)
+            {
+                if ((v = values[i]) != null && v.Equals(item))
+                {
+                    return i;
+                }
+            }
+            return -1;
+        }
+
+        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];
+                    _index--;
+                    return true;
+                }
+            }
+            return false;
+        }
+
+        public void RemoveAll(Predicate<T> predicate)
+        {
+            for (int i = _index; i > 0; i--)
+            {
+                if (predicate(values[i]))
+                {
+                    values[i] = values[_index];
+                    _index--;
+                }
+            }
+        }
+
+        public void RemoveAt(int index)
+        {
+            if (index <= _index)
+            {
+                values[index] = values[_index];
+                _index--;
+            }
+        }
+
+        public void Resize(int newSize)
+        {
+            Array.Resize(ref values, newSize);
+        }
+
+        IEnumerator IEnumerable.GetEnumerator()
+        {
+            yield return GetEnumerator();
+        }
+
+        void IList<T>.Insert(int index, T item)
+        {
+            throw new NotSupportedException();
+        }
+
+    }//------------------------------------- End of Class ------------------------------------------
+}

内核源代码/StgSharp.Common/Collections/IBidrirectionalDictionary.cs

@@ -0,0 +1,100 @@
+//-----------------------------------------------------------------------
+//-----------------------------------------------------------------------
+//     file="IBidrirectionalDictionary.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;
+using System.Collections.Generic;
+using System.Threading.Tasks;
+
+namespace StgSharp.Commom.Collections
+{
+    public interface IBidirectionalDictionary<TFirst, TSecond> : IDictionary<TFirst, TSecond>
+    {
+
+        public TFirst this[TSecond key]
+        {
+            get;
+            set;
+        }
+
+        public ICollection<TFirst> FirstIndex
+        {
+            get;
+        }
+
+        public ICollection<TSecond> SecondIndex
+        {
+            get;
+        }
+
+        public IReadOnlyDictionary<TFirst, TSecond> Forward
+        {
+            get;
+        }
+
+        public IReadOnlyDictionary<TSecond, TFirst> Reverse
+        {
+            get;
+        }
+
+        /// <summary>
+        /// Determines whether the <see cref="IBidirectionalDictionary{TFirst, TSecond}" /> contains
+        /// the specified key.
+        /// </summary>
+        /// <param _name="key"> The value to locate in the <see cref="IBidirectionalDictionary{TFirst, TSecond}" />. </param>
+        /// <returns>
+        /// true if the <see cref="IBidirectionalDictionary{TFirst, TSecond}" /> contains an element
+        /// with the specified key; otherwise, false.
+        /// </returns>
+        public bool Contains(TSecond key);
+
+        /// <summary>
+        /// Determines whether the <see cref="IBidirectionalDictionary{TFirst, TSecond}" /> contains
+        /// the specified key.
+        /// </summary>
+        /// <param _name="key"> The value to locate in the <see cref="IBidirectionalDictionary{TFirst, TSecond}" />. </param>
+        /// <returns>
+        /// 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 TryGetValue(TSecond key, out TFirst value);
+
+#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);
+#pragma warning restore CA1033 
+    }
+}

内核源代码/StgSharp.Common/Collections/IStringHashMultiplexer.cs

@@ -0,0 +1,12 @@
+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);
+    }
+}

内核源代码/StgSharp.Common/Collections/KeyMultiplexer.cs

@@ -0,0 +1,110 @@
+using System;
+using System.Collections.Generic;
+using System.Diagnostics.CodeAnalysis;
+using System.Globalization;
+using System.Runtime.CompilerServices;
+using System.Text;
+using System.Threading;
+
+namespace StgSharp.Collections
+{
+    public class StringHashMultiplexer : IEqualityComparer<string>, IStringHashMultiplexer
+    {
+        private string _source, _sourceLast;
+        private int _initCount, _remainedCount, _hashCache, _hashLast;
+
+        public int RemainedMultiplexCount
+        {
+            get => _remainedCount;
+            set => _initCount = value;
+        }
+
+        public bool Equals(string x, string y)
+        {
+            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);
+            _initCount = count;
+            _remainedCount = _initCount;
+            _source = obj;
+        }
+
+        public void ExtendCache(int count)
+        {
+            _initCount += count;
+            _remainedCount += count;
+        }
+
+        [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);
+            }
+            return hash;
+        }
+    }
+
+    public class ConcurrentStringHashMultiplexer : IEqualityComparer<string>, IStringHashMultiplexer
+    {
+        private readonly ThreadLocal<StringHashMultiplexer> multiplexers = 
+            new ();
+
+        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)
+        {
+            return x == y;
+        }
+
+        public void ExtendCache(int count)
+        {
+            multiplexers.Value.ExtendCache(count);
+        }
+
+        public unsafe int ForceComputeHash([NotNull] string obj)
+        {
+            int hash;
+            fixed (char* cPtr = obj.AsSpan())
+            {
+                hash = InternalIO.Intrinsic.cityhash_simplify(cPtr, obj.Length);
+            }
+            return hash;
+        }
+
+        public int GetHashCode(string obj)
+        {
+            return multiplexers.Value.GetHashCode(obj);
+        }
+    }
+}

内核源代码/StgSharp.Common/Collections/PartialDictionary.cs

@@ -0,0 +1,165 @@
+//-----------------------------------------------------------------------
+//-----------------------------------------------------------------------
+//     file="PartialDictionary.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;
+using System.Collections.Generic;
+using System.Linq;
+using System.Text;
+
+namespace StgSharp.Collections
+{
+    public partial class PartialDictionary<TKey, TValue> : IDictionary<TKey, TValue>
+    {
+
+        private readonly Dictionary<TKey, TValue> _source;
+        private readonly HashSet<TKey> _keys;
+        private readonly PartialDictionaryValues _values;
+
+        public PartialDictionary(
+                       Dictionary<TKey, TValue> source,
+                       TKey[] index )
+        {
+            _source = source;
+            _keys = new HashSet<TKey>( index );
+            foreach( TKey item in _keys ) {
+                if( !_source.ContainsKey( item ) ) {
+                    _source.Add( item, default! );
+                }
+            }
+            _values = new PartialDictionaryValues( this );
+        }
+
+        public PartialDictionary(
+                       Dictionary<TKey, TValue> source,
+                       HashSet<TKey> keys )
+        {
+            _source = source;
+            _keys = keys;
+            foreach( TKey item in _keys ) {
+                if( !_source.ContainsKey( item ) ) {
+                    _source.Add( item, default! );
+                }
+            }
+            _values = new PartialDictionaryValues( this );
+        }
+
+        public TValue this[ TKey key ]
+        {
+            get
+            {
+                if( _keys.Contains( key ) ) {
+                    return _source[ key ];
+                }
+                throw new KeyNotFoundException();
+            }
+            set
+            {
+                if( _keys.Contains( key ) ) {
+                    _source[ key ] = value;
+                }
+                throw new KeyNotFoundException();
+            }
+        }
+
+        public ICollection<TKey> Keys => _keys;
+
+        public ICollection<TValue> Values => _values;
+
+        public int Count => _keys.Count;
+
+        public bool Contains( KeyValuePair<TKey, TValue> item )
+        {
+            return _keys.Contains( item.Key ) && _source.Contains( item );
+        }
+
+        public bool ContainsKey( TKey key )
+        {
+            return _keys.Contains( key );
+        }
+
+        public void CopyTo( KeyValuePair<TKey, TValue>[] array, int arrayIndex )
+        {
+            throw new NotImplementedException();
+        }
+
+        public IEnumerator<KeyValuePair<TKey, TValue>> GetEnumerator()
+        {
+            foreach( TKey item in _keys ) {
+                yield return new KeyValuePair<TKey, TValue>(item, _source[item]);
+            }
+        }
+
+        public bool TryGetValue( TKey key, out TValue value )
+        {
+            if( _keys.Contains( key ) ) {
+                value = _source[ key ];
+                return true;
+            }
+            value = default!;
+            return false;
+        }
+
+        void ICollection<KeyValuePair<TKey, TValue>>.Add(
+                                                             KeyValuePair<TKey, TValue> item )
+        {
+            return;
+        }
+
+        void ICollection<KeyValuePair<TKey, TValue>>.Clear()
+        {
+            throw new NotSupportedException();
+        }
+
+        bool ICollection<KeyValuePair<TKey, TValue>>.IsReadOnly => true;
+
+        bool ICollection<KeyValuePair<TKey, TValue>>.Remove(
+                                                             KeyValuePair<TKey, TValue> item )
+        {
+            throw new NotSupportedException();
+        }
+
+        void IDictionary<TKey, TValue>.Add( TKey key, TValue value )
+        {
+            return;
+        }
+
+        bool IDictionary<TKey, TValue>.Remove( TKey key )
+        {
+            throw new NotSupportedException();
+        }
+
+        IEnumerator IEnumerable.GetEnumerator()
+        {
+            return GetEnumerator();
+        }
+
+    }
+}

内核源代码/StgSharp.Common/Collections/PartialDictionaryValues.cs

@@ -0,0 +1,108 @@
+//-----------------------------------------------------------------------
+//-----------------------------------------------------------------------
+//     file="PartialDictionaryValues.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;
+using System.Collections.Generic;
+using System.Text;
+
+namespace StgSharp.Collections
+{
+    public partial class PartialDictionary<TKey, TValue>
+    {
+
+        internal sealed class PartialDictionaryValues : ICollection<TValue>
+        {
+
+            private readonly PartialDictionary<TKey, TValue> _values;
+
+            public PartialDictionaryValues(
+                           PartialDictionary<TKey, TValue> value )
+            {
+                _values = value;
+            }
+
+            public bool IsReadOnly => true;
+
+            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))
+                    {
+                        return true;
+                    }
+                }
+                return false;
+            }
+
+            public void CopyTo( TValue[] array, int arrayIndex )
+            {
+                foreach (var kvp in _values)
+                {
+                    array[arrayIndex] = kvp.Value;
+                    arrayIndex++;
+                }
+            }
+
+            public IEnumerator<TValue> GetEnumerator()
+            {
+                foreach (var key in _values._keys)
+                {
+                    yield return _values._source[key];
+                }
+            }
+
+            bool ICollection<TValue>.Remove( TValue item )
+            {
+                throw new NotSupportedException();
+            }
+
+            IEnumerator IEnumerable.GetEnumerator()
+            {
+                return GetEnumerator();
+            }
+
+        }
+
+    }
+}