org.allenai.nlpstack.core.graph.pattern

Pattern

Related Docs: object Pattern | package pattern

class Pattern[T] extends Function[Graph[T], List[Match[T]]]

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.

Linear Supertypes
(Graph[T]) ⇒ List[Match[T]], AnyRef, Any
Known Subclasses
DependencyPattern
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. Pattern
  2. Function1
  3. AnyRef
  4. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Instance Constructors

  1. new Pattern(edgeMatchers: List[EdgeMatcher[T]], nodeMatchers: List[NodeMatcher[T]])

  2. new Pattern(matchers: List[Matcher[T]])

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 andThen[A](g: (List[Match[T]]) ⇒ A): (Graph[T]) ⇒ A

    Definition Classes
    Function1
    Annotations
    @unspecialized()

  5. def apply(graph: Graph[T], vertex: T): List[Match[T]]

    Find all matches of this pattern in the graph starting at vertex.

  6. def apply(graph: Graph[T]): List[Match[T]]

    Find all matches of this pattern in the graph.

    Find all matches of this pattern in the graph.

    Definition Classes
    Pattern → Function1

  7. final def asInstanceOf[T0]: T0

    Definition Classes
    Any

  8. def baseEdgeMatchers: List[BaseEdgeMatcher[T]]

  9. def baseNodeMatchers: List[BaseNodeMatcher[T]]

  10. def canEqual(that: Any): Boolean

  11. def clone(): AnyRef

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

  12. def compose[A](g: (A) ⇒ Graph[T]): (A) ⇒ List[Match[T]]

    Definition Classes
    Function1
    Annotations
    @unspecialized()

  13. def edgeMatchers: List[EdgeMatcher[T]]

    A list of just the edge matchers, in order.

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

    Definition Classes
    AnyRef

  15. def equals(that: Any): Boolean

    Definition Classes
    Pattern → AnyRef → Any

  16. def finalize(): Unit

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

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

    Definition Classes
    AnyRef → Any

  18. def hashCode(): Int

    Definition Classes
    Pattern → AnyRef → Any

  19. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

  20. val matchers: List[Matcher[T]]

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

    Definition Classes
    AnyRef

  22. def nodeMatchers: List[NodeMatcher[T]]

    A list of just the node matchers, in order.

  23. final def notify(): Unit

    Definition Classes
    AnyRef

  24. final def notifyAll(): Unit

    Definition Classes
    AnyRef

  25. def reflection: Pattern[T]

  26. def serialize: String

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

    Definition Classes
    AnyRef

  28. def toString(): String

    Definition Classes
    Pattern → Function1 → AnyRef → Any

  29. def toStringF(f: (String) ⇒ String): String

  30. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from (Graph[T]) ⇒ List[Match[T]]

Inherited from AnyRef

Inherited from Any

Ungrouped