A C D E G H I N P Q S T V
A
- add(E) - Method in class de.weltraumschaf.commons.concurrent.ConcurrentQueue
-
- add(E) - Method in interface de.weltraumschaf.commons.concurrent.Queue
-
Add element to the tail of queue.
C
- Concurrent - Class in de.weltraumschaf.commons.concurrent
-
Factory to create implementations.
- Concurrent() - Constructor for class de.weltraumschaf.commons.concurrent.Concurrent
-
Hidden for utility class.
- ConcurrentQueue<E> - Class in de.weltraumschaf.commons.concurrent
-
Queue implemented with compare-and-set algorithm from Brian Goetz.
- ConcurrentQueue() - Constructor for class de.weltraumschaf.commons.concurrent.ConcurrentQueue
-
- ConcurrentQueue.Entry<T> - Class in de.weltraumschaf.commons.concurrent
-
Linked list entry.
- ConcurrentStack<E> - Class in de.weltraumschaf.commons.concurrent
-
Stack implemented with compare-and-set algorithm from Brian Goetz.
- ConcurrentStack() - Constructor for class de.weltraumschaf.commons.concurrent.ConcurrentStack
-
- ConcurrentStack.Entry<T> - Class in de.weltraumschaf.commons.concurrent
-
Linked list entry.
D
- de.weltraumschaf.commons.concurrent - package de.weltraumschaf.commons.concurrent
-
Concurrent data structures.
E
- Entry(T) - Constructor for class de.weltraumschaf.commons.concurrent.ConcurrentQueue.Entry
-
Dedicated constructor.
- Entry(T, ConcurrentStack.Entry<T>) - Constructor for class de.weltraumschaf.commons.concurrent.ConcurrentStack.Entry
-
Dedicated constructor.
- equals(Object) - Method in class de.weltraumschaf.commons.concurrent.ConcurrentQueue.Entry
-
- equals(Object) - Method in class de.weltraumschaf.commons.concurrent.ConcurrentQueue
-
- equals(Object) - Method in class de.weltraumschaf.commons.concurrent.ConcurrentStack.Entry
-
- equals(Object) - Method in class de.weltraumschaf.commons.concurrent.ConcurrentStack
-
G
- get() - Method in class de.weltraumschaf.commons.concurrent.ConcurrentQueue
-
- get() - Method in interface de.weltraumschaf.commons.concurrent.Queue
-
Get element from head of queue.
H
- hashCode() - Method in class de.weltraumschaf.commons.concurrent.ConcurrentQueue.Entry
-
- hashCode() - Method in class de.weltraumschaf.commons.concurrent.ConcurrentQueue
-
- hashCode() - Method in class de.weltraumschaf.commons.concurrent.ConcurrentStack.Entry
-
- hashCode() - Method in class de.weltraumschaf.commons.concurrent.ConcurrentStack
-
- head - Variable in class de.weltraumschaf.commons.concurrent.ConcurrentQueue
-
References the head of the linked list.
I
- isEmpty() - Method in class de.weltraumschaf.commons.concurrent.ConcurrentQueue
-
- isEmpty() - Method in class de.weltraumschaf.commons.concurrent.ConcurrentStack
-
- isEmpty() - Method in interface de.weltraumschaf.commons.concurrent.Queue
-
Check if queue is empty.
- isEmpty() - Method in interface de.weltraumschaf.commons.concurrent.Stack
-
Check if stack is empty.
N
- newQueue() - Static method in class de.weltraumschaf.commons.concurrent.Concurrent
-
Create a queue.
- newStack() - Static method in class de.weltraumschaf.commons.concurrent.Concurrent
-
Create a stack.
- next - Variable in class de.weltraumschaf.commons.concurrent.ConcurrentQueue.Entry
-
Link to next entry, maybe null.
- next - Variable in class de.weltraumschaf.commons.concurrent.ConcurrentStack.Entry
-
Link to next entry, maybe null.
P
- peek() - Method in class de.weltraumschaf.commons.concurrent.ConcurrentStack
-
- peek() - Method in interface de.weltraumschaf.commons.concurrent.Stack
-
Returns the top element of stack w/o remove it.
- pop() - Method in class de.weltraumschaf.commons.concurrent.ConcurrentStack
-
- pop() - Method in interface de.weltraumschaf.commons.concurrent.Stack
-
Returns the top element of stack and removes it.
- push(E) - Method in class de.weltraumschaf.commons.concurrent.ConcurrentStack
-
- push(E) - Method in interface de.weltraumschaf.commons.concurrent.Stack
-
Push entry on top of the stack.
Q
- Queue<E> - Interface in de.weltraumschaf.commons.concurrent
-
Interface for queues (FIFO).
S
- Stack<E> - Interface in de.weltraumschaf.commons.concurrent
-
Interface for a stack (LIFO).
T
- tail - Variable in class de.weltraumschaf.commons.concurrent.ConcurrentQueue
-
References the tail of the linked list.
- top - Variable in class de.weltraumschaf.commons.concurrent.ConcurrentStack
-
References the top of the stack.
- toString() - Method in class de.weltraumschaf.commons.concurrent.ConcurrentQueue
-
- toString() - Method in class de.weltraumschaf.commons.concurrent.ConcurrentStack
-
V
- value - Variable in class de.weltraumschaf.commons.concurrent.ConcurrentQueue.Entry
-
Entry element.
- value - Variable in class de.weltraumschaf.commons.concurrent.ConcurrentStack.Entry
-
Entry element.
A C D E G H I N P Q S T V
Copyright © 2014 Sven Strittmatter. All Rights Reserved.