public boolean removeInEdge(final Edge edge) { final boolean removed = _inEdges.removeEdge(edge); if (!removed) throw new InternalReasonerException("Trying to remove a non-existing edge " + edge); return true; }
public boolean removeInEdge(final Edge edge) { final boolean removed = _inEdges.removeEdge(edge); if (!removed) throw new InternalReasonerException("Trying to remove a non-existing edge " + edge); return true; }
final public boolean removeEdge(final Edge edge) { final boolean removed = _outEdges.removeEdge(edge); if (!removed) throw new InternalReasonerException("Trying to remove a non-existing edge " + edge); return true; }
final public boolean removeEdge(final Edge edge) { final boolean removed = _outEdges.removeEdge(edge); if (!removed) throw new InternalReasonerException("Trying to remove a non-existing edge " + edge); return true; }
/** * Remove an element by replacing it by the last element. Order isn't preserved. * * @param edge to remove * @return true if removing occured */ public boolean removeEdge(final Edge edge) { for (int i = 0, l = size(); i < l; i++) if (get(i).equals(edge)) { removeEdge(i); return true; } return false; }
/** * Remove an element by replacing it by the last element. Order isn't preserved. * * @param edge to remove * @return true if removing occured */ public boolean removeEdge(final Edge edge) { for (int i = 0, l = size(); i < l; i++) if (get(i).equals(edge)) { removeEdge(i); return true; } return false; }
/** * Resets the edges in this list to only asserted edges. */ public void reset() { for (int i = 0; i < size(); i++) { final Edge e = get(i); if (e.getDepends().getBranch() != DependencySet.NO_BRANCH) removeEdge(i--); } } }
/** * Resets the edges in this list to only asserted edges. */ public void reset() { for (int i = 0; i < size(); i++) { final Edge e = get(i); if (e.getDepends().getBranch() != DependencySet.NO_BRANCH) removeEdge(i--); } } }