final case class Constant(initial: Vertex) extends EdgePath with Product with Serializable
Constructor for a constant EdgePath
- Alphabetic
- By Inheritance
- Constant
- Serializable
- Product
- Equals
- EdgePath
- AnyRef
- Any
- Hide All
- Show All
- Public
- Protected
Value Members
- final def !=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def ##: Int
- Definition Classes
- AnyRef → Any
- def +(e: Edge): EdgePath
More natural notation for appending an edge
More natural notation for appending an edge
- Definition Classes
- EdgePath
- def ++(path: EdgePath): EdgePath
Concatenation for EdgePaths
Concatenation for EdgePaths
- Definition Classes
- EdgePath
- final def ==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- def AIN(path: EdgePath, nonposQuad: NonPosQuad): Int
Calculates the algebraic intersection number of the EdgePath and a given path
Calculates the algebraic intersection number of the EdgePath and a given path
- Definition Classes
- EdgePath
- def GIN(path: EdgePath, nonposQuad: NonPosQuad): Int
Calculates the geometric intersection number of the EdgePath and a given path
Calculates the geometric intersection number of the EdgePath and a given path
- Definition Classes
- EdgePath
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- 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.
- Definition Classes
- EdgePath
- def breakIntoPrimitiveLoops: Vector[EdgePath]
Breaks a loop into primitive loops.
Breaks a loop into primitive loops.
- Definition Classes
- EdgePath
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native() @HotSpotIntrinsicCandidate()
- 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.
- Definition Classes
- EdgePath
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- 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
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
- Definition Classes
- EdgePath
- 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.
- Definition Classes
- EdgePath
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- def inTwoComplex(twoComplex: TwoComplex): Boolean
Checks whether the EdgePath is in a given Two Complex
Checks whether the EdgePath is in a given Two Complex
- Definition Classes
- EdgePath
- val initial: Vertex
- def intersectionsWith(otherPath: EdgePath, twoComplex: TwoComplex): Set[Intersection]
Given another loop gives intersection along with signs.
Given another loop gives intersection along with signs.
- Definition Classes
- EdgePath
- 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
- Definition Classes
- EdgePath
- def isEqualUptoBasepointShiftHelper(otherPath: EdgePath, remains: Int, current: Int): (Boolean, Int)
- Definition Classes
- EdgePath
- def isFreelyHomotopicTo(loop: EdgePath, nonposQuad: NonPosQuad): Boolean
- Definition Classes
- EdgePath
- def isHomotopicTo(path: EdgePath, nonposQuad: NonPosQuad): Boolean
Checks whether two paths are homotopic fixing endpoints
Checks whether two paths are homotopic fixing endpoints
- Definition Classes
- EdgePath
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- lazy val isLoop: Boolean
- Definition Classes
- EdgePath
- def isPrimitiveLoop: Boolean
Given a loop checks if the loop is primitive.
Given a loop checks if the loop is primitive.
- Definition Classes
- EdgePath
- def isPrimitiveLoopHelper(accum: Set[Vertex]): Boolean
- Definition Classes
- EdgePath
- def loopToGeodesic(nonposQuad: NonPosQuad): EdgePath
Reduces a loop to a geodesic
Reduces a loop to a geodesic
- Definition Classes
- EdgePath
- def makeBasePointSame(otherPath: EdgePath): EdgePath
Given a path otherPath shifts otherPath until it has the same basepoint as edgePath
Given a path otherPath shifts otherPath until it has the same basepoint as edgePath
- Definition Classes
- EdgePath
- def makeBasePointSameHelper(path: EdgePath): EdgePath
- Definition Classes
- EdgePath
- def mod(m: Int, n: Int): Int
- Definition Classes
- EdgePath
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- 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
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
- Definition Classes
- EdgePath
- 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
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
- Definition Classes
- EdgePath
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- 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
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
- Definition Classes
- EdgePath
- def productElementNames: Iterator[String]
- Definition Classes
- Product
- def reverse: EdgePath
- Definition Classes
- EdgePath
- def selfAIN(path: EdgePath, nonposQuad: NonPosQuad): Int
Calculates the geometric self-intersection number of a curve
Calculates the geometric self-intersection number of a curve
- Definition Classes
- EdgePath
- def selfGIN(nonposQuad: NonPosQuad): Int
Calculates the geometric self-intersection number of a curve
Calculates the geometric self-intersection number of a curve
- Definition Classes
- EdgePath
- def selfIntersection(nonposQuad: NonPosQuad): Set[Intersection]
Gives self intersections with signs.
Gives self intersections with signs.
- Definition Classes
- EdgePath
- def shiftBasePoint: EdgePath
In case the EdgePath is a loop, shifts the basePoint to the terminal of the first edge.
In case the EdgePath is a loop, shifts the basePoint to the terminal of the first edge.
- Definition Classes
- EdgePath
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- val terminal: Vertex
- def verticesCovered: Set[Vertex]
Gives the set of vertices visited by the path.
Gives the set of vertices visited by the path.
- Definition Classes
- EdgePath
- final def wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException]) @native()
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
Deprecated Value Members
- def finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable]) @Deprecated
- Deprecated