/** * @return turn flags of the specified node and edge properties. */ public long getTurnCostFlags(int edgeFrom, int nodeVia, int edgeTo) { if (edgeFrom == EdgeIterator.NO_EDGE || edgeTo == EdgeIterator.NO_EDGE) throw new IllegalArgumentException("from and to edge cannot be NO_EDGE"); if (nodeVia < 0) throw new IllegalArgumentException("via node cannot be negative"); return nextCostFlags(edgeFrom, nodeVia, edgeTo); }
/** * @return turn flags of the specified node and edge properties. */ public long getTurnCostFlags(int edgeFrom, int nodeVia, int edgeTo) { if (edgeFrom == EdgeIterator.NO_EDGE || edgeTo == EdgeIterator.NO_EDGE) throw new IllegalArgumentException("from and to edge cannot be NO_EDGE"); if (nodeVia < 0) throw new IllegalArgumentException("via node cannot be negative"); return nextCostFlags(edgeFrom, nodeVia, edgeTo); }
/** * @return turn flags of the specified node and edge properties. */ public long getTurnCostFlags(int edgeFrom, int nodeVia, int edgeTo) { if (edgeFrom == EdgeIterator.NO_EDGE || edgeTo == EdgeIterator.NO_EDGE) throw new IllegalArgumentException("from and to edge cannot be NO_EDGE"); if (nodeVia < 0) throw new IllegalArgumentException("via node cannot be negative"); return nextCostFlags(edgeFrom, nodeVia, edgeTo); }
/** * @return turn flags of the specified node and edge properties. */ public long getTurnCostFlags( int edgeFrom, int nodeVia, int edgeTo ) { if (edgeFrom == EdgeIterator.NO_EDGE || edgeTo == EdgeIterator.NO_EDGE) throw new IllegalArgumentException("from and to edge cannot be NO_EDGE"); if (nodeVia < 0) throw new IllegalArgumentException("via node cannot be negative"); return nextCostFlags(edgeFrom, nodeVia, edgeTo); }