class
DirectedGraphIndex[E] extends AnyRef
Instance Constructors
-
new
DirectedGraphIndex(len: Int)
-
new
DirectedGraphIndex(roots: HashSet[Int], outgoingEdges: Array[HashSet[(Int, E)]], edgesByName: HashMap[E, HashSet[(Int, Int)]])
Value Members
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
final
def
==(arg0: Any): Boolean
-
def
addEdge(head: Int, modifier: Int, label: E): Unit
-
def
addRoot(index: Int): Unit
-
final
def
asInstanceOf[T0]: T0
-
def
clone(): AnyRef
-
val
edgesByName: HashMap[E, HashSet[(Int, Int)]]
-
final
def
eq(arg0: AnyRef): Boolean
-
def
equals(arg0: Any): Boolean
-
def
finalize(): Unit
-
def
findByHeadAndName(head: Int, label: E): Seq[Edge[E]]
-
def
findByHeadAndPattern(head: Int, pattern: Regex): Seq[Edge[E]]
-
def
findByModifierAndName(modifier: Int, label: E): Seq[Edge[E]]
-
def
findByName(label: E): Seq[Edge[E]]
-
final
def
getClass(): Class[_]
-
def
hashCode(): Int
-
final
def
isInstanceOf[T0]: Boolean
-
final
def
ne(arg0: AnyRef): Boolean
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
val
outgoingEdges: Array[HashSet[(Int, E)]]
-
def
removeEdge(head: Int, modifier: Int, label: E): Unit
-
val
roots: HashSet[Int]
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
-
def
toString(): String
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
Inherited from AnyRef
Inherited from Any
An inverted index of the DirectedGraph, so we can efficiently implement enhanced dependencies User: mihais Date: 8/2/17