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 _elementDataSize(): Int

   just for unit test

   just for unit test

   Attributes

   protected[util]

5.  def add(node: Node): Unit

   store Node in internal collections

6.  final def asInstanceOf[T0]: T0

   Definition Classes

   Any

7.  def cardinality(label: String): Int

   cardinality of nodes for given label

8.  def clone(): AnyRef

   Attributes

   protected[lang]

   Definition Classes

   AnyRef

   Annotations

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

9.  def contains(id: Long): Boolean
10.  final def eq(arg0: AnyRef): Boolean

    Definition Classes

    AnyRef

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

    Definition Classes

    AnyRef → Any

12.  def finalize(): Unit

    Attributes

    protected[lang]

    Definition Classes

    AnyRef

    Annotations

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

13.  final def getClass(): Class[_ <: AnyRef]

    Definition Classes

    AnyRef → Any

    Annotations

    @native()

14.  def hashCode(): Int

    Definition Classes

    AnyRef → Any

    Annotations

    @native()

15.  final def isInstanceOf[T0]: Boolean

    Definition Classes

    Any

16.  def iterator(): Iterator[Node]
17.  final def ne(arg0: AnyRef): Boolean

    Definition Classes

    AnyRef

18.  def nodeById(id: Long): Node
19.  def nodeLabels(): Set[String]
20.  def nodesByLabel(label: String): ArrayList[Node]
21.  final def notify(): Unit

    Definition Classes

    AnyRef

    Annotations

    @native()

22.  final def notifyAll(): Unit

    Definition Classes

    AnyRef

    Annotations

    @native()

23.  def persistAll(nodesWriter: NodesWriter): Unit
24.  def remove(node: Node): Unit
25.  def size(): Int

    We drop the entire nodesByLabel index and will rebuild it on the next index lookup...

    We drop the entire nodesByLabel index and will rebuild it on the next index lookup... Context: we don't know the exact position of this node in the nodesByLabel index, and searching it is O(n). We considered using a separate TLongIntMap for the Id->Index mapping, but that would consume 12-20b per node

26.  final def synchronized[T0](arg0: => T0): T0

    Definition Classes

    AnyRef

27.  def toString(): String

    Definition Classes

    AnyRef → Any

28.  final def wait(): Unit

    Definition Classes

    AnyRef

    Annotations

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

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

    Definition Classes

    AnyRef

    Annotations

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

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

    Definition Classes

    AnyRef

    Annotations

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