@Override public int getAdditionalNodeField(int nodeId) { if (isVirtualNode(nodeId)) return 0; return mainNodeAccess.getAdditionalNodeField(nodeId); }
private long nextCostFlags(int edgeFrom, int nodeVia, int edgeTo) { int turnCostIndex = nodeAccess.getAdditionalNodeField(nodeVia); int i = 0; for (; i < 1000; i++) { if (turnCostIndex == NO_TURN_ENTRY) break; long turnCostPtr = (long) turnCostIndex * turnCostsEntryBytes; if (edgeFrom == turnCosts.getInt(turnCostPtr + TC_FROM)) { if (edgeTo == turnCosts.getInt(turnCostPtr + TC_TO)) return turnCosts.getInt(turnCostPtr + TC_FLAGS); } int nextTurnCostIndex = turnCosts.getInt(turnCostPtr + TC_NEXT); if (nextTurnCostIndex == turnCostIndex) throw new IllegalStateException("something went wrong: next entry would be the same"); turnCostIndex = nextTurnCostIndex; } // so many turn restrictions on one node? here is something wrong if (i >= 1000) throw new IllegalStateException("something went wrong: there seems to be no end of the turn cost-list!?"); return EMPTY_FLAGS; }
int previousEntryIndex = nodeAccess.getAdditionalNodeField(viaNode); if (previousEntryIndex == NO_TURN_ENTRY) {
@Override public int getAdditionalNodeField( int nodeId ) { if (isVirtualNode(nodeId)) return 0; return mainNodeAccess.getAdditionalNodeField(nodeId); }
@Override public int getAdditionalNodeField(int nodeId) { if (isVirtualNode(nodeId)) return 0; return mainNodeAccess.getAdditionalNodeField(nodeId); }
@Override public int getAdditionalNodeField(int nodeId) { if (isVirtualNode(nodeId)) return 0; return mainNodeAccess.getAdditionalNodeField(nodeId); }
private long nextCostFlags(int edgeFrom, int nodeVia, int edgeTo) { int turnCostIndex = nodeAccess.getAdditionalNodeField(nodeVia); int i = 0; for (; i < 1000; i++) { if (turnCostIndex == NO_TURN_ENTRY) break; long turnCostPtr = (long) turnCostIndex * turnCostsEntryBytes; if (edgeFrom == turnCosts.getInt(turnCostPtr + TC_FROM)) { if (edgeTo == turnCosts.getInt(turnCostPtr + TC_TO)) return turnCosts.getInt(turnCostPtr + TC_FLAGS); } int nextTurnCostIndex = turnCosts.getInt(turnCostPtr + TC_NEXT); if (nextTurnCostIndex == turnCostIndex) throw new IllegalStateException("something went wrong: next entry would be the same"); turnCostIndex = nextTurnCostIndex; } // so many turn restrictions on one node? here is something wrong if (i > 1000) throw new IllegalStateException("something went wrong: there seems to be no end of the turn cost-list!?"); return EMPTY_FLAGS; }
private long nextCostFlags(int edgeFrom, int nodeVia, int edgeTo) { int turnCostIndex = nodeAccess.getAdditionalNodeField(nodeVia); int i = 0; for (; i < 1000; i++) { if (turnCostIndex == NO_TURN_ENTRY) break; long turnCostPtr = (long) turnCostIndex * turnCostsEntryBytes; if (edgeFrom == turnCosts.getInt(turnCostPtr + TC_FROM)) { if (edgeTo == turnCosts.getInt(turnCostPtr + TC_TO)) return turnCosts.getInt(turnCostPtr + TC_FLAGS); } int nextTurnCostIndex = turnCosts.getInt(turnCostPtr + TC_NEXT); if (nextTurnCostIndex == turnCostIndex) throw new IllegalStateException("something went wrong: next entry would be the same"); turnCostIndex = nextTurnCostIndex; } // so many turn restrictions on one node? here is something wrong if (i >= 1000) throw new IllegalStateException("something went wrong: there seems to be no end of the turn cost-list!?"); return EMPTY_FLAGS; }
private long nextCostFlags( int edgeFrom, int nodeVia, int edgeTo ) { int turnCostIndex = nodeAccess.getAdditionalNodeField(nodeVia); int i = 0; for (; i < 1000; i++) { if (turnCostIndex == NO_TURN_ENTRY) break; long turnCostPtr = (long) turnCostIndex * turnCostsEntryBytes; if (edgeFrom == turnCosts.getInt(turnCostPtr + TC_FROM)) { if (edgeTo == turnCosts.getInt(turnCostPtr + TC_TO)) return turnCosts.getInt(turnCostPtr + TC_FLAGS); } int nextTurnCostIndex = turnCosts.getInt(turnCostPtr + TC_NEXT); if (nextTurnCostIndex == turnCostIndex) throw new IllegalStateException("something went wrong: next entry would be the same"); turnCostIndex = nextTurnCostIndex; } // so many turn restrictions on one node? here is something wrong if (i > 1000) throw new IllegalStateException("something went wrong: there seems to be no end of the turn cost-list!?"); return EMPTY_FLAGS; }
int previousEntryIndex = nodeAccess.getAdditionalNodeField(viaNode); if (previousEntryIndex == NO_TURN_ENTRY) {
int previousEntryIndex = nodeAccess.getAdditionalNodeField(viaNode); if (previousEntryIndex == NO_TURN_ENTRY)
int previousEntryIndex = nodeAccess.getAdditionalNodeField(viaNode); if (previousEntryIndex == NO_TURN_ENTRY) {