diff options
| author | Aki <please@ignore.pl> | 2021-09-29 21:52:57 +0200 |
|---|---|---|
| committer | Aki <please@ignore.pl> | 2021-09-29 21:52:57 +0200 |
| commit | 86684427ef55fdad89bccf6afb3de8085ae4580a (patch) | |
| tree | beae38abc6a89c6388407f5eab60c1bd6ebdc1d1 /zlib/contrib/dotzlib/DotZLib/CircularBuffer.cs | |
| parent | 6ebfc6e07d5c4fc701ce522391616550d197881a (diff) | |
| parent | 07162fa301835387e4da4278326ec1ff45d1dc3e (diff) | |
| download | starshatter-86684427ef55fdad89bccf6afb3de8085ae4580a.zip starshatter-86684427ef55fdad89bccf6afb3de8085ae4580a.tar.gz starshatter-86684427ef55fdad89bccf6afb3de8085ae4580a.tar.bz2 | |
Merge commit '07162fa301835387e4da4278326ec1ff45d1dc3e' as 'zlib'
Diffstat (limited to 'zlib/contrib/dotzlib/DotZLib/CircularBuffer.cs')
| -rw-r--r-- | zlib/contrib/dotzlib/DotZLib/CircularBuffer.cs | 83 |
1 files changed, 83 insertions, 0 deletions
diff --git a/zlib/contrib/dotzlib/DotZLib/CircularBuffer.cs b/zlib/contrib/dotzlib/DotZLib/CircularBuffer.cs new file mode 100644 index 0000000..c1cab3a --- /dev/null +++ b/zlib/contrib/dotzlib/DotZLib/CircularBuffer.cs @@ -0,0 +1,83 @@ +//
+// © Copyright Henrik Ravn 2004
+//
+// Use, modification and distribution are subject to the Boost Software License, Version 1.0.
+// (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+//
+
+using System;
+using System.Diagnostics;
+
+namespace DotZLib
+{
+
+ /// <summary>
+ /// This class implements a circular buffer
+ /// </summary>
+ internal class CircularBuffer
+ {
+ #region Private data
+ private int _capacity;
+ private int _head;
+ private int _tail;
+ private int _size;
+ private byte[] _buffer;
+ #endregion
+
+ public CircularBuffer(int capacity)
+ {
+ Debug.Assert( capacity > 0 );
+ _buffer = new byte[capacity];
+ _capacity = capacity;
+ _head = 0;
+ _tail = 0;
+ _size = 0;
+ }
+
+ public int Size { get { return _size; } }
+
+ public int Put(byte[] source, int offset, int count)
+ {
+ Debug.Assert( count > 0 );
+ int trueCount = Math.Min(count, _capacity - Size);
+ for (int i = 0; i < trueCount; ++i)
+ _buffer[(_tail+i) % _capacity] = source[offset+i];
+ _tail += trueCount;
+ _tail %= _capacity;
+ _size += trueCount;
+ return trueCount;
+ }
+
+ public bool Put(byte b)
+ {
+ if (Size == _capacity) // no room
+ return false;
+ _buffer[_tail++] = b;
+ _tail %= _capacity;
+ ++_size;
+ return true;
+ }
+
+ public int Get(byte[] destination, int offset, int count)
+ {
+ int trueCount = Math.Min(count,Size);
+ for (int i = 0; i < trueCount; ++i)
+ destination[offset + i] = _buffer[(_head+i) % _capacity];
+ _head += trueCount;
+ _head %= _capacity;
+ _size -= trueCount;
+ return trueCount;
+ }
+
+ public int Get()
+ {
+ if (Size == 0)
+ return -1;
+
+ int result = (int)_buffer[_head++ % _capacity];
+ --_size;
+ return result;
+ }
+
+ }
+}
|