private boolean delink_(long from, long to) { // nice("DELINK " + from + ":" + to + " ::: " + name + // " : " + trees.str(left)); Numbers leftLinks = leftNums(from); if (!leftLinks.contains(to)) { return false; } // nice("DELINK2 " + from + ":" + to + " ::: " + name + // " : " + trees.str(left)); leftLinks = leftLinks.without(to); if (leftLinks.size() > 0) { left.put(from, leftLinks); } else { left.remove(from); } Numbers rightLinks = rightNums(to); if (!symmetric) { assert rightLinks.contains(from); } rightLinks = rightLinks.without(from); if (rightLinks.size() > 0) { rightish().put(to, rightLinks); } else { rightish().remove(to); } return true; }
private boolean delink_(long from, long to) { // nice("DELINK " + from + ":" + to + " ::: " + name + // " : " + trees.str(left)); Numbers leftLinks = leftNums(from); if (!leftLinks.contains(to)) { return false; } // nice("DELINK2 " + from + ":" + to + " ::: " + name + // " : " + trees.str(left)); leftLinks = leftLinks.without(to); if (leftLinks.size() > 0) { left.put(from, leftLinks); } else { left.remove(from); } Numbers rightLinks = rightNums(to); if (!symmetric) { assert rightLinks.contains(from); } rightLinks = rightLinks.without(from); if (rightLinks.size() > 0) { rightish().put(to, rightLinks); } else { rightish().remove(to); } return true; }
private boolean delink_(long from, long to) { // nice("DELINK " + from + ":" + to + " ::: " + name + // " : " + trees.str(left)); Numbers leftLinks = leftNums(from); if (!leftLinks.contains(to)) { return false; } // nice("DELINK2 " + from + ":" + to + " ::: " + name + // " : " + trees.str(left)); leftLinks = leftLinks.without(to); if (leftLinks.size() > 0) { left.put(from, leftLinks); } else { left.remove(from); } Numbers rightLinks = rightNums(to); if (!symmetric) { assert rightLinks.contains(from); } rightLinks = rightLinks.without(from); if (rightLinks.size() > 0) { rightish().put(to, rightLinks); } else { rightish().remove(to); } return true; }