private boolean match2(AJoin[] joins, LinksBuilder[] builders, JoinSide[] sides, boolean exists) { long[] combo = new long[2]; JoinSide side1 = sides[1]; Numbers src0 = sides[0].futureIds.fetch(); for (int i0 = -1; i0 < src0.size(); i0++) { combo[0] = i0 < 0 ? -1 : src0.at(i0); Numbers src1 = side1.bridge.reach(combo, 1, sides[1].futureIds); for (int i1 = -1; i1 < src1.size(); i1++) { combo[1] = i1 < 0 ? -1 : src1.at(i1); if (check(joins, combo, builders, sides, exists) && exists) { return true; } } } return false; }
private boolean link_(long from, long to) { // nice("LINK " + from + ":" + to + " ::: " + name + " : " // + trees.str(left)); Numbers leftLinks = leftNums(from); if (leftLinks.contains(to)) { return false; } // nice("LINK2 " + from + ":" + to + " ::: " + name + // " : " + trees.str(left)); Check.state(manyTos || leftLinks.size() == 0, "The ?-to-one relation %s already has link from %s", name, from); leftLinks = leftLinks.with(to); left.put(from, leftLinks); Numbers rightLinks = rightNums(to); if (!symmetric) { assert !rightLinks.contains(from); } Check.state(manyFroms || rightLinks.size() == 0, "The one-to-? relation %s already has link to %s", name, to); rightLinks = rightLinks.with(from); rightish().put(to, rightLinks); 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; }
@Override public int size() { return ids.size(); }
@Override public boolean hasLink(long from, long to) { try { // READ LOCK locker.globalReadLock(); return leftNums(from).contains(to); } finally { // READ UNLOCK locker.globalReadUnlock(); } }
private boolean has(AJoin join, long[] combo, JoinSide[] sides) { long from = combo[join.from2]; long to = combo[join.to2]; FutureIds fromIds = sides[join.from2].futureIds; FutureIds toIds = sides[join.to2].futureIds; Numbers filterFroms = fromIds.optional() ? null : fromIds.fetch(); Numbers filterTos = toIds.optional() ? null : toIds.fetch(); boolean lefty = to == -1 && from >= 0 && (filterTos == null || !join.rel.linksFrom(from).hasAny(filterTos)); boolean righty = from == -1 && to >= 0 && (filterFroms == null || !join.rel.linksTo(to).hasAny(filterFroms)); boolean linked = join.rel.hasLink(from, to); switch (join.mode) { case INNER: return hasInfo(linked, from, to, join.rel); case LEFT_OUTER: return hasInfo(U.xor(lefty, linked), from, to, join.rel); case RIGHT_OUTER: return hasInfo(U.xor(righty, linked), from, to, join.rel); case FULL_OUTER: return hasInfo(U.xor(U.xor(lefty, righty), linked), from, to, join.rel); } throw Errors.notExpected(); }
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; }
@Override public boolean hasLink(long from, long to) { try { // READ LOCK locker.globalReadLock(); return leftNums(from).contains(to); } finally { // READ UNLOCK locker.globalReadUnlock(); } }
private boolean has(AJoin join, long[] combo, JoinSide[] sides) { long from = combo[join.from2]; long to = combo[join.to2]; FutureIds fromIds = sides[join.from2].futureIds; FutureIds toIds = sides[join.to2].futureIds; Numbers filterFroms = fromIds.optional() ? null : fromIds.fetch(); Numbers filterTos = toIds.optional() ? null : toIds.fetch(); boolean lefty = to == -1 && from >= 0 && (filterTos == null || !join.rel.linksFrom(from).hasAny(filterTos)); boolean righty = from == -1 && to >= 0 && (filterFroms == null || !join.rel.linksTo(to).hasAny(filterFroms)); boolean linked = join.rel.hasLink(from, to); switch (join.mode) { case INNER: return hasInfo(linked, from, to, join.rel); case LEFT_OUTER: return hasInfo(U.xor(lefty, linked), from, to, join.rel); case RIGHT_OUTER: return hasInfo(U.xor(righty, linked), from, to, join.rel); case FULL_OUTER: return hasInfo(U.xor(U.xor(lefty, righty), linked), from, to, join.rel); } throw Errors.notExpected(); }
public static Set<Long> set(Numbers numbers) { long[] nums = numbers.toArray(); Set<Long> set = new HashSet<Long>(); for (Long num : nums) { set.add(num); } return set; }
private boolean match2(AJoin[] joins, LinksBuilder[] builders, JoinSide[] sides, boolean exists) { long[] combo = new long[2]; JoinSide side1 = sides[1]; Numbers src0 = sides[0].futureIds.fetch(); for (int i0 = -1; i0 < src0.size(); i0++) { combo[0] = i0 < 0 ? -1 : src0.at(i0); Numbers src1 = side1.bridge.reach(combo, 1, sides[1].futureIds); for (int i1 = -1; i1 < src1.size(); i1++) { combo[1] = i1 < 0 ? -1 : src1.at(i1); if (check(joins, combo, builders, sides, exists) && exists) { return true; } } } return false; }
private boolean link_(long from, long to) { // nice("LINK " + from + ":" + to + " ::: " + name + " : " // + trees.str(left)); Numbers leftLinks = leftNums(from); if (leftLinks.contains(to)) { return false; } // nice("LINK2 " + from + ":" + to + " ::: " + name + // " : " + trees.str(left)); Check.state(manyTos || leftLinks.size() == 0, "The ?-to-one relation %s already has link from %s", name, from); leftLinks = leftLinks.with(to); left.put(from, leftLinks); Numbers rightLinks = rightNums(to); if (!symmetric) { assert !rightLinks.contains(from); } Check.state(manyFroms || rightLinks.size() == 0, "The one-to-? relation %s already has link to %s", name, to); rightLinks = rightLinks.with(from); rightish().put(to, rightLinks); 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; }
@Override public boolean hasLink(long from, long to) { try { // READ LOCK locker.globalReadLock(); return leftNums(from).contains(to); } finally { // READ UNLOCK locker.globalReadUnlock(); } }
private boolean has(AJoin join, long[] combo, JoinSide[] sides) { long from = combo[join.from2]; long to = combo[join.to2]; FutureIds fromIds = sides[join.from2].futureIds; FutureIds toIds = sides[join.to2].futureIds; Numbers filterFroms = fromIds.optional() ? null : fromIds.fetch(); Numbers filterTos = toIds.optional() ? null : toIds.fetch(); boolean lefty = to == -1 && from >= 0 && (filterTos == null || !join.rel.linksFrom(from).hasAny(filterTos)); boolean righty = from == -1 && to >= 0 && (filterFroms == null || !join.rel.linksTo(to).hasAny(filterFroms)); boolean linked = join.rel.hasLink(from, to); switch (join.mode) { case INNER: return hasInfo(linked, from, to, join.rel); case LEFT_OUTER: return hasInfo(U.xor(lefty, linked), from, to, join.rel); case RIGHT_OUTER: return hasInfo(U.xor(righty, linked), from, to, join.rel); case FULL_OUTER: return hasInfo(U.xor(U.xor(lefty, righty), linked), from, to, join.rel); } throw Errors.notExpected(); }
private List<long[]> export(SortedMap<Long, Numbers> map) { List<long[]> links = new ArrayList<long[]>(); for (Entry<Long, Numbers> entry : map.entrySet()) { long key = entry.getKey(); long[] arr = entry.getValue().toArray(); for (long x : arr) { links.add(new long[] { key, x }); } } return links; }
private boolean match2(AJoin[] joins, LinksBuilder[] builders, JoinSide[] sides, boolean exists) { long[] combo = new long[2]; JoinSide side1 = sides[1]; Numbers src0 = sides[0].futureIds.fetch(); for (int i0 = -1; i0 < src0.size(); i0++) { combo[0] = i0 < 0 ? -1 : src0.at(i0); Numbers src1 = side1.bridge.reach(combo, 1, sides[1].futureIds); for (int i1 = -1; i1 < src1.size(); i1++) { combo[1] = i1 < 0 ? -1 : src1.at(i1); if (check(joins, combo, builders, sides, exists) && exists) { return true; } } } return false; }
private boolean link_(long from, long to) { // nice("LINK " + from + ":" + to + " ::: " + name + " : " // + trees.str(left)); Numbers leftLinks = leftNums(from); if (leftLinks.contains(to)) { return false; } // nice("LINK2 " + from + ":" + to + " ::: " + name + // " : " + trees.str(left)); Check.state(manyTos || leftLinks.size() == 0, "The ?-to-one relation %s already has link from %s", name, from); leftLinks = leftLinks.with(to); left.put(from, leftLinks); Numbers rightLinks = rightNums(to); if (!symmetric) { assert !rightLinks.contains(from); } Check.state(manyFroms || rightLinks.size() == 0, "The one-to-? relation %s already has link to %s", name, to); rightLinks = rightLinks.with(from); rightish().put(to, rightLinks); return true; }
private List<long[]> export(SortedMap<Long, Numbers> map) { List<long[]> links = new ArrayList<long[]>(); for (Entry<Long, Numbers> entry : map.entrySet()) { long key = entry.getKey(); long[] arr = entry.getValue().toArray(); for (long x : arr) { links.add(new long[] { key, x }); } } return links; }