com.aowagie.text.pdf.hyphenation.ByteVector Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of afirma-lib-itext-android Show documentation
Show all versions of afirma-lib-itext-android Show documentation
Version modificada de iText 2.1.7 con el paquete cambiado, adaptaciones menores para firma y dependencias actualizadas.
/*
* Copyright 1999-2004 The Apache Software Foundation.
*
* 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.aowagie.text.pdf.hyphenation;
import java.io.Serializable;
/**
* This class implements a simple byte vector with access to the
* underlying array.
*
* @author Carlos Villegas ([email protected])
*/
class ByteVector implements Serializable {
private static final long serialVersionUID = -1096301185375029343L;
/**
* 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;
public ByteVector() {
this(DEFAULT_BLOCK_SIZE);
}
private ByteVector(final int capacity) {
if (capacity > 0) {
this.blockSize = capacity;
} else {
this.blockSize = DEFAULT_BLOCK_SIZE;
}
this.array = new byte[this.blockSize];
this.n = 0;
}
public byte[] getArray() {
return this.array;
}
/**
* return number of items in array
*/
int length() {
return this.n;
}
byte get(final int index) {
return this.array[index];
}
/**
* This is to implement memory allocation in the array. Like malloc().
*/
int alloc(final int size) {
final int index = this.n;
final int len = this.array.length;
if (this.n + size >= len) {
final byte[] aux = new byte[len + this.blockSize];
System.arraycopy(this.array, 0, aux, 0, len);
this.array = aux;
}
this.n += size;
return index;
}
void trimToSize() {
if (this.n < this.array.length) {
final byte[] aux = new byte[this.n];
System.arraycopy(this.array, 0, aux, 0, this.n);
this.array = aux;
}
}
}