/
BitInputStream.java
176 lines (144 loc) · 6.52 KB
/
BitInputStream.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
/*
* $Id$
*
* Copyright (c) 2015, Simsilica, LLC
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
*
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in
* the documentation and/or other materials provided with the
* distribution.
*
* 3. Neither the name of the copyright holder nor the names of its
* contributors may be used to endorse or promote products derived
* from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
* FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
* COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT,
* INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
* (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
* STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
* OF THE POSSIBILITY OF SUCH DAMAGE.
*/
package com.simsilica.ethereal.io;
import java.io.*;
/**
* Reads bit strings of any length from an
* underlying stream.
*
* @version $Revision: 4022 $
* @author Paul Speed
*/
public class BitInputStream implements AutoCloseable {
private final InputStream in;
private int lastByte;
private int bits = 0;
public BitInputStream( InputStream in ) {
this.in = in;
}
public long readLongBits( int count ) throws IOException {
if( count == 0 )
throw new IllegalArgumentException( "Cannot read 0 bits." );
if( count > 64 )
throw new IllegalArgumentException( "Bit count overflow:" + count );
long result = 0;
// While we still have bits remaining...
int remainingCount = count;
while( remainingCount > 0 ) {
// See if we need to refill the current read byte
if( bits == 0 ) {
int b = in.read();
if( b < 0 )
throw new IOException( "End of stream reached." );
lastByte = b;
bits = 8;
}
// Copy the smaller of the two: remaining bits
// or bits left in lastByte.
int bitsToCopy = bits < remainingCount ? bits : remainingCount;
// How much do we have to shift the read byte to just
// get the high bits we want?
int sourceShift = bits - bitsToCopy;
// And how much do we have to shift those bits to graft
// them onto our result?
int targetShift = remainingCount - bitsToCopy;
// Copy the bits
result |= ((long)lastByte >> sourceShift) << targetShift;
// Keep track of how many bits we have left
remainingCount -= bitsToCopy;
bits -= bitsToCopy;
// Now we need to mask off the bits we just copied from
// lastByte. Just keep the bits that are left.
lastByte = lastByte & (0xff >> (8 - bits));
}
return result;
}
public int readBits( int count ) throws IOException {
if( count == 0 )
throw new IllegalArgumentException( "Cannot read 0 bits." );
if( count > 32 )
throw new IllegalArgumentException( "Bit count overflow:" + count );
int result = 0;
// While we still have bits remaining...
int remainingCount = count;
while( remainingCount > 0 ) {
// See if we need to refill the current read byte
if( bits == 0 ) {
int b = in.read();
if( b < 0 )
throw new IOException( "End of stream reached." );
lastByte = b;
bits = 8;
}
// Copy the smaller of the two: remaining bits
// or bits left in lastByte.
int bitsToCopy = bits < remainingCount ? bits : remainingCount;
// How much do we have to shift the read byte to just
// get the high bits we want?
int sourceShift = bits - bitsToCopy;
// And how much do we have to shift those bits to graft
// them onto our result?
int targetShift = remainingCount - bitsToCopy;
// Copy the bits
result |= (lastByte >> sourceShift) << targetShift;
// Keep track of how many bits we have left
remainingCount -= bitsToCopy;
bits -= bitsToCopy;
// Now we need to mask off the bits we just copied from
// lastByte. Just keep the bits that are left.
lastByte = lastByte & (0xff >> (8 - bits));
}
return result;
}
@Override
public void close() throws IOException {
in.close();
}
public static void main( String... args ) throws Exception {
for( int count = 1; count <= 32; count++ ) {
System.out.println( "Count:" + count );
byte[] bytes = new byte[] { (byte)0x12, (byte)0x34, (byte)0x56, (byte)0x78, (byte)0x9a, (byte)0xbc, (byte)0xde, (byte)0xff };
int total = 8 * 8;
ByteArrayInputStream bIn = new ByteArrayInputStream(bytes);
BitInputStream in = new BitInputStream(bIn);
int bitsRead = 0;
while( bitsRead <= (total - count) ) {
System.out.println( Integer.toHexString( in.readBits(count) ) );
bitsRead += count;
}
}
}
}