| Modifier and Type | Method and Description |
|---|---|
PseudoNodeAttribute |
PseudoNodeProperty.createAttribute(Node<Record> node) |
PseudoNodeAttribute |
PseudoNodeProperty.getField(Node<Record> node) |
| Modifier and Type | Method and Description |
|---|---|
static double |
LineMatchEdgeFilter.getDistance(Edge<LineSegmentMatch> edge,
Node<LineSegmentMatch> node,
double tolerance) |
double |
LineMatchGraph.getDuplicateMatchLength(Node<LineSegmentMatch> node,
boolean direction,
int index1,
int index2) |
double |
LineMatchGraph.getMatchLength(Node<LineSegmentMatch> node,
boolean direction,
int index1,
int index2) |
Edge<LineSegmentMatch> |
LineMatchGraph.getUnprocessedEdgeWithSegment(Node<LineSegmentMatch> node,
int index,
Set<Edge<LineSegmentMatch>> processedEdges) |
boolean |
LineMatchGraph.hasMatch(Node<LineSegmentMatch> node,
boolean direction,
int index1,
int index2) |
boolean |
LineMatchGraph.hasSegmentsWithIndex(Node<LineSegmentMatch> node,
int index) |
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) |
List<Edge<LineSegmentMatch>> |
LineMatchGraph.splitEdge(Edge<LineSegmentMatch> edge,
Node<LineSegmentMatch> node) |
| Constructor and Description |
|---|
LineSegmentMatchWithinDistanceFilter(Node<LineSegmentMatch> node,
double maxDistance) |
| Modifier and Type | Method and Description |
|---|---|
Node<T> |
Graph.findNode(Point point)
Find the node by point coordinates returning the node if it exists, null
otherwise.
|
Node<T> |
NodeList.get(int index) |
Node<T> |
Edge.getFromNode() |
Node<T> |
Edge.getNextJunctionNode(Node<T> node) |
Node<T> |
Graph.getNode(int nodeId) |
Node<Record> |
RecordGraph.getNode(Point point) |
Node<T> |
Graph.getNode(Point point)
Get the node by point coordinates, creating one if it did not exist.
|
Node<T> |
NodeQuadTree.getObject(Integer id) |
Node<T> |
Edge.getOppositeNode(Node<T> node) |
Node<T> |
Edge.getToNode() |
Node<T> |
NodeList.set(int index,
Node<T> edge) |
| Modifier and Type | Method and Description |
|---|---|
List<Node<T>> |
Graph.findNodes(BoundingBox boundingBox) |
List<Node<T>> |
Graph.findNodes(Edge<T> edge,
double distance)
Find all the nodes <= the distance of the edge, that are "on" the line.
|
List<Node<T>> |
Graph.findNodes(Geometry geometry,
double distance)
Find the nodes <= the distance of the specified geometry.
|
List<Node<T>> |
Graph.findNodes(Node<T> node,
double distance)
Find all the nodes <= the distance of the node.
|
List<Node<T>> |
Graph.findNodes(Point point,
double distance)
Find the nodes <= the distance of the specified point coordinates.
|
List<Node<T>> |
Graph.findNodesOfDegree(int degree) |
Collection<Node<T>> |
Edge.getCommonNodes(Edge<T> edge) |
IdObjectIndex<Node<T>> |
Graph.getNodeIndex() |
List<Node<T>> |
Graph.getNodes() |
Collection<Node<T>> |
Edge.getNodes() |
List<Node<T>> |
Graph.getNodes(Comparator<Node<T>> comparator) |
List<Node<T>> |
Graph.getNodes(Filter<Node<T>> filter) |
List<Node<T>> |
Graph.getNodes(Filter<Node<T>> filter,
BoundingBox envelope) |
List<Node<T>> |
Graph.getNodes(Filter<Node<T>> filter,
Comparator<Node<T>> comparator) |
List<Node<T>> |
Graph.getNodes(Filter<Node<T>> filter,
Comparator<Node<T>> comparator,
BoundingBox envelope) |
List<Node<T>> |
Graph.getNodes(List<Integer> nodeIds) |
List<Node<T>> |
NodeQuadTree.getObjects(List<Integer> ids) |
Iterable<Node<T>> |
Graph.nodes() |
List<Node<T>> |
NodeQuadTree.query(BoundingBox envelope) |
| Modifier and Type | Method and Description |
|---|---|
void |
NodeList.add(int index,
Node<T> node) |
boolean |
NodeList.add(Node<T> node) |
static <T> void |
Edge.addEdgeToEdgesByLine(Node<T> node,
Map<LineString,Set<Edge<T>>> lineEdgeMap,
Edge<T> edge) |
int |
Node.compareTo(Node<T> node) |
double |
Edge.distance(Node<T> node) |
protected void |
Graph.evict(Node<T> node) |
List<Node<T>> |
Graph.findNodes(Node<T> node,
double distance)
Find all the nodes <= the distance of the node.
|
double |
Edge.getAngle(Node<T> node) |
double |
Graph.getClosestDistance(Node<T> node,
double maxDistance) |
Point |
NodeQuadTree.getCoordinates(Node<T> node) |
static <T> Set<Edge<T>> |
Node.getEdgesBetween(Node<T> node0,
Node<T> node1) |
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> Collection<Edge<T>> |
Node.getEdgesBetween(String typePath,
Node<T> node0,
Node<T> node1) |
static <T> Map<LineString,Set<Edge<T>>> |
Edge.getEdgesByLine(Node<T> node,
List<Edge<T>> edges) |
Set<Edge<T>> |
Node.getEdgesTo(Node<T> node) |
List<Edge<T>> |
Edge.getEdgesToNextJunctionNode(Node<T> node) |
BoundingBox |
NodeQuadTree.getEnvelope(Node<T> node) |
int |
NodeQuadTree.getId(Node<T> object) |
Node<T> |
Edge.getNextJunctionNode(Node<T> node) |
Node<T> |
Edge.getOppositeNode(Node<T> node) |
List<Edge<T>> |
Node.getOutEdgesTo(Node<T> node) |
static <T> boolean |
Node.hasEdgesBetween(String typePath,
Node<T> node0,
Node<T> node1) |
static <T> boolean |
Node.hasEdgesBetween(String typePath,
Node<T> node0,
Node<T> node1) |
boolean |
Node.hasEdgeTo(Node<T> node) |
boolean |
Edge.hasNode(Node<T> node) |
boolean |
Edge.isForwards(Node<T> node)
Get the direction of the edge from the specified node.
|
boolean |
Edge.isLessThanDistance(Node<T> node,
double distance) |
boolean |
Edge.isWithinDistance(Node<T> node,
double distance) |
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.
|
void |
Graph.moveNode(String typePath,
Node<Record> fromNode,
Node<Record> toNode,
Point newPoint) |
void |
Graph.moveNode(String typePath,
Node<Record> fromNode,
Node<Record> toNode,
Point newPoint) |
boolean |
Graph.moveNodesToMidpoint(String typePath,
Node<Record> node1,
Node<Record> node2) |
boolean |
Graph.moveNodesToMidpoint(String typePath,
Node<Record> node1,
Node<Record> node2) |
boolean |
Graph.movePointsWithinTolerance(Map<Point,Point> movedNodes,
double maxDistance,
Node<T> node1) |
void |
Graph.moveToMidpoint(Map<Point,Point> movedNodes,
Graph<T> graph1,
Node<T> node1,
Node<T> node2) |
void |
Graph.moveToMidpoint(Map<Point,Point> movedNodes,
Graph<T> graph1,
Node<T> node1,
Node<T> node2) |
void |
Graph.nodeMoved(Node<T> node,
Node<T> newNode) |
void |
Graph.nodeMoved(Node<T> node,
Node<T> newNode) |
void |
Graph.remove(Node<T> node) |
Node<T> |
NodeList.set(int index,
Node<T> edge) |
List<Edge<T>> |
Graph.splitEdge(Edge<T> edge,
Node<T> node) |
| Modifier and Type | Method and Description |
|---|---|
boolean |
NodeList.addAll(Collection<? extends Node<T>> collection) |
boolean |
NodeList.addAll(int i,
Collection<? extends Node<T>> collection) |
static List<Point> |
Node.getCoordinates(Collection<Node<Record>> nodes) |
List<Node<T>> |
Graph.getNodes(Comparator<Node<T>> comparator) |
List<Node<T>> |
Graph.getNodes(Filter<Node<T>> filter) |
List<Node<T>> |
Graph.getNodes(Filter<Node<T>> filter,
BoundingBox envelope) |
List<Node<T>> |
Graph.getNodes(Filter<Node<T>> filter,
Comparator<Node<T>> comparator) |
List<Node<T>> |
Graph.getNodes(Filter<Node<T>> filter,
Comparator<Node<T>> comparator) |
List<Node<T>> |
Graph.getNodes(Filter<Node<T>> filter,
Comparator<Node<T>> comparator,
BoundingBox envelope) |
List<Node<T>> |
Graph.getNodes(Filter<Node<T>> filter,
Comparator<Node<T>> comparator,
BoundingBox envelope) |
void |
Graph.visitNodes(Filter<Node<T>> filter,
Comparator<Node<T>> comparator,
Visitor<Node<T>> visitor) |
void |
Graph.visitNodes(Filter<Node<T>> filter,
Comparator<Node<T>> comparator,
Visitor<Node<T>> visitor) |
void |
Graph.visitNodes(Filter<Node<T>> filter,
Comparator<Node<T>> comparator,
Visitor<Node<T>> visitor) |
void |
Graph.visitNodes(Filter<Node<T>> filter,
Visitor<Node<T>> visitor) |
void |
Graph.visitNodes(Filter<Node<T>> filter,
Visitor<Node<T>> visitor) |
void |
Graph.visitNodes(Visitor<Node<T>> visitor) |
void |
Graph.visitNodes(Visitor<Node<T>> visitor,
Comparator<Node<T>> comparator) |
void |
Graph.visitNodes(Visitor<Node<T>> visitor,
Comparator<Node<T>> comparator) |
| Constructor and Description |
|---|
Edge(int id,
Graph<T> graph,
Node<T> fromNode,
Node<T> toNode) |
Edge(int id,
Graph<T> graph,
Node<T> fromNode,
Node<T> toNode) |
| Modifier and Type | Method and Description |
|---|---|
static Set<Double> |
NodeAttributes.Methods.edgeAngles(Node<?> node) |
static Map<String,Set<Double>> |
NodeAttributes.Methods.edgeAnglesByType(Node<?> node) |
static Set<RecordDefinition> |
NodeAttributes.Methods.edgeRecordDefinitions(Node<?> node) |
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 Set<String> |
NodeAttributes.Methods.edgeTypeNames(Node<?> node) |
static Set<Double> |
NodeAttributes.getEdgeAngles(Node<?> node) |
static Map<String,Set<Double>> |
NodeAttributes.getEdgeAnglesByType(Node<?> node) |
static <T> Set<Double> |
NodeAttributes.getEdgeAnglesByType(Node<T> node,
String typePath) |
static Set<RecordDefinition> |
NodeAttributes.getEdgeRecordDefinitions(Node<? extends Object> 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) |
static Set<String> |
NodeAttributes.getEdgeTypeNames(Node<? extends Object> node) |
protected boolean |
PseudoNodeAttribute.isPseudoNode(Node<Record> node,
Map<LineString,Set<Edge<Record>>> edgesByLine) |
| Constructor and Description |
|---|
PseudoNodeAttribute(Node<Record> node,
String typePath,
Collection<String> equalExcludeAttributes) |
| Modifier and Type | Method and Description |
|---|---|
int |
NodeNumEdgeAnglesComparator.compare(Node<T> node1,
Node<T> node2) |
int |
NodeNumEdgeAnglesComparator.compare(Node<T> node1,
Node<T> node2) |
int |
NodeDistanceComparator.compare(Node<T> node1,
Node<T> node2) |
int |
NodeDistanceComparator.compare(Node<T> node1,
Node<T> node2) |
int |
NodeDegreeComparator.compare(Node<T> node1,
Node<T> node2) |
int |
NodeDegreeComparator.compare(Node<T> node1,
Node<T> node2) |
| Constructor and Description |
|---|
NodeDistanceComparator(Node<T> node) |
NodeDistanceComparator(Node<T> node,
boolean invert) |
| Modifier and Type | Method and Description |
|---|---|
Node<T> |
NodeEvent.getNode() |
| Modifier and Type | Method and Description |
|---|---|
void |
NodeEventListenerList.nodeEvent(Node<T> node,
String typePath,
String ruleName,
String action,
String notes) |
| Constructor and Description |
|---|
NodeEvent(Node<T> node) |
NodeEvent(Node<T> node,
String ruleName,
String action) |
NodeEvent(Node<T> node,
String typePath,
String ruleName,
String action,
String notes) |
| Modifier and Type | Method and Description |
|---|---|
boolean |
NodeMatchingEdgeFilter.accept(Node<T> node) |
boolean |
NodeGeometryIntersectionFilter.accept(Node<T> node) |
boolean |
NodeCoordinatesFilter.accept(Node<T> node) |
boolean |
IsPointOnLineEdgeFilter.accept(Node<T> node) |
| Constructor and Description |
|---|
EdgeHasNodeFilter(Node<T> node) |
| Modifier and Type | Method and Description |
|---|---|
void |
GeometryGraph.addEdge(Node<LineSegment> fromNode,
Node<LineSegment> toNode) |
void |
GeometryGraph.addEdge(Node<LineSegment> fromNode,
Node<LineSegment> toNode) |
| Modifier and Type | Method and Description |
|---|---|
Map<Edge<LineSegment>,List<Node<LineSegment>>> |
LineStringGraph.getPointsOnEdges(Graph<LineSegment> graph1,
double tolerance) |
| Modifier and Type | Method and Description |
|---|---|
boolean |
LineStringGraph.hasTouchingEdges(Node<LineSegment> node) |
void |
LineStringGraph.nodeMoved(Node<LineSegment> node,
Node<LineSegment> newNode) |
void |
LineStringGraph.nodeMoved(Node<LineSegment> node,
Node<LineSegment> newNode) |
| Modifier and Type | Method and Description |
|---|---|
Filter<Node<Record>> |
RecordPseudoNodeRemovalVisitor.getFilter() |
static <T> List<Node<T>> |
NodeWithinBoundingBoxVisitor.getNodes(Graph<T> graph,
BoundingBox boundingBox) |
static <T> List<Node<T>> |
NodeWithinDistanceOfGeometryVisitor.getNodes(Graph<T> graph,
Geometry geometry,
double maxDistance) |
static <T> List<Node<T>> |
NodeLessThanDistanceOfGeometryVisitor.getNodes(Graph<T> graph,
Geometry geometry,
double maxDistance) |
static <T> List<Node<T>> |
OnLineNodeVisitor.getNodes(Graph<T> graph,
LineString line,
double maxDistance) |
static <T> List<Node<T>> |
NodeLessThanDistanceOfCoordinatesVisitor.getNodes(Graph<T> graph,
Point point,
double maxDistance) |
| Modifier and Type | Method and Description |
|---|---|
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>> |
NodeOnEdgeVisitor.getEdges(Graph<T> graph,
Node<T> node,
double maxDistance) |
protected Edge<Record> |
RecordPseudoNodeRemovalVisitor.mergeEdges(Node<Record> node,
Edge<Record> edge1,
Edge<Record> edge2) |
protected Record |
RecordPseudoNodeRemovalVisitor.mergeObjects(Node<Record> node,
Record object1,
Record object2) |
void |
AbstractNodeListenerVisitor.nodeEvent(Node<T> node,
String typePath,
String ruleName,
String action,
String notes) |
void |
AbstractEdgeListenerVisitor.nodeEvent(Node<T> node,
String typePath,
String ruleName,
String action,
String notes) |
boolean |
MapPseudoNodeRemovalVisitor.visit(Node<Map<String,Object>> node) |
boolean |
RecordPseudoNodeRemovalVisitor.visit(Node<Record> node) |
boolean |
PolygonNodeRemovalVisitor.visit(Node<Record> node) |
boolean |
NodeRemovalVisitor.visit(Node<Record> node) |
boolean |
SplitEdgesOnNodeVisitor.visit(Node<T> node) |
boolean |
SplitEdgesCloseToNodeVisitor.visit(Node<T> node) |
boolean |
OnLineNodeVisitor.visit(Node<T> node) |
boolean |
NodeWithinDistanceOfGeometryVisitor.visit(Node<T> node) |
boolean |
NodeWithinDistanceOfCoordinateVisitor.visit(Node<T> node) |
boolean |
NodeWithinBoundingBoxVisitor.visit(Node<T> node) |
boolean |
NodeLessThanDistanceOfGeometryVisitor.visit(Node<T> node) |
boolean |
NodeLessThanDistanceOfCoordinatesVisitor.visit(Node<T> node) |
| Modifier and Type | Method and Description |
|---|---|
void |
RecordPseudoNodeRemovalVisitor.setFilter(Filter<Node<Record>> filter) |
| Constructor and Description |
|---|
EdgeLessThanDistanceToNodeVisitor(Node<T> node,
double maxDistance,
Visitor<Edge<T>> matchVisitor) |
NodeOnEdgeVisitor(Node<T> node,
BoundingBox boundingBox,
double maxDistance,
Visitor<Edge<T>> matchVisitor) |
| Constructor and Description |
|---|
NodeLessThanDistanceOfCoordinatesVisitor(Point coordinates,
double maxDistance,
Visitor<Node<T>> matchVisitor) |
NodeLessThanDistanceOfGeometryVisitor(Geometry geometry,
double maxDistance,
Visitor<Node<T>> matchVisitor) |
NodeWithinBoundingBoxVisitor(BoundingBox boundingBox,
Visitor<Node<T>> matchVisitor) |
NodeWithinDistanceOfCoordinateVisitor(Point coordinates,
double maxDistance,
Visitor<Node<T>> matchVisitor) |
NodeWithinDistanceOfGeometryVisitor(Geometry geometry,
double maxDistance,
Visitor<Node<T>> matchVisitor) |
OnLineNodeVisitor(LineString line,
Visitor<Node<T>> matchVisitor) |
| Modifier and Type | Method and Description |
|---|---|
static <T> boolean |
CoordinatesListUtil.movePointsWithinTolerance(Map<Point,Point> movedNodes,
Graph<T> graph2,
double maxDistance,
Node<T> node1)
Only move the node if there is one of them
|
Copyright © 2015 Revolution Systems Inc.. All rights reserved.