Value Members

1.  final def !=(arg0: Any): Boolean

   Definition Classes

   AnyRef → Any

2.  final def ##: Int

   Definition Classes

   AnyRef → Any

3.  final def ==(arg0: Any): Boolean

   Definition Classes

   AnyRef → Any

4.  def E(): Iterator[Edge]

   Iterator over all edges - alias for edges

5.  def V(ids: <repeated...>[Long]): Iterator[Node]

   Iterator over nodes with provided ids - alias for nodes(ids...) note: does not return any nodes if no ids are provided

6.  def V(): Iterator[Node]

   Iterator over all nodes - alias for nodes

7.  def addNode(id: Long, label: String, keyValues: <repeated...>[AnyRef]): Node

   Add a node with given id, label and properties.

   Add a node with given id, label and properties. Throws an IllegalArgumentException if a node with the given ID already exists

8.  def addNode(label: String, keyValues: <repeated...>[AnyRef]): Node

   Add a node with given label and properties Will automatically assign an ID - this is the safest option to avoid ID clashes.

9.  def applyBackpressureMaybe(): Unit

   When we're running low on heap memory we'll serialize some elements to disk.

   When we're running low on heap memory we'll serialize some elements to disk. To ensure we're not creating new ones faster than old ones are serialized away, we're applying some backpressure to those newly created ones.

10.  final def asInstanceOf[T0]: T0

    Definition Classes

    Any

11.  def clone(): AnyRef

    Attributes

    protected[lang]

    Definition Classes

    AnyRef

    Annotations

    @throws(classOf[java.lang.CloneNotSupportedException]) @native()

12.  def close(): Unit

    If the config.graphLocation is set, data in the graph is persisted to that location.

    If the config.graphLocation is set, data in the graph is persisted to that location.

    If called from multiple threads concurrently, only one starts the shutdown process, but the other one will still be blocked. This is intentional: we also want the second caller to block until close is completed, and not falsely assume that it has finished, only because it exits straight away.

    Definition Classes

    Graph → AutoCloseable

    Annotations

    @Override()

13.  def copyTo(destination: Graph): Unit

    Copies all nodes/edges into the given empty graph, preserving their ids and properties.

14.  def createDetached(label: String): DetachedNodeData
15.  def edgeCount(): Int

    calculates the number of edges in the graph Note: this is an expensive operation, because edges are stored as part of the nodes

16.  def edgeCountByLabel(): Map[String, Integer]

    number of edges grouped by label

17.  def edges(label: String): Iterator[Edge]

    Iterator over edges with given label

18.  def edges(): Iterator[Edge]

    Iterator over all edges

19.  final def eq(arg0: AnyRef): Boolean

    Definition Classes

    AnyRef

20.  def equals(arg0: AnyRef): Boolean

    Definition Classes

    AnyRef → Any

21.  def finalize(): Unit

    Attributes

    protected[lang]

    Definition Classes

    AnyRef

    Annotations

    @throws(classOf[java.lang.Throwable])

22.  def getAllLibraryVersions(): ArrayList[Map[String, String]]
23.  final def getClass(): Class[_ <: AnyRef]

    Definition Classes

    AnyRef → Any

    Annotations

    @native()

24.  def getStorage(): OdbStorage
25.  def getStringInterner(): StringInterner
26.  def hashCode(): Int

    Definition Classes

    AnyRef → Any

    Annotations

    @native()

27.  def isClosed(): Boolean
28.  final def isInstanceOf[T0]: Boolean

    Definition Classes

    Any

29.  final def ne(arg0: AnyRef): Boolean

    Definition Classes

    AnyRef

30.  def node(id: Long): Node

    return node with given id, or null if there is no such node

31.  def nodeCount(label: String): Int

    number of nodes for given label

32.  def nodeCount(): Int

    overall number of nodes

33.  def nodeCountByLabel(): Map[String, Integer]

    number of nodes grouped by label

34.  def nodes(labelPredicate: Predicate[String]): Iterator[Node]
35.  def nodes(labels: Set[String]): Iterator[Node]
36.  def nodes(labels: <repeated...>[String]): Iterator[Node]
37.  def nodes(label: String): Iterator[Node]
38.  def nodes(ids: <repeated...>[Long]): Iterator[Node]

    Iterator over nodes with provided ids empty, if no ids are provided

39.  final def nodes(): Iterator[Node]

    Iterator over all nodes

40.  final def notify(): Unit

    Definition Classes

    AnyRef

    Annotations

    @native()

41.  final def notifyAll(): Unit

    Definition Classes

    AnyRef

    Annotations

    @native()

42.  def persistLibraryVersion(name: String, version: String): Unit
43.  def registerNodeRef(ref: NodeRef): Unit
44.  def remove(node: Node): Unit
45.  final def synchronized[T0](arg0: => T0): T0

    Definition Classes

    AnyRef

46.  def toString(): String

    Definition Classes

    Graph → AnyRef → Any

    Annotations

    @Override()

47.  final def wait(): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws(classOf[java.lang.InterruptedException])

48.  final def wait(arg0: Long, arg1: Int): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws(classOf[java.lang.InterruptedException])

49.  final def wait(arg0: Long): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws(classOf[java.lang.InterruptedException]) @native()