Uses of Class
javolution.lang.Realtime

Packages that use Realtime

Package	Description
javolution.context	Run-time contexts to facilitate separation of concerns and achieve higher level of performance and flexibility.
javolution.io	Utility classes for input and output such as Struct and Union for direct interoperability with C/C++.
javolution.lang	Fundamental classes, interfaces and annotations.
javolution.text	Text handling package.
javolution.util	High-performance collection classes with worst case execution time behavior documented.
javolution.util.function	Basic functions for lambda expressions and method references.

Uses of Realtime in javolution.context

Classes in javolution.context with annotations of type Realtime

Modifier and Type	Class and Description
class	AbstractContext The parent class for all contexts.

Uses of Realtime in javolution.io

Classes in javolution.io with annotations of type Realtime

Modifier and Type	Class and Description
class	Struct Equivalent to a C/C++ struct; this class confers interoperability between Java classes and C/C++ struct.

Uses of Realtime in javolution.lang

Classes in javolution.lang with annotations of type Realtime

Modifier and Type	Class and Description
class	MathLib An utility class providing a Realtime implementation of the math library.

Uses of Realtime in javolution.text

Classes in javolution.text with annotations of type Realtime

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.

Uses of Realtime in javolution.util

Classes in javolution.util with annotations of type Realtime

Modifier and Type	Class and Description
class	FastCollection<E> A closure-based collection supporting numerous views which can be chained.
class	FastMap<K,V> A high-performance hash map with real-time behavior.
class	Index A non-negative number representing a position in an arrangement.

Methods in javolution.util with annotations of type Realtime

Modifier and Type	Method and Description
boolean	FastCollection.add(E element) Adds the specified element to this collection
boolean	FastSortedSet.add(E e)
void	FastTable.add(int index, E element) Inserts the specified element at the specified position in this table.
boolean	FastCollection.addAll(Collection<? extends E> that) Adds all the specified elements to this collection.
boolean	FastTable.addAll(int index, Collection<? extends E> elements) Inserts all of the elements in the specified collection into this table at the specified position.
void	FastTable.addFirst(E element) Inserts the specified element at the front of this table.
boolean	FastSortedTable.addIfAbsent(E element) Adds the specified element only if not already present.
void	FastTable.addLast(E element) Inserts the specified element at the end of this table.
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.
<T extends E> T	FastCollection.any(Class<T> type) Returns any non-null element of the specified type (convenience method).
void	FastCollection.clear() Removes all elements from this collection.
void	FastMap.clear() Removes all this map's entries.
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.
Equality<? super E>	FastCollection.comparator() Returns the comparator used by this collection for element equality and/or ordering if this collection is sorted.
boolean	FastCollection.contains(Object searched) Indicates if this collection contains the specified element.
boolean	FastSet.contains(Object obj)
boolean	FastSortedSet.contains(Object obj)
boolean	FastSortedTable.contains(Object obj)
boolean	FastCollection.containsAll(Collection<?> that) Indicates if this collection contains all the specified elements.
boolean	FastMap.containsKey(Object key) Indicates if this map contains the specified key.
boolean	FastSortedMap.containsKey(Object key)
boolean	FastMap.containsValue(Object value) Indicates if this map contains the specified value.
Iterator<E>	FastTable.descendingIterator() Returns an iterator over the elements in this table in reverse sequential order.
E	FastTable.element() Retrieves, but does not remove, the head of the queue represented by this table.
boolean	FastCollection.equals(Object obj) Compares the specified object with this collection for equality.
boolean	FastMap.equals(Object obj) Compares the specified object with this map 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 (convenience method).
E	FastTable.get(int index) Returns the element at the specified position in this table.
FastBitSet	FastBitSet.get(int fromIndex, int toIndex) Returns a new bit set composed of a range of bits from this one.
V	FastMap.get(Object key) Returns the value for the specified key.
V	FastSortedMap.get(Object key)
E	FastTable.getFirst() Retrieves, but does not remove, the first element of this table.
E	FastTable.getLast() Retrieves, but does not remove, the last element of this table.
int	FastCollection.hashCode() Returns the hash code of this collection.
FastSortedSet<E>	FastSortedSet.headSet(E toElement) Returns a view of the portion of this set whose elements are strictly less than toElement.
int	FastSortedTable.indexOf(Object obj)
int	FastTable.indexOf(Object element) Returns the index of the first occurrence of the specified element in this table, or -1 if this table does not contain the element.
boolean	FastBitSet.intersects(FastBitSet that) Returns true if this bit set shares at least one common bit with the specified bit set.
boolean	FastCollection.isEmpty() Indicates if this collection is empty.
boolean	FastMap.isEmpty() Indicates if this map is empty
boolean	FastSet.isEmpty()
boolean	FastTable.isEmpty()
Iterator<E>	FastCollection.iterator() Returns an iterator over this collection elements.
int	FastTable.lastIndexOf(Object element) Returns the index of the last occurrence of the specified element in this table, or -1 if this table does not contain the element.
ListIterator<E>	FastTable.listIterator() Returns a list iterator over the elements in this table.
ListIterator<E>	FastTable.listIterator(int index) Returns a list iterator over the elements in this table, starting at the specified position in the table.
E	FastCollection.max() Returns the largest element of this collection using this collection comparator (convenience method).
E	FastCollection.min() Returns the smallest element of this collection using this collection comparator (convenience method).
boolean	FastTable.offer(E e) Inserts the specified element into the queue represented by this table.
boolean	FastTable.offerFirst(E e) Inserts the specified element at the front of this table.
boolean	FastTable.offerLast(E e) Inserts the specified element at the end of this table.
void	FastBitSet.or(FastBitSet that) Performs the logical OR operation on this bit set and the one specified.
E	FastTable.peek() Retrieves, but does not remove, the head of the queue represented by this table.
E	FastTable.peekFirst() Retrieves, but does not remove, the first element of this table, or returns null if this table is empty.
E	FastTable.peekLast() Retrieves, but does not remove, the last element of this table, or returns null if this table is empty.
void	FastCollection.perform(Consumer<? extends Collection<E>> action) Executes the specified read action on this collection.
void	FastMap.perform(Consumer<? extends Map<K,V>> action) Executes the specified read-only action on this map.
E	FastTable.poll() Retrieves and removes the head of the queue represented by this table.
E	FastTable.pollFirst() Retrieves and removes the first element of this table, or returns null if this table is empty.
E	FastTable.pollLast() .
E	FastTable.pop() Pops an element from the stack represented by this table.
int	FastSortedTable.positionOf(E element) Returns the index of the specified element if present; or a negative number equals to -n with n being the index next to the "would be" index of the specified element if the specified element was to be added.
void	FastTable.push(E e) Pushes an element onto the stack represented by this table.
V	FastMap.put(K key, V value) Associates the specified value with the specified key.
V	FastSortedMap.put(K key, V value)
void	FastMap.putAll(Map<? extends K,? extends V> that) Adds the specified map entries to this map.
V	FastMap.putIfAbsent(K key, V value) Associates the specified value with the specified key only if the specified key has no current mapping.
V	FastSortedMap.putIfAbsent(K key, V value)
E	FastCollection.reduce(Reducer<E> reducer) Performs a reduction of the elements of this collection using the specified reducer.
E	FastTable.remove() Retrieves and removes the head of the queue represented by this table.
E	FastTable.remove(int index) Removes the element at the specified position in this table.
boolean	FastCollection.remove(Object searched) Removes the specified element from this collection.
V	FastMap.remove(Object key) Removes the entry for the specified key.
boolean	FastSet.remove(Object obj)
V	FastSortedMap.remove(Object key)
boolean	FastSortedSet.remove(Object obj)
boolean	FastSortedTable.remove(Object obj)
boolean	FastMap.remove(Object key, Object value) Removes the entry for a key only if currently mapped to a given value.
boolean	FastSortedMap.remove(Object key, Object value)
boolean	FastCollection.removeAll(Collection<?> that) Removes all the specified element from this collection.
E	FastTable.removeFirst() Retrieves and removes the last element of this table, or returns null if this table is empty.
boolean	FastTable.removeFirstOccurrence(Object o) Removes the first occurrence of the specified element from this table.
boolean	FastCollection.removeIf(Predicate<? super E> filter) Removes from this collection all the elements matching the specified functional predicate (convenience method).
E	FastTable.removeLast() Retrieves and removes the last element of this table.
boolean	FastTable.removeLastOccurrence(Object o) Removes the last occurrence of the specified element from this table.
V	FastMap.replace(K key, V value) Replaces the entry for a key only if currently mapped to some value.
V	FastSortedMap.replace(K key, V value)
boolean	FastMap.replace(K key, V oldValue, V newValue) Replaces the entry for a key only if currently mapped to a given value.
boolean	FastSortedMap.replace(K key, V oldValue, V newValue)
boolean	FastCollection.retainAll(Collection<?> that) Removes all the elements except those in the specified collection.
E	FastTable.set(int index, E element) Replaces the element at the specified position in this table with the specified element.
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() Returns the size of this collection.
int	FastMap.size() Returns the number of entries/keys/values in this map.
int	FastSet.size()
int	FastTable.size()
void	FastTable.sort() Sorts this table in place (quick sort).
FastSortedSet<E>	FastSortedSet.subSet(E fromElement, E toElement) Returns a view of the portion of this set whose elements range from fromElement, inclusive, to toElement, exclusive.
FastSortedSet<E>	FastSortedSet.tailSet(E fromElement) Returns a view of the portion of this set whose elements are greater than or equal to fromElement.
Object[]	FastCollection.toArray() Returns an array holding this collection elements.
<T> T[]	FastCollection.toArray(T[] array) Returns the specified array holding this collection elements if enough capacity.
String	FastCollection.toString() Returns the string representation of this collection using its default format.
String	FastMap.toString() Returns the string representation of this map using its contextual format.
void	FastCollection.update(Consumer<? extends Collection<E>> action) Executes the specified update action on this collection.
void	FastMap.update(Consumer<? extends Map<K,V>> action) Executes the specified update action on this map.
void	FastBitSet.xor(FastBitSet that) Performs the logical XOR operation on this bit set and the one specified.

Uses of Realtime in javolution.util.function

Fields in javolution.util.function with annotations of type Realtime

Modifier and Type	Field and Description
static Equality<Object>	Equalities.ARRAY A content array comparator.
static Equality<Object>	Equalities.IDENTITY A comparator for which instances are only equals to themselves.
static Equality<CharSequence>	Equalities.LEXICAL A lexicographic comparator for any CharSequence.
static Equality<CharSequence>	Equalities.LEXICAL_CASE_INSENSITIVE A case insensitive lexicographic comparator for any CharSequence.
static Equality<CharSequence>	Equalities.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 Equality<Object>	Equalities.STANDARD A standard object comparator (based on the object hashCode and equals methods).

Methods in javolution.util.function with annotations of type Realtime

Modifier and Type	Method and Description
static Reducer<Boolean>	Reducers.and() Conditional 'and' operator (returns true if the collection is empty).
static <E> Reducer<E>	Reducers.any(Class<? extends E> type) Returns any non-null element of the specified type.
static <E> Reducer<E>	Reducers.max(Comparator<? super E> comparator) Returns the greatest element of a collection according to the specified comparator (returns null if the collection is empty).
static <E> Reducer<E>	Reducers.min(Comparator<? super E> comparator) Returns the smallest element of a collection according to the collection comparator (returns null if the collection is empty).
static Reducer<Boolean>	Reducers.or() Conditional 'or' operator (returns false if the collection is empty).
static Reducer<Integer>	Reducers.sum() Returns the sum of the specified integers value (returns 0 if the collection is empty).