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
|
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You 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.
*/
/* $Id$ */
package org.apache.fop.hyphenation;
import java.io.Serializable;
/**
* This class implements a simple byte vector with access to the
* underlying array.
*
* @author Carlos Villegas <cav@uniscope.co.jp>
*/
public class ByteVector implements Serializable {
private static final long serialVersionUID = 1554572867863466772L;
/**
* Capacity increment size
*/
private static final int DEFAULT_BLOCK_SIZE = 2048;
private int blockSize;
/**
* The encapsulated array
*/
private byte[] array;
/**
* Points to next free item
*/
private int n;
/**
* Construct byte vector instance with default block size.
*/
public ByteVector() {
this(DEFAULT_BLOCK_SIZE);
}
/**
* Construct byte vector instance.
* @param capacity initial block size
*/
public ByteVector(int capacity) {
if (capacity > 0) {
blockSize = capacity;
} else {
blockSize = DEFAULT_BLOCK_SIZE;
}
array = new byte[blockSize];
n = 0;
}
/**
* Construct byte vector instance.
* @param a byte array to use
* TODO should n should be initialized to a.length to be consistent with
* CharVector behavior? [GA]
*/
public ByteVector(byte[] a) {
blockSize = DEFAULT_BLOCK_SIZE;
array = a;
n = 0;
}
/**
* Construct byte vector instance.
* @param a byte array to use
* @param capacity initial block size
* TODO should n should be initialized to a.length to be consistent with
* CharVector behavior? [GA]
*/
public ByteVector(byte[] a, int capacity) {
if (capacity > 0) {
blockSize = capacity;
} else {
blockSize = DEFAULT_BLOCK_SIZE;
}
array = a;
n = 0;
}
/**
* Obtain byte vector array.
* @return byte array
*/
public byte[] getArray() {
return array;
}
/**
* Obtain number of items in array.
* @return number of items
*/
public int length() {
return n;
}
/**
* Obtain capacity of array.
* @return current capacity of array
*/
public int capacity() {
return array.length;
}
/**
* Pet byte at index.
* @param index the index
* @param val a byte
*/
public void put(int index, byte val) {
array[index] = val;
}
/**
* Get byte at index.
* @param index the index
* @return a byte
*/
public byte get(int index) {
return array[index];
}
/**
* This is to implement memory allocation in the array. Like malloc().
* @param size to allocate
* @return previous length
*/
public int alloc(int size) {
int index = n;
int len = array.length;
if (n + size >= len) {
byte[] aux = new byte[len + blockSize];
System.arraycopy(array, 0, aux, 0, len);
array = aux;
}
n += size;
return index;
}
/**
* Trim byte vector to current length.
*/
public void trimToSize() {
if (n < array.length) {
byte[] aux = new byte[n];
System.arraycopy(array, 0, aux, 0, n);
array = aux;
}
}
}
|
