Package cds.moc
Class IntArray
java.lang.Object
cds.moc.Array
cds.moc.IntArray
Fast array of integers
-
Field Summary
Fields inherited from class cds.moc.Array
DEFAULTBLOC, size, sizeBloc, sorted
-
Constructor Summary
Constructors -
Method Summary
Modifier and TypeMethodDescriptionboolean
add
(int v, boolean testUnicity) boolean
add
(long v, boolean testUnicity) Add a long.clone()
Deep copyboolean
delete
(int v) boolean
delete
(int v1, int v2) boolean
delete
(long v) Delete the first value equals to v kept the array sorted if requiredboolean
delete
(long v1, long v2) Delete the all values between v1 and v2 (inclusive) kept the array sorted if requiredboolean
deleteBrothers
(int me) boolean
deleteBrothers
(long me) Delete three other brothers only of all of them are already present (apart me)boolean
Equality testint
find
(int v) int
find
(long v) Return the index of the first value v.long
get
(int i) Provide the element ilong
getMem()
Size of the array in bytesint
Size of the array in compressed mode => consecutive values are memorized as range (2 values)boolean
intersectRange
(int vStart, int vEnd) boolean
intersectRange
(long vStart, long vEnd) Return true if at least one value of the range [vStart..vEnd] (included) is found in the arrayint[]
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 ivoid
sort()
Sort the array (only if required)void
trim()
Remove the reservation room in the arrayMethods 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 Details
-
IntArray
public IntArray(int bloc) Create a free array of longs -
IntArray
public IntArray(int[] v) Create an array of integers initializing with v[]- Parameters:
v
- initial values of the array
-
-
Method Details
-
clone
Deep copy -
equals
Equality test -
seeArray
public int[] 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 -
set
public void set(int i, long v) Description copied from class:Array
set the element i -
getMem
public long getMem()Size of the array in bytes -
getSizeCompressed
public int getSizeCompressed()Size of the array in compressed mode => consecutive values are memorized as range (2 values)- Specified by:
getSizeCompressed
in classArray
- Returns:
- Number of values
-
add
public boolean add(long v, boolean testUnicity) Add a long. the array will be automatically extended if necessary -
add
public boolean add(int v, boolean testUnicity) -
delete
public boolean delete(long v) Delete the first value equals to v kept the array sorted if required -
delete
public boolean delete(int v) -
delete
public boolean delete(long v1, long v2) Delete the all values between v1 and v2 (inclusive) kept the array sorted if required -
delete
public boolean delete(int v1, int 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 classArray
- Returns:
- false if not found
-
deleteBrothers
public boolean deleteBrothers(int 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) -
find
public int find(int 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 classArray
- Parameters:
vStart
- range starting valuevEnd
- range ending value- Returns:
- true in case of success
-
intersectRange
public boolean intersectRange(int vStart, int vEnd) -
sort
public void sort()Sort the array (only if required) -
trim
public void trim()Remove the reservation room in the array
-