sealed trait EdgePath extends AnyRef

Self Type
EdgePath
Linear Supertypes
AnyRef, Any
Known Subclasses
Append, Constant
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. EdgePath
  2. AnyRef
  3. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Abstract Value Members

  1. abstract val initial: Vertex
  2. abstract val terminal: Vertex

Concrete Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##: Int
    Definition Classes
    AnyRef → Any
  3. def +(e: Edge): EdgePath

    More natural notation for appending an edge

  4. def ++(path: EdgePath): EdgePath

    Concatenation for EdgePaths

  5. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  6. def AIN(path: EdgePath, nonposQuad: NonPosQuad): Int

    Calculates the algebraic intersection number of the EdgePath and a given path

  7. def GIN(path: EdgePath, nonposQuad: NonPosQuad): Int

    Calculates the geometric intersection number of the EdgePath and a given path

  8. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  9. def breakIntoPrimitiveLoopHelper(center: Vertex, current: EdgePath, accum: Vector[EdgePath]): Vector[EdgePath]

    Helper method for breakIntoPrimitiveLoops.

    Helper method for breakIntoPrimitiveLoops. Notice that in the code current is built in the opposite way in which edgepath is consumed.

  10. def breakIntoPrimitiveLoops: Vector[EdgePath]

    Breaks a loop into primitive loops.

  11. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.CloneNotSupportedException]) @native() @HotSpotIntrinsicCandidate()
  12. def cyclicalTake(i: Int, j: Int): EdgePath

    Given indexes i and j gives the subpath between i-th and j-th vertex.

    Given indexes i and j gives the subpath between i-th and j-th vertex. Because it works on loops j can be less than i.

  13. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  14. def equals(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef → Any
  15. def extractCrossings(loop: EdgePath, nonposQuad: NonPosQuad, sign: Int): Vector[((Int, Int), (Int, Int))]

    Extracts the start and end indices of the crossings of the given sign between the EdgePath (if it is a loop, error otherwise) and a given loop

  16. def findVertexIndex(vertex: Vertex): Option[Int]

    Given a vertex, gives the first index at which it appears in edgePath.

    Given a vertex, gives the first index at which it appears in edgePath. If not present returns None.

  17. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  18. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  19. def inTwoComplex(twoComplex: TwoComplex): Boolean

    Checks whether the EdgePath is in a given Two Complex

  20. def intersectionsWith(otherPath: EdgePath, twoComplex: TwoComplex): Set[Intersection]

    Given another loop gives intersection along with signs.

  21. def isEqualUptoBasepointShift(otherPath: EdgePath): (Boolean, Int)

    Checks if otherPath is equal to edgePath upto shift of basepoint.

    Checks if otherPath is equal to edgePath upto shift of basepoint. Should return (true, n) if otherPath after n shifts of basepoints is equal to edgePath

  22. def isEqualUptoBasepointShiftHelper(otherPath: EdgePath, remains: Int, current: Int): (Boolean, Int)
  23. def isFreelyHomotopicTo(loop: EdgePath, nonposQuad: NonPosQuad): Boolean
  24. def isHomotopicTo(path: EdgePath, nonposQuad: NonPosQuad): Boolean

    Checks whether two paths are homotopic fixing endpoints

  25. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  26. lazy val isLoop: Boolean
  27. def isPrimitiveLoop: Boolean

    Given a loop checks if the loop is primitive.

  28. def isPrimitiveLoopHelper(accum: Set[Vertex]): Boolean
  29. def loopToGeodesic(nonposQuad: NonPosQuad): EdgePath

    Reduces a loop to a geodesic

  30. def makeBasePointSame(otherPath: EdgePath): EdgePath

    Given a path otherPath shifts otherPath until it has the same basepoint as edgePath

  31. def makeBasePointSameHelper(path: EdgePath): EdgePath
  32. def mod(m: Int, n: Int): Int
  33. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  34. def negativeCrossings(loop: EdgePath, nonposQuad: NonPosQuad): Vector[((Int, Int), (Int, Int))]

    Extracts the start and end indices of all negative crossings between the canonical forms of the EdgePath (if it is a loop, error otherwise) and a given loop

  35. def nonCrossings(loop: EdgePath, nonposQuad: NonPosQuad): Vector[((Int, Int), (Int, Int))]

    Extracts the start and end indices of all non-crossings between the canonical forms EdgePath (if it is a loop, error otherwise) and a given loop

  36. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  37. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  38. def positiveCrossings(loop: EdgePath, nonposQuad: NonPosQuad): Vector[((Int, Int), (Int, Int))]

    Extracts the start and end indices of all positive crossings between the canonical forms of the EdgePath (if it is a loop, error otherwise) and a given loop

  39. def reverse: EdgePath
  40. def selfAIN(path: EdgePath, nonposQuad: NonPosQuad): Int

    Calculates the geometric self-intersection number of a curve

  41. def selfGIN(nonposQuad: NonPosQuad): Int

    Calculates the geometric self-intersection number of a curve

  42. def selfIntersection(nonposQuad: NonPosQuad): Set[Intersection]

    Gives self intersections with signs.

  43. def shiftBasePoint: EdgePath

    In case the EdgePath is a loop, shifts the basePoint to the terminal of the first edge.

  44. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  45. def toString(): String
    Definition Classes
    AnyRef → Any
  46. def verticesCovered: Set[Vertex]

    Gives the set of vertices visited by the path.

  47. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  48. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()
  49. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])

Deprecated Value Members

  1. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.Throwable]) @Deprecated
    Deprecated

Inherited from AnyRef

Inherited from Any

Ungrouped