DirectedEdgeStar class
A DirectedEdgeStar is an ordered list of outgoing DirectedEdges around a node. It supports labelling the edges as well as linking the edges to form both MaximalEdgeRings and MinimalEdgeRings.
@version 1.7
- Inheritance
-
- Object
- EdgeEndStar
- DirectedEdgeStar
Constructors
Properties
- edgeList ↔ List?
-
A list of all outgoing edges in the result, in CCW order
getter/setter pairinherited
- edgeMap ↔ Map
-
A map which maintains the edges in sorted order around the node
getter/setter pairinherited
- hashCode → int
-
The hash code for this object.
no setterinherited
- label ↔ Label?
-
getter/setter pair
-
ptInAreaLocation
↔ List<
int> -
The location of the point for this star in Geometry i Areas
getter/setter pairinherited
- resultAreaEdgeList ↔ List?
-
A list of all outgoing edges in the result, in CCW order
getter/setter pair
- runtimeType → Type
-
A representation of the runtime type of the object.
no setterinherited
Methods
-
checkAreaLabelsConsistent(
int geomIndex) → bool -
inherited
-
computeDepths(
DirectedEdge de) → void -
computeDepths3(
int startIndex, int endIndex, int startDepth) → int - Compute the DirectedEdge depths for a subsequence of the edge array.
-
computeEdgeEndLabels(
BoundaryNodeRule boundaryNodeRule) → void -
inherited
-
computeLabelling(
List< GeometryGraph> geom) → void -
Compute the labelling for all dirEdges in this star, as well
as the overall labelling
override
-
findCoveredLineEdges(
) → void - 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.
-
findIndex(
EdgeEnd eSearch) → int -
inherited
-
getCoordinate(
) → Coordinate? -
@return the coordinate for the node this star is based at
inherited
-
getDegree(
) → int -
inherited
-
getEdges(
) → List -
inherited
-
getLabel(
) → Label? -
getLocation(
int geomIndex, Coordinate p, List< GeometryGraph> geom) → int -
inherited
-
getNextCW(
EdgeEnd ee) → EdgeEnd -
inherited
-
getOutgoingDegree(
) → int -
getOutgoingDegreeWithRing(
EdgeRing er) → int -
getResultAreaEdges(
) → List -
getRightmostEdge(
) → DirectedEdge? -
insert(
EdgeEnd ee) → void -
Insert a directed edge in the list
override
-
insertEdgeEnd(
EdgeEnd e, Object obj) → void -
Insert an EdgeEnd into the map, and clear the edgeList cache,
since the list of edges has now changed
inherited
-
isAreaLabelsConsistent(
GeometryGraph geomGraph) → bool -
inherited
-
iterator(
) → Iterator -
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).
inherited
-
linkAllDirectedEdges(
) → void -
linkMinimalDirectedEdges(
EdgeRing er) → void -
linkResultDirectedEdges(
) → void -
Traverse the star of DirectedEdges, linking the included edges together.
To link two dirEdges, the
nextpointer for an incoming dirEdge is set to the next outgoing edge. -
mergeSymLabels(
) → void - For each dirEdge in the star, merge the label from the sym dirEdge into the label
-
noSuchMethod(
Invocation invocation) → dynamic -
Invoked when a nonexistent method or property is accessed.
inherited
-
propagateSideLabels(
int geomIndex) → void -
inherited
-
toString(
) → String -
A string representation of this object.
inherited
-
updateLabelling(
Label nodeLabel) → void - Update incomplete dirEdge labels from the labelling for the node
Operators
-
operator ==(
Object other) → bool -
The equality operator.
inherited
Constants
- LINKING_TO_OUTGOING → const int
- SCANNING_FOR_INCOMING → const int