summaryrefslogtreecommitdiff
path: root/src/main/java/com/amazon/carbonado/lob/CharArrayClob.java
blob: ddba88946840ef3db7c6cc052e3d29c99a2eb830 (plain)
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
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
/*
 * Copyright 2006 Amazon Technologies, Inc. or its affiliates.
 * Amazon, Amazon.com and Carbonado are trademarks or registered trademarks
 * of Amazon Technologies, Inc. or its affiliates.  All rights reserved.
 *
 * 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.
 */

package com.amazon.carbonado.lob;

import java.io.IOException;
import java.io.Reader;
import java.io.Writer;

import java.util.Arrays;

import com.amazon.carbonado.PersistException;

/**
 * Implementation of a Clob which is backed by a growable in-memory character
 * array.
 *
 * @author Brian S O'Neill
 */
public class CharArrayClob extends AbstractClob {

    private final int mInitialCapacity;
    private char[] mData;
    private int mLength;

    /**
     * Construct a CharArrayClob with the given initial capacity.
     *
     * @param capacity initial capacity of internal character array
     */
    public CharArrayClob(int capacity) {
        if (capacity == 0) {
            throw new IllegalArgumentException();
        }
        mInitialCapacity = capacity;
        mData = new char[capacity];
    }

    /**
     * Construct a CharArrayClob initially backed by the given character array. The
     * character array is not cloned until this CharArrayClob grows or shrinks.
     *
     * @param data initial data backing the Clob
     */
    public CharArrayClob(char[] data) {
        if (data.length == 0) {
            throw new IllegalArgumentException();
        }
        mLength = mInitialCapacity = data.length;
        mData = data;
    }

    /**
     * Construct a CharArrayClob initially backed by the given character array. The
     * character array is not cloned until this CharArrayClob grows or shrinks.
     *
     * @param data initial data backing the Clob
     * @param length initial length of data
     */
    public CharArrayClob(char[] data, int length) {
        if (data.length < length) {
            throw new IllegalArgumentException();
        }
        mInitialCapacity = data.length;
        mData = data;
        mLength = length;
    }

    public Reader openReader() {
        return new Input(this, 0);
    }

    public Reader openReader(long pos) {
        if (pos < 0) {
            throw new IllegalArgumentException("Position is negative: " + pos);
        }
        return new Input(this, pos);
    }

    public Reader openReader(long pos, int bufferSize) {
        return openReader(pos);
    }

    public synchronized long getLength() {
        return mLength;
    }

    @Override
    public synchronized String asString() {
        return new String(mData, 0, mLength);
    }

    synchronized int read(long pos) {
        if (pos < 0) {
            throw new IllegalArgumentException("Position is negative: " + pos);
        }

        if (pos > Integer.MAX_VALUE) {
            return -1;
        }

        int ipos = (int) pos;
        if (ipos >= mLength) {
            return -1;
        }

        return mData[ipos];
    }

    synchronized int read(long pos, char[] chars) {
        if (pos < 0) {
            throw new IllegalArgumentException("Position is negative: " + pos);
        }
        if (chars == null) {
            throw new IllegalArgumentException("Character array is null");
        }

        if (pos > Integer.MAX_VALUE) {
            return -1;
        }

        int ipos = (int) pos;
        if (ipos > mLength) { // the use of '>' instead of '>=' is intentional
            return -1;
        }

        int length = chars.length;
        if (ipos + length > mLength) {
            length = mLength - ipos;
        }

        System.arraycopy(mData, ipos, chars, 0, length);

        return length;
    }

    synchronized int read(long pos, char[] chars, int offset, int length) {
        if (pos < 0) {
            throw new IllegalArgumentException("Position is negative: " + pos);
        }
        if (chars == null) {
            throw new IllegalArgumentException("Character array is null");
        }
        if (offset < 0) {
            throw new IllegalArgumentException("Offset is negative: " + offset);
        }
        if (length < 0) {
            throw new IllegalArgumentException("Length is negative: " + length);
        }

        if (pos > Integer.MAX_VALUE) {
            return -1;
        }

        int ipos = (int) pos;
        if (ipos > mLength) { // the use of '>' instead of '>=' is intentional
            return -1;
        }

        if (ipos + length > mLength) {
            length = mLength - ipos;
        }

        try {
            System.arraycopy(mData, ipos, chars, offset, length);
        } catch (IndexOutOfBoundsException e) {
            if (offset >= chars.length && length > 0) {
                throw new IllegalArgumentException("Offset is too large: " + offset);
            }
            throw e;
        }

        return length;
    }

    public Writer openWriter() {
        return new Output(this, 0);
    }

    public Writer openWriter(long pos) {
        if (pos < 0) {
            throw new IllegalArgumentException("Position is negative: " + pos);
        }
        return new Output(this, pos);
    }

    public Writer openWriter(long pos, int bufferSize) {
        return openWriter(pos);
    }

    public synchronized void setLength(long length) throws PersistException {
        if (length < 0) {
            throw new IllegalArgumentException("Length is negative: " + length);
        }
        if (length > Integer.MAX_VALUE) {
            throw new PersistException("Length too long: " + length);
        }
        int ilength = (int) length;
        if (ilength < mLength) {
            mLength = ilength;
            if (mData.length > mInitialCapacity) {
                // Free up some space.
                mData = new char[mInitialCapacity];
            }
        } else if (ilength > mLength) {
            if (ilength <= mData.length) {
                Arrays.fill(mData, mLength, ilength, (char) 0);
                mLength = ilength;
            } else {
                int newLength = mData.length * 2;
                if (newLength < ilength) {
                    newLength = ilength;
                }
                char[] newData = new char[newLength];
                System.arraycopy(mData, 0, newData, 0, mLength);
            }
            mLength = ilength;
        }
    }

    synchronized void write(long pos, int b) throws IOException {
        if (pos < 0) {
            throw new IllegalArgumentException("Position is negative: " + pos);
        }

        if (pos > Integer.MAX_VALUE) {
            throw new IOException("Position too high: " + pos);
        }

        int ipos = (int) pos;
        ensureLengthForWrite(ipos + 1);
        mData[ipos] = (char) b;
    }

    synchronized void write(long pos, char[] chars) throws IOException {
        if (pos < 0) {
            throw new IllegalArgumentException("Position is negative: " + pos);
        }
        if (chars == null) {
            throw new IllegalArgumentException("Character array is null");
        }

        if (pos > Integer.MAX_VALUE) {
            throw new IOException("Position too high: " + pos);
        }
        if (pos + chars.length > Integer.MAX_VALUE) {
            throw new IOException("Position plus length too high: " + (pos + chars.length));
        }

        int ipos = (int) pos;
        ensureLengthForWrite(ipos + chars.length);
        System.arraycopy(chars, 0, mData, ipos, chars.length);
    }

    synchronized void write(long pos, char[] chars, int offset, int length) throws IOException {
        if (pos < 0) {
            throw new IllegalArgumentException("Position is negative: " + pos);
        }
        if (chars == null) {
            throw new IllegalArgumentException("Character array is null");
        }
        if (offset < 0) {
            throw new IllegalArgumentException("Offset is negative: " + offset);
        }
        if (length < 0) {
            throw new IllegalArgumentException("Length is negative: " + length);
        }

        if (pos > Integer.MAX_VALUE) {
            throw new IOException("Position too high: " + pos);
        }
        if (pos + length > Integer.MAX_VALUE) {
            throw new IOException("Position plus length too high: " + (pos + length));
        }

        int ipos = (int) pos;
        ensureLengthForWrite(ipos + length);
        System.arraycopy(chars, offset, mData, ipos, length);
    }

    // Caller must be synchronized
    private void ensureLengthForWrite(int ilength) {
        if (ilength > mLength) {
            if (ilength <= mData.length) {
                mLength = ilength;
            } else {
                int newLength = mData.length * 2;
                if (newLength < ilength) {
                    newLength = ilength;
                }
                char[] newData = new char[newLength];
                System.arraycopy(mData, 0, newData, 0, mLength);
                mData = newData;
            }
            mLength = ilength;
        }
    }

    /**
     * Always returns null.
     */
    public Object getLocator() {
        return null;
    }

    private static class Input extends Reader {
        private final CharArrayClob mClob;
        private long mPos;
        private long mMarkPos;

        Input(CharArrayClob blob, long pos) {
            mClob = blob;
            mPos = pos;
            mMarkPos = pos;
        }

        @Override
        public int read() {
            int b = mClob.read(mPos);
            if (b >= 0) {
                mPos++;
            }
            return b;
        }

        @Override
        public int read(char[] chars) {
            int length = mClob.read(mPos, chars);
            if (length > 0) {
                mPos += length;
            }
            return length;
        }

        @Override
        public int read(char[] chars, int offset, int length) {
            length = mClob.read(mPos, chars, offset, length);
            if (length > 0) {
                mPos += length;
            }
            return length;
        }

        @Override
        public long skip(long n) {
            if (n <= 0) {
                return 0;
            }

            long newPos = mPos + n;
            if (newPos < 0) {
                newPos = Long.MAX_VALUE;
            }

            long length = mClob.getLength();
            if (newPos > length) {
                newPos = length;
            }

            n = newPos - mPos;
            mPos = newPos;
            return n;
        }

        @Override
        public boolean ready() {
            return (mClob.getLength() - mPos) > 0;
        }

        @Override
        public void mark(int readlimit) {
            mMarkPos = mPos;
        }

        @Override
        public void reset() {
            mPos = mMarkPos;
        }

        @Override
        public boolean markSupported() {
            return true;
        }

        @Override
        public void close() {
        }
    }

    private static class Output extends Writer {
        private final CharArrayClob mClob;
        private long mPos;

        Output(CharArrayClob blob, long pos) {
            mClob = blob;
            mPos = pos;
        }

        @Override
        public void write(int b) throws IOException {
            mClob.write(mPos, b);
            mPos++;
        }

        @Override
        public void write(char[] b) throws IOException {
            mClob.write(mPos, b);
            mPos += b.length;
        }

        @Override
        public void write(char[] b, int offset, int length) throws IOException {
            mClob.write(mPos, b, offset, length);
            mPos += length;
        }

        @Override
        public void flush() {
        }

        @Override
        public void close() {
        }
    }
}