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

   Definition Classes

   Any

5.  def clone(): AnyRef

   Attributes

   protected[lang]

   Definition Classes

   AnyRef

   Annotations

   @throws(classOf[java.lang.CloneNotSupportedException]) @native()

6.  def computeDepths(de: DirectedEdge): Unit
7.  def computeLabelling(geom: Array[GeometryGraph]): Unit

   Compute the labelling for all dirEdges in this star, as well as the overall labelling

   Compute the labelling for all dirEdges in this star, as well as the overall labelling

   Definition Classes

   DirectedEdgeStar → EdgeEndStar

8.  var edgeList: List[EdgeEnd]

   A list of all outgoing edges in the result, in CCW order

   A list of all outgoing edges in the result, in CCW order

   Attributes

   protected

   Definition Classes

   EdgeEndStar

9.  var edgeMap: TreeMap[EdgeEnd, EdgeEnd]

   A map which maintains the edges in sorted order around the node

   A map which maintains the edges in sorted order around the node

   Attributes

   protected

   Definition Classes

   EdgeEndStar

10.  final def eq(arg0: AnyRef): Boolean

    Definition Classes

    AnyRef

11.  def equals(arg0: AnyRef): Boolean

    Definition Classes

    AnyRef → Any

12.  def finalize(): Unit

    Attributes

    protected[lang]

    Definition Classes

    AnyRef

    Annotations

    @throws(classOf[java.lang.Throwable])

13.  def findCoveredLineEdges(): Unit

    Traverse the star of edges, maintaining the current location in the result area at this node (if any).

    Traverse the star of edges, maintaining the current location in the result area at this node (if any). If any L edges are found in the interior of the result, mark them as covered.

14.  def findIndex(eSearch: EdgeEnd): Int

    Definition Classes

    EdgeEndStar

15.  final def getClass(): Class[_ <: AnyRef]

    Definition Classes

    AnyRef → Any

    Annotations

    @native()

16.  def getCoordinate: Coordinate

    return the coordinate for the node this star is based at

    return the coordinate for the node this star is based at

    Definition Classes

    EdgeEndStar

17.  def getDegree: Int

    Definition Classes

    EdgeEndStar

18.  def getEdges: List[EdgeEnd]

    Definition Classes

    EdgeEndStar

19.  def getLabel: Label
20.  def getNextCW(ee: EdgeEnd): EdgeEnd

    Definition Classes

    EdgeEndStar

21.  def getOutgoingDegree(er: EdgeRing): Int
22.  def getOutgoingDegree: Int
23.  def getRightmostEdge: DirectedEdge
24.  def hashCode(): Int

    Definition Classes

    AnyRef → Any

    Annotations

    @native()

25.  def insert(ee: EdgeEnd): Unit

    Insert a directed edge in the list

    Insert a directed edge in the list

    Definition Classes

    DirectedEdgeStar → EdgeEndStar

26.  def insertEdgeEnd(e: EdgeEnd, obj: EdgeEnd): Unit

    Insert an EdgeEnd into the map, and clear the edgeList cache, since the list of edges has now changed

    Insert an EdgeEnd into the map, and clear the edgeList cache, since the list of edges has now changed

    Attributes

    protected

    Definition Classes

    EdgeEndStar

27.  def isAreaLabelsConsistent(geomGraph: GeometryGraph): Boolean

    Definition Classes

    EdgeEndStar

28.  final def isInstanceOf[T0]: Boolean

    Definition Classes

    Any

29.  def iterator: Iterator[EdgeEnd]

    Iterator access to the ordered list of edges is optimized by copying the map collection to a list.

    Iterator access to the ordered list of edges is optimized by copying the map collection to a list. (This assumes that once an iterator is requested, it is likely that insertion into the map is complete).

    Definition Classes

    EdgeEndStar

30.  def linkAllDirectedEdges(): Unit
31.  def linkMinimalDirectedEdges(er: EdgeRing): Unit
32.  def linkResultDirectedEdges(): Unit

    Traverse the star of DirectedEdges, linking the included edges together.

    Traverse the star of DirectedEdges, linking the included edges together. To link two dirEdges, the next pointer for an incoming dirEdge is set to the next outgoing edge.

    DirEdges are only linked if:

    • they belong to an area (i.e. they have sides)
    • they are marked as being in the result

    Edges are linked in CCW order (the order they are stored). This means that rings have their face on the Right (in other words, the topological location of the face is given by the RHS label of the DirectedEdge)

    PRECONDITION: No pair of dirEdges are both marked as being in the result

33.  def mergeSymLabels(): Unit

    For each dirEdge in the star, merge the label from the sym dirEdge into the label

34.  final def ne(arg0: AnyRef): Boolean

    Definition Classes

    AnyRef

35.  final def notify(): Unit

    Definition Classes

    AnyRef

    Annotations

    @native()

36.  final def notifyAll(): Unit

    Definition Classes

    AnyRef

    Annotations

    @native()

37.  def print(out: PrintStream): Unit

    Definition Classes

    DirectedEdgeStar → EdgeEndStar

38.  final def synchronized[T0](arg0: => T0): T0

    Definition Classes

    AnyRef

39.  def toString(): String

    Definition Classes

    EdgeEndStar → AnyRef → Any

40.  def updateLabelling(nodeLabel: Label): Unit

    Update incomplete dirEdge labels from the labelling for the node

41.  final def wait(): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws(classOf[java.lang.InterruptedException])

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

    Definition Classes

    AnyRef

    Annotations

    @throws(classOf[java.lang.InterruptedException])

43.  final def wait(arg0: Long): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws(classOf[java.lang.InterruptedException]) @native()