Package | Description |
---|---|
javolution.context |
Run-time
contexts to facilitate
separation of concerns and achieve higher level of performance and flexibility. |
javolution.lang |
Fundamental classes, interfaces and annotations.
|
javolution.text |
Text handling package.
|
javolution.util |
High-performance collection classes with
guaranteed worst case execution time . |
javolution.util.function |
Basic functions for lambda expressions and method references.
|
Modifier and Type | Class and Description |
---|---|
class |
AbstractContext
The parent class for all contexts.
|
Modifier and Type | Class and Description |
---|---|
class |
MathLib
An utility class providing a
Realtime implementation of
the math library. |
Modifier and Type | Class and Description |
---|---|
class |
Text
An immutable character sequence with fast
concatenation ,
insertion and
deletion capabilities (O[Log(n)]) instead of
O[n] for StringBuffer/StringBuilder). |
class |
TypeFormat
Utility class to parse
CharSequence into primitive types and
to format primitive types into any Appendable . |
Modifier and Type | Class and Description |
---|---|
class |
FastCollection<E>
A high-performance collection with
real-time behavior;
smooth capacity increase/decrease and minimal memory footprint. |
static class |
FastCollection.StandardText
The standard java collection format (parsing not supported).
|
class |
FastMap<K,V>
A high-performance map with
real-time behavior;
smooth capacity increase/decrease and minimal memory footprint. |
class |
Index
A non-negative number representing a position in an arrangement.
|
Modifier and Type | Method and Description |
---|---|
boolean |
FastSortedSet.add(E e)
FastSet operations with different time limit behavior.
|
void |
FastTable.add(int index,
E element)
List operations.
|
boolean |
FastCollection.addAll(Collection<? extends E> that) |
boolean |
FastTable.addAll(int index,
Collection<? extends E> elements) |
void |
FastBitSet.and(FastBitSet that)
Performs the logical AND operation on this bit set and the
given bit set.
|
void |
FastBitSet.andNot(FastBitSet that)
Performs the logical AND operation on this bit set and the
complement of the given bit set.
|
void |
FastCollection.clear() |
void |
FastSet.clear() |
void |
FastTable.clear() |
void |
FastBitSet.clear(int fromIndex,
int toIndex)
Sets the bits from the specified
fromIndex (inclusive) to the
specified toIndex (exclusive) to false . |
boolean |
FastCollection.contains(Object element) |
boolean |
FastSet.contains(Object obj) |
boolean |
FastSortedSet.contains(Object obj) |
boolean |
FastSortedTable.contains(Object obj)
Sorted table operations optimizations.
|
boolean |
FastCollection.containsAll(Collection<?> that) |
boolean |
FastSortedMap.containsKey(Object key)
FastMap operations with different time limit behavior.
|
boolean |
FastMap.containsValue(Object value) |
boolean |
FastCollection.doWhile(Predicate<? super E> doContinue)
Iterates over this collection elements applying the specified predicate
until that predicate returns
false (if the collection is
parallel all concurrent iterations will terminate then). |
boolean |
FastCollection.equals(Object obj)
Compares the specified object with this collection for equality.
|
void |
FastBitSet.flip(int fromIndex,
int toIndex)
Sets a range of bits to the opposite value.
|
void |
FastCollection.forEach(Consumer<? super E> consumer)
Iterates over all this collection elements applying the specified
consumer.
|
FastBitSet |
FastBitSet.get(int fromIndex,
int toIndex)
Returns a new bit set composed of a range of bits from this one.
|
V |
FastSortedMap.get(Object key) |
int |
FastCollection.hashCode() |
FastSortedMap<K,V> |
FastSortedMap.headMap(K toKey) |
FastSortedSet<E> |
FastSortedSet.headSet(E toElement) |
int |
FastSortedTable.indexOf(Object obj) |
int |
FastTable.indexOf(Object element) |
boolean |
FastBitSet.intersects(FastBitSet that)
Returns
true if this bit set shares at least one
common bit with the specified bit set. |
boolean |
FastSet.isEmpty()
Set operations optimizations.
|
boolean |
FastTable.isEmpty()
Collection operations.
|
int |
FastTable.lastIndexOf(Object element) |
void |
FastBitSet.or(FastBitSet that)
Performs the logical OR operation on this bit set and the one specified.
|
V |
FastSortedMap.put(K key,
V value) |
void |
FastMap.putAll(Map<? extends K,? extends V> map) |
V |
FastSortedMap.putIfAbsent(K key,
V value) |
E |
FastCollection.reduce(CollectionOperator<? super E> operator)
Performs a reduction of the elements of this collection using the
specified operator (convenience method).
|
E |
FastTable.remove(int index) |
boolean |
FastCollection.remove(Object element) |
boolean |
FastSet.remove(Object obj) |
V |
FastSortedMap.remove(Object key) |
boolean |
FastSortedSet.remove(Object obj) |
boolean |
FastSortedTable.remove(Object obj) |
boolean |
FastSortedMap.remove(Object key,
Object value) |
boolean |
FastCollection.removeAll(Collection<?> that) |
boolean |
FastCollection.removeIf(Predicate<? super E> filter)
Removes from this collection all the elements matching the specified
functional predicate.
|
V |
FastSortedMap.replace(K key,
V value) |
boolean |
FastSortedMap.replace(K key,
V oldValue,
V newValue) |
boolean |
FastCollection.retainAll(Collection<?> that) |
void |
FastBitSet.set(int fromIndex,
int toIndex)
Sets the bits from the specified
fromIndex (inclusive) to the
specified toIndex (exclusive) to true . |
void |
FastBitSet.set(int fromIndex,
int toIndex,
boolean value)
Sets the bits between from (inclusive) and to (exclusive) to the
specified value.
|
int |
FastCollection.size() |
int |
FastSet.size() |
int |
FastTable.size() |
int |
FastSortedTable.slotOf(E element)
Returns the would index of the specified element if it were
to be added to this sorted table.
|
void |
FastTable.sort()
Sorts this table in place (quick sort).
|
FastSortedMap<K,V> |
FastSortedMap.subMap(K fromKey,
K toKey) |
FastSortedSet<E> |
FastSortedSet.subSet(E fromElement,
E toElement)
SortedSet operations.
|
FastSortedMap<K,V> |
FastSortedMap.tailMap(K fromKey) |
FastSortedSet<E> |
FastSortedSet.tailSet(E fromElement) |
Object[] |
FastCollection.toArray() |
<T> T[] |
FastCollection.toArray(T[] array) |
String |
FastCollection.toString() |
void |
FastBitSet.xor(FastBitSet that)
Performs the logical XOR operation on this bit set and the one specified.
|
Modifier and Type | Field and Description |
---|---|
static CollectionOperator<Boolean> |
Operators.AND
Conditional 'and' operator (returns
true if the collection is
empty). |
static CollectionOperator<Object> |
Operators.ANY
Returns any non-null element.
|
static EqualityComparator<Object> |
Comparators.ARRAY
A content array comparator.
|
static EqualityComparator<Object> |
Comparators.IDENTITY
A comparator for which instances are only equals to themselves.
|
static EqualityComparator<CharSequence> |
Comparators.LEXICAL
A lexicographic comparator for any
CharSequence . |
static EqualityComparator<CharSequence> |
Comparators.LEXICAL_CASE_INSENSITIVE
A case insensitive lexicographic comparator for any
CharSequence . |
static EqualityComparator<CharSequence> |
Comparators.LEXICAL_FAST
An optimized lexical comparator for any
CharSequence taking
a sample of few characters instead of the whole character sequence to
calculate the hash code (still equality comparison checks all characters). |
static CollectionOperator<Object> |
Operators.MAX
Returns the greatest element of a collection according to the collection
comparator (returns
null if the collection is empty). |
static CollectionOperator<Object> |
Operators.MIN
Returns the smallest element of a collection according to the collection
comparator (returns
null if the collection is empty). |
static CollectionOperator<Boolean> |
Operators.OR
Conditional 'or' operator (returns
false if the collection is
empty). |
static EqualityComparator<Object> |
Comparators.STANDARD
A standard object comparator (based on the object hashCode and equals
methods).
|
static CollectionOperator<Integer> |
Operators.SUM
Returns the sum of the specified integers value (returns
0
if the collection is empty). |
Copyright © 2005-2013 Javolution. All Rights Reserved.