Package cds.moc

Class ShortArray

java.lang.Object

cds.moc.Array

cds.moc.ShortArray

All Implemented Interfaces:

java.lang.Cloneable, java.lang.Iterable<java.lang.Long>

public final class ShortArray
extends Array

Fast array of shorts

Field Summary

Fields inherited from class cds.moc.Array

DEFAULTBLOC, size, sizeBloc, sorted

Constructor Summary

Constructors

Constructor	Description
ShortArray(int bloc)	Create a free array of longs
ShortArray(short[] v)	Create an array of integers initializing with v[]

Method Summary

Modifier and Type	Method	Description
boolean	add(long v, boolean testUnicity)	Add a long.
boolean	add(short v, boolean testUnicity)
Array	clone()	Deep copy
boolean	delete(long v)	Delete the first value equals to v kept the array sorted if required
boolean	delete(long v1, long v2)	Delete the all values between v1 and v2 (inclusive) kept the array sorted if required
boolean	delete(short v)
boolean	delete(short v1, short v2)
boolean	deleteBrothers(long me)	Delete three other brothers only of all of them are already present (apart me)
boolean	deleteBrothers(short me)
boolean	equals(Array a)	Equality test
int	find(long v)	Return the index of the first value v.
int	find(short v)
int	geSize()
long	get(int i)	Provide the element i
long	getMem()	Size of the array in bytes
int	getSizeCompressed()	Size of the array in compressed mode => consecutive values are memorized as range (2 values)
boolean	intersectRange(long vStart, long vEnd)	Return true if at least one value of the range [vStart..vEnd] (included) is found in the array
boolean	intersectRange(short vStart, short vEnd)
short[]	seeArray()	Provide the java reference on the array (real size is provided by getSize() and not by .length)
void	set(int i, long v)	set the element i
void	sort()	Sort the array (only if required)
void	trim()	Remove the reservation room in the array

Methods inherited from class cds.moc.Array

getSize, isSorted, iterator, setSize

Methods inherited from class java.lang.Object

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

Methods inherited from interface java.lang.Iterable

forEach, spliterator

Constructor Detail

ShortArray

public ShortArray(int bloc)

Create a free array of longs

ShortArray

public ShortArray(short[] v)

Create an array of integers initializing with v[]

Parameters:

v - initial values of the array

Method Detail

clone

public Array clone()

Deep copy

Specified by:

clone in class Array

equals

public boolean equals(Array a)

Equality test

Specified by:

equals in class Array

seeArray

public short[] seeArray()

Provide the java reference on the array (real size is provided by getSize() and not by .length)

Returns:

array of longs

get

public long get(int i)

Description copied from class: Array

Provide the element i

Specified by:

get in class Array

set

public void set(int i,
                long v)

Description copied from class: Array

set the element i

Specified by:

set in class Array

getMem

public long getMem()

Size of the array in bytes

Specified by:

getMem in class Array

geSize

public int geSize()

getSizeCompressed

public int getSizeCompressed()

Size of the array in compressed mode => consecutive values are memorized as range (2 values)

Specified by:

getSizeCompressed in class Array

Returns:

Number of values

add

public boolean add(long v,
                   boolean testUnicity)

Add a long. the array will be automatically extended if necessary

Specified by:

add in class Array

Parameters:

v - value to add

testUnicity - true for avoiding redundancy (slower)

Returns:

true if the value has been added

add

public boolean add(short v,
                   boolean testUnicity)

delete

public boolean delete(long v)

Delete the first value equals to v kept the array sorted if required

Specified by:

delete in class Array

Parameters:

v - the value to remove

Returns:

true if the value has been removed

delete

public boolean delete(short v)

delete

public boolean delete(long v1,
                      long v2)

Delete the all values between v1 and v2 (inclusive) kept the array sorted if required

Specified by:

delete in class Array

Parameters:

v1 - the low range value

v2 - the high range value

Returns:

true if at least one value has been removed

delete

public boolean delete(short v1,
                      short v2)

deleteBrothers

public boolean deleteBrothers(long me)

Delete three other brothers only of all of them are already present (apart me)

Specified by:

deleteBrothers in class Array

Returns:

false if not found

deleteBrothers

public boolean deleteBrothers(short me)

find

public int find(long v)

Return the index of the first value v. -1 if not found. If the arrays is sorted, proceeds by bsearch (see bsearch doc)

Specified by:

find in class Array

Parameters:

v - Value to find

Returns:

index of the value, otherwise negative index

find

public int find(short v)

intersectRange

public boolean intersectRange(long vStart,
                              long vEnd)

Return true if at least one value of the range [vStart..vEnd] (included) is found in the array

Specified by:

intersectRange in class Array

Parameters:

vStart - range starting value

vEnd - range ending value

Returns:

true in case of success

intersectRange

public boolean intersectRange(short vStart,
                              short vEnd)

sort

public void sort()

Sort the array (only if required)

Specified by:

sort in class Array

trim

public void trim()

Remove the reservation room in the array

Specified by:

trim in class Array