(ded4a3e0a) v0.9.0.7

2019-06-25 16:00:44 +03:00
parent e5ae622c77
commit 4a51db77b5
1777 changed files with 421528 additions and 917 deletions
@@ -0,0 +1,88 @@
+using System.Collections.Generic;
+
+namespace MonoGame.Utilities
+{
+    internal class ByteBufferPool
+    {
+        public int FreeAmount
+        {
+            get { return _freeBuffers.Count; }
+        }
+
+        private readonly List<byte[]> _freeBuffers;
+
+        public ByteBufferPool()
+        {
+            _freeBuffers = new List<byte[]>();
+        }
+
+        /// <summary>
+        /// Get a buffer that is at least as big as size.
+        /// </summary>
+        public byte[] Get(int size)
+        {
+            byte[] result;
+            lock (_freeBuffers)
+            {
+                var index = FirstLargerThan(size);
+
+                if (index == -1)
+                {
+                    result = new byte[size];
+                }
+                else
+                {
+                    result = _freeBuffers[index];
+                    _freeBuffers.RemoveAt(index);
+                }
+            }
+            return result;
+        }
+
+        /// <summary>
+        /// Return the given buffer to the pool.
+        /// </summary>
+        /// <param name="buffer"></param>
+        public void Return(byte[] buffer)
+        {
+            lock (_freeBuffers)
+            {
+                var index = FirstLargerThan(buffer.Length);
+                if (index == -1)
+                    _freeBuffers.Add(buffer);
+                else
+                    _freeBuffers.Insert(index, buffer);
+            }
+        }
+
+        // Find the smallest buffer that is larger than or equally large as size or -1 if none exist
+        private int FirstLargerThan(int size)
+        {
+            if (_freeBuffers.Count == 0) return -1;
+
+            var l = 0;
+            var r = _freeBuffers.Count - 1;
+
+            while (l <= r)
+            {
+                var m = (l + r)/2;
+                var buffer = _freeBuffers[m];
+                if (buffer.Length < size)
+                {
+                    l = m + 1;
+                }
+                else if (buffer.Length > size)
+                {
+                    r = m;
+                    if (l == r) return l;
+                }
+                else
+                {
+                    return m;
+                }
+            }
+
+            return -1;
+        }
+    }
+}