de.grogra.xl.impl.base
public abstract class GraphQueue extends HierarchicalQueue implements Queue, java.util.concurrent.Executor
| Modifier and Type | Class and Description |
|---|---|
static class |
GraphQueue.AddEdgeDescriptor |
static class |
GraphQueue.AddNodeDescriptor |
static class |
GraphQueue.AddUndirectedEdgeDescriptor |
static class |
GraphQueue.ConnectDescriptor |
static class |
GraphQueue.DeleteEdgeDescriptor |
static class |
GraphQueue.DeleteNodeDescriptor |
static class |
GraphQueue.ExecuteDescriptor |
protected class |
GraphQueue.Processor |
HierarchicalQueue.Cursor, HierarchicalQueue.Data, HierarchicalQueue.Reader| Modifier and Type | Field and Description |
|---|---|
static GraphQueue.AddEdgeDescriptor |
ADD_EDGE_DESCRIPTOR |
static GraphQueue.AddNodeDescriptor |
ADD_NODE_DESCRIPTOR |
static GraphQueue.AddUndirectedEdgeDescriptor |
ADD_UNDIRECTED_EDGE_DESCRIPTOR |
static GraphQueue.ConnectDescriptor |
CONNECT_DESCRIPTOR |
static GraphQueue.DeleteEdgeDescriptor |
DELETE_EDGE_DESCRIPTOR |
static GraphQueue.DeleteNodeDescriptor |
DELETE_NODE_DESCRIPTOR |
static GraphQueue.ExecuteDescriptor |
EXECUTE_DESCRIPTOR |
static QueueDescriptor |
FIRST_QUEUE |
static QueueDescriptor |
LAST_QUEUE |
BEGIN_LEVEL, IS_FINISHED, ITEM_AND_BITS_MASK, ITEM_MASK, MAX_UNUSED_BIT, MIN_UNUSED_BIT, MIN_UNUSED_ITEM, NEXT_EXISTS, out| Constructor and Description |
|---|
GraphQueue(QueueDescriptor<?> descr,
boolean usesObjectQueue,
boolean createBackLinks) |
| Modifier and Type | Method and Description |
|---|---|
abstract void |
addEdgeBits(java.lang.Object source,
java.lang.Object target,
int edges) |
abstract void |
addNode(java.lang.Object node) |
abstract void |
addUndirectedEdgeBits(java.lang.Object source,
java.lang.Object target,
int edges) |
void |
clear()
Clears the queue.
|
protected void |
clearSegmentsToExcludeImpl(int[] segs) |
abstract <N,P> void |
connect(N source,
N target,
P param,
Connector<N,P> redirector) |
abstract void |
connectAdjacent(java.lang.Object start,
java.lang.Object end,
int edges) |
abstract <N> void |
connectIncoming(N source,
N target,
Operator<N> operator) |
abstract <N> void |
connectOutgoing(N source,
N target,
Operator<N> operator) |
abstract void |
copyIncoming(java.lang.Object source,
java.lang.Object target,
int edges) |
abstract void |
copyIncoming(java.lang.Object source,
java.lang.Object target,
int edges,
int copyMask,
int addMask) |
abstract void |
copyOutgoing(java.lang.Object source,
java.lang.Object target,
int edges) |
abstract void |
copyOutgoing(java.lang.Object source,
java.lang.Object target,
int edges,
int copyMask,
int addMask) |
protected abstract GraphQueue.Processor |
createProcessor() |
abstract void |
deleteCurrentEdges(java.lang.Object node,
int edges,
boolean outgoing) |
abstract void |
deleteEdgeBits(java.lang.Object source,
java.lang.Object target,
int edges) |
abstract void |
deleteNode(java.lang.Object node) |
abstract void |
embedInterpretive(java.lang.Object interpreted,
java.lang.Object start,
java.lang.Object end) |
QueueDescriptor<?> |
getDescriptor()
Returns the descriptor which was used to create this queue.
|
protected abstract RuntimeModel |
getModel() |
void |
markSegment(int n) |
abstract void |
moveIncoming(java.lang.Object source,
java.lang.Object target,
int edges) |
abstract void |
moveOutgoing(java.lang.Object source,
java.lang.Object target,
int edges) |
boolean |
process(int[] segments)
Processes all queued tasks.
|
void |
resetToSegment(int n) |
beginLevel, beginSkipBlock, cloneData, createData, discardLevel, endLevel, endSkipBlock, getCursor, getData, hasItems, hasItemsInCurrentLevel, moveTo, restore, setItemSize, writeItem, writeObject, writeObjectInStreamclose, dump, flush, write, write, write, writeBoolean, writeByte, writeBytes, writeChar, writeChars, writeDouble, writeFloat, writeInt, writeLong, writeObjectInQueue, writeShort, writeUTFclone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, waitclearSegmentsToExcludepublic static final GraphQueue.AddEdgeDescriptor ADD_EDGE_DESCRIPTOR
public static final GraphQueue.AddNodeDescriptor ADD_NODE_DESCRIPTOR
public static final GraphQueue.AddUndirectedEdgeDescriptor ADD_UNDIRECTED_EDGE_DESCRIPTOR
public static final GraphQueue.ConnectDescriptor CONNECT_DESCRIPTOR
public static final GraphQueue.DeleteEdgeDescriptor DELETE_EDGE_DESCRIPTOR
public static final GraphQueue.DeleteNodeDescriptor DELETE_NODE_DESCRIPTOR
public static final GraphQueue.ExecuteDescriptor EXECUTE_DESCRIPTOR
public static final QueueDescriptor FIRST_QUEUE
public static final QueueDescriptor LAST_QUEUE
public GraphQueue(QueueDescriptor<?> descr, boolean usesObjectQueue, boolean createBackLinks)
public abstract void addEdgeBits(java.lang.Object source,
java.lang.Object target,
int edges)
public abstract void addNode(java.lang.Object node)
public abstract void addUndirectedEdgeBits(java.lang.Object source,
java.lang.Object target,
int edges)
public void clear()
QueueQueueCollection
in order to reuse the queue for a new transformation step.clear in interface Queueclear in class HierarchicalQueueprotected void clearSegmentsToExcludeImpl(int[] segs)
public abstract <N,P> void connect(N source,
N target,
P param,
Connector<N,P> redirector)
public abstract void connectAdjacent(java.lang.Object start,
java.lang.Object end,
int edges)
public abstract <N> void connectIncoming(N source,
N target,
Operator<N> operator)
public abstract <N> void connectOutgoing(N source,
N target,
Operator<N> operator)
public abstract void copyIncoming(java.lang.Object source,
java.lang.Object target,
int edges)
public abstract void copyIncoming(java.lang.Object source,
java.lang.Object target,
int edges,
int copyMask,
int addMask)
public abstract void copyOutgoing(java.lang.Object source,
java.lang.Object target,
int edges)
public abstract void copyOutgoing(java.lang.Object source,
java.lang.Object target,
int edges,
int copyMask,
int addMask)
protected abstract GraphQueue.Processor createProcessor()
public abstract void deleteCurrentEdges(java.lang.Object node,
int edges,
boolean outgoing)
public abstract void deleteEdgeBits(java.lang.Object source,
java.lang.Object target,
int edges)
public abstract void deleteNode(java.lang.Object node)
public abstract void embedInterpretive(java.lang.Object interpreted,
java.lang.Object start,
java.lang.Object end)
public QueueDescriptor<?> getDescriptor()
QueuegetDescriptor in interface QueueQueueCollection.getQueue(QueueDescriptor),
QueueDescriptor.createQueue(QueueCollection)protected abstract RuntimeModel getModel()
public void markSegment(int n)
markSegment in interface Queuepublic abstract void moveIncoming(java.lang.Object source,
java.lang.Object target,
int edges)
public abstract void moveOutgoing(java.lang.Object source,
java.lang.Object target,
int edges)
public boolean process(int[] segments)
throws RuntimeModelException
QueueQueueCollection.process(int[]).process in interface Queuetrue iff the execution of tasks resulted
in modifications to the GraphRuntimeModelException - if some error occurs during executionpublic void resetToSegment(int n)
resetToSegment in interface Queue