daily update on 20250122 by nitload youmu, architect rearrange

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

@@ -0,0 +1,58 @@
+using StgSharp;
+using StgSharp.Graphics.OpenGL;
+
+using System;
+using System.Collections;
+using System.Collections.Concurrent;
+using System.Collections.Generic;
+using System.Text;
+
+namespace StgSharp.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 this.GetEnumerator();
+        }
+
+        public T CreateObject()
+        {
+            T _new = _defaultCreater();
+            _cache.AddOrUpdate();
+        }
+    }
+}

内核源代码/StgSharp/Logic/Collections/CapacityFixedList.cs

@@ -0,0 +1,162 @@
+//-----------------------------------------------------------------------
+//-----------------------------------------------------------------------
+//     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.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/Logic/Collections/IBidrirectionalDictionary.cs

@@ -68,7 +68,7 @@ namespace StgSharp.Collections
         /// 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>
+        /// <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.
@@ -79,7 +79,7 @@ namespace StgSharp.Collections
         /// 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>
+        /// <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.