forked from kangjianwei/LearningJDK
-
Notifications
You must be signed in to change notification settings - Fork 0
/
CharArrayReader.java
287 lines (242 loc) · 10.8 KB
/
CharArrayReader.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
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
/*
* Copyright (c) 1996, 2015, Oracle and/or its affiliates. All rights reserved.
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* This code is free software; you can redistribute it and/or modify it
* under the terms of the GNU General Public License version 2 only, as
* published by the Free Software Foundation. Oracle designates this
* particular file as subject to the "Classpath" exception as provided
* by Oracle in the LICENSE file that accompanied this code.
*
* This code is distributed in the hope that it will be useful, but WITHOUT
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
* version 2 for more details (a copy is included in the LICENSE file that
* accompanied this code).
*
* You should have received a copy of the GNU General Public License version
* 2 along with this work; if not, write to the Free Software Foundation,
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
*
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
* or visit www.oracle.com if you need additional information or have any
* questions.
*/
package java.io;
/**
* This class implements a character buffer that can be used as a
* character-input stream.
*
* @author Herb Jellinek
* @since 1.1
*/
// 字符数组输入流:从给定的字符数组中读取字符
public class CharArrayReader extends Reader {
/** The character buffer. */
protected char[] buf; // 输入源,存放待读字符
/** The current buffer position. */
protected int pos; // 指向输入源下一个待读字符的游标
/**
* The index of the end of this buffer. There is not valid
* data at or beyond this index.
*/
protected int count; // 输入源中的游标上限
/** The position of mark in buffer. */
protected int markedPos = 0;
/*▼ 构造器 ████████████████████████████████████████████████████████████████████████████████┓ */
/**
* Creates a CharArrayReader from the specified array of chars.
*
* @param buf Input buffer (not copied)
*/
public CharArrayReader(char[] buf) {
this.buf = buf;
this.pos = 0;
this.count = buf.length;
}
/**
* Creates a CharArrayReader from the specified array of chars.
*
* <p> The resulting reader will start reading at the given
* {@code offset}. The total number of {@code char} values that can be
* read from this reader will be either {@code length} or
* {@code buf.length-offset}, whichever is smaller.
*
* @param buf Input buffer (not copied)
* @param offset Offset of the first char to read
* @param length Number of chars to read
*
* @throws IllegalArgumentException If {@code offset} is negative or greater than
* {@code buf.length}, or if {@code length} is negative, or if
* the sum of these two values is negative.
*/
public CharArrayReader(char[] buf, int offset, int length) {
if((offset<0) || (offset>buf.length) || (length<0) || ((offset + length)<0)) {
throw new IllegalArgumentException();
}
this.buf = buf;
this.pos = offset;
this.count = Math.min(offset + length, buf.length);
this.markedPos = offset;
}
/*▲ 构造器 ████████████████████████████████████████████████████████████████████████████████┛ */
/*▼ 读 ████████████████████████████████████████████████████████████████████████████████┓ */
/**
* Reads a single character.
*
* @throws IOException If an I/O error occurs
*/
// 返回从当前输入流中读取的一个char,返回-1表示读取失败
public int read() throws IOException {
synchronized(lock) {
ensureOpen();
if(pos >= count) {
return -1;
} else {
return buf[pos++];
}
}
}
/**
* Reads characters into a portion of an array.
*
* @param b Destination buffer
* @param off Offset at which to start storing characters
* @param len Maximum number of characters to read
*
* @return The actual number of characters read, or -1 if
* the end of the stream has been reached
*
* @throws IOException If an I/O error occurs
* @throws IndexOutOfBoundsException {@inheritDoc}
*/
// 尝试从当前输入流中读取len个char,并将其填充到b的off处。返回实际填充的字符数量,返回-1表示读取失败
public int read(char[] b, int off, int len) throws IOException {
synchronized(lock) {
ensureOpen();
if((off<0) || (off>b.length) || (len<0) || ((off + len)>b.length) || ((off + len)<0)) {
throw new IndexOutOfBoundsException();
} else if(len == 0) {
return 0;
}
if(pos >= count) {
return -1;
}
int avail = count - pos;
if(len>avail) {
len = avail;
}
if(len<=0) {
return 0;
}
System.arraycopy(buf, pos, b, off, len);
pos += len;
return len;
}
}
/*▲ 读 ████████████████████████████████████████████████████████████████████████████████┛ */
/*▼ 存档 ████████████████████████████████████████████████████████████████████████████████┓ */
/**
* Tells whether this stream supports the mark() operation, which it does.
*/
// 判断当前输入流是否支持存档标记,此处默认为true
public boolean markSupported() {
return true;
}
/**
* Marks the present position in the stream. Subsequent calls to reset()
* will reposition the stream to this point.
*
* @param readAheadLimit Limit on the number of characters that may be
* read while still preserving the mark. Because
* the stream's input comes from a character array,
* there is no actual limit; hence this argument is
* ignored.
*
* @throws IOException If an I/O error occurs
*/
// 设置存档标记,readAheadLimit参数未使用
public void mark(int readAheadLimit) throws IOException {
synchronized(lock) {
ensureOpen();
markedPos = pos;
}
}
/**
* Resets the stream to the most recent mark, or to the beginning if it has
* never been marked.
*
* @throws IOException If an I/O error occurs
*/
// 对于支持设置存档的输入流,可以重置其"读游标"到存档区的起始位置
public void reset() throws IOException {
synchronized(lock) {
ensureOpen();
pos = markedPos;
}
}
/*▲ 存档 ████████████████████████████████████████████████████████████████████████████████┛ */
/*▼ 杂项 ████████████████████████████████████████████████████████████████████████████████┓ */
/**
* Closes the stream and releases any system resources associated with
* it. Once the stream has been closed, further read(), ready(),
* mark(), reset(), or skip() invocations will throw an IOException.
* Closing a previously closed stream has no effect. This method will block
* while there is another thread blocking on the reader.
*/
// 关闭输入流
public void close() {
synchronized(lock) {
buf = null;
}
}
/**
* Tells whether this stream is ready to be read. Character-array readers
* are always ready to be read.
*
* @throws IOException If an I/O error occurs
*/
// 判断当前流是否已准备好被读取
public boolean ready() throws IOException {
synchronized(lock) {
ensureOpen();
return (count - pos)>0;
}
}
/**
* Skips characters. Returns the number of characters that were skipped.
*
* <p>The <code>n</code> parameter may be negative, even though the
* <code>skip</code> method of the {@link Reader} superclass throws
* an exception in this case. If <code>n</code> is negative, then
* this method does nothing and returns <code>0</code>.
*
* @param n The number of characters to skip
*
* @return The number of characters actually skipped
*
* @throws IOException If the stream is closed, or an I/O error occurs
*/
// 读取中跳过n个字符,返回实际跳过的字符数
public long skip(long n) throws IOException {
synchronized(lock) {
ensureOpen();
long avail = count - pos;
if(n>avail) {
n = avail;
}
if(n<0) {
return 0;
}
pos += n;
return n;
}
}
/*▲ 杂项 ████████████████████████████████████████████████████████████████████████████████┛ */
/** Checks to make sure that the stream has not been closed */
private void ensureOpen() throws IOException {
if(buf == null) {
throw new IOException("Stream closed");
}
}
}