A B C D E F G H I K L M N O P Q R S T U V W

A

AbstractGraph<E> - Class in org.amino.ds.graph

Default implementation of Graph interface.

AbstractGraph() - Constructor for class org.amino.ds.graph.AbstractGraph

Default constructor.

AbstractParallelPrefix<T> - Class in org.amino.alg.parallelprefix

AbstractParallelPrefix() - Constructor for class org.amino.alg.parallelprefix.AbstractParallelPrefix

AbstractScanner - Class in org.amino.alg.scan

Abstract class for searching byte arrays.

AbstractScanner() - Constructor for class org.amino.alg.scan.AbstractScanner

AbstractScheduler - Class in org.amino.scheduler.internal

Abstract class for Amino schedulers.

AbstractScheduler(int) - Constructor for class org.amino.scheduler.internal.AbstractScheduler

AbstractScheduler.WorkThread - Class in org.amino.scheduler.internal

AbstractScheduler.WorkThread(int) - Constructor for class org.amino.scheduler.internal.AbstractScheduler.WorkThread

AbstractSorter - Class in org.amino.alg.sort

This is the abstract sorting class that implements the Sorter interface.

AbstractSorter() - Constructor for class org.amino.alg.sort.AbstractSorter

AdaptEliminationArray - Class in org.amino.utility

This class implements similar functionality of EliminationArray.

AdaptEliminationArray(int) - Constructor for class org.amino.utility.AdaptEliminationArray

Create elimination array with specified size.

add(E) - Method in class org.amino.ds.graph.AbstractGraph

add(E) - Method in class org.amino.ds.lockfree.EBDeque

Inserts element e at the end of the deque.

add(E) - Method in class org.amino.ds.lockfree.LocalSet

add(E) - Method in class org.amino.ds.lockfree.LockFreeList

Adds the specified element to the head of this list.

add(int, E) - Method in class org.amino.ds.lockfree.LockFreeList

add(E) - Method in class org.amino.ds.lockfree.LockFreeOrderedList

Adds the specified element to this list.

add(E) - Method in class org.amino.ds.lockfree.LockFreePriorityQueue

add(E) - Method in class org.amino.ds.lockfree.LockFreeSet

add(E) - Method in class org.amino.ds.lockfree.LockFreeVector

addAll(Collection<? extends E>) - Method in class org.amino.ds.graph.AbstractGraph

addAll(Collection<? extends E>) - Method in class org.amino.ds.lockfree.LocalSet

addAll(int, Collection<? extends E>) - Method in class org.amino.ds.lockfree.LockFreeList

addAll(Collection<? extends E>) - Method in class org.amino.ds.lockfree.LockFreeList

addAll(Collection<? extends E>) - Method in class org.amino.ds.lockfree.LockFreeSet

addAllNodes(Collection<Node<E>>) - Method in class org.amino.ds.graph.AbstractGraph

add all the nodes to graph.

addAllNodes(Collection<Node<E>>) - Method in interface org.amino.ds.graph.Graph

add all the nodes to graph.

addEdge(Edge<E>) - Method in class org.amino.ds.graph.AdjacentList

add a specified edge into this adjacent list.

addEdge(Node<E>, double) - Method in class org.amino.ds.graph.AdjacentList

add a edge into this adjacent list, with specified node and weight.

addEdge(Node<E>, Node<E>, double) - Method in class org.amino.ds.graph.DirectedGraphImpl

add one edge to graph with weight.

addEdge(Edge<E>) - Method in class org.amino.ds.graph.DirectedGraphImpl

Add an edge to this graph.

addEdge(E, E, double) - Method in class org.amino.ds.graph.DirectedGraphImpl

add one edge to graph.

addEdge(E, E, double) - Method in interface org.amino.ds.graph.Graph

add one edge to graph.

addEdge(Node<E>, Node<E>, double) - Method in interface org.amino.ds.graph.Graph

add one edge to graph with weight.

addEdge(Edge<E>) - Method in interface org.amino.ds.graph.Graph

Add an edge to this graph.

addEdge(E, E, double) - Method in class org.amino.ds.graph.UndirectedGraph

add one edge to graph.

addEdge(Node<E>, Node<E>, double) - Method in class org.amino.ds.graph.UndirectedGraph

add one edge to graph with weight.

addEdge(Edge<E>) - Method in class org.amino.ds.graph.UndirectedGraph

Add an edge to this graph.

addFirst(E) - Method in class org.amino.ds.lockfree.EBDeque

This is the method that does a right push into the Deque.

addFirst(E) - Method in class org.amino.ds.lockfree.LocalDeque

This is the method that does a right push into the Deque.

addFirst(E) - Method in class org.amino.ds.lockfree.LockFreeDeque

This is the method that does a right push into the Deque.

addLast(E) - Method in class org.amino.ds.lockfree.EBDeque

This is the method that does a left push into the Deque.

addLast(E) - Method in class org.amino.ds.lockfree.LocalDeque

This is the method that does a left push into the Deque.

addLast(E) - Method in class org.amino.ds.lockfree.LockFreeDeque

This is the method that does a left push into the Deque.

addNode(E) - Method in class org.amino.ds.graph.AbstractGraph

Add a node to graph, which contains value e.

addNode(Node<E>) - Method in class org.amino.ds.graph.AbstractGraph

Add a node to graph, which contains value e.

addNode(E) - Method in interface org.amino.ds.graph.Graph

Add a node to graph, which contains value e.

addNode(Node<E>) - Method in interface org.amino.ds.graph.Graph

Add a node to graph, which contains value e.

addWork(Runnable) - Method in class org.amino.scheduler.internal.AbstractScheduler

Submit a new work item.

addWork(Runnable) - Method in class org.amino.scheduler.internal.WorkStealingScheduler

Submit a new work item.

AdjacentList<E> - Class in org.amino.ds.graph

This class represents adjacent list, which is a frequently used method for storing graph.

AdjacentList(Node<E>) - Constructor for class org.amino.ds.graph.AdjacentList

Constructs an adjacent list with specified node as the head node.

AdjacentNode<E> - Class in org.amino.ds.graph

Objects of this class is used to express nodes in an adjacent list.

AdjacentNode(Node<E>, double) - Constructor for class org.amino.ds.graph.AdjacentNode

Constructs an adjacent node, with specified node and weight.

awaitTermination(long, TimeUnit) - Method in class org.amino.scheduler.internal.AbstractScheduler

B

BinaryOp<T> - Interface in org.amino.alg.parallelprefix

Interface for parallel prefix binary operation.

binarySearch(byte[], byte) - Method in class org.amino.alg.scan.AbstractScanner

binarySearch(byte[], byte) - Method in interface org.amino.alg.scan.Scanner

binarySearch(byte[], int, int, byte) - Method in interface org.amino.alg.scan.Scanner

Search a byte value from byte-array.

C

casPrev() - Method in class org.amino.ds.lockfree.LockFreeList.ListStateHolder

clear() - Method in class org.amino.ds.graph.AbstractGraph

clear() - Method in class org.amino.ds.lockfree.EBDeque

Removes all elements, clears the deque.

clear() - Method in class org.amino.ds.lockfree.LocalDeque

Removes all elements, clears the deque.

clear() - Method in class org.amino.ds.lockfree.LocalSet

clear() - Method in class org.amino.ds.lockfree.LockFreeDeque

Removes all elements, clears the deque.

clear() - Method in class org.amino.ds.lockfree.LockFreeDictionary

clear() - Method in class org.amino.ds.lockfree.LockFreeList

Removes all of the elements from this list (optional operation).

clear() - Method in class org.amino.ds.lockfree.LockFreeSet

clone() - Method in class org.amino.ds.graph.AbstractGraph

Clone this graph.

clone() - Method in class org.amino.ds.graph.DirectedGraphImpl

Clone this graph.

clone() - Method in interface org.amino.ds.graph.Graph

Clone this graph.

clone() - Method in class org.amino.ds.graph.UndirectedGraph

Clone this graph.

compareTo(AdjacentList<E>) - Method in class org.amino.ds.graph.AdjacentList

compareTo(Node<E>) - Method in class org.amino.ds.graph.Node

contains(Object) - Method in class org.amino.ds.graph.AbstractGraph

contains(Object) - Method in class org.amino.ds.lockfree.EBDeque

contains(Object) - Method in class org.amino.ds.lockfree.LocalDeque

Contains function is not thread safe.

contains(Object) - Method in class org.amino.ds.lockfree.LocalSet

contains(Object) - Method in class org.amino.ds.lockfree.LockFreeDeque

Contains function is not thread safe.

contains(Object) - Method in class org.amino.ds.lockfree.LockFreeList

Returns true if this list contains the specified element.

contains(Object) - Method in class org.amino.ds.lockfree.LockFreePriorityQueue

contains(Object) - Method in class org.amino.ds.lockfree.LockFreeSet

containsAll(Collection<?>) - Method in class org.amino.ds.graph.AbstractGraph

containsAll(Collection<?>) - Method in class org.amino.ds.lockfree.LocalSet

containsAll(Collection<?>) - Method in class org.amino.ds.lockfree.LockFreeList

containsAll(Collection<?>) - Method in class org.amino.ds.lockfree.LockFreeSet

containsEdge(E, E) - Method in class org.amino.ds.graph.AbstractGraph

Returns whether this graph contains an edge between start and end.

containsEdge(E) - Method in class org.amino.ds.graph.AdjacentList

finds in this adjacent list whether there is an edge that has specified node value.

containsEdge(Node<E>) - Method in class org.amino.ds.graph.AdjacentList

finds whether the head node of this adjacent list links to the specified node e.

containsEdge(E, E) - Method in interface org.amino.ds.graph.Graph

Returns whether this graph contains an edge between start and end.

containsKey(Object) - Method in class org.amino.ds.lockfree.LockFreeDictionary

containsNode(Node<E>) - Method in class org.amino.ds.graph.AbstractGraph

Judge if node is contained in graph.

containsNode(Node<E>) - Method in interface org.amino.ds.graph.Graph

whether this graph contains the specified node.

containsValue(Object) - Method in class org.amino.ds.lockfree.LockFreeDictionary

D

DEFAULT_MINIMUM_ARRAY_SIZE - Static variable in class org.amino.alg.parallelprefix.ThreadedParallelPrefix

minimum size.

DefaultAddBinaryOp<T> - Class in org.amino.alg.parallelprefix

Provide basic implementation for addition binary operation used in parallel prefix package.

DefaultAddBinaryOp() - Constructor for class org.amino.alg.parallelprefix.DefaultAddBinaryOp

defaultNumberOfWorkers() - Static method in class org.amino.scheduler.internal.AbstractScheduler

DefaultSorter - Class in org.amino.alg.sort

This is the simple default sorter class.

DefaultSorter() - Constructor for class org.amino.alg.sort.DefaultSorter

deleteValue(V) - Method in class org.amino.ds.lockfree.LockFreeDictionary

descendingIterator() - Method in class org.amino.ds.lockfree.EBDeque

descendingIterator() - Method in class org.amino.ds.lockfree.LocalDeque

descendingIterator() - Method in class org.amino.ds.lockfree.LockFreeDeque

DirectedGraph<E> - Interface in org.amino.ds.graph

Interface of directed graph.

DirectedGraphImpl<E> - Class in org.amino.ds.graph

Sample implementation of interface DirectedGraph.

DirectedGraphImpl() - Constructor for class org.amino.ds.graph.DirectedGraphImpl

Doable<I,O> - Interface in org.amino.pattern.internal

Interface for worker in pattern framework.

dump() - Method in class org.amino.ds.lockfree.EBDeque

It's used for debugging purpose.

dump() - Method in class org.amino.ds.lockfree.EBStack

dump array.

dump() - Method in class org.amino.utility.AdaptEliminationArray

dump for debug.

dump() - Method in class org.amino.utility.EliminationArray

dump for debug.

dumpGraph() - Method in class org.amino.ds.graph.AbstractGraph

for testing.

DynamicWorker<S,T> - Interface in org.amino.pattern.internal

Classes for a dynamicWorker.

E

EBDeque<E> - Class in org.amino.ds.lockfree

This Deque implementation is based on the algorithm defined in the follwoing paper: CAS-Based Lock-Free Algorithm for Shared Deques By Maged M.

EBDeque() - Constructor for class org.amino.ds.lockfree.EBDeque

default constructor.

EBDeque(int) - Constructor for class org.amino.ds.lockfree.EBDeque

EBStack<E> - Class in org.amino.ds.lockfree

EBStack() - Constructor for class org.amino.ds.lockfree.EBStack

Default constructor.

EBStack(int) - Constructor for class org.amino.ds.lockfree.EBStack

Specify size of internal elimination array.

Edge<E> - Class in org.amino.ds.graph

Edge in the graph.

Edge(Node<E>, Node<E>) - Constructor for class org.amino.ds.graph.Edge

Constructor an edge with default edge 1.

Edge(Node<E>, Node<E>, double) - Constructor for class org.amino.ds.graph.Edge

Construct an edge with weight.

element() - Method in class org.amino.ds.lockfree.EBDeque

Returns head (first element) of this deque, but does not remove it.

EliminationArray - Class in org.amino.utility

A global elimination array class for several data structures.

EliminationArray(int) - Constructor for class org.amino.utility.EliminationArray

Create an EliminationArray object with specified size.

entrySet() - Method in class org.amino.ds.lockfree.LockFreeDictionary

equals(Object) - Method in class org.amino.ds.graph.AdjacentNode

equals(Object) - Method in class org.amino.ds.graph.Node

execute(long, TimeUnit) - Method in interface org.amino.pattern.internal.MasterWorker

Begin processing of the work items submitted.

execute() - Method in interface org.amino.pattern.internal.MasterWorker

Begin processing of the work items submitted.

execute(Runnable) - Method in class org.amino.scheduler.internal.AbstractScheduler

F

FastRandom - Class in org.amino.utility

This class provides fast random method.

find(E) - Method in class org.amino.ds.tree.ParallelRBTree

Find the key in the tree.

find(T) - Method in class org.amino.mcas.LockFreeBSTree

Find key in the tree.

findAll(byte[], byte) - Method in class org.amino.alg.scan.AbstractScanner

Find the indices of all occurrences of the given value in the array.

findAll(byte[], byte[]) - Method in class org.amino.alg.scan.AbstractScanner

Find the index of the any occurrence of the given sequence in the array.

findAll(byte[], byte, int, int) - Method in class org.amino.alg.scan.ParallelScanner

Find the indices of all occurrences of the given value in an array segment.

findAll(byte[], byte[], int, int) - Method in class org.amino.alg.scan.ParallelScanner

Find the index of the any occurrence of the given sequence in an array segment.

findAll(byte[], byte) - Method in interface org.amino.alg.scan.Scanner

Find the indices of all occurrences of the given value in the array.

findAll(byte[], byte, int, int) - Method in interface org.amino.alg.scan.Scanner

Find the indices of all occurrences of the given value in an array segment.

findAll(byte[], byte[]) - Method in interface org.amino.alg.scan.Scanner

Find the index of the any occurrence of the given sequence in the array.

findAll(byte[], byte[], int, int) - Method in interface org.amino.alg.scan.Scanner

Find the index of the any occurrence of the given sequence in an array segment.

findAny(byte[], byte) - Method in class org.amino.alg.scan.AbstractScanner

Find the index of the any occurrence of the given value in the array.

findAny(byte[], byte[]) - Method in class org.amino.alg.scan.AbstractScanner

Find the index of the any occurrence of the given sequence in the array.

findAny(byte[], byte, int, int) - Method in class org.amino.alg.scan.ParallelScanner

Find the index of the any occurrence of the given value in an array segment.

findAny(byte[], byte[], int, int) - Method in class org.amino.alg.scan.ParallelScanner

Find the index of the any occurrence of the given sequence in an array segment.

findAny(byte[], byte) - Method in interface org.amino.alg.scan.Scanner

Find the index of the any occurrence of the given value in the array.

findAny(byte[], byte, int, int) - Method in interface org.amino.alg.scan.Scanner

Find the index of the any occurrence of the given value in an array segment.

findAny(byte[], byte[]) - Method in interface org.amino.alg.scan.Scanner

Find the index of the any occurrence of the given sequence in the array.

findAny(byte[], byte[], int, int) - Method in interface org.amino.alg.scan.Scanner

Find the index of the any occurrence of the given sequence in an array segment.

findFirst(byte[], byte) - Method in class org.amino.alg.scan.AbstractScanner

Find the index of the first occurrence of the given value in the array.

findFirst(byte[], byte[]) - Method in class org.amino.alg.scan.AbstractScanner

Find the index of the first occurrence of the given sequence in the array.

findFirst(byte[], byte) - Method in interface org.amino.alg.scan.Scanner

Find the index of the first occurrence of the given value in the array.

findFirst(byte[], byte[]) - Method in interface org.amino.alg.scan.Scanner

Find the index of the first occurrence of the given sequence in the array.

findLast(byte[], byte) - Method in class org.amino.alg.scan.AbstractScanner

Find the index of the last occurrence of the given value in the array.

findLast(byte[], byte[]) - Method in class org.amino.alg.scan.AbstractScanner

Find the index of the last occurrence of the given sequence in the array.

findLast(byte[], byte) - Method in interface org.amino.alg.scan.Scanner

Find the index of the last occurrence of the given value in the array.

findLast(byte[], byte[]) - Method in interface org.amino.alg.scan.Scanner

Find the index of the last occurrence of the given sequence in the array.

findNext(byte[], byte, int) - Method in class org.amino.alg.scan.ParallelScanner

Find the next index of the given value in the array.

findNext(byte[], byte[], int) - Method in class org.amino.alg.scan.ParallelScanner

Find the next index of the given sequence in the array.

findNext(byte[], byte, int) - Method in interface org.amino.alg.scan.Scanner

Find the next index of the given value in the array.

findNext(byte[], byte[], int) - Method in interface org.amino.alg.scan.Scanner

Find the next index of the given sequence in the array.

findPrevious(byte[], byte, int) - Method in class org.amino.alg.scan.ParallelScanner

Find the previous index of the given value in the array.

findPrevious(byte[], byte[], int) - Method in class org.amino.alg.scan.ParallelScanner

Find the previous index of the given value in the array.

findPrevious(byte[], byte, int) - Method in interface org.amino.alg.scan.Scanner

Find the previous index of the given value in the array.

findPrevious(byte[], byte[], int) - Method in interface org.amino.alg.scan.Scanner

Find the previous index of the given value in the array.

finished() - Method in interface org.amino.pattern.internal.MasterWorker

Indicate to the master/worker that there is not more work coming.

freeMultiOwnerShip(AdjacentList<E>[]) - Method in class org.amino.ds.graph.AbstractGraph

release all ownership of every element in targets.

freeOwnership() - Method in class org.amino.ds.graph.AdjacentList

free the ownership.

G

get(Object) - Method in class org.amino.ds.lockfree.LockFreeDictionary

get(int) - Method in class org.amino.ds.lockfree.LockFreeList

get(int) - Method in class org.amino.ds.lockfree.LockFreeVector

Get element with the index.

getAllNodes() - Method in class org.amino.ds.graph.AbstractGraph

get all the nodes in the graph.

getAllNodes() - Method in interface org.amino.ds.graph.Graph

get all the nodes in the graph.

getAllResults() - Method in interface org.amino.pattern.internal.MasterWorker

Obtain all of the results from the processing work items.

getConnectedComponents(UndirectedGraph<E>, ExecutorService) - Static method in class org.amino.alg.graph.GraphAlg

parallel Connected Component algorithm based on [Steve Goddard 1996].

getDestinations(Node<E>) - Method in interface org.amino.ds.graph.DirectedGraph

Get nodes started with start node.

getDestinations(Node<E>) - Method in class org.amino.ds.graph.DirectedGraphImpl

Get nodes started with start node.

getEdge(Node<E>) - Method in class org.amino.ds.graph.AdjacentList

return all the edge linked to node n.

getEdge(E) - Method in class org.amino.ds.graph.AdjacentList

return all the edges whose one end has the value t in this adjacent list.

getEdges(E, E) - Method in class org.amino.ds.graph.AbstractGraph

get all the edge start from the nodes which contain value start and end.

getEdges(Node<E>, Node<E>) - Method in class org.amino.ds.graph.AbstractGraph

get all all the edges which start from node start and end with node end.

getEdges(Node<E>, Node<E>) - Method in interface org.amino.ds.graph.Graph

get all all the edges which start from node start and end with node end.

getEdges(E, E) - Method in interface org.amino.ds.graph.Graph

get all the edge start from the nodes which contain value start and end.

getEnd() - Method in class org.amino.ds.graph.Edge

getFirst() - Method in class org.amino.ds.lockfree.EBDeque

getFirst() - Method in class org.amino.ds.lockfree.LocalDeque

getFirst() - Method in class org.amino.ds.lockfree.LockFreeDeque

getHeadNode() - Method in class org.amino.ds.graph.AdjacentList

getHeight() - Method in class org.amino.ds.tree.ParallelRBTree

Get height of the tree.

getIncoming(Node<E>) - Method in interface org.amino.ds.graph.DirectedGraph

Get edges ended with end node.

getIncoming(Node<E>) - Method in class org.amino.ds.graph.DirectedGraphImpl

Get edges ended with end node.

getLast() - Method in class org.amino.ds.lockfree.EBDeque

getLast() - Method in class org.amino.ds.lockfree.LocalDeque

getLast() - Method in class org.amino.ds.lockfree.LockFreeDeque

getLinkedEdges(Node<E>) - Method in class org.amino.ds.graph.AbstractGraph

get all edges directly linked to the specified node.

getLinkedEdges() - Method in class org.amino.ds.graph.AdjacentList

get all linked edges implied by this adjacent list.

getLinkedEdges(Node<E>) - Method in interface org.amino.ds.graph.Graph

get all edges directly linked to the specified node.

getLinkedNodes(Node<E>) - Method in class org.amino.ds.graph.AbstractGraph

get all nodes which directly linked to node.

getLinkedNodes() - Method in class org.amino.ds.graph.AdjacentList

getLinkedNodes(Node<E>) - Method in interface org.amino.ds.graph.Graph

get all nodes which directly linked to node.

getMajorVersion() - Static method in class org.amino.Runtime

Return major version number.

getMaxAvailableWorkerThreads() - Static method in class org.amino.Runtime

Return maximum number of worker threads.

getMinimumArraySize() - Method in class org.amino.alg.parallelprefix.ThreadedParallelPrefix

getMinorVersion() - Static method in class org.amino.Runtime

Return minor version number.

getMST(UndirectedGraph, ExecutorService) - Static method in class org.amino.alg.graph.GraphAlg

parallel MST algorithm based on Boruvka's algorithm.

getMultiOwnerShip(AdjacentList<E>[]) - Method in class org.amino.ds.graph.AbstractGraph

Get all ownership of multiple AdjacentList.

getNode() - Method in class org.amino.ds.graph.AdjacentNode

getNodes(E) - Method in class org.amino.ds.graph.AbstractGraph

get all nodes whose value equal to e.

getNodes(E) - Method in interface org.amino.ds.graph.Graph

get all nodes whose value equal to e.

getNumberAvailableWorkerThreads() - Static method in class org.amino.Runtime

Return number of available worker threads.

getOutgoing(Node<E>) - Method in interface org.amino.ds.graph.DirectedGraph

Get edges started with start node.

getOutgoing(Node<E>) - Method in class org.amino.ds.graph.DirectedGraphImpl

Get edges started with start node.

getOutstandingWork() - Method in class org.amino.scheduler.internal.AbstractScheduler

getOutstandingWork() - Method in class org.amino.scheduler.internal.WorkStealingScheduler

getOwnership() - Method in class org.amino.ds.graph.AdjacentList

getRejectedExecutionHandler() - Method in class org.amino.scheduler.internal.AbstractScheduler

getRejectedExecutionHandler() - Method in interface org.amino.scheduler.internal.Scheduler

Get handler used for rejected executions.

getShortestPath(Graph<E>, ExecutorService, E, E) - Static method in class org.amino.alg.graph.GraphAlg

This is an implementation of a parallelization of Dijkstra's shortest path algorithm described by Crauser, Mehlhorn, Meyer and Sanders in their paper "A Parallelization of Dijkstra's Shortest Path Algorithm" in 23rd Symposium on Mathematical Foundations of Computer Science, 1998.

getShortestPath(Graph<E>, ExecutorService, Node<E>, Node<E>) - Static method in class org.amino.alg.graph.GraphAlg

This is an implementation of a parallelization of Dijkstra's shortest path algorithm described by Crauser, Mehlhorn, Meyer and Sanders in their paper "A Parallelization of Dijkstra's Shortest Path Algorithm" in 23rd Symposium on Mathematical Foundations of Computer Science, 1998.

getSources(Node<E>) - Method in interface org.amino.ds.graph.DirectedGraph

Get nodes end with end node.

getSources(Node<E>) - Method in class org.amino.ds.graph.DirectedGraphImpl

Get nodes end with end node.

getStart() - Method in class org.amino.ds.graph.Edge

getStrongComponents(DirectedGraph<E>, ExecutorService) - Static method in class org.amino.alg.graph.GraphAlg

Parallel Strong Connected Component algorithm based on [LK Fleischer2000].

getValue() - Method in class org.amino.ds.graph.Node

getValue() - Method in class org.amino.ds.tree.ParallelRBTree.Node

Get value.

getVersion() - Static method in class org.amino.Runtime

Return current version of Amino package.

getWeight() - Method in class org.amino.ds.graph.AdjacentNode

getWeight() - Method in class org.amino.ds.graph.Edge

getWeightDestinations(Node<E>) - Method in interface org.amino.ds.graph.DirectedGraph

Get weighted edges started with start node.

getWeightDestinations(Node<E>) - Method in class org.amino.ds.graph.DirectedGraphImpl

Get weighted edges started with start node.

getWeightSources(Node<E>) - Method in interface org.amino.ds.graph.DirectedGraph

Get weighted edges ended with end node.

getWeightSources(Node<E>) - Method in class org.amino.ds.graph.DirectedGraphImpl

Get weighted edges ended with end node.

getWork(int) - Method in class org.amino.scheduler.internal.AbstractScheduler

Get work item identified by id.

getWork(int) - Method in class org.amino.scheduler.internal.WorkStealingScheduler

Get work item identified by id.

Graph<E> - Interface in org.amino.ds.graph

A Graph provides basic operations to create, search and change itself.

GraphAlg - Class in org.amino.alg.graph

H

hashCode() - Method in class org.amino.ds.graph.Node

head - Variable in class org.amino.ds.lockfree.LockFreeList

Pointer to header node, initialized to a dummy node.

I

IEliminationArray - Interface in org.amino.utility

A global elimination array interface.

indexOf(Object) - Method in class org.amino.ds.lockfree.LockFreeList

inOrderWalk(Doable<E, E>) - Method in class org.amino.ds.tree.ParallelRBTree

Iterate the tree in-order.

insert(E) - Method in class org.amino.ds.tree.ParallelRBTree

Insert a element into the tree.

InsertionSorter - Class in org.amino.alg.sort

This class implements the basic Insertion sorting algorithm.

InsertionSorter() - Constructor for class org.amino.alg.sort.InsertionSorter

is - Variable in class org.amino.alg.sort.QuickSorter

Insert sorter.

IS_THRESHOLD - Static variable in class org.amino.alg.sort.QuickSorter

Threshold if used to decide if quick sort is needed.

isCompleted() - Method in interface org.amino.pattern.internal.MasterWorker

Poll an executing master/worker for completion.

isEmpty() - Method in class org.amino.ds.graph.AbstractGraph

isEmpty() - Method in class org.amino.ds.lockfree.EBDeque

Checks to see if the deque is empty or not.

isEmpty() - Method in class org.amino.ds.lockfree.EBStack

Check to see if Stack is empty.

isEmpty() - Method in interface org.amino.ds.lockfree.IStack

isEmpty() - Method in class org.amino.ds.lockfree.LocalDeque

Checks to see if the deque is empty or not.

isEmpty() - Method in class org.amino.ds.lockfree.LocalSet

isEmpty() - Method in class org.amino.ds.lockfree.LockFreeDeque

Checks to see if the deque is empty or not.

isEmpty() - Method in class org.amino.ds.lockfree.LockFreeDictionary

isEmpty() - Method in class org.amino.ds.lockfree.LockFreeList

isEmpty() - Method in class org.amino.ds.lockfree.LockFreePriorityQueue

isEmpty() - Method in class org.amino.ds.lockfree.LockFreeQueue

isEmpty() - Method in class org.amino.ds.lockfree.LockFreeSet

isEmpty() - Method in class org.amino.mcas.LockFreeBSTree

Is the tree empty?

isLeaf() - Method in class org.amino.ds.tree.ParallelRBTree.Node

Decide if this node is a leaf.

isNotLeaf() - Method in class org.amino.ds.tree.ParallelRBTree.Node

Decide if this node is a leaf.

isShutdown() - Method in class org.amino.scheduler.internal.AbstractScheduler

isStatic() - Method in interface org.amino.pattern.internal.MasterWorker

Determine if a master/worker is static.

IStack<E> - Interface in org.amino.ds.lockfree

interface definition of stack.

isTerminated() - Method in class org.amino.scheduler.internal.AbstractScheduler

iterator() - Method in class org.amino.ds.graph.AbstractGraph

iterator() - Method in class org.amino.ds.lockfree.EBDeque

iterator() - Method in class org.amino.ds.lockfree.LocalDeque

iterator() - Method in class org.amino.ds.lockfree.LocalSet

iterator() - Method in class org.amino.ds.lockfree.LockFreeDeque

iterator() - Method in class org.amino.ds.lockfree.LockFreeList

iterator() - Method in class org.amino.ds.lockfree.LockFreePriorityQueue

iterator() - Method in class org.amino.ds.lockfree.LockFreeQueue

iterator() - Method in class org.amino.ds.lockfree.LockFreeSet

K

keySet() - Method in class org.amino.ds.lockfree.LockFreeDictionary

L

lastIndexOf(Object) - Method in class org.amino.ds.lockfree.LockFreeList

leftSubtreeHeight() - Method in class org.amino.ds.tree.ParallelRBTree

Get height of left subtree.

listIterator() - Method in class org.amino.ds.lockfree.LockFreeList

listIterator(int) - Method in class org.amino.ds.lockfree.LockFreeList

LocalDeque<E> - Class in org.amino.ds.lockfree

This Deque implementation is based on the algorithm defined in the follwoing paper: CAS-Based Lock-Free Algorithm for Shared Deques By Maged M.

LocalDeque() - Constructor for class org.amino.ds.lockfree.LocalDeque

LocalSet<E> - Class in org.amino.ds.lockfree

This is an implementation of lock-free hashset data structure, based on algorithm described in two paper "Split-Ordered Lists - Lock-free Resizable Hash Tables" by Ori Shalev Tel Aviv University and Nir Shavit Tel-Aviv University and Sun Microsystems Laboratories "High Performance Dynamic Lock-Free Hash Tables and List-Based Set" by Maged M.

LocalSet(int, float) - Constructor for class org.amino.ds.lockfree.LocalSet

Create a new set with explicitly specified expected size and load factor.

LocalSet(int) - Constructor for class org.amino.ds.lockfree.LocalSet

LocalSet() - Constructor for class org.amino.ds.lockfree.LocalSet

Create a new LocalSet.

LockFreeBSTree<T,V> - Class in org.amino.mcas

This is an implementation of a lock-free binary search tree.

LockFreeBSTree() - Constructor for class org.amino.mcas.LockFreeBSTree

Default constructor.

LockFreeDeque<E> - Class in org.amino.ds.lockfree

This Deque implementation is based on the algorithm defined in the follwoing paper: CAS-Based Lock-Free Algorithm for Shared Deques By Maged M.

LockFreeDeque() - Constructor for class org.amino.ds.lockfree.LockFreeDeque

LockFreeDictionary<K,V> - Class in org.amino.ds.lockfree

This is a thread-safe and lock-free dictionary.

LockFreeDictionary() - Constructor for class org.amino.ds.lockfree.LockFreeDictionary

default constructor.

LockFreeDictionary(Comparator<? super K>) - Constructor for class org.amino.ds.lockfree.LockFreeDictionary

LockFreeList<E> - Class in org.amino.ds.lockfree

This is an implementation of a lock-free linked list data structure.

LockFreeList() - Constructor for class org.amino.ds.lockfree.LockFreeList

Constructs an empty list.

LockFreeList.Entry<E> - Class in org.amino.ds.lockfree

internal node definition.

LockFreeList.Entry(E) - Constructor for class org.amino.ds.lockfree.LockFreeList.Entry

LockFreeList.Entry(E, AtomicMarkableReference<LockFreeList.Entry<E>>) - Constructor for class org.amino.ds.lockfree.LockFreeList.Entry

LockFreeList.ListStateHolder<E> - Class in org.amino.ds.lockfree

hold state between two function calls.

LockFreeList.ListStateHolder() - Constructor for class org.amino.ds.lockfree.LockFreeList.ListStateHolder

LockFreeOrderedList<E> - Class in org.amino.ds.lockfree

This an implementation of a lock-free ordered linked list data structure.

LockFreeOrderedList() - Constructor for class org.amino.ds.lockfree.LockFreeOrderedList

Creates a LockfreeList that is initially empty.

LockFreeOrderedList(Collection<? extends E>) - Constructor for class org.amino.ds.lockfree.LockFreeOrderedList

Creates a LockfreeList initially containing the elements of the given collection, added in traversal order of the collection's iterator.

LockFreePriorityQueue<E> - Class in org.amino.ds.lockfree

It is a thread-safe and lock-free queue.

LockFreePriorityQueue() - Constructor for class org.amino.ds.lockfree.LockFreePriorityQueue

default constructor.

LockFreePriorityQueue(Comparator<? super E>) - Constructor for class org.amino.ds.lockfree.LockFreePriorityQueue

LockFreeQueue<E> - Class in org.amino.ds.lockfree

This is an implementation of a lock-free FIFO queue data structure.

LockFreeQueue() - Constructor for class org.amino.ds.lockfree.LockFreeQueue

default constructor.

LockFreeQueue(Collection<? extends E>) - Constructor for class org.amino.ds.lockfree.LockFreeQueue

Constructor with initial collection.

LockFreeSet<E> - Class in org.amino.ds.lockfree

This is an implementation of lock-free hashset data structure, based on algorithm described in two paper "Split-Ordered Lists - Lock-free Resizable Hash Tables" by Ori Shalev Tel Aviv University and Nir Shavit Tel-Aviv University and Sun Microsystems Laboratories "High Performance Dynamic Lock-Free Hash Tables and List-Based Set" by Maged M.

LockFreeSet(int, float) - Constructor for class org.amino.ds.lockfree.LockFreeSet

Create a new set with explicitly specified expected size and load factor.

LockFreeSet(int) - Constructor for class org.amino.ds.lockfree.LockFreeSet

LockFreeSet() - Constructor for class org.amino.ds.lockfree.LockFreeSet

Create a new LockFreeSet.

LockFreeVector<E> - Class in org.amino.ds.lockfree

It is a thread safe and lock-free vector.

LockFreeVector() - Constructor for class org.amino.ds.lockfree.LockFreeVector

Create a new lock-free vector.

M

manageWorkerThreads() - Static method in class org.amino.Runtime

Return whether Amino Runtime is managing worker threads.

markRemoved() - Method in class org.amino.ds.lockfree.LockFreeList.ListStateHolder

MasterWorker<S,T> - Interface in org.amino.pattern.internal

This is a simple master/worker pattern.

MasterWorker.ResultKey - Class in org.amino.pattern.internal

An abstract type used to hold keys for result values.

MasterWorker.ResultKey() - Constructor for class org.amino.pattern.internal.MasterWorker.ResultKey

MasterWorkerFactory - Class in org.amino.pattern.internal

Classes for a MasterWorker Factory.

median(byte[], int, int, int) - Static method in class org.amino.alg.sort.QuickSorter

Routine to find pivot element.

median(char[], int, int, int) - Static method in class org.amino.alg.sort.QuickSorter

Routine to find pivot element.

median(short[], int, int, int) - Static method in class org.amino.alg.sort.QuickSorter

Routine to find pivot element.

median(int[], int, int, int) - Static method in class org.amino.alg.sort.QuickSorter

Routine to find pivot element.

median(long[], int, int, int) - Static method in class org.amino.alg.sort.QuickSorter

Routine to find pivot element.

median(float[], int, int, int) - Static method in class org.amino.alg.sort.QuickSorter

Routine to find pivot element.

median(double[], int, int, int) - Static method in class org.amino.alg.sort.QuickSorter

Routine to find pivot element.

modify(int[], int[], BinaryOp<T>) - Method in class org.amino.alg.parallelprefix.ThreadedParallelPrefix.PartialReduction

For every element in parallelReduction except the first one, spawn off a worker thread and with the value of that element, modify each element of outputArray with it using the op method.

modify(float[], float[], BinaryOp<T>) - Method in class org.amino.alg.parallelprefix.ThreadedParallelPrefix.PartialReduction

For every element in parallelReduction except the first one, spawn off a worker thread and with the value of that element, modify each element of outputArray with it using the op method.

N

newDynamic(DynamicWorker<X, Y>) - Static method in class org.amino.pattern.internal.MasterWorkerFactory

newDynamic(DynamicWorker<X, Y>, int) - Static method in class org.amino.pattern.internal.MasterWorkerFactory

newStatic(Doable<X, Y>) - Static method in class org.amino.pattern.internal.MasterWorkerFactory

newStatic(Doable<X, Y>, int) - Static method in class org.amino.pattern.internal.MasterWorkerFactory

nextInt(int) - Static method in class org.amino.utility.FastRandom

Generate a pseudo-random integer.

ninther(int[], int, int, int) - Static method in class org.amino.alg.sort.QuickSorter

Routine to find pivot element.

Node<E> - Class in org.amino.ds.graph

Node in the graph.

Node(E) - Constructor for class org.amino.ds.graph.Node

Constructs a graph node, with specified element e.

numWorkers() - Method in interface org.amino.pattern.internal.MasterWorker

Get the number of active workers.

numWorkers() - Method in class org.amino.scheduler.internal.AbstractScheduler

Get number of workers.

numWorkers() - Method in interface org.amino.scheduler.internal.Scheduler

Get number of workers.

O

ObjectID - Class in org.amino.mcas

a object with a id used for global sequential.

ObjectID() - Constructor for class org.amino.mcas.ObjectID

default constructor.

offer(E) - Method in class org.amino.ds.lockfree.EBDeque

Inserts element e at the tail of this deque.

offer(E) - Method in class org.amino.ds.lockfree.LocalDeque

Inserts element e at the tail of this deque.

offer(E) - Method in class org.amino.ds.lockfree.LockFreeDeque

Inserts element e at the tail of this deque.

offer(E) - Method in class org.amino.ds.lockfree.LockFreePriorityQueue

offer(E) - Method in class org.amino.ds.lockfree.LockFreeQueue

offerFirst(E) - Method in class org.amino.ds.lockfree.EBDeque

offerFirst(E) - Method in class org.amino.ds.lockfree.LocalDeque

offerFirst(E) - Method in class org.amino.ds.lockfree.LockFreeDeque

offerLast(E) - Method in class org.amino.ds.lockfree.EBDeque

offerLast(E) - Method in class org.amino.ds.lockfree.LocalDeque

offerLast(E) - Method in class org.amino.ds.lockfree.LockFreeDeque

org.amino - package org.amino

Class definition for Amino Runtime.

org.amino.alg.graph - package org.amino.alg.graph

Interfaces and classes to implement a parallel graph algorithm.

org.amino.alg.parallelprefix - package org.amino.alg.parallelprefix

Interfaces and classes to implement a parallel-prefix algorithm.

org.amino.alg.scan - package org.amino.alg.scan

Classes and interface for string searching and matching operations.

org.amino.alg.sort - package org.amino.alg.sort

Provides classes and interfaces for parallel QuickSort and other common sorting algorithms

org.amino.ds.graph - package org.amino.ds.graph

Interfaces and classes to implement a parallel graph data structure.

org.amino.ds.lockfree - package org.amino.ds.lockfree

Provides classes and interfaces for various lock-free collection classes.

org.amino.ds.tree - package org.amino.ds.tree

Interfaces and classes to implement a parallel tree data structure.

org.amino.mcas - package org.amino.mcas

Provides classes and interfaces for software Multi-CAS classes.

org.amino.pattern.internal - package org.amino.pattern.internal

Provides the classes and interfaces for a simple master/worker pattern.

org.amino.scheduler.internal - package org.amino.scheduler.internal

Provides classes and interfaces for scheduling threads.

org.amino.utility - package org.amino.utility

Provides classes and interfaces for various utility classes.

P

Parallel - Annotation Type in org.amino.utility

An annotation which indicates how method should be used inside multi-threaded program.

ParallelPrefix<T> - Interface in org.amino.alg.parallelprefix

Interface for parallel prefix (scan) operation.

ParallelQuickSorterWorkStealing - Class in org.amino.alg.sort

This class provides a parallel quicksort implementation using a dynamic master-worker pattern.

ParallelQuickSorterWorkStealing() - Constructor for class org.amino.alg.sort.ParallelQuickSorterWorkStealing

Constructor.

ParallelQuickSorterWorkStealing(int) - Constructor for class org.amino.alg.sort.ParallelQuickSorterWorkStealing

Constructor.

ParallelRBTree<E> - Class in org.amino.ds.tree

This is an implementation of a relaxed balanced red-black tree data structure.

ParallelRBTree() - Constructor for class org.amino.ds.tree.ParallelRBTree

Default constructor.

ParallelRBTree.Node<E> - Class in org.amino.ds.tree

Internal node of tree.

ParallelRBTree.Node(E) - Constructor for class org.amino.ds.tree.ParallelRBTree.Node

Constructor with default value.

ParallelRBTree.Node(E, ParallelRBTree.Node<E>) - Constructor for class org.amino.ds.tree.ParallelRBTree.Node

Constructor with default value and parent pointer.

ParallelRBTree.Node(E, ParallelRBTree.Node<E>, ParallelRBTree.Node<E>, ParallelRBTree.Node<E>) - Constructor for class org.amino.ds.tree.ParallelRBTree.Node

Constructor with default value, parent, left child and right child pointer.

ParallelScanner - Class in org.amino.alg.scan

Implementation of parallel scanner.

ParallelScanner(int) - Constructor for class org.amino.alg.scan.ParallelScanner

Creates a new parallel scanner, with the specified number of threads "nthreads".

ParallelScanner() - Constructor for class org.amino.alg.scan.ParallelScanner

Creates a new parallel scanner, with default number of threads that equals to the the number of logical processors.

ParallelType - Enum in org.amino.utility

peek() - Method in class org.amino.ds.lockfree.EBDeque

Returns the first element of this deque, or null if deque is empty.

peek() - Method in class org.amino.ds.lockfree.EBStack

Return copy of the top data on the Stack.

peek() - Method in interface org.amino.ds.lockfree.IStack

peek() - Method in class org.amino.ds.lockfree.LocalDeque

Returns the first element of this deque, or null if deque is empty.

peek() - Method in class org.amino.ds.lockfree.LockFreeDeque

Returns the first element of this deque, or null if deque is empty.

peek() - Method in class org.amino.ds.lockfree.LockFreePriorityQueue

peek() - Method in class org.amino.ds.lockfree.LockFreeQueue

peekFirst() - Method in class org.amino.ds.lockfree.EBDeque

peekFirst() - Method in class org.amino.ds.lockfree.LocalDeque

peekFirst() - Method in class org.amino.ds.lockfree.LockFreeDeque

peekFirst() - Method in class org.amino.ds.lockfree.LockFreePriorityQueue

peekLast() - Method in class org.amino.ds.lockfree.EBDeque

peekLast() - Method in class org.amino.ds.lockfree.LocalDeque

peekLast() - Method in class org.amino.ds.lockfree.LockFreeDeque

poll() - Method in class org.amino.ds.lockfree.EBDeque

Returns and removes first (head) element of this deque, or null if this deque is empty.

poll() - Method in class org.amino.ds.lockfree.LocalDeque

Returns and removes first (head) element of this deque, or null if this deque is empty.

poll() - Method in class org.amino.ds.lockfree.LockFreeDeque

Returns and removes first (head) element of this deque, or null if this deque is empty.

poll() - Method in class org.amino.ds.lockfree.LockFreePriorityQueue

poll() - Method in class org.amino.ds.lockfree.LockFreeQueue

pollFirst() - Method in class org.amino.ds.lockfree.EBDeque

This is the method to pop the Right node from the Deque.

pollFirst() - Method in class org.amino.ds.lockfree.LocalDeque

This is the method to pop the Right node from the Deque.

pollFirst() - Method in class org.amino.ds.lockfree.LockFreeDeque

This is the method to pop the Right node from the Deque.

pollLast() - Method in class org.amino.ds.lockfree.EBDeque

pollLast() - Method in class org.amino.ds.lockfree.LocalDeque

pollLast() - Method in class org.amino.ds.lockfree.LockFreeDeque

pop() - Method in class org.amino.ds.lockfree.EBDeque

pop() - Method in class org.amino.ds.lockfree.EBStack

Pop data from the Stack.

pop() - Method in interface org.amino.ds.lockfree.IStack

pop() - Method in class org.amino.ds.lockfree.LocalDeque

pop() - Method in class org.amino.ds.lockfree.LockFreeDeque

popBack() - Method in class org.amino.ds.lockfree.LockFreeVector

Remove the last element in the vector.

printBinTree() - Method in class org.amino.ds.tree.ParallelRBTree

Print the reb-blak tree.

printLeafs() - Method in class org.amino.ds.tree.ParallelRBTree

Print all leafs in the tree.

push(E) - Method in class org.amino.ds.lockfree.EBDeque

push(E) - Method in class org.amino.ds.lockfree.EBStack

Push data onto Stack.

push(E) - Method in interface org.amino.ds.lockfree.IStack

push(E) - Method in class org.amino.ds.lockfree.LocalDeque

push(E) - Method in class org.amino.ds.lockfree.LockFreeDeque

pushBack(E) - Method in class org.amino.ds.lockfree.LockFreeVector

add e at the end of vector.

put(K, V) - Method in class org.amino.ds.lockfree.LockFreeDictionary

putAll(Map<? extends K, ? extends V>) - Method in class org.amino.ds.lockfree.LockFreeDictionary

Q

QuickSorter - Class in org.amino.alg.sort

This class implements the basic sequential quicksort algorithm.

QuickSorter() - Constructor for class org.amino.alg.sort.QuickSorter

R

rand() - Static method in class org.amino.utility.FastRandom

Generate a pseudo-random integer.

reduce(int[], int[], BinaryOp<T>) - Method in class org.amino.alg.parallelprefix.ThreadedParallelPrefix.PartialReduction

Reduce across an array of integers.

reduce(float[], float[], BinaryOp<T>) - Method in class org.amino.alg.parallelprefix.ThreadedParallelPrefix.PartialReduction

Reduce across an array of float numbers.

releaseThreads(int) - Static method in class org.amino.Runtime

Increase count of threads available to participate in work.

remove(Object) - Method in class org.amino.ds.graph.AbstractGraph

remove() - Method in class org.amino.ds.lockfree.EBDeque

Returns and removes the first element in this deque.

remove(Object) - Method in class org.amino.ds.lockfree.EBDeque

Remove first occurrence of specified object o in this deque.

remove() - Method in class org.amino.ds.lockfree.LocalDeque

Returns and removes the first element in this deque.

remove(Object) - Method in class org.amino.ds.lockfree.LocalDeque

Remove first occurrence of specified object o in this deque.

remove(Object) - Method in class org.amino.ds.lockfree.LocalSet

remove() - Method in class org.amino.ds.lockfree.LockFreeDeque

Returns and removes the first element in this deque.

remove(Object) - Method in class org.amino.ds.lockfree.LockFreeDeque

Remove first occurrence of specified object o in this deque.

remove(Object) - Method in class org.amino.ds.lockfree.LockFreeDictionary

remove(Object) - Method in class org.amino.ds.lockfree.LockFreeList

remove(int) - Method in class org.amino.ds.lockfree.LockFreeList

remove(Object) - Method in class org.amino.ds.lockfree.LockFreeSet

remove(E) - Method in class org.amino.ds.tree.ParallelRBTree

remove an element from the tree.

remove(T) - Method in class org.amino.mcas.LockFreeBSTree

Remove key in the tree.

removeAll(Collection<?>) - Method in class org.amino.ds.graph.AbstractGraph

removeAll(Collection<?>) - Method in class org.amino.ds.lockfree.LocalSet

removeAll(Collection<?>) - Method in class org.amino.ds.lockfree.LockFreeList

removeAll(Collection<?>) - Method in class org.amino.ds.lockfree.LockFreeSet

removeEdge(Edge<E>) - Method in class org.amino.ds.graph.AdjacentList

remove a specified edge from this adjacent list.

removeEdge(Node<E>) - Method in class org.amino.ds.graph.AdjacentList

remove all edges connected to specified node.

removeEdge(E) - Method in class org.amino.ds.graph.AdjacentList

remove specified edge from this adjacent list.

removeEdge(Node<E>, Node<E>) - Method in class org.amino.ds.graph.DirectedGraphImpl

remove all the edges which start from start and end to end.

removeEdge(E, E) - Method in class org.amino.ds.graph.DirectedGraphImpl

remove all the edges which start from start and end to end.

removeEdge(Edge<E>) - Method in class org.amino.ds.graph.DirectedGraphImpl

remove all the edges which start from start and end to end.

removeEdge(Node<E>, Node<E>) - Method in interface org.amino.ds.graph.Graph

remove all the edges which start from start and end to end.

removeEdge(Edge<E>) - Method in interface org.amino.ds.graph.Graph

remove all the edges which start from start and end to end.

removeEdge(E, E) - Method in interface org.amino.ds.graph.Graph

remove all the edges which start from start and end to end.

removeEdge(Edge<E>) - Method in class org.amino.ds.graph.UndirectedGraph

remove all the edges which start from start and end to end.

removeEdge(Node<E>, Node<E>) - Method in class org.amino.ds.graph.UndirectedGraph

remove all the edges which start from start and end to end.

removeEdge(E, E) - Method in class org.amino.ds.graph.UndirectedGraph

remove all the edges which start from start and end to end.

removeFirst() - Method in class org.amino.ds.lockfree.EBDeque

removeFirst() - Method in class org.amino.ds.lockfree.LocalDeque

removeFirst() - Method in class org.amino.ds.lockfree.LockFreeDeque

removeFirstOccurrence(Object) - Method in class org.amino.ds.lockfree.EBDeque

removeFirstOccurrence(Object) - Method in class org.amino.ds.lockfree.LocalDeque

removeFirstOccurrence(Object) - Method in class org.amino.ds.lockfree.LockFreeDeque

removeLast() - Method in class org.amino.ds.lockfree.EBDeque

removeLast() - Method in class org.amino.ds.lockfree.LocalDeque

removeLast() - Method in class org.amino.ds.lockfree.LockFreeDeque

removeLastOccurrence(Object) - Method in class org.amino.ds.lockfree.EBDeque

removeLastOccurrence(Object) - Method in class org.amino.ds.lockfree.LocalDeque

removeLastOccurrence(Object) - Method in class org.amino.ds.lockfree.LockFreeDeque

removeNode(Node<E>) - Method in class org.amino.ds.graph.AbstractGraph

remove the node from the graph.

removeNode(Node<E>) - Method in class org.amino.ds.graph.DirectedGraphImpl

remove the node from the graph.

removeNode(Node<E>) - Method in interface org.amino.ds.graph.Graph

remove the node from the graph.

removeNode(Node<E>) - Method in class org.amino.ds.graph.UndirectedGraph

remove the node from the graph.

replaceAll(byte[], byte, byte) - Method in class org.amino.alg.scan.AbstractScanner

Replace all occurrences of the search value with the replacement value.

replaceAll(byte[], byte[], byte[]) - Method in class org.amino.alg.scan.AbstractScanner

Replace all occurrences of the search sequence with the replacement sequence.

replaceAll(byte[], byte, byte, int, int) - Method in class org.amino.alg.scan.ParallelScanner

Replace all occurrences of the search value with the replacement value.

replaceAll(byte[], byte[], byte[], int, int) - Method in class org.amino.alg.scan.ParallelScanner

Replace all occurrences of the search sequence with the replacement sequence.

replaceAll(byte[], byte, byte) - Method in interface org.amino.alg.scan.Scanner

Replace all occurrences of the search value with the replacement value.

replaceAll(byte[], byte, byte, int, int) - Method in interface org.amino.alg.scan.Scanner

Replace all occurrences of the search value with the replacement value.

replaceAll(byte[], byte[], byte[]) - Method in interface org.amino.alg.scan.Scanner

Replace all occurrences of the search sequence with the replacement sequence.

replaceAll(byte[], byte[], byte[], int, int) - Method in interface org.amino.alg.scan.Scanner

Replace all occurrences of the search sequence with the replacement sequence.

reserve(int) - Method in class org.amino.ds.lockfree.LockFreeVector

reserve more space.

reserveThreads(int) - Static method in class org.amino.Runtime

Decrease count of threads available to participate in work if manageWorkerThreads returns true.

result(MasterWorker.ResultKey) - Method in interface org.amino.pattern.internal.MasterWorker

Obtain the results from the processing of a work item.

retainAll(Collection<?>) - Method in class org.amino.ds.graph.AbstractGraph

retainAll(Collection<?>) - Method in class org.amino.ds.lockfree.LocalSet

This method is not thread-safe.

retainAll(Collection<?>) - Method in class org.amino.ds.lockfree.LockFreeList

retainAll(Collection<?>) - Method in class org.amino.ds.lockfree.LockFreeSet

This method is not thread-safe.

reverse(byte[]) - Method in class org.amino.alg.sort.AbstractSorter

reverse(char[]) - Method in class org.amino.alg.sort.AbstractSorter

reverse(short[]) - Method in class org.amino.alg.sort.AbstractSorter

reverse(int[]) - Method in class org.amino.alg.sort.AbstractSorter

reverse(long[]) - Method in class org.amino.alg.sort.AbstractSorter

reverse(float[]) - Method in class org.amino.alg.sort.AbstractSorter

reverse(double[]) - Method in class org.amino.alg.sort.AbstractSorter

reverse(T[]) - Method in class org.amino.alg.sort.AbstractSorter

Sort array using reverse natural (descending) order.

reverse(List<T>) - Method in class org.amino.alg.sort.AbstractSorter

Sort List using reverse natural (descending) order.

reverse(byte[], int, int) - Method in class org.amino.alg.sort.DefaultSorter

reverse(char[], int, int) - Method in class org.amino.alg.sort.DefaultSorter

reverse(short[], int, int) - Method in class org.amino.alg.sort.DefaultSorter

reverse(int[], int, int) - Method in class org.amino.alg.sort.DefaultSorter

reverse(long[], int, int) - Method in class org.amino.alg.sort.DefaultSorter

reverse(float[], int, int) - Method in class org.amino.alg.sort.DefaultSorter

reverse(double[], int, int) - Method in class org.amino.alg.sort.DefaultSorter

reverse(T[], int, int) - Method in class org.amino.alg.sort.DefaultSorter

reverse(List<T>, int, int) - Method in class org.amino.alg.sort.DefaultSorter

reverse(byte[], int, int) - Method in class org.amino.alg.sort.InsertionSorter

reverse(char[], int, int) - Method in class org.amino.alg.sort.InsertionSorter

reverse(short[], int, int) - Method in class org.amino.alg.sort.InsertionSorter

reverse(int[], int, int) - Method in class org.amino.alg.sort.InsertionSorter

reverse(long[], int, int) - Method in class org.amino.alg.sort.InsertionSorter

reverse(float[], int, int) - Method in class org.amino.alg.sort.InsertionSorter

reverse(double[], int, int) - Method in class org.amino.alg.sort.InsertionSorter

reverse(byte[], int, int) - Method in class org.amino.alg.sort.ParallelQuickSorterWorkStealing

reverse(char[], int, int) - Method in class org.amino.alg.sort.ParallelQuickSorterWorkStealing

reverse(short[], int, int) - Method in class org.amino.alg.sort.ParallelQuickSorterWorkStealing

reverse(int[], int, int) - Method in class org.amino.alg.sort.ParallelQuickSorterWorkStealing

reverse(long[], int, int) - Method in class org.amino.alg.sort.ParallelQuickSorterWorkStealing

reverse(float[], int, int) - Method in class org.amino.alg.sort.ParallelQuickSorterWorkStealing

reverse(double[], int, int) - Method in class org.amino.alg.sort.ParallelQuickSorterWorkStealing

reverse(byte[], int, int) - Method in class org.amino.alg.sort.QuickSorter

Sort array using reverse natural (descending) order.

reverse(char[], int, int) - Method in class org.amino.alg.sort.QuickSorter

Sort array using reverse natural (descending) order.

reverse(short[], int, int) - Method in class org.amino.alg.sort.QuickSorter

Sort array using reverse natural (descending) order.

reverse(int[], int, int) - Method in class org.amino.alg.sort.QuickSorter

Sort array using reverse natural (descending) order.

reverse(long[], int, int) - Method in class org.amino.alg.sort.QuickSorter

Sort array using reverse natural (descending) order.

reverse(float[], int, int) - Method in class org.amino.alg.sort.QuickSorter

Sort array using reverse natural (descending) order.

reverse(double[], int, int) - Method in class org.amino.alg.sort.QuickSorter

Sort array using reverse natural (descending) order.

reverse(byte[]) - Method in interface org.amino.alg.sort.Sorter

Sort array using reverse natural (descending) order.

reverse(byte[], int, int) - Method in interface org.amino.alg.sort.Sorter

Sort array using reverse natural (descending) order.

reverse(char[]) - Method in interface org.amino.alg.sort.Sorter

Sort array using reverse natural (descending) order.

reverse(char[], int, int) - Method in interface org.amino.alg.sort.Sorter

Sort array using reverse natural (descending) order.

reverse(short[]) - Method in interface org.amino.alg.sort.Sorter

Sort array using reverse natural (descending) order.

reverse(short[], int, int) - Method in interface org.amino.alg.sort.Sorter

Sort array using reverse natural (descending) order.

reverse(int[]) - Method in interface org.amino.alg.sort.Sorter

Sort array using reverse natural (descending) order.

reverse(int[], int, int) - Method in interface org.amino.alg.sort.Sorter

Sort array using reverse natural (descending) order.

reverse(long[]) - Method in interface org.amino.alg.sort.Sorter

Sort array using reverse natural (descending) order.

reverse(long[], int, int) - Method in interface org.amino.alg.sort.Sorter

Sort array using reverse natural (descending) order.

reverse(float[]) - Method in interface org.amino.alg.sort.Sorter

Sort array using reverse natural (descending) order.

reverse(float[], int, int) - Method in interface org.amino.alg.sort.Sorter

Sort array using reverse natural (descending) order.

reverse(double[]) - Method in interface org.amino.alg.sort.Sorter

Sort array using reverse natural (descending) order.

reverse(double[], int, int) - Method in interface org.amino.alg.sort.Sorter

Sort array using reverse natural (descending) order.

reverse(T[]) - Method in interface org.amino.alg.sort.Sorter

Sort array using reverse natural (descending) order.

reverse(T[], int, int) - Method in interface org.amino.alg.sort.Sorter

Sort array using reverse natural (descending) order.

reverse(List<T>) - Method in interface org.amino.alg.sort.Sorter

Sort List using reverse natural (descending) order.

reverse(List<T>, int, int) - Method in interface org.amino.alg.sort.Sorter

rightSubtreeHeight() - Method in class org.amino.ds.tree.ParallelRBTree

Get height of right subtree.

run(I) - Method in interface org.amino.pattern.internal.Doable

Run the work item.

run(S, WorkQueue<S>) - Method in interface org.amino.pattern.internal.DynamicWorker

run() - Method in class org.amino.scheduler.internal.AbstractScheduler.WorkThread

Runtime - Class in org.amino

Controlling Runtime class for Amino project.

S

scan(int[], int[], BinaryOp<T>) - Method in class org.amino.alg.parallelprefix.AbstractParallelPrefix

Perform a parallel-prefix operation on input array 'array'.

scan(char[], char[], BinaryOp<T>) - Method in class org.amino.alg.parallelprefix.AbstractParallelPrefix

Perform a parallel-prefix operation on input array 'array'.

scan(byte[], byte[], BinaryOp<T>) - Method in class org.amino.alg.parallelprefix.AbstractParallelPrefix

Perform a parallel-prefix operation on input array 'array'.

scan(long[], long[], BinaryOp<T>) - Method in class org.amino.alg.parallelprefix.AbstractParallelPrefix

Perform a parallel-prefix operation on input array 'array'.

scan(float[], float[], BinaryOp<T>) - Method in class org.amino.alg.parallelprefix.AbstractParallelPrefix

Perform a parallel-prefix operation on input array 'array'.

scan(double[], double[], BinaryOp<T>) - Method in class org.amino.alg.parallelprefix.AbstractParallelPrefix

Perform a parallel-prefix operation on input array 'array'.

scan(short[], short[], BinaryOp<T>) - Method in class org.amino.alg.parallelprefix.AbstractParallelPrefix

Perform a parallel-prefix operation on input array 'array'.

scan(T[], T[], BinaryOp<T>) - Method in class org.amino.alg.parallelprefix.AbstractParallelPrefix

Perform a parallel-prefix operation on input array 'array'.

scan(int[], int[], BinaryOp<T>) - Method in interface org.amino.alg.parallelprefix.ParallelPrefix

Perform a parallel-prefix operation on input array 'array'.

scan(char[], char[], BinaryOp<T>) - Method in interface org.amino.alg.parallelprefix.ParallelPrefix

Perform a parallel-prefix operation on input array 'array'.

scan(byte[], byte[], BinaryOp<T>) - Method in interface org.amino.alg.parallelprefix.ParallelPrefix

Perform a parallel-prefix operation on input array 'array'.

scan(short[], short[], BinaryOp<T>) - Method in interface org.amino.alg.parallelprefix.ParallelPrefix

Perform a parallel-prefix operation on input array 'array'.

scan(long[], long[], BinaryOp<T>) - Method in interface org.amino.alg.parallelprefix.ParallelPrefix

Perform a parallel-prefix operation on input array 'array'.

scan(float[], float[], BinaryOp<T>) - Method in interface org.amino.alg.parallelprefix.ParallelPrefix

Perform a parallel-prefix operation on input array 'array'.

scan(double[], double[], BinaryOp<T>) - Method in interface org.amino.alg.parallelprefix.ParallelPrefix

Perform a parallel-prefix operation on input array 'array'.

scan(T[], T[], BinaryOp<T>) - Method in interface org.amino.alg.parallelprefix.ParallelPrefix

Perform a parallel-prefix operation on input array 'array'.

scan(int[], int[], BinaryOp<T>) - Method in class org.amino.alg.parallelprefix.ThreadedParallelPrefix

Perform a parallel-prefix operation on input array 'array'.

scan(float[], float[], BinaryOp<T>) - Method in class org.amino.alg.parallelprefix.ThreadedParallelPrefix

Perform a parallel-prefix operation on input array 'array'.

scan(double[], double[], BinaryOp<T>) - Method in class org.amino.alg.parallelprefix.ThreadedParallelPrefix

Perform a parallel-prefix operation on input array 'array'.

scan(char[], char[], BinaryOp<T>) - Method in class org.amino.alg.parallelprefix.ThreadedParallelPrefix

Perform a parallel-prefix operation on input array 'array'.

scan(byte[], byte[], BinaryOp<T>) - Method in class org.amino.alg.parallelprefix.ThreadedParallelPrefix

Perform a parallel-prefix operation on input array 'array'.

scan(short[], short[], BinaryOp<T>) - Method in class org.amino.alg.parallelprefix.ThreadedParallelPrefix

Perform a parallel-prefix operation on input array 'array'.

scan(long[], long[], BinaryOp<T>) - Method in class org.amino.alg.parallelprefix.ThreadedParallelPrefix

Perform a parallel-prefix operation on input array 'array'.

scan(T[], T[], BinaryOp<T>) - Method in class org.amino.alg.parallelprefix.ThreadedParallelPrefix

Perform a parallel-prefix operation on input array 'array'.

Scanner - Interface in org.amino.alg.scan

Interface for searching byte arrays.

Scheduler - Interface in org.amino.scheduler.internal

A Scheduler provides basic execution facilities across a number of worker threads.

search(E) - Method in class org.amino.ds.tree.ParallelRBTree

Find the key in the tree.

selectPivot(int[], int, int) - Method in class org.amino.alg.sort.QuickSorter

Select a pivot element from the given array section.

selectPivot(byte[], int, int) - Method in class org.amino.alg.sort.QuickSorter

Select a pivot element from the given array section.

selectPivot(char[], int, int) - Method in class org.amino.alg.sort.QuickSorter

Select a pivot element from the given array section.

selectPivot(short[], int, int) - Method in class org.amino.alg.sort.QuickSorter

Select a pivot element from the given array section.

selectPivot(long[], int, int) - Method in class org.amino.alg.sort.QuickSorter

Select a pivot element from the given array section.

selectPivot(float[], int, int) - Method in class org.amino.alg.sort.QuickSorter

Select a pivot element from the given array section.

selectPivot(double[], int, int) - Method in class org.amino.alg.sort.QuickSorter

Select a pivot element from the given array section.

set(int, E) - Method in class org.amino.ds.lockfree.LockFreeList

set(int, E) - Method in class org.amino.ds.lockfree.LockFreeVector

Set the element with index to e.

setManageWorkerThreads(boolean) - Static method in class org.amino.Runtime

Used to determine whether the Amino Runtime controls how many worker threads are active at any one time within Amino packages.

setMaxAvailableWorkerThreads(int) - Static method in class org.amino.Runtime

Set upper limit of threads available to work within Amino packages.

setMinimumArraySize(int) - Method in class org.amino.alg.parallelprefix.ThreadedParallelPrefix

setNumberOfWorkers(int) - Static method in class org.amino.scheduler.internal.AbstractScheduler

setRejectedExecutionHandler(RejectedExecutionHandler) - Method in class org.amino.scheduler.internal.AbstractScheduler

setRejectedExecutionHandler(RejectedExecutionHandler) - Method in interface org.amino.scheduler.internal.Scheduler

Set handler.

setValue(E) - Method in class org.amino.ds.graph.Node

set the value of this node.

setWeight(double) - Method in class org.amino.ds.graph.Edge

set weight of this edge.

shutdown() - Method in class org.amino.ds.tree.ParallelRBTree

Shutdown balancer thread.

shutdown() - Method in interface org.amino.pattern.internal.MasterWorker

Shutdown the master/worker.

shutdown() - Method in class org.amino.scheduler.internal.AbstractScheduler

shutdownNow() - Method in class org.amino.scheduler.internal.AbstractScheduler

signalNewWork() - Method in class org.amino.scheduler.internal.AbstractScheduler

Wakeup waiting workers when new workload arrived.

simpleContentionManager(AdjacentList<E>[]) - Method in class org.amino.ds.graph.AbstractGraph

manage contention of multi-threads in the rush for ownership.

simpleContentionManager(AdjacentList<E>) - Method in class org.amino.ds.graph.AbstractGraph

manage contention of multithreads in the rush for ownership.

size() - Method in class org.amino.ds.graph.AbstractGraph

size() - Method in class org.amino.ds.lockfree.EBDeque

size() - Method in class org.amino.ds.lockfree.LocalDeque

size() - Method in class org.amino.ds.lockfree.LocalSet

size() - Method in class org.amino.ds.lockfree.LockFreeDeque

size() - Method in class org.amino.ds.lockfree.LockFreeDictionary

size() - Method in class org.amino.ds.lockfree.LockFreeList

size() - Method in class org.amino.ds.lockfree.LockFreePriorityQueue

size() - Method in class org.amino.ds.lockfree.LockFreeQueue

size() - Method in class org.amino.ds.lockfree.LockFreeSet

size() - Method in class org.amino.ds.lockfree.LockFreeVector

return size of vector.

sort(byte[]) - Method in class org.amino.alg.sort.AbstractSorter

sort(char[]) - Method in class org.amino.alg.sort.AbstractSorter

sort(short[]) - Method in class org.amino.alg.sort.AbstractSorter

sort(int[]) - Method in class org.amino.alg.sort.AbstractSorter

sort(long[]) - Method in class org.amino.alg.sort.AbstractSorter

sort(float[]) - Method in class org.amino.alg.sort.AbstractSorter

sort(double[]) - Method in class org.amino.alg.sort.AbstractSorter

sort(T[]) - Method in class org.amino.alg.sort.AbstractSorter

sort(T[], Comparator<T>) - Method in class org.amino.alg.sort.AbstractSorter

sort(List<T>) - Method in class org.amino.alg.sort.AbstractSorter

sort(List<T>, Comparator<T>) - Method in class org.amino.alg.sort.AbstractSorter

sort(byte[], int, int) - Method in class org.amino.alg.sort.DefaultSorter

sort(char[], int, int) - Method in class org.amino.alg.sort.DefaultSorter

sort(short[], int, int) - Method in class org.amino.alg.sort.DefaultSorter

sort(int[], int, int) - Method in class org.amino.alg.sort.DefaultSorter

sort(long[], int, int) - Method in class org.amino.alg.sort.DefaultSorter

sort(float[], int, int) - Method in class org.amino.alg.sort.DefaultSorter

sort(double[], int, int) - Method in class org.amino.alg.sort.DefaultSorter

sort(T[], int, int) - Method in class org.amino.alg.sort.DefaultSorter

sort(T[], int, int, Comparator<T>) - Method in class org.amino.alg.sort.DefaultSorter

sort(List<T>, int, int) - Method in class org.amino.alg.sort.DefaultSorter

sort(List<T>, int, int, Comparator<T>) - Method in class org.amino.alg.sort.DefaultSorter

sort(List<T>) - Method in class org.amino.alg.sort.DefaultSorter

sort(List<T>, Comparator<T>) - Method in class org.amino.alg.sort.DefaultSorter

sort(byte[], int, int) - Method in class org.amino.alg.sort.InsertionSorter

sort(char[], int, int) - Method in class org.amino.alg.sort.InsertionSorter

sort(short[], int, int) - Method in class org.amino.alg.sort.InsertionSorter

sort(int[], int, int) - Method in class org.amino.alg.sort.InsertionSorter

sort(long[], int, int) - Method in class org.amino.alg.sort.InsertionSorter

sort(float[], int, int) - Method in class org.amino.alg.sort.InsertionSorter

sort(double[], int, int) - Method in class org.amino.alg.sort.InsertionSorter

sort(byte[], int, int) - Method in class org.amino.alg.sort.ParallelQuickSorterWorkStealing

sort(char[], int, int) - Method in class org.amino.alg.sort.ParallelQuickSorterWorkStealing

sort(short[], int, int) - Method in class org.amino.alg.sort.ParallelQuickSorterWorkStealing

sort(int[], int, int) - Method in class org.amino.alg.sort.ParallelQuickSorterWorkStealing

sort(long[], int, int) - Method in class org.amino.alg.sort.ParallelQuickSorterWorkStealing

sort(float[], int, int) - Method in class org.amino.alg.sort.ParallelQuickSorterWorkStealing

sort(double[], int, int) - Method in class org.amino.alg.sort.ParallelQuickSorterWorkStealing

sort(byte[], int, int) - Method in class org.amino.alg.sort.QuickSorter

sort(char[], int, int) - Method in class org.amino.alg.sort.QuickSorter

sort(short[], int, int) - Method in class org.amino.alg.sort.QuickSorter

sort(int[], int, int) - Method in class org.amino.alg.sort.QuickSorter

sort(long[], int, int) - Method in class org.amino.alg.sort.QuickSorter

sort(float[], int, int) - Method in class org.amino.alg.sort.QuickSorter

sort(double[], int, int) - Method in class org.amino.alg.sort.QuickSorter

sort(byte[]) - Method in interface org.amino.alg.sort.Sorter

sort(byte[], int, int) - Method in interface org.amino.alg.sort.Sorter

sort(char[]) - Method in interface org.amino.alg.sort.Sorter

sort(char[], int, int) - Method in interface org.amino.alg.sort.Sorter

sort(short[]) - Method in interface org.amino.alg.sort.Sorter

sort(short[], int, int) - Method in interface org.amino.alg.sort.Sorter

sort(int[]) - Method in interface org.amino.alg.sort.Sorter

sort(int[], int, int) - Method in interface org.amino.alg.sort.Sorter

sort(long[]) - Method in interface org.amino.alg.sort.Sorter

sort(long[], int, int) - Method in interface org.amino.alg.sort.Sorter

sort(float[]) - Method in interface org.amino.alg.sort.Sorter

sort(float[], int, int) - Method in interface org.amino.alg.sort.Sorter

sort(double[]) - Method in interface org.amino.alg.sort.Sorter

sort(double[], int, int) - Method in interface org.amino.alg.sort.Sorter

sort(T[]) - Method in interface org.amino.alg.sort.Sorter

sort(T[], int, int) - Method in interface org.amino.alg.sort.Sorter

sort(T[], Comparator<T>) - Method in interface org.amino.alg.sort.Sorter

sort(T[], int, int, Comparator<T>) - Method in interface org.amino.alg.sort.Sorter

sort(List<T>) - Method in interface org.amino.alg.sort.Sorter

sort(List<T>, int, int) - Method in interface org.amino.alg.sort.Sorter

sort(List<T>, Comparator<T>) - Method in interface org.amino.alg.sort.Sorter

sort(List<T>, int, int, Comparator<T>) - Method in interface org.amino.alg.sort.Sorter

Sorter - Interface in org.amino.alg.sort

Interface Sorter

sortp(int[], int[], int, int) - Method in class org.amino.alg.sort.DefaultSorter

sortp(int[], int[], int, int) - Method in interface org.amino.alg.sort.Sorter

Sort array and return a permuted index vector.

startWorkers() - Method in class org.amino.scheduler.internal.AbstractScheduler

start to execute all workers.

subList(int, int) - Method in class org.amino.ds.lockfree.LockFreeList

submit(S) - Method in interface org.amino.pattern.internal.MasterWorker

Submit a work item for processing.

submit(S, long, TimeUnit) - Method in interface org.amino.pattern.internal.MasterWorker

Submit a work item for processing and block until it is either submitted successfully or the specified timeout period has expired.

submit(S) - Method in interface org.amino.pattern.internal.WorkQueue

Submit a work item to the work queue.

submit(S, long, TimeUnit) - Method in interface org.amino.pattern.internal.WorkQueue

Submit a work item to the work queue.

swap(byte[], int, int) - Static method in class org.amino.alg.sort.AbstractSorter

swap two specified positions in the array.

swap(char[], int, int) - Static method in class org.amino.alg.sort.AbstractSorter

swap two specified positions in the array.

swap(short[], int, int) - Static method in class org.amino.alg.sort.AbstractSorter

swap two specified positions in the array.

swap(int[], int, int) - Static method in class org.amino.alg.sort.AbstractSorter

swap two specified positions in the array.

swap(long[], int, int) - Static method in class org.amino.alg.sort.AbstractSorter

swap two specified positions in the array.

swap(float[], int, int) - Static method in class org.amino.alg.sort.AbstractSorter

swap two specified positions in the array.

swap(double[], int, int) - Static method in class org.amino.alg.sort.AbstractSorter

swap two specified positions in the array.

swap(T[], int, int) - Static method in class org.amino.alg.sort.AbstractSorter

swap two specified positions in the array.

swapIfGreater(byte[], int, int) - Static method in class org.amino.alg.sort.AbstractSorter

swap two specified positions in the array, if the first value is greater than the second one.

swapIfGreater(char[], int, int) - Static method in class org.amino.alg.sort.AbstractSorter

swap two specified positions in the array, if the first value is greater than the second one.

swapIfGreater(short[], int, int) - Static method in class org.amino.alg.sort.AbstractSorter

swap two specified positions in the array, if the first value is greater than the second one.

swapIfGreater(int[], int, int) - Static method in class org.amino.alg.sort.AbstractSorter

swap two specified positions in the array, if the first value is greater than the second one.

swapIfGreater(long[], int, int) - Static method in class org.amino.alg.sort.AbstractSorter

swap two specified positions in the array, if the first value is greater than the second one.

swapIfGreater(float[], int, int) - Static method in class org.amino.alg.sort.AbstractSorter

swap two specified positions in the array, if the first value is greater than the second one.

swapIfGreater(double[], int, int) - Static method in class org.amino.alg.sort.AbstractSorter

swap two specified positions in the array, if the first value is greater than the second one.

swapIfGreater(T[], int, int) - Static method in class org.amino.alg.sort.AbstractSorter

swap two specified positions in the array, if the first value is greater than the second one.

swapIfLess(byte[], int, int) - Static method in class org.amino.alg.sort.AbstractSorter

swap two specified positions in the array, if the first value is less than the second one.

swapIfLess(char[], int, int) - Static method in class org.amino.alg.sort.AbstractSorter

swap two specified positions in the array, if the first value is less than the second one.

swapIfLess(short[], int, int) - Static method in class org.amino.alg.sort.AbstractSorter

swap two specified positions in the array, if the first value is less than the second one.

swapIfLess(int[], int, int) - Static method in class org.amino.alg.sort.AbstractSorter

swap two specified positions in the array, if the first value is less than the second one.

swapIfLess(long[], int, int) - Static method in class org.amino.alg.sort.AbstractSorter

swap two specified positions in the array, if the first value is less than the second one.

swapIfLess(float[], int, int) - Static method in class org.amino.alg.sort.AbstractSorter

swap two specified positions in the array, if the first value is less than the second one.

swapIfLess(double[], int, int) - Static method in class org.amino.alg.sort.AbstractSorter

swap two specified positions in the array, if the first value is less than the second one.

swapIfLess(T[], int, int) - Static method in class org.amino.alg.sort.AbstractSorter

swap two specified positions in the array, if the first value is less than the second one.

T

ThreadedParallelPrefix<T> - Class in org.amino.alg.parallelprefix

Threaded implementation of parallel-prefix operation.

ThreadedParallelPrefix(int) - Constructor for class org.amino.alg.parallelprefix.ThreadedParallelPrefix

ThreadedParallelPrefix() - Constructor for class org.amino.alg.parallelprefix.ThreadedParallelPrefix

Set number of worker threads to the number of availableProcessors.

ThreadedParallelPrefix.PartialReduction - Class in org.amino.alg.parallelprefix

Class for performing partial reductions for Parallel-prefix operations across a pool of threads.

ThreadedParallelPrefix.PartialReduction(int) - Constructor for class org.amino.alg.parallelprefix.ThreadedParallelPrefix.PartialReduction

toArray() - Method in class org.amino.ds.graph.AbstractGraph

toArray(E[]) - Method in class org.amino.ds.graph.AbstractGraph

toArray() - Method in class org.amino.ds.lockfree.LocalSet

This method puts all elements of set into an array and returns it.

toArray(T[]) - Method in class org.amino.ds.lockfree.LocalSet

toArray() - Method in class org.amino.ds.lockfree.LockFreeList

toArray(T[]) - Method in class org.amino.ds.lockfree.LockFreeList

toArray() - Method in class org.amino.ds.lockfree.LockFreeSet

This method puts all elements of set into an array and returns it.

toArray(T[]) - Method in class org.amino.ds.lockfree.LockFreeSet

toString() - Method in class org.amino.ds.graph.AdjacentNode

toString() - Method in class org.amino.ds.graph.Node

toString() - Method in class org.amino.ds.tree.ParallelRBTree.Node

transform(byte, byte) - Method in interface org.amino.alg.parallelprefix.BinaryOp

Transform two bytes to one.

transform(char, char) - Method in interface org.amino.alg.parallelprefix.BinaryOp

Transform two bytes to one.

transform(short, short) - Method in interface org.amino.alg.parallelprefix.BinaryOp

Transform two bytes to one.

transform(int, int) - Method in interface org.amino.alg.parallelprefix.BinaryOp

Transform two bytes to one.

transform(long, long) - Method in interface org.amino.alg.parallelprefix.BinaryOp

Transform two bytes to one.

transform(float, float) - Method in interface org.amino.alg.parallelprefix.BinaryOp

Transform two bytes to one.

transform(double, double) - Method in interface org.amino.alg.parallelprefix.BinaryOp

Transform two bytes to one.

transform(T, T) - Method in interface org.amino.alg.parallelprefix.BinaryOp

Transform two bytes to one.

transform(byte, byte) - Method in class org.amino.alg.parallelprefix.DefaultAddBinaryOp

Transform two bytes to one.

transform(char, char) - Method in class org.amino.alg.parallelprefix.DefaultAddBinaryOp

Transform two bytes to one.

transform(short, short) - Method in class org.amino.alg.parallelprefix.DefaultAddBinaryOp

Transform two bytes to one.

transform(int, int) - Method in class org.amino.alg.parallelprefix.DefaultAddBinaryOp

Transform two bytes to one.

transform(long, long) - Method in class org.amino.alg.parallelprefix.DefaultAddBinaryOp

Transform two bytes to one.

transform(float, float) - Method in class org.amino.alg.parallelprefix.DefaultAddBinaryOp

Transform two bytes to one.

transform(double, double) - Method in class org.amino.alg.parallelprefix.DefaultAddBinaryOp

Transform two bytes to one.

transform(T, T) - Method in class org.amino.alg.parallelprefix.DefaultAddBinaryOp

Transform two bytes to one.

tryAdd(Object, int) - Method in class org.amino.utility.AdaptEliminationArray

Try to add element without touching the central data structure.

tryAdd(Object, int) - Method in class org.amino.utility.EliminationArray

Try to add element without touching the central data structure.

tryAdd(Object, int) - Method in interface org.amino.utility.IEliminationArray

Try to add element without touching the central data structure.

tryRemove(int) - Method in class org.amino.utility.AdaptEliminationArray

Try to remove element without touching central data structure.

tryRemove(int) - Method in class org.amino.utility.EliminationArray

Try to remove element without touching central data structure.

tryRemove(int) - Method in interface org.amino.utility.IEliminationArray

Try to remove element without touching central data structure.

U

UndirectedGraph<E> - Class in org.amino.ds.graph

Undirected graph.

UndirectedGraph() - Constructor for class org.amino.ds.graph.UndirectedGraph

update(T, V) - Method in class org.amino.mcas.LockFreeBSTree

update value with key in the tree.

V

valueOf(String) - Static method in enum org.amino.utility.ParallelType

Returns the enum constant of this type with the specified name.

values() - Method in class org.amino.ds.lockfree.LockFreeDictionary

values() - Static method in enum org.amino.utility.ParallelType

Returns an array containing the constants of this enum type, in the order they are declared.

verifyRBTreeHeight() - Method in class org.amino.ds.tree.ParallelRBTree

Verify the height of the tree conform to the rule of red-black tree.

W

waitForCompletion(long, TimeUnit) - Method in interface org.amino.pattern.internal.MasterWorker

Wait until all workers have completed or the specified timeout period expires.

waitForCompletion() - Method in interface org.amino.pattern.internal.MasterWorker

Wait until all workers have completed.

waitNewWork(int) - Method in class org.amino.scheduler.internal.AbstractScheduler

Wait for new workload.

WorkQueue<S> - Interface in org.amino.pattern.internal

Classes for queuing work items..

WorkStealingScheduler - Class in org.amino.scheduler.internal

Classes for a work stealing scheduler.

WorkStealingScheduler() - Constructor for class org.amino.scheduler.internal.WorkStealingScheduler

WorkStealingScheduler(int) - Constructor for class org.amino.scheduler.internal.WorkStealingScheduler

WorkStealingScheduler(int, boolean) - Constructor for class org.amino.scheduler.internal.WorkStealingScheduler

A B C D E F G H I K L M N O P Q R S T U V W