aboutsummaryrefslogtreecommitdiffstats
path: root/external-libs/zlib/contrib/dotzlib/DotZLib/CircularBuffer.cs
diff options
context:
space:
mode:
authorJay Berkenbilt <ejb@ql.org>2009-10-10 19:43:06 +0200
committerJay Berkenbilt <ejb@ql.org>2009-10-10 19:43:06 +0200
commit8f6f4773bc78ee15978657d78a7b44d462bb4416 (patch)
tree0b9a3a06cf62739f98034337189cd14ee6ad5f1d /external-libs/zlib/contrib/dotzlib/DotZLib/CircularBuffer.cs
parentf3bf8d3110b852b8f338898c3237d16a74360cf3 (diff)
downloadqpdf-8f6f4773bc78ee15978657d78a7b44d462bb4416.tar.zst
remove files not needed for building
git-svn-id: svn+q:///qpdf/trunk@768 71b93d88-0707-0410-a8cf-f5a4172ac649
Diffstat (limited to 'external-libs/zlib/contrib/dotzlib/DotZLib/CircularBuffer.cs')
-rw-r--r--external-libs/zlib/contrib/dotzlib/DotZLib/CircularBuffer.cs83
1 files changed, 0 insertions, 83 deletions
diff --git a/external-libs/zlib/contrib/dotzlib/DotZLib/CircularBuffer.cs b/external-libs/zlib/contrib/dotzlib/DotZLib/CircularBuffer.cs
deleted file mode 100644
index 16997e90..00000000
--- a/external-libs/zlib/contrib/dotzlib/DotZLib/CircularBuffer.cs
+++ /dev/null
@@ -1,83 +0,0 @@
-//
-// © 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;
- }
-
- }
-}