Class/Object

org.clulab.struct

DirectedGraphIndex

Related Docs: object DirectedGraphIndex | package struct

Permalink

class DirectedGraphIndex[E] extends AnyRef

An inverted index of the DirectedGraph, so we can efficiently implement enhanced dependencies User: mihais Date: 8/2/17

Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. DirectedGraphIndex
  2. AnyRef
  3. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new DirectedGraphIndex(sentenceLength: Int)

    Permalink

  2. new DirectedGraphIndex(size: Int, roots: HashSet[Int], outgoingEdges: Array[HashSet[(Int, E)]], incomingEdges: Array[HashSet[(Int, E)]], edgesByName: HashMap[E, HashSet[(Int, Int)]])

    Permalink

Value Members

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

    Permalink
    Definition Classes
    AnyRef → Any

  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any

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

    Permalink
    Definition Classes
    AnyRef → Any

  4. def addEdge(head: Int, modifier: Int, label: E): Unit

    Permalink

  5. def addRoot(index: Int): Unit

    Permalink

  6. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any

  7. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  8. val edgesByName: HashMap[E, HashSet[(Int, Int)]]

    Permalink

  9. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef

  10. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  11. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )

  12. def findByHeadAndName(head: Int, label: E): Seq[Edge[E]]

    Permalink

  13. def findByHeadAndPattern(head: Int, pattern: Regex): Seq[Edge[E]]

    Permalink

  14. def findByModifierAndName(modifier: Int, label: E): Seq[Edge[E]]

    Permalink

  15. def findByModifierAndPattern(modifier: Int, pattern: Regex): Seq[Edge[E]]

    Permalink

  16. def findByName(label: E): Seq[Edge[E]]

    Permalink

  17. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any

  18. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  19. val incomingEdges: Array[HashSet[(Int, E)]]

    Permalink

  20. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

  21. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef

  22. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  23. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

  24. val outgoingEdges: Array[HashSet[(Int, E)]]

    Permalink

  25. def removeEdge(head: Int, modifier: Int, label: E): Unit

    Permalink

  26. val roots: HashSet[Int]

    Permalink

  27. val size: Int

    Permalink

  28. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef

  29. def toDirectedGraph(prefferedSize: Option[Int] = None): DirectedGraph[E]

    Permalink

  30. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any

  31. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  33. final def wait(arg0: Long): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from AnyRef

Inherited from Any

Ungrouped