org.vishia.util

Class IntegerBlockArray

java.lang.Object

org.vishia.util.IntegerBlockArray

public class IntegerBlockArray
extends java.lang.Object

This class is a int array. The access is done with get(int) and set(int, int). The array is divide in many parts, whereby one part can be stored in one block of a block-heap, see AllocInBlock. Usual one part can store about 100 values. With a 2-level tree structure 10000 values can be stored, with 3 level 1 million etc. The size of the array is general unlimited, only the memory space on execution machine is limited. Increasing the size does not re-allocate and does not move large data, only allocate new memory blocks.

Field Summary

Fields

Modifier and Type	Field and Description
(package private) int[]	array
(package private) int	bit1
(package private) int	bit2
(package private) IntegerBlockArray[]	blocks
(package private) int	size Size of this array inclusively maybe sub blocks.
static int	version Version, history and license.

Constructor Summary

Constructors

Constructor and Description
IntegerBlockArray(int newSize)

Method Summary

Modifier and Type	Method and Description
int	binarySearch(int val, int max) Searches the value in the arrays and returns the index of that value, which is equal or near lesser than the requested one.
int	binarySearchFirstKey(int val, int max) Searches the value in the arrays and returns the index of the first occurence of that value, which is equal or near lesser than the requested one.
(package private) int	get(int ix)
static void	main(java.lang.String[] args)
(package private) void	set(int ix, int val)
(package private) void	setSize(int newSize)

Methods inherited from class java.lang.Object

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

Field Detail

version

public static final int version

Version, history and license.

• 2014-05-23 Hartmut bugfix binarySearch(int, int), new binarySearchFirstKey(int, int). It was a mix before with a faulty algorithm.
• 2013-12-31 Hartmut created.

Copyright/Copyleft: For this source the LGPL Lesser General Public License, published by the Free Software Foundation is valid. It means:

1. You can use this source without any restriction for any desired purpose.
2. You can redistribute copies of this source to everybody.
3. Every user of this source, also the user of redistribute copies with or without payment, must accept this license for further using.
4. But the LPGL is not appropriate for a whole software product, if this source is only a part of them. It means, the user must publish this part of source, but don't need to publish the whole source of the own product.
5. You can study and modify (improve) this source for own using or for redistribution, but you have to license the modified sources likewise under this LGPL Lesser General Public License. You mustn't delete this Copyright/Copyleft inscription in this source file.

If you are intent to use this sources without publishing its usage, you can get a second license subscribing a special contract with the author.

See Also:

Constant Field Values

array

int[] array

bit1

int bit1

bit2

int bit2

size

int size

Size of this array inclusively maybe sub blocks.

blocks

IntegerBlockArray[] blocks

Constructor Detail

IntegerBlockArray

IntegerBlockArray(int newSize)

Method Detail

get

int get(int ix)

set

void set(int ix,
         int val)

setSize

void setSize(int newSize)

binarySearch

public int binarySearch(int val,
                        int max)

Searches the value in the arrays and returns the index of that value, which is equal or near lesser than the requested one. It assumes that all values are stored in ascending order.

Parameters:

val -

max -

Returns:

binarySearchFirstKey

public int binarySearchFirstKey(int val,
                                int max)

Searches the value in the arrays and returns the index of the first occurence of that value, which is equal or near lesser than the requested one. It assumes that all values are stored in ascending order, but it is possible to have one value more as one time.

Parameters:

val -

max -

Returns:

main

public static void main(java.lang.String[] args)