org.jpedal.utils.repositories.Vector_Int Maven / Gradle / Ivy
The newest version!
/*
* ===========================================
* Java Pdf Extraction Decoding Access Library
* ===========================================
*
* Project Info: http://www.idrsolutions.com
* Help section for developers at http://www.idrsolutions.com/java-pdf-library-support/
*
* (C) Copyright 1997-2013, IDRsolutions and Contributors.
*
* This file is part of JPedal
*
This library is free software; you can redistribute it and/or
modify it under the terms of the GNU Lesser General Public
License as published by the Free Software Foundation; either
version 2.1 of the License, or (at your option) any later version.
This library 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
Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public
License along with this library; if not, write to the Free Software
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*
* ---------------
* Vector_Int.java
* ---------------
*/
package org.jpedal.utils.repositories;
import java.io.Serializable;
/**
* Provides the functionality/convenience of a Vector for ints -
*
* Much faster because not synchronized and no cast - Does not double in size each time
*/
public class Vector_Int implements Serializable {
private static final long serialVersionUID = 4565082539962696837L;
// how much we resize each time - will be doubled up to 160
int increment_size = 1000;
protected int current_item = 0;
// current max size
int max_size = 250;
// holds the data
protected int[] items = new int[this.max_size];
/** new value for an empty array */
protected int defaultValue = 0;
private boolean debug;
// default size
public Vector_Int() {
}
protected static int incrementSize(int increment_size) {
if (increment_size < 8000) increment_size = increment_size * 4;
else
if (increment_size < 16000) increment_size = increment_size * 2;
else increment_size = increment_size + 2000;
return increment_size;
}
// set size
public Vector_Int(int number) {
this.max_size = number;
this.items = new int[this.max_size];
}
// set size (and debug options for internal use
public Vector_Int(int number, boolean debug) {
this.debug = debug;
this.max_size = number;
this.items = new int[this.max_size];
}
// /////////////////////////////////
/**
* get element at
*/
final synchronized public int elementAt(int id) {
if (id >= this.max_size) return 0;
else return this.items[id];
}
// /////////////////////////////////
/**
* extract underlying data
*/
final public int[] get() {
return this.items;
}
// /////////////////////////////////
/**
* set an element
*/
final public void setElementAt(int new_name, int id) {
if (id >= this.max_size) checkSize(id);
this.items[id] = new_name;
}
// /////////////////////////////////
/**
* replace underlying data
*/
final public void set(int[] new_items) {
this.items = new_items;
}
// //////////////////////////////////
// merge together using larger as new value
final public void keep_larger(int master, int child) {
if (this.items[master] < this.items[child]) this.items[master] = this.items[child];
}
// //////////////////////////////////
// merge to keep smaller
final public void keep_smaller(int master, int child) {
if (this.items[master] > this.items[child]) this.items[master] = this.items[child];
}
// /////////////////////////////////
/**
* clear the array
*/
final public void clear() {
this.checkPoint = -1;
this.items = null;
// holds the data
this.items = new int[this.max_size];
if (this.defaultValue != 0) {
for (int i = 0; i < this.max_size; i++)
this.items[i] = this.defaultValue;
}
else {
if (this.current_item > 0) {
for (int i = 0; i < this.current_item; i++)
this.items[i] = 0;
}
else {
for (int i = 0; i < this.max_size; i++)
this.items[i] = 0;
}
}
this.current_item = 0;
}
// /////////////////////////////////
/**
* return the size+1 as in last item (so an array of 0 values is 1) if added If using set, use checkCapacity
*/
final synchronized public int size() {
return this.current_item + 1;
}
/**
* return the sizeof array
*/
final synchronized public int getCapacity() {
return this.items.length;
}
// /////////////////////////////////
/**
* remove element at
*/
final public void removeElementAt(int id) {
if (id >= 0) {
// copy all items back one to over-write
System.arraycopy(this.items, id + 1, this.items, id, this.current_item - 1 - id);
// flush last item
this.items[this.current_item - 1] = 0;
}
else this.items[0] = 0;
// reduce counter
this.current_item--;
}
/**
* delete element at
*/
final synchronized public void deleteElementWithValue(int id) {
int currentSize = this.items.length;
int[] newItems = new int[currentSize - 1];
int counter = 0;
// copy all items back except item to delete
for (int item : this.items) {
if (item != id) {
newItems[counter] = item;
counter++;
}
}
// reassign
this.items = newItems;
// reduce counter
this.current_item--;
}
@Override
public String toString() {
String returnString = "{";
// copy all items back except item to delete
for (int item : this.items)
returnString = returnString + ' ' + item;
return returnString + "} " + this.current_item;
}
// //////////////////////////////////
/**
* see if value present
*/
final public boolean contains(int value) {
boolean flag = false;
for (int i = 0; i < this.current_item; i++) {
if (this.items[i] == value) {
i = this.current_item + 1;
flag = true;
}
}
return flag;
}
// ///////////////////////////////////
/**
* pull item from top as in LIFO stack
*/
final public int pull() {
if (this.current_item > 0) this.current_item--;
return (this.items[this.current_item]);
}
// ///////////////////////////////////
/**
* put item at top as in LIFO stack
*/
final public void push(int value) {
checkSize(this.current_item);
this.items[this.current_item] = value;
this.current_item++;
checkSize(this.current_item);
}
// /////////////////////////////////
/**
* add an item
*/
final public void addElement(int value) {
checkSize(this.current_item);
this.items[this.current_item] = value;
this.current_item++;
checkSize(this.current_item);
if (this.debug) System.out.println(this.current_item + "=" + value);
}
// //////////////////////////////////
// merge together using larger as new value
final public void add_together(int master, int child) {
this.items[master] = this.items[master] + this.items[child];
}
// //////////////////////////////////
/**
* check the size of the array and increase if needed
*/
final private void checkSize(int i) {
if (i >= this.max_size) {
int old_size = this.max_size;
this.max_size = this.max_size + this.increment_size;
// allow for it not creating space
if (this.max_size <= i) this.max_size = i + this.increment_size + 2;
int[] temp = this.items;
this.items = new int[this.max_size];
int i1;
// add a default value
if (this.defaultValue != 0) {
for (i1 = old_size; i1 < this.max_size; i1++)
this.items[i1] = this.defaultValue;
}
System.arraycopy(temp, 0, this.items, 0, old_size);
this.increment_size = incrementSize(this.increment_size);
// if( increment_size <= i ){
// if(increment_size<2500)
// increment_size=increment_size*4;
// else if(increment_size<10000)
// increment_size=increment_size*2;
// else
// increment_size=increment_size+2000;
// //max_size = i +increment_size+ 2;
// }
}
}
/**
* recycle the array by just resetting the pointer
*/
final public void reuse() {
this.current_item = 0;
}
public void trim() {
int[] newItems = new int[this.current_item];
System.arraycopy(this.items, 0, newItems, 0, this.current_item);
this.items = newItems;
this.max_size = this.current_item;
}
/** reset pointer used in add to remove items above */
public void setSize(int currentItem) {
this.current_item = currentItem;
}
private int checkPoint = -1;
/**
* used to store end of PDF components
*/
public void resetToCheckpoint() {
if (this.debug) System.out.println("checkpoint=" + this.checkPoint + " current=" + this.current_item);
if (this.checkPoint != -1) this.current_item = this.checkPoint;
this.checkPoint = -1;
}
/**
* used to rollback array to point
*/
public void setCheckpoint() {
if (this.debug) System.out.println("1set checkpoint=" + this.current_item + ' ' + this.checkPoint);
if (this.checkPoint == -1) this.checkPoint = this.current_item;
if (this.debug) System.out.println("2set checkpoint=" + this.current_item + ' ' + this.checkPoint);
}
}