com.tangosol.util.LongArray Maven / Gradle / Ivy
Show all versions of coherence Show documentation
/*
* Copyright (c) 2000, 2020, Oracle and/or its affiliates.
*
* Licensed under the Universal Permissive License v 1.0 as shown at
* http://oss.oracle.com/licenses/upl.
*/
package com.tangosol.util;
import java.io.Serializable;
/**
* An interface, similar in its methods to List, and similar in its purpose
* to a Java array, designed for sparse storage and indexed by long values.
*
* Unlike the List interface, the LongArray interface assumes that every
* index can be accessed and has storage available.
*
* @author cp
* @version 1.00 2002.04.24 based on WindowedArray component and SparseArray
* prototype
*/
public interface LongArray
extends Cloneable, Serializable, Iterable
{
/**
* Return the value stored at the specified index.
*
* @param lIndex a long index value
*
* @return the object stored at the specified index, or null
*/
public V get(long lIndex);
/**
* Return the "first" index which is less than or equal to the specified index.
*
* @param lIndex the index
*
* @return the index or NOT_FOUND
*/
public long floorIndex(long lIndex);
/**
* Return the "first" value with an index which is less than or equal to the specified index.
*
* @param lIndex the index
*
* @return the value or null
*/
public V floor(long lIndex);
/**
* Return the "first" index which is greater than or equal to the specified index.
*
* @param lIndex the index
*
* @return the index or NOT_FOUND
*/
public long ceilingIndex(long lIndex);
/**
* Return the "first" value with an index which is greater than or equal to the specified index.
*
* @param lIndex the index
*
* @return the value or null
*/
public V ceiling(long lIndex);
/**
* Add the passed item to the LongArray at the specified index.
*
* If the index is already used, the passed value will replace the current
* value stored with the key, and the replaced value will be returned.
*
* It is expected that LongArray implementations will "grow" as necessary
* to support the specified index.
*
* @param lIndex a long index value
* @param oValue the object to store at the specified index
*
* @return the object that was stored at the specified index, or null
*/
public V set(long lIndex, V oValue);
/**
* Add the passed element value to the LongArray and return the index at
* which the element value was stored.
*
* @param oValue the object to add to the LongArray
*
* @return the long index value at which the element value was stored
*/
public long add(V oValue);
/**
* Determine if the specified index is in use.
*
* @param lIndex a long index value
*
* @return true if a value (including null) is stored at the specified
* index, otherwise false
*/
public boolean exists(long lIndex);
/**
* Remove the specified index from the LongArray, returning its associated
* value.
*
* @param lIndex the index into the LongArray
*
* @return the associated value (which can be null) or null if the
* specified index is not in the LongArray
*/
public V remove(long lIndex);
/**
* Remove all nodes in the specified range.
*
* @param lIndexFrom the floor index
* @param lIndexTo the ceiling index (exclusive)
*/
public void remove(long lIndexFrom, long lIndexTo);
/**
* Determine if the LongArray contains the specified element.
*
* More formally, returns true if and only if this LongArray
* contains at least one element e such that
* (o==null ? e==null : o.equals(e)).
*
* @param oValue element whose presence in this list is to be tested
*
* @return true if this list contains the specified element
*/
public boolean contains(V oValue);
/**
* Remove all nodes from the LongArray.
*/
public void clear();
/**
* Test for empty LongArray.
*
* @return true if LongArray has no nodes
*/
public boolean isEmpty();
/**
* Determine the size of the LongArray.
*
* @return the number of nodes in the LongArray
*/
public int getSize();
/**
* Obtain a LongArray.Iterator of the contents of the LongArray in
* order of increasing indices.
*
* @return an instance of LongArray.Iterator
*/
public Iterator iterator();
/**
* Obtain a LongArray.Iterator of the contents of the LongArray in
* order of increasing indices, starting at a particular index such
* that the first call to next will set the location of
* the iterator at the first existent index that is greater than or
* equal to the specified index, or will throw a
* NoSuchElementException if there is no such existent index.
*
* @param lIndex the LongArray index to iterate from
*
* @return an instance of LongArray.Iterator
*/
public Iterator iterator(long lIndex);
/**
* Obtain a LongArray.Iterator of the contents of the LongArray in
* reverse order (decreasing indices).
*
* @return an instance of LongArray.Iterator
*/
public Iterator reverseIterator();
/**
* Obtain a LongArray.Iterator of the contents of the LongArray in
* reverse order (decreasing indices), starting at a particular
* index such that the first call to next will set the
* location of the iterator at the first existent index that is
* less than or equal to the specified index, or will throw a
* NoSuchElementException if there is no such existent index.
*
* @param lIndex the LongArray index to iterate from
*
* @return an instance of LongArray.Iterator
*/
public Iterator reverseIterator(long lIndex);
/**
* Determine the first index that exists in the LongArray.
*
* @return the lowest long value that exists in this LongArray, or
* NOT_FOUND if the LongArray is empty
*/
public long getFirstIndex();
/**
* Determine the last index that exists in the LongArray.
*
* @return the highest long value that exists in this LongArray,
* or NOT_FOUND if the LongArray is empty
*/
public long getLastIndex();
/**
* Return the index in this LongArray of the first occurrence of
* the specified element, or NOT_FOUND if this LongArray does not
* contain the specified element.
*
* @param oValue the object to find index for
*
* @return the index of the specified object in the LongArray
*/
public long indexOf(V oValue);
/**
* Return the index in this LongArray of the first occurrence of
* the specified element such that (index greater or equal to lIndex), or
* NOT_FOUND if this LongArray does not contain the specified element.
*
* @param oValue the object to find the index for
* @param lIndex the index to compare to
*
* @return the index of the specified object in the LongArray that is greater
* or equal to the specified index
*/
public long indexOf(V oValue, long lIndex);
/**
* Return the index in this LongArray of the last occurrence of the
* specified element, or NOT_FOUND if this LongArray does not
* contain the specified element.
*
* @param oValue the object to find the index for
*
* @return the index of the last occurrence of the specified object in
* the LongArray
*/
public long lastIndexOf(V oValue);
/**
* Return the index in this LongArray of the last occurrence of
* the specified element such that (index less then or equal to lIndex), or
* NOT_FOUND if this LongArray does not contain the specified element.
*
* @param oValue the object to find the index for
* @param lIndex the index to compare to
*
* @return the index of the specified object in this LongArray that is
* less or equal to the specified index
*/
public long lastIndexOf(V oValue, long lIndex);
/**
* Return an array of the indices into this LongArray.
*
* @return an array of the indices into this LongArray
*
* @since 12.2.1.4
*/
public default long[] keys()
{
long[] alKeys = new long[getSize()];
int i = 0;
for (Iterator iter = iterator(); iter.hasNext(); )
{
iter.next();
alKeys[i++] = iter.getIndex();
}
return alKeys;
}
// ----- Object methods -------------------------------------------------
/**
* Provide a string representation of the LongArray.
*
* @return a human-readable String value describing the LongArray instance
*/
public String toString();
/**
* Test for LongArray equality.
*
* @param o an Object to compare to this LongArray for equality
*
* @return true if the passed Object is a LongArray containing the same
* indexes and whose elements at those indexes are equal
*/
public boolean equals(Object o);
// ----- cloneable interface --------------------------------------------
/**
* Make a clone of the LongArray. The element values are not deep-cloned.
*
* @return a clone of this LongArray object
*/
public LongArray clone();
// ----- LongArray.Iterator interface -----------------------------------
/**
* An Iterator that adds a "current element" concept, similar to the
* {@link java.util.Map.Entry} interface.
*/
public interface Iterator
extends java.util.Iterator
{
/**
* Returns true if the iteration has more elements. (In other
* words, returns true if next would return an
* element rather than throwing an exception.)
*
* @return true if the iterator has more elements
*/
public boolean hasNext();
/**
* Returns the next element in the iteration.
*
* @return the next element in the iteration
*
* @exception java.util.NoSuchElementException iteration has no
* more elements
*/
public V next();
/**
* Returns the index of the current value, which is the value returned
* by the most recent call to the next method.
*
* @exception IllegalStateException if the next method has
* not yet been called, or the remove method has
* already been called after the last call to the
* next method.
*
* @return the index of the current value
*/
public long getIndex();
/**
* Returns the current value, which is the same value returned by the
* most recent call to the next method, or the most recent
* value passed to setValue if setValue were called
* after the next method.
*
* @return the current value
*
* @exception IllegalStateException if the next method has
* not yet been called, or the remove method has
* already been called after the last call to the
* next method.
*/
public V getValue();
/**
* Stores a new value at the current value index, returning the value
* that was replaced. The index of the current value is obtainable by
* calling the getIndex method.
*
* @param oValue the new value to store
*
* @return the replaced value
*
* @exception IllegalStateException if the next method has
* not yet been called, or the remove method has
* already been called after the last call to the
* next method.
*/
public V setValue(V oValue);
/**
* Removes from the underlying collection the last element returned by
* the iterator (optional operation). This method can be called only
* once per call to next. The behavior of an iterator is
* unspecified if the underlying collection is modified while the
* iteration is in progress in any way other than by calling this
* method.
*
* @exception UnsupportedOperationException if the remove
* operation is not supported by this Iterator
* @exception IllegalStateException if the next method has
* not yet been called, or the remove method has
* already been called after the last call to the
* next method.
*/
public void remove();
}
// ----- constants ------------------------------------------------------
/**
* This index is used to indicate that an element was not found.
*/
public static final long NOT_FOUND = -1;
}