@Override public boolean isBackward(FlagEncoder encoder) { return edges.get(current).isBackward(encoder); }
@Override public final boolean accept(EdgeIteratorState iter) { return fwd && iter.isForward(encoder) || bwd && iter.isBackward(encoder); }
@Override public final boolean accept(EdgeIteratorState iter) { boolean blocked = blockedEdges.contains(iter.getEdge()); return fwd && iter.isForward(encoder) && !blocked || bwd && iter.isBackward(encoder) && !blocked; }
private static void printUnitTestEdge(FlagEncoder flagEncoder, EdgeIteratorState edge) { boolean fwd = edge.isForward(flagEncoder); boolean bwd = edge.isBackward(flagEncoder); if (!fwd && !bwd) { return; } int from = fwd ? edge.getBaseNode() : edge.getAdjNode(); int to = fwd ? edge.getAdjNode() : edge.getBaseNode(); System.out.printf(Locale.ROOT, "graph.edge(%d, %d, %f, %s);\n", from, to, edge.getDistance(), fwd && bwd ? "true" : "false"); }
assertEquals(99.123, list.get(0).getSpeed(flags), 1e-3); assertTrue(edgeIter.isForward(list.get(0))); assertTrue(edgeIter.isBackward(list.get(0))); edge = graph.edge(2, 3); edge.setFlags(list.get(1).setProperties(44.123, true, false)); assertEquals(44.123, list.get(1).getReverseSpeed(flags), 1e-3); assertFalse(edgeIter.isForward(list.get(1))); assertTrue(edgeIter.isBackward(list.get(1)));
&& (Math.abs(sign) == Instruction.TURN_SLIGHT_RIGHT || Math.abs(sign) == Instruction.TURN_RIGHT || Math.abs(sign) == Instruction.TURN_SHARP_RIGHT) && (Math.abs(prevInstruction.getSign()) == Instruction.TURN_SLIGHT_RIGHT || Math.abs(prevInstruction.getSign()) == Instruction.TURN_RIGHT || Math.abs(prevInstruction.getSign()) == Instruction.TURN_SHARP_RIGHT) && edge.isForward(encoder) != edge.isBackward(encoder) && InstructionsHelper.isNameSimilar(prevInstructionName, name)) {
@Override public boolean isBackward( FlagEncoder encoder ) { return edges.get(current).isBackward(encoder); }
@Override public boolean isBackward(FlagEncoder encoder) { return edges.get(current).isBackward(encoder); }
@Override public boolean isBackward(FlagEncoder encoder) { return edges.get(current).isBackward(encoder); }
@Override public final boolean accept( EdgeIteratorState iter ) { return out && iter.isForward(encoder) || in && iter.isBackward(encoder); }
@Override public final boolean accept(EdgeIteratorState iter) { return fwd && iter.isForward(encoder) || bwd && iter.isBackward(encoder); }
@Override public final boolean accept(EdgeIteratorState iter) { return fwd && iter.isForward(encoder) || bwd && iter.isBackward(encoder); }
@Override public final boolean accept(EdgeIteratorState iter) { boolean blocked = blockedEdges.contains(iter.getEdge()); return fwd && iter.isForward(encoder) && !blocked || bwd && iter.isBackward(encoder) && !blocked; }
@Override public final boolean accept(EdgeIteratorState iter) { boolean blocked = blockedEdges.contains(iter.getEdge()); return fwd && iter.isForward(encoder) && !blocked || bwd && iter.isBackward(encoder) && !blocked; }
private static void printUnitTestEdge(FlagEncoder flagEncoder, EdgeIteratorState edge) { boolean fwd = edge.isForward(flagEncoder); boolean bwd = edge.isBackward(flagEncoder); if (!fwd && !bwd) { return; } int from = fwd ? edge.getBaseNode() : edge.getAdjNode(); int to = fwd ? edge.getAdjNode() : edge.getBaseNode(); System.out.printf(Locale.ROOT, "graph.edge(%d, %d, %f, %s);\n", from, to, edge.getDistance(), fwd && bwd ? "true" : "false"); }
&& (Math.abs(sign) == Instruction.TURN_SLIGHT_RIGHT || Math.abs(sign) == Instruction.TURN_RIGHT || Math.abs(sign) == Instruction.TURN_SHARP_RIGHT) && (Math.abs(prevInstruction.getSign()) == Instruction.TURN_SLIGHT_RIGHT || Math.abs(prevInstruction.getSign()) == Instruction.TURN_RIGHT || Math.abs(prevInstruction.getSign()) == Instruction.TURN_SHARP_RIGHT) && edge.isForward(encoder) != edge.isBackward(encoder) && InstructionsHelper.isNameSimilar(prevInstructionName, name)) {