HyperSQL Database 2.7.4 · org.hsqldb.lib.IntIndex · APIdia, the JavaDoc alternative

Modifier and Type	Field and Description
private int	capacity
private int	count
private final boolean	fixedSize
private int[]	keys
private boolean	sorted
private int	targetSearchValue

Access	Constructor and Description
public	IntIndex(int capacity, boolean fixedSize)

Method Summary

Modifier and Type	Method and Description
public synchronized int	Returns: index of added key or -1 if full add(int the key key) Adds a key, maintaining sort order on current search target column.
public synchronized boolean	Returns: true or false depending on success addSorted(int the key key) Adds a key into the table with the guarantee that the key is equal or larger than the largest existing key.
public synchronized boolean	Returns: true or false depending on success addUnique(int the key key) Adds a key, ensuring no duplicate key already exists in the current search target column.
public synchronized boolean	Returns: true or false depending on success addUnsorted(int the key key) Adds a key into the table.
private int	Returns: the index binaryEmptySlotSearch() Returns the index of the lowest element `>` the given search target or count or -1 if target is found
private int	Returns: index or -1 if not found binaryFirstSearch() Returns the index of the lowest element == the given search target, or -1
private int	Returns: the index binarySlotSearch() Returns the index of the lowest element `>=` the given search target, or count
public synchronized int	capacity()
public void	clear()
protected int	Returns: -1, 0 or +1 compare(int the index i) Check if targeted column value in the row indexed i is less than the search target object.
protected void	doubleCapacity()
private synchronized void	fastQuickSort() fast quicksort using a stack on the heap to reduce stack use
private synchronized void	fastQuickSortRecursive() fast quicksort with recursive quicksort implementation
public synchronized int	findFirstConsecutiveKeys(int the number of consecutive keys required number) Returns: the index or -1 if not found
public synchronized int	findFirstEqualKeyIndex(int the value value) Returns: the index
public synchronized int	findFirstGreaterEqualKeyIndex(int the value value) Returns: the index
public synchronized int	Returns: the index findFirstGreaterEqualSlotIndex(int the value value) This method is similar to findFirstGreaterEqualKeyIndex(int) but returns the index of the empty row past the end of the array if the search value is larger than all the values / keys in the searched column.
public synchronized int	findFirstIndexUnsorted(int value)
public synchronized int	getKey(int i)
public int[]	getKeys()
public synchronized long	getTotalValues()
private void	insertionSort(int lo0, int hi0)
protected boolean	Returns: true or false lessThan(int the first index i, int the second index j) Check if row indexed i is less than row indexed j
protected void	moveAndInsertRow(int i, int j)
protected void	moveRows(int fromIndex, int toIndex, int rows)
private int	partition(int start, int end, int pivot)
private void	quickSort(int l, int r)
public final synchronized void	remove(int position)
public synchronized void	removeAll()
public synchronized int	removeFirstConsecutiveKeys(int the number of consecutive keys required number, int default value def) Returns: the first key in series or def if not found
public synchronized void	removeRange(int start, int limit)
public synchronized void	setKey(int the index i, int the key key) Modifies an existing pair.
public synchronized int	size()
public synchronized void	sort()
protected void	swap(int i1, int i2)

Inherited from java.lang.Object:: clone equals finalize getClass hashCode notify notifyAll toString wait wait wait

capacity	back to summary
private int capacity

count	back to summary
private int count

fixedSize	back to summary
private final boolean fixedSize

keys	back to summary
private int[] keys

sorted	back to summary
private boolean sorted

targetSearchValue	back to summary
private int targetSearchValue

IntIndex	back to summary
public IntIndex(int capacity, boolean fixedSize)

Method Detail

add	back to summary
public synchronized int add(int key) Adds a key, maintaining sort order on current search target column. Parameters key:int the key Returns:int index of added key or -1 if full

add

back to summary

public synchronized int add(int key)

Adds a key, maintaining sort order on current search target column.

Parameters

key:int: the key

Returns:int

index of added key or -1 if full

addSorted	back to summary
public synchronized boolean addSorted(int key) Adds a key into the table with the guarantee that the key is equal or larger than the largest existing key. This prevents a sort from taking place on next call to find() Parameters key:int the key Returns:boolean true or false depending on success

addSorted

back to summary

public synchronized boolean addSorted(int key)

Adds a key into the table with the guarantee that the key is equal or larger than the largest existing key. This prevents a sort from taking place on next call to find()

Parameters

key:int: the key

Returns:boolean

true or false depending on success

addUnique	back to summary
public synchronized boolean addUnique(int key) Adds a key, ensuring no duplicate key already exists in the current search target column. Parameters key:int the key Returns:boolean true or false depending on success

addUnique

back to summary

public synchronized boolean addUnique(int key)

Adds a key, ensuring no duplicate key already exists in the current search target column.

Parameters

key:int: the key

Returns:boolean

true or false depending on success

addUnsorted	back to summary
public synchronized boolean addUnsorted(int key) Adds a key into the table. Parameters key:int the key Returns:boolean true or false depending on success

addUnsorted

back to summary

public synchronized boolean addUnsorted(int key)

Adds a key into the table.

Parameters

key:int: the key

Returns:boolean

true or false depending on success

binaryEmptySlotSearch back to summary

binaryEmptySlotSearch	back to summary
private int binaryEmptySlotSearch() Returns the index of the lowest element `>` the given search target or count or -1 if target is found Returns:int the index

private int binaryEmptySlotSearch()

Returns the index of the lowest element > the given search target or count or -1 if target is found

Returns:int: the index

binaryFirstSearch	back to summary
private int binaryFirstSearch() Returns the index of the lowest element == the given search target, or -1 Returns:int index or -1 if not found

binaryFirstSearch

back to summary

private int binaryFirstSearch()

Returns the index of the lowest element == the given search target, or -1

Returns:int: index or -1 if not found

binarySlotSearch back to summary

binarySlotSearch	back to summary
private int binarySlotSearch() Returns the index of the lowest element `>=` the given search target, or count Returns:int the index

private int binarySlotSearch()

Returns the index of the lowest element >= the given search target, or count

Returns:int: the index

capacity	back to summary
public synchronized int capacity()

clear	back to summary
public void clear()

compare	back to summary
protected int compare(int i) Check if targeted column value in the row indexed i is less than the search target object. Parameters i:int the index Returns:int -1, 0 or +1

compare

back to summary

protected int compare(int i)

Check if targeted column value in the row indexed i is less than the search target object.

Parameters

i:int: the index

Returns:int

-1, 0 or +1

doubleCapacity	back to summary
protected void doubleCapacity()

fastQuickSort	back to summary
private synchronized void fastQuickSort() fast quicksort using a stack on the heap to reduce stack use

fastQuickSortRecursive	back to summary
private synchronized void fastQuickSortRecursive() fast quicksort with recursive quicksort implementation

findFirstConsecutiveKeys	back to summary
public synchronized int findFirstConsecutiveKeys(int number) Parameters number:int the number of consecutive keys required Returns:int the index or -1 if not found

findFirstEqualKeyIndex	back to summary
public synchronized int findFirstEqualKeyIndex(int value) Parameters value:int the value Returns:int the index

findFirstGreaterEqualKeyIndex	back to summary
public synchronized int findFirstGreaterEqualKeyIndex(int value) Parameters value:int the value Returns:int the index

findFirstGreaterEqualSlotIndex	back to summary
public synchronized int findFirstGreaterEqualSlotIndex(int value) This method is similar to findFirstGreaterEqualKeyIndex(int) but returns the index of the empty row past the end of the array if the search value is larger than all the values / keys in the searched column. Parameters value:int the value Returns:int the index

findFirstGreaterEqualSlotIndex

back to summary

public synchronized int findFirstGreaterEqualSlotIndex(int value)

This method is similar to findFirstGreaterEqualKeyIndex(int) but returns the index of the empty row past the end of the array if the search value is larger than all the values / keys in the searched column.

Parameters

value:int: the value

Returns:int

the index

findFirstIndexUnsorted	back to summary
public synchronized int findFirstIndexUnsorted(int value)

getKey	back to summary
public synchronized int getKey(int i)

getKeys	back to summary
public int[] getKeys()

getTotalValues	back to summary
public synchronized long getTotalValues()

insertionSort	back to summary
private void insertionSort(int lo0, int hi0)

lessThan	back to summary
protected boolean lessThan(int i, int j) Check if row indexed i is less than row indexed j Parameters i:int the first index j:int the second index Returns:boolean true or false

lessThan

back to summary

protected boolean lessThan(int i, int j)

Check if row indexed i is less than row indexed j

Parameters

i:int: the first index
j:int: the second index

Returns:boolean

true or false

moveAndInsertRow	back to summary
protected void moveAndInsertRow(int i, int j)

moveRows	back to summary
protected void moveRows(int fromIndex, int toIndex, int rows)

partition	back to summary
private int partition(int start, int end, int pivot)

quickSort	back to summary
private void quickSort(int l, int r)

remove	back to summary
public final synchronized void remove(int position)

removeAll	back to summary
public synchronized void removeAll()

removeFirstConsecutiveKeys	back to summary
public synchronized int removeFirstConsecutiveKeys(int number, int def) Parameters number:int the number of consecutive keys required def:int default value Returns:int the first key in series or def if not found

removeRange	back to summary
public synchronized void removeRange(int start, int limit)

setKey	back to summary
public synchronized void setKey(int i, int key) Modifies an existing pair. Parameters i:int the index key:int the key

setKey

back to summary

public synchronized void setKey(int i, int key)

Modifies an existing pair.

Parameters

i:int: the index
key:int: the key

size	back to summary
public synchronized int size()

sort	back to summary
public synchronized void sort()

swap	back to summary
protected void swap(int i1, int i2)

public Class IntIndex

Field Summary

Constructor Summary

Method Summary

Field Detail

Constructor Detail

Method Detail