mirror of
https://github.com/zxing/zxing.git
synced 2024-11-13 22:44:09 -08:00
d4efd44fb0
git-svn-id: https://zxing.googlecode.com/svn/trunk@1202 59b500cc-1b3d-0410-9834-0bbf25fbcc57
109 lines
3.3 KiB
C#
Executable file
109 lines
3.3 KiB
C#
Executable file
/*
|
|
* Copyright 2007 ZXing authors
|
|
*
|
|
* Licensed under the Apache License, Version 2.0 (the "License");
|
|
* you may not use this file except in compliance with the License.
|
|
* You may obtain a copy of the License at
|
|
*
|
|
* http://www.apache.org/licenses/LICENSE-2.0
|
|
*
|
|
* Unless required by applicable law or agreed to in writing, software
|
|
* distributed under the License is distributed on an "AS IS" BASIS,
|
|
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
* See the License for the specific language governing permissions and
|
|
* limitations under the License.
|
|
*/
|
|
using System;
|
|
namespace com.google.zxing.common
|
|
{
|
|
|
|
/// <summary> <p>This provides an easy abstraction to read bits at a time from a sequence of bytes, where the
|
|
/// number of bits read is not often a multiple of 8.</p>
|
|
///
|
|
/// <p>This class is thread-safe but not reentrant. Unless the caller modifies the bytes array
|
|
/// it passed in, in which case all bets are off.</p>
|
|
///
|
|
/// </summary>
|
|
/// <author> Sean Owen
|
|
/// </author>
|
|
/// <author>www.Redivivus.in (suraj.supekar@redivivus.in) - Ported from ZXING Java Source
|
|
/// </author>
|
|
public sealed class BitSource
|
|
{
|
|
|
|
//UPGRADE_NOTE: Final was removed from the declaration of 'bytes '. "ms-help://MS.VSCC.v80/dv_commoner/local/redirect.htm?index='!DefaultContextWindowIndex'&keyword='jlca1003'"
|
|
private sbyte[] bytes;
|
|
private int byteOffset;
|
|
private int bitOffset;
|
|
|
|
/// <param name="bytes">bytes from which this will read bits. Bits will be read from the first byte first.
|
|
/// Bits are read within a byte from most-significant to least-significant bit.
|
|
/// </param>
|
|
public BitSource(sbyte[] bytes)
|
|
{
|
|
this.bytes = bytes;
|
|
}
|
|
|
|
/// <param name="numBits">number of bits to read
|
|
/// </param>
|
|
/// <returns> int representing the bits read. The bits will appear as the least-significant
|
|
/// bits of the int
|
|
/// </returns>
|
|
/// <throws> IllegalArgumentException if numBits isn't in [1,32] </throws>
|
|
public int readBits(int numBits)
|
|
{
|
|
if (numBits < 1 || numBits > 32)
|
|
{
|
|
throw new System.ArgumentException();
|
|
}
|
|
|
|
int result = 0;
|
|
|
|
// First, read remainder from current byte
|
|
if (bitOffset > 0)
|
|
{
|
|
int bitsLeft = 8 - bitOffset;
|
|
int toRead = numBits < bitsLeft?numBits:bitsLeft;
|
|
int bitsToNotRead = bitsLeft - toRead;
|
|
int mask = (0xFF >> (8 - toRead)) << bitsToNotRead;
|
|
result = (bytes[byteOffset] & mask) >> bitsToNotRead;
|
|
numBits -= toRead;
|
|
bitOffset += toRead;
|
|
if (bitOffset == 8)
|
|
{
|
|
bitOffset = 0;
|
|
byteOffset++;
|
|
}
|
|
}
|
|
|
|
// Next read whole bytes
|
|
if (numBits > 0)
|
|
{
|
|
while (numBits >= 8)
|
|
{
|
|
result = (result << 8) | (bytes[byteOffset] & 0xFF);
|
|
byteOffset++;
|
|
numBits -= 8;
|
|
}
|
|
|
|
// Finally read a partial byte
|
|
if (numBits > 0)
|
|
{
|
|
int bitsToNotRead = 8 - numBits;
|
|
int mask = (0xFF >> bitsToNotRead) << bitsToNotRead;
|
|
result = (result << numBits) | ((bytes[byteOffset] & mask) >> bitsToNotRead);
|
|
bitOffset += numBits;
|
|
}
|
|
}
|
|
|
|
return result;
|
|
}
|
|
|
|
/// <returns> number of bits that can be read successfully
|
|
/// </returns>
|
|
public int available()
|
|
{
|
|
return 8 * (bytes.Length - byteOffset) - bitOffset;
|
|
}
|
|
}
|
|
} |