c

# Constant

#### final case classConstant(initial: Vertex) extends EdgePath with Product with Serializable

Constructor for a constant EdgePath

Linear Supertypes
Serializable, Product, Equals, EdgePath, AnyRef, Any
Ordering
1. Alphabetic
2. By Inheritance
Inherited
1. Constant
2. Serializable
3. Product
4. Equals
5. EdgePath
6. AnyRef
7. Any
1. Hide All
2. Show All
Visibility
1. Public
2. Protected

### Instance Constructors

1. new Constant(initial: Vertex)

### Value Members

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

More natural notation for appending an edge

More natural notation for appending an edge

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

Concatenation for EdgePaths

Concatenation for EdgePaths

Definition Classes
EdgePath
5. final def ==(arg0: Any): Boolean
Definition Classes
AnyRef → Any

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

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
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.

Definition Classes
EdgePath
10. def breakIntoPrimitiveLoops: Vector[EdgePath]

Breaks a loop into primitive loops.

Breaks a loop into primitive loops.

Definition Classes
EdgePath
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)

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
13. final def eq(arg0: AnyRef): Boolean
Definition Classes
AnyRef
14. 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
15. 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
16. final def getClass(): Class[_ <: AnyRef]
Definition Classes
AnyRef → Any
Annotations
@native() @HotSpotIntrinsicCandidate()
17. 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
18. val initial
Definition Classes
ConstantEdgePath
19. 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
20. 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
21. def isEqualUptoBasepointShiftHelper(otherPath: EdgePath, remains: Int, current: Int): (Boolean, Int)
Definition Classes
EdgePath
Definition Classes
EdgePath

Checks whether two paths are homotopic fixing endpoints

Checks whether two paths are homotopic fixing endpoints

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

Given a loop checks if the loop is primitive.

Given a loop checks if the loop is primitive.

Definition Classes
EdgePath
27. def isPrimitiveLoopHelper(accum: Set[Vertex]): Boolean
Definition Classes
EdgePath

Reduces a loop to a geodesic

Reduces a loop to a geodesic

Definition Classes
EdgePath
29. def makeBasePointSame(otherPath: 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
30. def makeBasePointSameHelper(path: EdgePath)
Definition Classes
EdgePath
31. def mod(m: Int, n: Int): Int
Definition Classes
EdgePath
32. final def ne(arg0: AnyRef): Boolean
Definition Classes
AnyRef

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

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
35. final def notify(): Unit
Definition Classes
AnyRef
Annotations
@native() @HotSpotIntrinsicCandidate()
36. final def notifyAll(): Unit
Definition Classes
AnyRef
Annotations
@native() @HotSpotIntrinsicCandidate()

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
38. def productElementNames: Iterator[String]
Definition Classes
Product
39. def reverse
Definition Classes
EdgePath

Calculates the geometric self-intersection number of a curve

Calculates the geometric self-intersection number of a curve

Definition Classes
EdgePath

Calculates the geometric self-intersection number of a curve

Calculates the geometric self-intersection number of a curve

Definition Classes
EdgePath

Gives self intersections with signs.

Gives self intersections with signs.

Definition Classes
EdgePath
43. def shiftBasePoint

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
44. final def synchronized[T0](arg0: => T0): T0
Definition Classes
AnyRef
45. val terminal
Definition Classes
ConstantEdgePath
46. 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
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