| Modifier and Type | Method and Description |
|---|---|
static void |
DirectionalAttributes.edgeSplitAttributes(LineString line,
Point point,
List<Edge<Record>> edges) |
void |
DirectionalAttributes.setEdgeSplitAttributes(LineString line,
Point point,
List<Edge<Record>> edges) |
| Modifier and Type | Method and Description |
|---|---|
Edge<LineSegmentMatch> |
LineMatchGraph.getUnprocessedEdgeWithSegment(Node<LineSegmentMatch> node,
int index,
Set<Edge<LineSegmentMatch>> processedEdges) |
| Modifier and Type | Method and Description |
|---|---|
List<Edge<LineSegmentMatch>> |
LineMatchGraph.splitEdge(Edge<LineSegmentMatch> edge,
Node<LineSegmentMatch> node) |
| Modifier and Type | Method and Description |
|---|---|
boolean |
NotMatchedEdgeFilter.accept(Edge<LineSegmentMatch> edge) |
boolean |
LineSegmentMatchWithinDistanceFilter.accept(Edge<LineSegmentMatch> edge) |
boolean |
LineMatchEdgeFilter.accept(Edge<LineSegmentMatch> edge2) |
static double |
LineMatchEdgeFilter.getDistance(Edge<LineSegmentMatch> edge,
Node<LineSegmentMatch> node,
double tolerance) |
static boolean |
LineMatchEdgeFilter.isEitherOppositeNodesWithinDistance(Edge<LineSegmentMatch> edge1,
Edge<LineSegmentMatch> edge2,
Node<LineSegmentMatch> fromNode2,
double tolerance) |
static boolean |
LineMatchEdgeFilter.isEitherOppositeNodesWithinDistance(Edge<LineSegmentMatch> edge1,
Edge<LineSegmentMatch> edge2,
Node<LineSegmentMatch> fromNode2,
double tolerance) |
static boolean |
LineMatchEdgeFilter.isOppositeNodeWithinDistance(Edge<LineSegmentMatch> edge1,
Edge<LineSegmentMatch> edge2,
Node<LineSegmentMatch> node,
double tolerance) |
static boolean |
LineMatchEdgeFilter.isOppositeNodeWithinDistance(Edge<LineSegmentMatch> edge1,
Edge<LineSegmentMatch> edge2,
Node<LineSegmentMatch> node,
double tolerance) |
List<Edge<LineSegmentMatch>> |
LineMatchGraph.splitEdge(Edge<LineSegmentMatch> edge,
Node<LineSegmentMatch> node) |
| Modifier and Type | Method and Description |
|---|---|
Edge<LineSegmentMatch> |
LineMatchGraph.getUnprocessedEdgeWithSegment(Node<LineSegmentMatch> node,
int index,
Set<Edge<LineSegmentMatch>> processedEdges) |
| Constructor and Description |
|---|
LineMatchEdgeFilter(Edge<LineSegmentMatch> edge,
int index,
double tolerance) |
| Modifier and Type | Method and Description |
|---|---|
Edge<Record> |
RecordGraph.addEdge(Record object) |
Edge<T> |
Graph.addEdge(T object,
LineString line) |
protected Edge<T> |
Graph.addEdge(T object,
LineString line,
Point from,
Point to)
Actually add the edge.
|
protected Edge<T> |
Graph.addEdge(T object,
Point from,
Point to) |
Edge<T> |
Graph.createEdge(GeometryFactory geometryFactory,
T object,
LineString points) |
Edge<T> |
EdgeList.get(int index) |
Edge<T> |
Graph.getEdge(int edgeId) |
Edge<Record> |
RecordGraph.getEdge(Record record) |
Edge<T> |
EdgePair.getEdge1() |
Edge<T> |
EdgePair.getEdge2() |
Edge<T> |
Node.getNextEdge(Edge<T> edge) |
static <V> Edge<V> |
Node.getNextEdge(List<Edge<V>> edges,
Edge<V> edge) |
Edge<T> |
Node.getNextInEdge(Edge<T> edge) |
Edge<T> |
Node.getNextOutEdge(Edge<T> edge) |
Edge<T> |
EdgeQuadTree.getObject(Integer id) |
Edge<Record> |
RecordGraph.merge(Node<Record> node,
Edge<Record> edge1,
Edge<Record> edge2) |
Edge<T> |
Graph.merge(Node<T> node,
Edge<T> edge1,
Edge<T> edge2)
Merge the two edges at the node.
|
Edge<T> |
Graph.mergeEdges(Edge<T> edge1,
Edge<T> edge2)
Merge the two edges into a single edge, removing the old edges and node if
required from the graph and adding a new edge to the graph.
|
Edge<T> |
Graph.replaceEdge(Edge<T> edge,
LineString line) |
Edge<T> |
EdgeList.set(int index,
Edge<T> edge) |
| Modifier and Type | Method and Description |
|---|---|
List<Edge<Record>> |
RecordGraph.addEdges(Collection<? extends Record> objects) |
List<Edge<T>> |
Graph.findEdges(EdgeVisitor<T> visitor) |
List<Edge<T>> |
Graph.findEdges(Point point,
double distance) |
static <T extends Geometry> |
RecordGraph.getEdgeFilter(Filter<T> geometryFilter) |
IdObjectIndex<Edge<T>> |
Graph.getEdgeIndex() |
List<Edge<T>> |
Node.getEdges() |
List<Edge<T>> |
Graph.getEdges() |
static <T> Set<Edge<T>> |
Edge.getEdges(Collection<Edge<T>> edges,
LineString line) |
List<Edge<T>> |
Graph.getEdges(Comparator<Edge<T>> comparator) |
List<Edge<T>> |
Graph.getEdges(Edge<T> edge) |
List<Edge<T>> |
Graph.getEdges(Filter<Edge<T>> filter) |
List<Edge<T>> |
Graph.getEdges(Filter<Edge<T>> filter,
BoundingBox envelope) |
List<Edge<T>> |
Graph.getEdges(Filter<Edge<T>> filter,
Comparator<Edge<T>> comparator) |
List<Edge<T>> |
Graph.getEdges(Filter<Edge<T>> filter,
Comparator<Edge<T>> comparator,
BoundingBox envelope) |
List<Edge<T>> |
Graph.getEdges(Filter<Edge<T>> filter,
Comparator<Edge<T>> comparator,
Geometry geometry) |
List<Edge<T>> |
Graph.getEdges(Filter<Edge<T>> filter,
Geometry geometry) |
List<Edge<T>> |
Graph.getEdges(int... ids) |
static <T> List<Edge<T>> |
Edge.getEdges(List<Edge<T>> edges,
Filter<Edge<T>> filter) |
List<Edge<T>> |
Graph.getEdges(List<Integer> ids) |
static <T> Set<Edge<T>> |
Edge.getEdges(Map<LineString,Set<Edge<T>>> lineEdgeMap,
LineString line) |
static <T> Set<Edge<T>> |
Node.getEdgesBetween(Node<T> node0,
Node<T> node1) |
static <T> Collection<Edge<T>> |
Node.getEdgesBetween(String typePath,
Node<T> node0,
Node<T> node1) |
static <T> Map<LineString,Set<Edge<T>>> |
Edge.getEdgesByLine(List<Edge<T>> edges) |
static <T> Map<LineString,Set<Edge<T>>> |
Edge.getEdgesByLine(Node<T> node,
List<Edge<T>> edges) |
static <T> List<Edge<T>> |
Edge.getEdgesMatchingObjectFilter(List<Edge<T>> edges,
Filter<T> filter) |
Set<Edge<T>> |
Node.getEdgesTo(Node<T> node) |
List<Edge<T>> |
Edge.getEdgesToNextJunctionNode(Node<T> node) |
List<Edge<T>> |
Node.getEdgesWithoutAttribute(String fieldName)
Get all the edges from a node which do not have an attribute with the
specified name.
|
List<Edge<T>> |
Node.getInEdges() |
List<Edge<T>> |
EdgeQuadTree.getObjects(List<Integer> ids) |
List<Edge<T>> |
Node.getOutEdges() |
List<Edge<T>> |
Node.getOutEdgesTo(Node<T> node) |
static <T> Map<String,List<Edge<T>>> |
Edge.getTypeNameEdgesMap(List<Edge<T>> edges)
Get the map of type name to list of edges.
|
List<Edge<T>> |
Edge.replace(LineString... lines) |
List<Edge<T>> |
Edge.replace(List<LineString> lines) |
List<Edge<T>> |
Graph.replaceEdge(Edge<T> edge,
Geometry lines) |
List<Edge<T>> |
Graph.replaceEdge(Edge<T> edge,
List<LineString> lines) |
<V extends Point> |
Edge.split(Collection<V> splitPoints) |
<V extends Point> |
Edge.split(Collection<V> points,
double maxDistance) |
List<Edge<T>> |
Edge.split(List<Point> points) |
List<Edge<T>> |
Edge.split(Point... points) |
<V extends Point> |
Graph.splitEdge(Edge<T> edge,
Collection<V> nodes) |
<V extends Point> |
Graph.splitEdge(Edge<T> edge,
Collection<V> splitPoints,
double maxDistance) |
List<Edge<T>> |
Graph.splitEdge(Edge<T> edge,
Node<T> node) |
List<Edge<T>> |
Graph.splitEdge(Edge<T> edge,
Point... nodes) |
List<Edge<Record>> |
RecordGraph.splitEdges(Point point,
double distance) |
| Modifier and Type | Method and Description |
|---|---|
boolean |
EdgeList.add(Edge<T> edge) |
void |
EdgeList.add(int index,
Edge<T> edge) |
static <T> void |
Edge.addEdgeToEdgesByLine(Map<LineString,Set<Edge<T>>> lineEdgeMap,
Edge<T> edge) |
static <T> void |
Edge.addEdgeToEdgesByLine(Node<T> node,
Map<LineString,Set<Edge<T>>> lineEdgeMap,
Edge<T> edge) |
protected void |
Node.addInEdge(Edge<T> edge) |
protected void |
Node.addOutEdge(Edge<T> edge) |
int |
EdgeToAngleComparator.compare(Edge<T> edge1,
Edge<T> edge2)
Compare the to angle for two edges.
|
int |
EdgeToAngleComparator.compare(Edge<T> edge1,
Edge<T> edge2)
Compare the to angle for two edges.
|
int |
EdgeFromAngleComparator.compare(Edge<T> edge1,
Edge<T> edge2)
Compare the two edges at a given node.
|
int |
EdgeFromAngleComparator.compare(Edge<T> edge1,
Edge<T> edge2)
Compare the two edges at a given node.
|
int |
Edge.compareTo(Edge<T> edge) |
boolean |
Graph.contains(Edge<T> edge) |
double |
Edge.distance(Edge<LineSegmentMatch> edge) |
protected void |
Graph.evict(Edge<T> edge) |
List<Node<T>> |
Graph.findNodes(Edge<T> edge,
double distance)
Find all the nodes <= the distance of the edge, that are "on" the line.
|
Collection<Node<T>> |
Edge.getCommonNodes(Edge<T> edge) |
int |
Node.getEdgeIndex(Edge<T> edge) |
static <V> int |
Node.getEdgeIndex(List<Edge<V>> edges,
Edge<V> edge) |
List<Edge<T>> |
Graph.getEdges(Edge<T> edge) |
BoundingBox |
EdgeQuadTree.getEnvelope(Edge<T> edge) |
int |
EdgeQuadTree.getId(Edge<T> edge) |
int |
Node.getInEdgeIndex(Edge<T> edge) |
Edge<T> |
Node.getNextEdge(Edge<T> edge) |
static <V> Edge<V> |
Node.getNextEdge(List<Edge<V>> edges,
Edge<V> edge) |
Edge<T> |
Node.getNextInEdge(Edge<T> edge) |
Edge<T> |
Node.getNextOutEdge(Edge<T> edge) |
int |
Node.getOutEdgeIndex(Edge<T> edge) |
String |
RecordGraph.getTypeName(Edge<Record> edge)
Get the type name for the edge.
|
String |
Graph.getTypeName(Edge<T> edge)
Get the type name for the edge.
|
boolean |
Node.hasEdge(Edge<T> edge) |
boolean |
Graph.hasEdge(Edge<T> edge) |
Edge<Record> |
RecordGraph.merge(Node<Record> node,
Edge<Record> edge1,
Edge<Record> edge2) |
Edge<Record> |
RecordGraph.merge(Node<Record> node,
Edge<Record> edge1,
Edge<Record> edge2) |
Edge<T> |
Graph.merge(Node<T> node,
Edge<T> edge1,
Edge<T> edge2)
Merge the two edges at the node.
|
Edge<T> |
Graph.merge(Node<T> node,
Edge<T> edge1,
Edge<T> edge2)
Merge the two edges at the node.
|
Edge<T> |
Graph.mergeEdges(Edge<T> edge1,
Edge<T> edge2)
Merge the two edges into a single edge, removing the old edges and node if
required from the graph and adding a new edge to the graph.
|
Edge<T> |
Graph.mergeEdges(Edge<T> edge1,
Edge<T> edge2)
Merge the two edges into a single edge, removing the old edges and node if
required from the graph and adding a new edge to the graph.
|
void |
Node.remove(Edge<T> edge) |
void |
Graph.remove(Edge<T> edge) |
int[] |
Node.removeEdge(int[] oldEdgeIds,
Edge<T> edge) |
List<Edge<T>> |
Graph.replaceEdge(Edge<T> edge,
Geometry lines) |
Edge<T> |
Graph.replaceEdge(Edge<T> edge,
LineString line) |
List<Edge<T>> |
Graph.replaceEdge(Edge<T> edge,
List<LineString> lines) |
Edge<T> |
EdgeList.set(int index,
Edge<T> edge) |
<V extends Point> |
Graph.splitEdge(Edge<T> edge,
Collection<V> nodes) |
<V extends Point> |
Graph.splitEdge(Edge<T> edge,
Collection<V> splitPoints,
double maxDistance) |
List<Edge<T>> |
Graph.splitEdge(Edge<T> edge,
Node<T> node) |
List<Edge<T>> |
Graph.splitEdge(Edge<T> edge,
Point... nodes) |
boolean |
Edge.touches(Edge<T> edge) |
boolean |
EdgeCollectionVisitor.visit(Edge<T> edge) |
| Modifier and Type | Method and Description |
|---|---|
boolean |
EdgeList.addAll(Collection<? extends Edge<T>> collection) |
boolean |
EdgeList.addAll(int i,
Collection<? extends Edge<T>> collection) |
static <T> void |
Edge.addEdgeToEdgesByLine(Map<LineString,Set<Edge<T>>> lineEdgeMap,
Edge<T> edge) |
static <T> void |
Edge.addEdgeToEdgesByLine(Node<T> node,
Map<LineString,Set<Edge<T>>> lineEdgeMap,
Edge<T> edge) |
void |
Graph.deleteEdges(Filter<Edge<T>> filter) |
int[] |
Graph.getEdgeIds(Collection<Edge<T>> edges) |
static <V> int |
Node.getEdgeIndex(List<Edge<V>> edges,
Edge<V> edge) |
static <T> Set<Edge<T>> |
Edge.getEdges(Collection<Edge<T>> edges,
LineString line) |
List<Edge<T>> |
Graph.getEdges(Comparator<Edge<T>> comparator) |
List<Edge<T>> |
Graph.getEdges(Filter<Edge<T>> filter) |
List<Edge<T>> |
Graph.getEdges(Filter<Edge<T>> filter,
BoundingBox envelope) |
List<Edge<T>> |
Graph.getEdges(Filter<Edge<T>> filter,
Comparator<Edge<T>> comparator) |
List<Edge<T>> |
Graph.getEdges(Filter<Edge<T>> filter,
Comparator<Edge<T>> comparator) |
List<Edge<T>> |
Graph.getEdges(Filter<Edge<T>> filter,
Comparator<Edge<T>> comparator,
BoundingBox envelope) |
List<Edge<T>> |
Graph.getEdges(Filter<Edge<T>> filter,
Comparator<Edge<T>> comparator,
BoundingBox envelope) |
List<Edge<T>> |
Graph.getEdges(Filter<Edge<T>> filter,
Comparator<Edge<T>> comparator,
Geometry geometry) |
List<Edge<T>> |
Graph.getEdges(Filter<Edge<T>> filter,
Comparator<Edge<T>> comparator,
Geometry geometry) |
List<Edge<T>> |
Graph.getEdges(Filter<Edge<T>> filter,
Geometry geometry) |
static <T> List<Edge<T>> |
Edge.getEdges(List<Edge<T>> edges,
Filter<Edge<T>> filter) |
static <T> List<Edge<T>> |
Edge.getEdges(List<Edge<T>> edges,
Filter<Edge<T>> filter) |
static <T> Set<Edge<T>> |
Edge.getEdges(Map<LineString,Set<Edge<T>>> lineEdgeMap,
LineString line) |
static <T> Map<LineString,Set<Edge<T>>> |
Edge.getEdgesByLine(List<Edge<T>> edges) |
static <T> Map<LineString,Set<Edge<T>>> |
Edge.getEdgesByLine(Node<T> node,
List<Edge<T>> edges) |
static <T> List<Edge<T>> |
Edge.getEdgesMatchingObjectFilter(List<Edge<T>> edges,
Filter<T> filter) |
static <V> Edge<V> |
Node.getNextEdge(List<Edge<V>> edges,
Edge<V> edge) |
static <T> List<T> |
Edge.getObjects(Collection<Edge<T>> edges)
Get the list of objects from the collection of edges.
|
static <T> Map<String,List<Edge<T>>> |
Edge.getTypeNameEdgesMap(List<Edge<T>> edges)
Get the map of type name to list of edges.
|
static <T> boolean |
Edge.hasEdgeMatchingObjectFilter(List<Edge<T>> edges,
Filter<T> filter) |
void |
Graph.queryEdges(EdgeVisitor<T> visitor,
Visitor<Edge<T>> matchVisitor) |
static <T> void |
Edge.remove(Collection<Edge<T>> edges) |
static <T> void |
Edge.setEdgesAttribute(List<Edge<T>> edges,
String fieldName,
Object value) |
void |
Graph.visitEdges(Comparator<Edge<T>> comparator,
Visitor<Edge<T>> visitor) |
void |
Graph.visitEdges(Comparator<Edge<T>> comparator,
Visitor<Edge<T>> visitor) |
void |
Graph.visitEdges(Filter<Edge<T>> filter,
Comparator<Edge<T>> comparator,
Visitor<Edge<T>> visitor) |
void |
Graph.visitEdges(Filter<Edge<T>> filter,
Comparator<Edge<T>> comparator,
Visitor<Edge<T>> visitor) |
void |
Graph.visitEdges(Filter<Edge<T>> filter,
Comparator<Edge<T>> comparator,
Visitor<Edge<T>> visitor) |
void |
Graph.visitEdges(Filter<Edge<T>> filter,
Visitor<Edge<T>> visitor) |
void |
Graph.visitEdges(Filter<Edge<T>> filter,
Visitor<Edge<T>> visitor) |
void |
Graph.visitEdges(Visitor<Edge<T>> visitor) |
void |
Graph.visitEdges(Visitor<Edge<T>> visitor,
BoundingBox envelope) |
| Constructor and Description |
|---|
EdgePair(Edge<T> edge1,
Edge<T> edge2) |
EdgePair(Edge<T> edge1,
Edge<T> edge2) |
| Modifier and Type | Method and Description |
|---|---|
static <T> Map<LineString,Map<String,Set<Edge<T>>>> |
NodeAttributes.Methods.edgesByLineAndTypeName(Node<T> node) |
static <T> Map<String,List<Edge<T>>> |
NodeAttributes.Methods.edgesByType(Node<T> node) |
static <T> Map<String,Map<LineString,Set<Edge<T>>>> |
NodeAttributes.Methods.edgesByTypeNameAndLine(Node<T> node) |
static <T> Map<LineString,Map<String,Set<Edge<T>>>> |
NodeAttributes.getEdgesByLineAndTypeName(Node<T> node)
Get the map of edge angles, which contains a map of type names to the list
of edges with that angle and type name.
|
static <T> Map<String,List<Edge<T>>> |
NodeAttributes.getEdgesByType(Node<T> node) |
static <T> List<Edge<T>> |
NodeAttributes.getEdgesByType(Node<T> node,
String typePath) |
static <T> Map<String,Map<LineString,Set<Edge<T>>>> |
NodeAttributes.getEdgesByTypeNameAndLine(Node<T> node) |
| Modifier and Type | Method and Description |
|---|---|
protected boolean |
PseudoNodeAttribute.isPseudoNode(Node<Record> node,
Map<LineString,Set<Edge<Record>>> edgesByLine) |
| Modifier and Type | Method and Description |
|---|---|
int |
EdgeObjectComparator.compare(Edge<T> edge1,
Edge<T> edge2) |
int |
EdgeObjectComparator.compare(Edge<T> edge1,
Edge<T> edge2) |
int |
EdgeLengthComparator.compare(Edge<T> edge1,
Edge<T> edge2) |
int |
EdgeLengthComparator.compare(Edge<T> edge1,
Edge<T> edge2) |
int |
EdgeAttributeValueComparator.compare(Edge<T> edge1,
Edge<T> edge2) |
int |
EdgeAttributeValueComparator.compare(Edge<T> edge1,
Edge<T> edge2) |
| Modifier and Type | Method and Description |
|---|---|
Edge<T> |
EdgeEvent.getEdge() |
Edge<T> |
EdgeEvent.getSource() |
| Modifier and Type | Method and Description |
|---|---|
void |
EdgeEventListenerList.edgeEvent(Edge<T> edge,
String ruleName,
String action,
String notes) |
| Constructor and Description |
|---|
EdgeEvent(Edge<T> edge) |
EdgeEvent(Edge<T> edge,
String ruleName,
String action) |
EdgeEvent(Edge<T> edge,
String ruleName,
String action,
String notes) |
| Modifier and Type | Method and Description |
|---|---|
boolean |
LineFilter.accept(Edge<T> edge) |
boolean |
EdgeTypeNameFilter.accept(Edge<T> edge)
Accept the edge if its type name is in the list of type names specified on
this filter.
|
boolean |
EdgeObjectFilter.accept(Edge<T> edge) |
boolean |
EdgeHasNodeFilter.accept(Edge<T> edge) |
| Constructor and Description |
|---|
IsPointOnLineEdgeFilter(Edge<T> edge,
double maxDistance) |
| Constructor and Description |
|---|
NodeMatchingEdgeFilter(Filter<Edge<T>> edgeFilter) |
| Modifier and Type | Method and Description |
|---|---|
boolean |
GeometryGraph.removeDuplicateLineEdges(Edge<LineSegment> edge)
Remove duplicate edges, edges must be processed in order of the index
attribute.
|
| Modifier and Type | Method and Description |
|---|---|
static Edge<LineSegment> |
LineStringGraph.getFirstEdge(Collection<Edge<LineSegment>> edges) |
| Modifier and Type | Method and Description |
|---|---|
static List<Edge<LineSegment>> |
EdgeLessThanDistance.getEdges(Graph<LineSegment> graph,
LineSegment lineSegment,
double maxDistance) |
static List<Edge<LineSegment>> |
EdgeLessThanDistance.getEdges(LineStringGraph graph,
Point fromPoint,
Point toPoint,
double maxDistance) |
Map<Edge<LineSegment>,List<Node<LineSegment>>> |
LineStringGraph.getPointsOnEdges(Graph<LineSegment> graph1,
double tolerance) |
<V extends Point> |
LineStringGraph.splitEdge(Edge<LineSegment> edge,
Collection<V> nodes) |
| Modifier and Type | Method and Description |
|---|---|
boolean |
EdgeLessThanDistance.accept(Edge<LineSegment> edge) |
boolean |
LineStringGraph.removeDuplicateEdges(Edge<LineSegment> edge)
Remove duplicate edges, edges must be processed in order of the index
attribute.
|
boolean |
LineStringGraph.splitCrossingEdges(Edge<LineSegment> edge1) |
<V extends Point> |
LineStringGraph.splitEdge(Edge<LineSegment> edge,
Collection<V> nodes) |
boolean |
LineSegmentIntersectionVisitor.visit(Edge<LineSegment> edge) |
boolean |
EdgeLessThanDistance.visit(Edge<LineSegment> edge) |
| Modifier and Type | Method and Description |
|---|---|
static Edge<LineSegment> |
LineStringGraph.getFirstEdge(Collection<Edge<LineSegment>> edges) |
<V extends Point> |
LineStringGraph.splitEdges(Map<Edge<LineSegment>,List<V>> pointsOnEdge1) |
| Constructor and Description |
|---|
EdgeLessThanDistance(LineSegment lineSegment,
double maxDistance,
Visitor<Edge<LineSegment>> matchVisitor) |
| Modifier and Type | Method and Description |
|---|---|
protected Edge<Record> |
RecordPseudoNodeRemovalVisitor.mergeEdges(Node<Record> node,
Edge<Record> edge1,
Edge<Record> edge2) |
| Modifier and Type | Method and Description |
|---|---|
static <T> List<Edge<T>> |
EdgeWithinDistance.edgesWithinDistance(Graph<T> graph,
Geometry geometry,
double maxDistance) |
static <T> List<Edge<T>> |
EdgeWithinDistance.edgesWithinDistance(Graph<T> graph,
Node<T> node,
double maxDistance) |
static <T> List<Edge<T>> |
EdgeLessThanDistanceToNodeVisitor.edgesWithinDistance(Graph<T> graph,
Node<T> node,
double maxDistance) |
static <T> List<Edge<T>> |
EdgeWithinDistance.edgesWithinDistance(Graph<T> graph,
Point point,
double maxDistance) |
static <T> List<Edge<T>> |
EdgeIntersectsLinearlyEdgeVisitor.getEdges(Graph<T> graph,
Edge<T> edge) |
static <T> List<Edge<T>> |
BoundingBoxIntersectsEdgeVisitor.getEdges(Graph<T> graph,
Edge<T> edge,
double maxDistance) |
static <T> List<Edge<T>> |
EdgeIntersectLineVisitor.getEdges(Graph<T> graph,
LineString line) |
static <T> List<Edge<T>> |
NodeOnEdgeVisitor.getEdges(Graph<T> graph,
Node<T> node,
double maxDistance) |
Collection<Edge<T>> |
SplitEdgesCloseToNodeVisitor.getNewEdges() |
Collection<Edge<T>> |
SplitCrossingEdgesVisitor.getNewEdges() |
List<Edge<T>> |
SplitCrossingEdgesVisitor.queryCrosses(IdObjectIndex<Edge<T>> edgeIndex,
LineString line) |
| Modifier and Type | Method and Description |
|---|---|
boolean |
EdgeWithinDistance.accept(Edge<T> edge) |
void |
AbstractEdgeListenerVisitor.edgeEvent(Edge<T> edge,
String ruleName,
String action,
String notes) |
void |
AbstractNodeListenerVisitor.edgeEvent(Edge<T> edge,
String path,
String ruleName,
String action,
String notes) |
static <T> List<Edge<T>> |
EdgeIntersectsLinearlyEdgeVisitor.getEdges(Graph<T> graph,
Edge<T> edge) |
static <T> List<Edge<T>> |
BoundingBoxIntersectsEdgeVisitor.getEdges(Graph<T> graph,
Edge<T> edge,
double maxDistance) |
protected Edge<Record> |
RecordPseudoNodeRemovalVisitor.mergeEdges(Node<Record> node,
Edge<Record> edge1,
Edge<Record> edge2) |
protected Edge<Record> |
RecordPseudoNodeRemovalVisitor.mergeEdges(Node<Record> node,
Edge<Record> edge1,
Edge<Record> edge2) |
protected void |
EqualTypeAndLineEdgeCleanupVisitor.removeDuplicate(Edge<Record> removeEdge,
Edge<Record> keepEdge) |
protected void |
EqualTypeAndLineEdgeCleanupVisitor.removeDuplicate(Edge<Record> removeEdge,
Edge<Record> keepEdge) |
boolean |
SplitIntersectingEdgeVisitor.visit(Edge<Record> edge)
Visit each edge in the graph to find other edges which linearly intersect
the edge and are not geometrically equal.
|
boolean |
LinearIntersectionNotEqualLineEdgeCleanupVisitor.visit(Edge<Record> edge) |
boolean |
LinearIntersectionNotEqualEdgeLogVisitor.visit(Edge<Record> edge) |
boolean |
ItersectsNodeEdgeCleanupVisitor.visit(Edge<Record> edge) |
boolean |
EqualTypeAndLineEdgeCleanupVisitor.visit(Edge<Record> edge) |
boolean |
EdgeLessThanLengthVisitor.visit(Edge<Record> edge) |
boolean |
SplitCrossingEdgesVisitor.visit(Edge<T> edge) |
boolean |
RemoveBothDuplicateEdgeVisitor.visit(Edge<T> edge) |
boolean |
NodeOnEdgeVisitor.visit(Edge<T> edge) |
boolean |
NearParallelEdgeVisitor.visit(Edge<T> edge) |
boolean |
EdgeWithinDistance.visit(Edge<T> edge) |
boolean |
EdgeLessThanDistanceToNodeVisitor.visit(Edge<T> edge) |
boolean |
EdgeIntersectsLinearlyEdgeVisitor.visit(Edge<T> edge2) |
boolean |
EdgeIntersectLineVisitor.visit(Edge<T> edge) |
boolean |
EdgeCleanCloseVerticesVisitor.visit(Edge<T> edge)
Visit the edge performing any required cleanup.
|
boolean |
DeleteEdgeVisitor.visit(Edge<T> edge) |
boolean |
ChannelOutEdgeVisitor.visit(Edge<T> edge) |
boolean |
BoundingBoxIntersectsEdgeVisitor.visit(Edge<T> edge) |
| Modifier and Type | Method and Description |
|---|---|
List<Edge<T>> |
SplitCrossingEdgesVisitor.queryCrosses(IdObjectIndex<Edge<T>> edgeIndex,
LineString line) |
void |
LinearIntersectionNotEqualLineEdgeCleanupVisitor.setComparator(Comparator<Edge<Record>> comparator) |
void |
SplitEdgesCloseToNodeVisitor.setNewEdges(Collection<Edge<T>> newEdges) |
void |
SplitCrossingEdgesVisitor.setNewEdges(Collection<Edge<T>> newEdges) |
| Constructor and Description |
|---|
EdgeIntersectsLinearlyEdgeVisitor(Edge<T> edge,
Visitor<Edge<T>> matchVisitor) |
| Constructor and Description |
|---|
BoundingBoxIntersectsEdgeVisitor(BoundingBox boundingBox,
Visitor<Edge<T>> matchVisitor) |
EdgeCleanCloseVerticesVisitor(Graph<T> graph,
double minDistance,
Visitor<Edge<T>> visitor) |
EdgeIntersectLineVisitor(LineString line,
Visitor<Edge<T>> matchVisitor) |
EdgeIntersectsLinearlyEdgeVisitor(Edge<T> edge,
Visitor<Edge<T>> matchVisitor) |
EdgeLessThanDistanceToNodeVisitor(Node<T> node,
double maxDistance,
Visitor<Edge<T>> matchVisitor) |
EdgeLessThanLengthVisitor(double minLength,
Visitor<Edge<Record>> visitor) |
EdgeWithinDistance(Geometry geometry,
double maxDistance,
Visitor<Edge<T>> matchVisitor) |
NodeOnEdgeVisitor(Node<T> node,
BoundingBox boundingBox,
double maxDistance,
Visitor<Edge<T>> matchVisitor) |
| Modifier and Type | Method and Description |
|---|---|
static void |
Debug.typePath(Edge<?> edge,
String typePath) |
Copyright © 2015 Revolution Systems Inc.. All rights reserved.