final EdgeIteratorState getEdgeProps(int edgeId, int adjNode) { if (edgeId <= EdgeIterator.NO_EDGE) throw new IllegalStateException("edgeId invalid " + edgeId + ", " + this); BaseGraph.EdgeIterable edge = createSingleEdge(EdgeFilter.ALL_EDGES); if (edge.init(edgeId, adjNode)) return edge; // if edgeId exists but adjacent nodes do not match return null; } }
@Override public EdgeIteratorState detach(boolean reverseArg) { if (edgeId == nextEdgeId || edgeId == EdgeIterator.NO_EDGE) throw new IllegalStateException("call next before detaching or setEdgeId (edgeId:" + edgeId + " vs. next " + nextEdgeId + ")"); EdgeIterable iter = edgeAccess.createSingleEdge(filter); boolean ret; if (reverseArg) { ret = iter.init(edgeId, baseNode); // for #162 iter.reverse = !reverse; } else ret = iter.init(edgeId, adjNode); assert ret; return iter; } }
final EdgeIteratorState getEdgeProps(int edgeId, int adjNode) { if (edgeId <= EdgeIterator.NO_EDGE) throw new IllegalStateException("edgeId invalid " + edgeId + ", " + this); BaseGraph.EdgeIterable edge = createSingleEdge(EdgeFilter.ALL_EDGES); if (edge.init(edgeId, adjNode)) return edge; // if edgeId exists but adjacent nodes do not match return null; } }
final EdgeIteratorState getEdgeProps( int edgeId, int adjNode ) { if (edgeId <= EdgeIterator.NO_EDGE) throw new IllegalStateException("edgeId invalid " + edgeId + ", " + this); BaseGraph.EdgeIterable edge = createSingleEdge(EdgeFilter.ALL_EDGES); if (edge.init(edgeId, adjNode)) return edge; // if edgeId exists but adjacent nodes do not match return null; } }
final EdgeIteratorState getEdgeProps(int edgeId, int adjNode) { if (edgeId <= EdgeIterator.NO_EDGE) throw new IllegalStateException("edgeId invalid " + edgeId + ", " + this); BaseGraph.EdgeIterable edge = createSingleEdge(EdgeFilter.ALL_EDGES); if (edge.init(edgeId, adjNode)) return edge; // if edgeId exists but adjacent nodes do not match return null; } }
@Override public EdgeIteratorState detach(boolean reverseArg) { if (edgeId == nextEdgeId || edgeId == EdgeIterator.NO_EDGE) throw new IllegalStateException("call next before detaching or setEdgeId (edgeId:" + edgeId + " vs. next " + nextEdgeId + ")"); EdgeIterable iter = edgeAccess.createSingleEdge(filter); boolean ret; if (reverseArg) { ret = iter.init(edgeId, baseNode); // for #162 iter.reverse = !reverse; } else ret = iter.init(edgeId, adjNode); assert ret; return iter; } }
@Override public EdgeIteratorState detach(boolean reverseArg) { if (edgeId == nextEdgeId || edgeId == EdgeIterator.NO_EDGE) throw new IllegalStateException("call next before detaching or setEdgeId (edgeId:" + edgeId + " vs. next " + nextEdgeId + ")"); EdgeIterable iter = edgeAccess.createSingleEdge(filter); boolean ret; if (reverseArg) { ret = iter.init(edgeId, baseNode); // for #162 iter.reverse = !reverse; } else ret = iter.init(edgeId, adjNode); assert ret; return iter; } }
@Override public EdgeIteratorState detach( boolean reverseArg ) { if (edgeId == nextEdgeId || edgeId == EdgeIterator.NO_EDGE) throw new IllegalStateException("call next before detaching or setEdgeId (edgeId:" + edgeId + " vs. next " + nextEdgeId + ")"); EdgeIterable iter = edgeAccess.createSingleEdge(filter); boolean ret; if (reverseArg) { ret = iter.init(edgeId, baseNode); // for #162 iter.reverse = !reverse; } else ret = iter.init(edgeId, adjNode); assert ret; return iter; } }