org.basex.util.list

Class IntList

java.lang.Object

org.basex.util.list.ElementList

org.basex.util.list.IntList

public class IntList
extends ElementList

This is a simple container for native integers.

Author:

BaseX Team 2005-12, BSD License, Christian Gruen

Field Summary

Fields

Modifier and Type	Field and Description
protected int[]	list Element container.

Fields inherited from class org.basex.util.list.ElementList

CAP, size

Constructor Summary

Constructors

Constructor and Description
IntList() Default constructor.
IntList(double f) Constructor.
IntList(int c) Constructor, specifying an initial array capacity.
IntList(int[] a) Constructor, specifying an initial array.

Method Summary

Methods

Modifier and Type	Method and Description
void	add(int e) Adds an entry to the array.
boolean	contains(int e) Checks if the specified element is found in the list.
void	delete(int i) Deletes the element at the specified position.
int	get(int i) Returns the element at the specified index position.
void	insert(int i, int[] e) Inserts elements at the specified index position.
void	move(int e, int i) Adds a difference to all elements starting from the specified index.
int	peek() Returns the uppermost element from the stack.
int	pop() Pops the uppermost element from the stack.
void	push(int val) Pushes an element onto the stack.
void	set(int i, int e) Sets an element at the specified index position.
IntList	sort() Sorts the data.
void	sort(byte[][] tok, boolean num, boolean asc) Sorts the data in the order of the specified token array.
void	sort(double[] num, boolean asc) Sorts the data in the order of the specified numeric array.
void	sort(int[] num, boolean asc) Sorts the data in the order of the specified numeric array.
int	sortedIndexOf(int e) Searches the specified element via binary search.
int[]	toArray() Returns an array with all elements.
java.lang.String	toString()

Methods inherited from class org.basex.util.list.ElementList

isEmpty, newSize, newSize, reset, size

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait

Field Detail

list

protected int[] list

Element container.

Constructor Detail

IntList

public IntList()

Default constructor.

IntList

public IntList(int c)

Constructor, specifying an initial array capacity.

Parameters:

c - array capacity

IntList

public IntList(double f)

Constructor.

Parameters:

f - resize factor

IntList

public IntList(int[] a)

Constructor, specifying an initial array.

Parameters:

a - initial array

Method Detail

add

public final void add(int e)

Adds an entry to the array.

Parameters:

e - entry to be added

get

public final int get(int i)

Returns the element at the specified index position.

Parameters:

i - index

Returns:

element

set

public final void set(int i,
       int e)

Sets an element at the specified index position.

Parameters:

i - index

e - element to be set

contains

public final boolean contains(int e)

Checks if the specified element is found in the list.

Parameters:

e - element to be found

Returns:

result of check

insert

public final void insert(int i,
          int[] e)

Inserts elements at the specified index position.

Parameters:

i - index

e - elements to be inserted

delete

public final void delete(int i)

Deletes the element at the specified position.

Parameters:

i - position to delete

move

public final void move(int e,
        int i)

Adds a difference to all elements starting from the specified index.

Parameters:

e - difference

i - index

peek

public final int peek()

Returns the uppermost element from the stack.

Returns:

the uppermost element

pop

public final int pop()

Pops the uppermost element from the stack.

Returns:

the popped element

push

public final void push(int val)

Pushes an element onto the stack.

Parameters:

val - element

sortedIndexOf

public final int sortedIndexOf(int e)

Searches the specified element via binary search. Note that all elements must be sorted.

Parameters:

e - element to be found

Returns:

index of the search key, or the negative insertion point - 1

toArray

public final int[] toArray()

Returns an array with all elements.

Returns:

array

sort

public IntList sort()

Sorts the data.

Returns:

self reference

sort

public final void sort(byte[][] tok,
        boolean num,
        boolean asc)

Sorts the data in the order of the specified token array. Note that the input array will be resorted as well. The algorithm is derived from Arrays.sort(int[]).

Parameters:

tok - token array to sort by

num - numeric sort

asc - ascending

sort

public final void sort(double[] num,
        boolean asc)

Sorts the data in the order of the specified numeric array. Note that the input array will be resorted as well. The algorithm is derived from Arrays.sort(int[]).

Parameters:

num - token array to sort by

asc - ascending

sort

public final void sort(int[] num,
        boolean asc)

Sorts the data in the order of the specified numeric array. Note that the input array will be resorted as well. The algorithm is derived from Arrays.sort(int[]).

Parameters:

num - token array to sort by

asc - ascending

toString

public java.lang.String toString()

Overrides:

toString in class java.lang.Object