Instance Constructors
-
new
OutgoingGraphPattern(matcher: StringMatcher)
Value Members
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
final
def
==(arg0: Any): Boolean
-
final
def
asInstanceOf[T0]: T0
-
def
clone(): AnyRef
-
def
distinct(results: Seq[(Int, SynPath)]): Seq[(Int, SynPath)]
-
final
def
eq(arg0: AnyRef): Boolean
-
def
equals(arg0: Any): Boolean
-
def
finalize(): Unit
-
def
findAllIn(tok: Int, sent: Int, doc: Document, state: State, path: SynPath, config: OdinConfig): Seq[(Int, SynPath)]
-
def
findAllIn(tok: Int, sent: Int, doc: Document, state: State, config: OdinConfig): Seq[(Int, SynPath)]
-
final
def
getClass(): Class[_]
-
def
hashCode(): Int
-
def
incoming(tok: Int, sent: Int, doc: Document, graphType: String): Array[String]
-
def
incomingEdges(sent: Int, doc: Document, graphType: String): Array[Array[(Int, String)]]
-
final
def
isInstanceOf[T0]: Boolean
-
final
def
ne(arg0: AnyRef): Boolean
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
def
outgoing(tok: Int, sent: Int, doc: Document, graphType: String): Array[String]
-
def
outgoingEdges(sent: Int, doc: Document, graphType: String): Array[Array[(Int, String)]]
-
def
retrieveGraph(sent: Int, doc: Document, graphType: String): Option[DirectedGraph[String]]
-
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
