Class

net.sansa_stack.inference.utils.graph

EdgeEquivalenceComparator

Related Doc: package graph

Permalink

class EdgeEquivalenceComparator extends Comparator[LabeledEdge[Node, String]]

Definition of edge equivalence used for graph isomorphism detection.

Linear Supertypes
Comparator[LabeledEdge[Node, String]], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. EdgeEquivalenceComparator
  2. Comparator
  3. AnyRef
  4. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new EdgeEquivalenceComparator()

    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. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any

  5. def clone(): AnyRef

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

  6. def compare(e1: LabeledEdge[Node, String], e2: LabeledEdge[Node, String]): Int

    Permalink
    Definition Classes
    EdgeEquivalenceComparator → Comparator

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

    Permalink
    Definition Classes
    AnyRef

  8. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  9. def finalize(): Unit

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

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

    Permalink
    Definition Classes
    AnyRef → Any

  11. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  12. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

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

    Permalink
    Definition Classes
    AnyRef

  14. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  15. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

  16. def reversed(): Comparator[LabeledEdge[Node, String]]

    Permalink
    Definition Classes
    Comparator

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

    Permalink
    Definition Classes
    AnyRef

  18. def thenComparing[U <: Comparable[_ >: U]](arg0: Function[_ >: LabeledEdge[Node, String], _ <: U]): Comparator[LabeledEdge[Node, String]]

    Permalink
    Definition Classes
    Comparator

  19. def thenComparing[U](arg0: Function[_ >: LabeledEdge[Node, String], _ <: U], arg1: Comparator[_ >: U]): Comparator[LabeledEdge[Node, String]]

    Permalink
    Definition Classes
    Comparator

  20. def thenComparing(arg0: Comparator[_ >: LabeledEdge[Node, String]]): Comparator[LabeledEdge[Node, String]]

    Permalink
    Definition Classes
    Comparator

  21. def thenComparingDouble(arg0: ToDoubleFunction[_ >: LabeledEdge[Node, String]]): Comparator[LabeledEdge[Node, String]]

    Permalink
    Definition Classes
    Comparator

  22. def thenComparingInt(arg0: ToIntFunction[_ >: LabeledEdge[Node, String]]): Comparator[LabeledEdge[Node, String]]

    Permalink
    Definition Classes
    Comparator

  23. def thenComparingLong(arg0: ToLongFunction[_ >: LabeledEdge[Node, String]]): Comparator[LabeledEdge[Node, String]]

    Permalink
    Definition Classes
    Comparator

  24. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any

  25. final def wait(): Unit

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

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

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

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

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

Inherited from Comparator[LabeledEdge[Node, String]]

Inherited from AnyRef

Inherited from Any

Ungrouped