class
Pattern[T] extends (Graph[T]) ⇒ List[Match[T]]
Instance Constructors
-
new
Pattern(edgeMatchers: List[EdgeMatcher[T]], nodeMatchers: List[NodeMatcher[T]])
-
new
Pattern(matchers: List[Matcher[T]])
Value Members
-
final
def
!=(arg0: AnyRef): Boolean
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
final
def
==(arg0: AnyRef): Boolean
-
final
def
==(arg0: Any): Boolean
-
def
andThen[A](g: (List[Match[T]]) ⇒ A): (Graph[T]) ⇒ A
-
def
apply(graph: Graph[T], vertex: T): List[Match[T]]
-
def
apply(graph: Graph[T]): List[Match[T]]
-
final
def
asInstanceOf[T0]: T0
-
def
baseEdgeMatchers: List[BaseEdgeMatcher[T]]
-
def
baseNodeMatchers: List[BaseNodeMatcher[T]]
-
def
canEqual(that: Any): Boolean
-
def
clone(): AnyRef
-
def
compose[A](g: (A) ⇒ Graph[T]): (A) ⇒ List[Match[T]]
-
def
edgeMatchers: List[EdgeMatcher[T]]
-
final
def
eq(arg0: AnyRef): Boolean
-
def
equals(that: Any): Boolean
-
def
finalize(): Unit
-
final
def
getClass(): Class[_]
-
def
hashCode(): Int
-
final
def
isInstanceOf[T0]: Boolean
-
val
matchers: List[Matcher[T]]
-
final
def
ne(arg0: AnyRef): Boolean
-
def
nodeMatchers: List[NodeMatcher[T]]
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
def
reflection: Pattern[T]
-
def
serialize: String
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
toString(): String
-
def
toStringF(f: (String) ⇒ String): 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
Represents a pattern with which graphs can be searched. A pattern will start and end with a node matcher, and every matcher (necessarily) alternates between a NodeMatcher and and EdgeMatcher.