|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Object com.carrotsearch.hppc.CharArrayDeque
@Generated(date="2011-07-12T16:58:51+0200", value="HPPC generated from: CharArrayDeque.java") public class CharArrayDeque
An array-backed deque (doubly linked queue) of chars. A single array is used to store and
manipulate all elements. Reallocations are governed by a ArraySizingStrategy
and may be expensive if they move around really large chunks of memory.
See ObjectArrayDeque
class for API similarities and differences against Java
Collections.
Field Summary | |
---|---|
char[] |
buffer
Internal array for storing elements. |
static int |
DEFAULT_CAPACITY
Default capacity if no other capacity is given in the constructor. |
int |
head
The index of the element at the head of the deque or an arbitrary number equal to tail if the deque is empty. |
protected ArraySizingStrategy |
resizer
Buffer resizing strategy. |
int |
tail
The index at which the next element would be added to the tail of the deque. |
Constructor Summary | |
---|---|
CharArrayDeque()
Create with default sizing strategy and initial capacity for storing 5 elements. |
|
CharArrayDeque(CharContainer container)
Creates a new deque from elements of another container, appending them at the end of this deque. |
|
CharArrayDeque(int initialCapacity)
Create with default sizing strategy and the given initial capacity. |
|
CharArrayDeque(int initialCapacity,
ArraySizingStrategy resizer)
Create with a custom buffer resizing strategy. |
Method Summary | ||
---|---|---|
void |
addFirst(char... elements)
Vararg-signature method for adding elements at the front of this deque. |
|
void |
addFirst(char e1)
Inserts the specified element at the front of this deque. |
|
int |
addFirst(CharContainer container)
Inserts all elements from the given container to the front of this deque. |
|
int |
addFirst(java.lang.Iterable<? extends CharCursor> iterable)
Inserts all elements from the given iterable to the front of this deque. |
|
void |
addLast(char... elements)
Vararg-signature method for adding elements at the end of this deque. |
|
void |
addLast(char e1)
Inserts the specified element at the end of this deque. |
|
int |
addLast(CharContainer container)
Inserts all elements from the given container to the end of this deque. |
|
int |
addLast(java.lang.Iterable<? extends CharCursor> iterable)
Inserts all elements from the given iterable to the end of this deque. |
|
int |
bufferIndexOf(char e1)
Return the index of the first (counting from head) element equal to e1 . |
|
void |
clear()
Removes all elements from this collection. |
|
CharArrayDeque |
clone()
Clone this object. |
|
boolean |
contains(char e)
Lookup a given element in the container. |
|
|
descendingForEach(T predicate)
Applies a predicate to container elements as long, as the predicate
returns true . |
|
|
descendingForEach(T procedure)
Applies procedure to all elements of this deque, tail to head. |
|
java.util.Iterator<CharCursor> |
descendingIterator()
Returns a cursor over the values of this deque (in tail to head order). |
|
protected void |
ensureBufferSpace(int expectedAdditions)
Ensures the internal buffer has enough free slots to store expectedAdditions . |
|
boolean |
equals(java.lang.Object obj)
Compares the specified object with this deque for equality. |
|
|
forEach(T predicate)
Applies a predicate to container elements as long, as the predicate
returns true . |
|
|
forEach(T procedure)
Applies a procedure to all container elements. |
|
static CharArrayDeque |
from(char... elements)
Create a new deque by pushing a variable number of arguments to the end of it. |
|
static CharArrayDeque |
from(CharArrayDeque container)
Create a new deque by pushing a variable number of arguments to the end of it. |
|
char |
getFirst()
Retrieves, but does not remove, the first element of this deque. |
|
char |
getLast()
Retrieves, but does not remove, the last element of this deque. |
|
int |
hashCode()
|
|
boolean |
isEmpty()
Shortcut for size() == 0 . |
|
java.util.Iterator<CharCursor> |
iterator()
Returns a cursor over the values of this deque (in head to tail order). |
|
int |
lastBufferIndexOf(char e1)
Return the index of the last (counting from tail) element equal to e1 . |
|
static CharArrayDeque |
newInstance()
Returns a new object of this class with no need to declare generic type (shortcut instead of using a constructor). |
|
static CharArrayDeque |
newInstanceWithCapacity(int initialCapacity)
Returns a new object of this class with no need to declare generic type (shortcut instead of using a constructor). |
|
void |
release()
Release internal buffers of this deque and reallocate the smallest buffer possible. |
|
int |
removeAll(CharLookupContainer c)
Default implementation uses a predicate for removal. |
|
int |
removeAll(CharPredicate predicate)
Removes all elements in this collection for which the given predicate returns true . |
|
int |
removeAllOccurrences(char e1)
Removes all occurrences of e from this collection. |
|
void |
removeAtBufferIndex(int index)
Removes the element at index in the internal
{#link buffer } array, returning its value. |
|
char |
removeFirst()
Retrieves and removes the first element of this deque. |
|
int |
removeFirstOccurrence(char e1)
Removes the first element that equals e1 , returning its
deleted position or -1 if the element was not found. |
|
char |
removeLast()
Retrieves and removes the last element of this deque. |
|
int |
removeLastOccurrence(char e1)
Removes the last element that equals e1 , returning its
deleted position or -1 if the element was not found. |
|
int |
retainAll(CharLookupContainer c)
Default implementation uses a predicate for retaining. |
|
int |
retainAll(CharPredicate predicate)
Default implementation redirects to CharCollection.removeAll(CharPredicate)
and negates the predicate. |
|
int |
size()
Return the current number of elements in this container. |
|
char[] |
toArray()
Default implementation of copying to an array. |
|
char[] |
toArray(char[] target)
Copies elements of this deque to an array. |
|
java.lang.String |
toString()
Convert the contents of this container to a human-friendly string. |
Methods inherited from class java.lang.Object |
---|
finalize, getClass, notify, notifyAll, wait, wait, wait |
Methods inherited from interface com.carrotsearch.hppc.CharCollection |
---|
removeAll, retainAll, retainAll |
Field Detail |
---|
public static final int DEFAULT_CAPACITY
public char[] buffer
public int head
public int tail
protected final ArraySizingStrategy resizer
Constructor Detail |
---|
public CharArrayDeque()
BoundedProportionalArraySizingStrategy
public CharArrayDeque(int initialCapacity)
BoundedProportionalArraySizingStrategy
public CharArrayDeque(int initialCapacity, ArraySizingStrategy resizer)
public CharArrayDeque(CharContainer container)
Method Detail |
---|
public void addFirst(char e1)
addFirst
in interface CharDeque
e1
- the element to addpublic void addFirst(char... elements)
This method is handy, but costly if used in tight loops (anonymous array passing)
public final int addFirst(CharContainer container)
public final int addFirst(java.lang.Iterable<? extends CharCursor> iterable)
public void addLast(char e1)
addLast
in interface CharDeque
e1
- the element to addpublic void addLast(char... elements)
This method is handy, but costly if used in tight loops (anonymous array passing)
public final int addLast(CharContainer container)
public final int addLast(java.lang.Iterable<? extends CharCursor> iterable)
public char removeFirst()
removeFirst
in interface CharDeque
public char removeLast()
removeLast
in interface CharDeque
public char getFirst()
getFirst
in interface CharDeque
public char getLast()
getLast
in interface CharDeque
public int removeFirstOccurrence(char e1)
e1
, returning its
deleted position or -1
if the element was not found.
removeFirstOccurrence
in interface CharDeque
public int bufferIndexOf(char e1)
e1
. The index points to the buffer
array.
e1
- The element to look for.
e1
or -1
if not found.public int removeLastOccurrence(char e1)
e1
, returning its
deleted position or -1
if the element was not found.
removeLastOccurrence
in interface CharDeque
public int lastBufferIndexOf(char e1)
e1
. The index points to the buffer
array.
e1
- The element to look for.
e1
or -1
if not found.public int removeAllOccurrences(char e1)
e
from this collection.
removeAllOccurrences
in interface CharCollection
e1
- Element to be removed from this collection, if present.
public void removeAtBufferIndex(int index)
index
in the internal
{#link buffer
} array, returning its value.
index
- Index of the element to remove. The index must be located between
head
and tail
in modulo buffer
arithmetic.public boolean isEmpty()
size() == 0
.
isEmpty
in interface CharContainer
public int size()
O(n)
time, although implementing classes
should try to maintain the current size and return in constant time.
size
in interface CharContainer
public void clear()
The internal array buffers are not released as a result of this call.
clear
in interface CharCollection
release()
public void release()
protected final void ensureBufferSpace(int expectedAdditions)
expectedAdditions
. Increases internal buffer size if needed.
public final char[] toArray()
toArray
in interface CharContainer
public char[] toArray(char[] target)
target
array is filled from index 0 (head of the queue) to index size() - 1
(tail of the queue).
target
- The target array must be large enough to hold all elements.
public CharArrayDeque clone()
clone
in class java.lang.Object
public java.util.Iterator<CharCursor> iterator()
Iterator.next()
(to avoid boxing of primitive types). To
read the current value (or index in the deque's buffer) use the cursor's public
fields. An example is shown below.
for (IntValueCursor c : intDeque) { System.out.println("buffer index=" + c.index + " value=" + c.value); }
iterator
in interface CharContainer
iterator
in interface java.lang.Iterable<CharCursor>
public java.util.Iterator<CharCursor> descendingIterator()
Iterator.next()
(to avoid boxing of primitive types). To
read the current value (or index in the deque's buffer) use the cursor's public
fields. An example is shown below.
for (Iteratori = intDeque.descendingIterator(); i.hasNext(); ) { final IntCursor c = i.next(); System.out.println("buffer index=" + c.index + " value=" + c.value); }
descendingIterator
in interface CharDeque
public <T extends CharProcedure> T forEach(T procedure)
procedure
to all container elements. Returns the argument (any
subclass of CharProcedure
. This lets the caller to call methods of the argument
by chaining the call (even if the argument is an anonymous type) to retrieve computed values,
for example (IntContainer):
int count = container.forEach(new IntProcedure() { int count; // this is a field declaration in an anonymous class. public void apply(int value) { count++; }}).count;
forEach
in interface CharContainer
public <T extends CharPredicate> T forEach(T predicate)
predicate
to container elements as long, as the predicate
returns true
. The iteration is interrupted otherwise.
forEach
in interface CharContainer
public <T extends CharProcedure> T descendingForEach(T procedure)
procedure
to all elements of this deque, tail to head.
descendingForEach
in interface CharDeque
public <T extends CharPredicate> T descendingForEach(T predicate)
predicate
to container elements as long, as the predicate
returns true
. The iteration is interrupted otherwise.
descendingForEach
in interface CharDeque
public int removeAll(CharPredicate predicate)
true
.
removeAll
in interface CharCollection
public boolean contains(char e)
contains
in interface CharContainer
true
if this container has an element
equal to e
.public int hashCode()
hashCode
in interface CharDeque
hashCode
in class java.lang.Object
List.hashCode()
(should be implemented
with the same algorithm), replacing forward index loop with a forward iterator
loop.public boolean equals(java.lang.Object obj)
ObjectDeque
, and all corresponding
pairs of elements acquired from forward iterators are the same. In other words, two indexed
containers are defined to be equal if they contain the same elements in the same
order of iteration.
Note that, unlike in List
, deques may be of different types and still
return true
from CharDeque.equals(java.lang.Object)
. This may be dangerous if you use
different hash functions in two containers, but don't override the default
implementation of CharDeque.equals(java.lang.Object)
. It is the programmer's responsibility to
enforcing these contracts properly.
equals
in interface CharDeque
equals
in class java.lang.Object
public static CharArrayDeque newInstance()
public static CharArrayDeque newInstanceWithCapacity(int initialCapacity)
public static CharArrayDeque from(char... elements)
public static CharArrayDeque from(CharArrayDeque container)
public int removeAll(CharLookupContainer c)
removeAll
in interface CharCollection
public int retainAll(CharLookupContainer c)
retainAll
in interface CharCollection
public int retainAll(CharPredicate predicate)
CharCollection.removeAll(CharPredicate)
and negates the predicate.
retainAll
in interface CharCollection
public java.lang.String toString()
toString
in class java.lang.Object
|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |