flatgraph-core
API
Generated with
flatgraph-core/flatgraph/Accessors

Accessors

flatgraph.Accessors
object Accessors

Attributes

Graph
Supertypes
class Object
trait Matchable
class Any
Self type
Accessors.type

Members list

Type members

Classlikes

class EdgeView(neighbors: Array[GNode], base: GNode, properties: Any, inout: Byte, edgeKind: Short, start: Int, end: Int) extends IndexedSeq[Edge]

Attributes

Supertypes
trait IndexedSeq[Edge]
trait IndexedSeqOps[Edge, IndexedSeq, IndexedSeq[Edge]]
trait IndexedSeq[Edge]
trait IndexedSeqOps[Edge, IndexedSeq, IndexedSeq[Edge]]
trait Seq[Edge]
trait SeqOps[Edge, IndexedSeq, IndexedSeq[Edge]]
trait Seq[Edge]
trait Equals
trait SeqOps[Edge, IndexedSeq, IndexedSeq[Edge]]
trait PartialFunction[Int, Edge]
trait Int => Edge
trait Iterable[Edge]
trait Iterable[Edge]
trait IterableFactoryDefaults[Edge, IndexedSeq]
trait IterableOps[Edge, IndexedSeq, IndexedSeq[Edge]]
trait IterableOnceOps[Edge, IndexedSeq, IndexedSeq[Edge]]
trait IterableOnce[Edge]
class Object
trait Matchable
class Any
Show all

Value members

Concrete methods

def _getNodeProperties(node: GNode): IterableOnce[(Int, IndexedSeq[Any])]
def getEdgesIn(node: GNode, edgeKind: Int): IndexedSeq[Edge]
def getEdgesIn(node: GNode): IndexedSeq[Edge]
def getEdgesOut(node: GNode, edgeKind: Int): IndexedSeq[Edge]
def getEdgesOut(node: GNode): IndexedSeq[Edge]
def getInverseIndex(graph: Graph, nodeKind: Int, propertyKind: Int): MultiDictIndex[GNode]
def getNeighborsIn(node: GNode, edgeKind: Int): Iterator[GNode]
def getNeighborsIn(node: GNode): Iterator[GNode]

follow all IN edges to their adjacent nodes

follow all IN edges to their adjacent nodes

Attributes

def getNeighborsIn(g: Graph, nodeKind: Short, seq: Int, edgeKind: Int): Iterator[GNode]
def getNeighborsIn(g: Graph, nodeKind: Short, seq: Int): Iterator[GNode]

follow all IN edges to their adjacent nodes

follow all IN edges to their adjacent nodes

Attributes

def getNeighborsOut(node: GNode, edgeKind: Int): Iterator[GNode]
def getNeighborsOut(node: GNode): Iterator[GNode]

follow all OUT edges to their adjacent nodes

follow all OUT edges to their adjacent nodes

Attributes

def getNeighborsOut(graph: Graph, nodeKind: Int, seq: Int, edgeKind: Int): Iterator[GNode]
def getNeighborsOut(g: Graph, nodeKind: Short, seq: Int): Iterator[GNode]

follow all OUT edges to their adjacent nodes

follow all OUT edges to their adjacent nodes

Attributes

def getNodeProperties(node: GNode): IterableOnce[(String, IndexedSeq[Any])]
def getNodeProperty(node: GNode, propertyKind: Int): IndexedSeq[Any]
def getNodeProperty(graph: Graph, nodeKind: Int, propertyKind: Int, seq: Int): ISeq[Any]
def getNodePropertyMulti[T](graph: Graph, nodeKind: Int, propertyKind: Int, seq: Int): ISeq[T]
def getNodePropertyOption[T](graph: Graph, nodeKind: Int, propertyKind: Int, seq: Int): Option[T]
def getNodePropertyOptionCompat(node: GNode, propertyKind: Int): Option[Object]
def getNodePropertySingle[T](graph: Graph, nodeKind: Int, propertyKind: Int, seq: Int, default: T): T
def getWithInverseIndex(graph: Graph, nodeKind: Int, propertyKind: Int, value: String): Iterator[GNode]
Generated with