de.grogra.xl.impl.base

Interface Summary
Interface	Description
Connector<N,P>	A `Connector` is used to specify a connection of a new node with a graph at a position which is given by an existing node in the graph.
Operator<N>

Class Summary
Class	Description
CompiletimeModel
ConnectionTransformation
EdgeData
EdgeIterator	An `EdgeIterator` is used to iterate over the edges of a node.
FieldListPattern
FirstLastScale	This class contains the first and last nodes of a produced graph at a particular scale.
Graph	This class is an abstract base class for implementations of XL's runtime model for graph-like structures.
Graph.ThreadData
GraphImpl
GraphQueue
GraphQueue.AddEdgeDescriptor
GraphQueue.AddNodeDescriptor
GraphQueue.AddUndirectedEdgeDescriptor
GraphQueue.ConnectDescriptor
GraphQueue.DeleteEdgeDescriptor
GraphQueue.DeleteNodeDescriptor
GraphQueue.ExecuteDescriptor
GraphQueueImpl
Neighbors<N>
NodeEdgePair<N>
Producer	This class is an abstract base implementation of `Producer`.
QStateMultiScale	This class contains the state information of a query pertaining to multiple scales.
RuntimeModel

Package de.grogra.xl.impl.base Description

Abstract base implementation of XL's compile-time and run-time models for graphs with objects as nodes and int-coded, directed edges.

Package Specification

This package contains a collection of classes that can be used as base classes for an implementation of XL's CompiletimeModel and RuntimeModel. These classes are suitable for data sources that can be represented as graphs with objects as nodes and int-coded, directed edges:

Each node of the graph is an instance of a common base class for nodes. This base class is returned by CompiletimeModel.getNodeType() and RuntimeModel.getNodeType().
An ordered tuple of nodes may be connected by at most one edge that is labeled by an int-value. This int-value is interpreted as a set of sub-edges in the following way:
- The bits 0 to 7 (masked by RuntimeModel.SPECIAL_MASK) represent the edge's special sub-edge. If these bits, interpreted as a byte, have the value 0, no special sub-edge is present. Otherwise, the special sub-edge identified by this byte is present in this edge. Because the value 255 (all bits set) is used as a wildcard mask in pattern matching, that value should not be used as a special sub-edge identifier. Note that at most one special edge may exist at a time between the nodes of an ordered tuple.
- The other 24 bits (bits 8 to 31) represent 24 possible standard sub-edges. E.g., branch and successor edges are encoded by the bit masks RuntimeModel.BRANCH_EDGE and RuntimeModel.SUCCESSOR_EDGE. Implementations may define further types of sub-edges by further bit masks. Thus, at most 24 different standard sub-edges may exist independently between the nodes of an ordered tuple.