Codota Logo
ReadOnlyRelation
Code IndexAdd Codota to your IDE (free)

How to use
ReadOnlyRelation
in
com.ohmdb.abstracts

Best Java code snippets using com.ohmdb.abstracts.ReadOnlyRelation (Showing top 11 results out of 315)

  • Add the Codota plugin to your IDE and get smart completions
private void myMethod () {
SimpleDateFormat s =
  • Codota IconString pattern;new SimpleDateFormat(pattern)
  • Codota IconString template;Locale locale;new SimpleDateFormat(template, locale)
  • Codota Iconnew SimpleDateFormat()
  • Smart code suggestions by Codota
}
origin: ohmdb/ohmdb

public String details() {
  return "[#" + index + " " + mode + " " + rel.name() + " (" + from + "/" + from2 + "->" + to + "/" + to2 + ")";
}
origin: com.gitblit.ohmdb/ohmdb-core

int fromN = join.rel.fromSize();
if (minSize >= fromN && inner(join.mode)) {
  minSize = fromN;
int toN = join.rel.toSize();
if (minSize >= toN && inner(join.mode)) {
  minSize = toN;
  Numbers ids = minJoin.rel.froms();
  sides[minJoin.from].futureIds = IDS.futureIds(ids);
} else {
  Numbers ids = minJoin.rel.tos();
  sides[minJoin.to].futureIds = IDS.futureIds(ids);
origin: com.gitblit.ohmdb/ohmdb

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();
}
origin: com.gitblit.ohmdb/ohmdb-core

@Override
public Numbers reach(long[] combo, int level, FutureIds futureIds) {
  Numbers src = futureIds.optional() ? null : futureIds.fetch();
  for (JoinBridgeRel bridgeRel : fromRels) {
    long id = combo[bridgeRel.index];
    Numbers filter = bridgeRel.rel.linksTo(id);
    src = inter(src, filter);
  }
  for (JoinBridgeRel bridgeRel : toRels) {
    long id = combo[bridgeRel.index];
    Numbers filter = bridgeRel.rel.linksFrom(id);
    src = inter(src, filter);
  }
  if (src == null) {
    src = futureIds.fetch();
  }
  return src;
}
origin: ohmdb/ohmdb

int fromN = join.rel.fromSize();
if (minSize >= fromN && inner(join.mode)) {
  minSize = fromN;
int toN = join.rel.toSize();
if (minSize >= toN && inner(join.mode)) {
  minSize = toN;
  Numbers ids = minJoin.rel.froms();
  sides[minJoin.from].futureIds = IDS.futureIds(ids);
} else {
  Numbers ids = minJoin.rel.tos();
  sides[minJoin.to].futureIds = IDS.futureIds(ids);
origin: com.gitblit.ohmdb/ohmdb-core

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();
}
origin: com.gitblit.ohmdb/ohmdb

@Override
public Numbers reach(long[] combo, int level, FutureIds futureIds) {
  Numbers src = futureIds.optional() ? null : futureIds.fetch();
  for (JoinBridgeRel bridgeRel : fromRels) {
    long id = combo[bridgeRel.index];
    Numbers filter = bridgeRel.rel.linksTo(id);
    src = inter(src, filter);
  }
  for (JoinBridgeRel bridgeRel : toRels) {
    long id = combo[bridgeRel.index];
    Numbers filter = bridgeRel.rel.linksFrom(id);
    src = inter(src, filter);
  }
  if (src == null) {
    src = futureIds.fetch();
  }
  return src;
}
origin: com.gitblit.ohmdb/ohmdb

int fromN = join.rel.fromSize();
if (minSize >= fromN && inner(join.mode)) {
  minSize = fromN;
int toN = join.rel.toSize();
if (minSize >= toN && inner(join.mode)) {
  minSize = toN;
  Numbers ids = minJoin.rel.froms();
  sides[minJoin.from].futureIds = IDS.futureIds(ids);
} else {
  Numbers ids = minJoin.rel.tos();
  sides[minJoin.to].futureIds = IDS.futureIds(ids);
origin: ohmdb/ohmdb

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();
}
origin: ohmdb/ohmdb

@Override
public Numbers reach(long[] combo, int level, FutureIds futureIds) {
  Numbers src = futureIds.optional() ? null : futureIds.fetch();
  for (JoinBridgeRel bridgeRel : fromRels) {
    long id = combo[bridgeRel.index];
    Numbers filter = bridgeRel.rel.linksTo(id);
    src = inter(src, filter);
  }
  for (JoinBridgeRel bridgeRel : toRels) {
    long id = combo[bridgeRel.index];
    Numbers filter = bridgeRel.rel.linksFrom(id);
    src = inter(src, filter);
  }
  if (src == null) {
    src = futureIds.fetch();
  }
  return src;
}
origin: ohmdb/ohmdb

@Override
public String toString() {
  return mode + "(#" + from + " " + rel.name() + " #" + to + ")";
}
com.ohmdb.abstractsReadOnlyRelation

Most used methods

  • fromSize
  • froms
  • hasLink
  • linksFrom
  • linksTo
  • toSize
  • tos
  • name

Popular in Java

  • Running tasks concurrently on multiple threads
  • getSystemService (Context)
  • getContentResolver (Context)
  • orElseThrow (Optional)
  • ArrayList (java.util)
    Resizable-array implementation of the List interface. Implements all optional list operations, and p
  • Collection (java.util)
    Collection is the root of the collection hierarchy. It defines operations on data collections and t
  • UUID (java.util)
    UUID is an immutable representation of a 128-bit universally unique identifier (UUID). There are mul
  • BlockingQueue (java.util.concurrent)
    A java.util.Queue that additionally supports operations that wait for the queue to become non-empty
  • JTextField (javax.swing)
  • StringUtils (org.apache.commons.lang)
    Operations on java.lang.String that arenull safe. * IsEmpty/IsBlank - checks if a String contains
Codota Logo
  • Products

    Search for Java codeSearch for JavaScript codeEnterprise
  • IDE Plugins

    IntelliJ IDEAWebStormAndroid StudioEclipseVisual Studio CodePyCharmSublime TextPhpStormVimAtomGoLandRubyMineEmacsJupyter
  • Company

    About UsContact UsCareers
  • Resources

    FAQBlogCodota Academy Plugin user guide Terms of usePrivacy policyJava Code IndexJavascript Code Index
Get Codota for your IDE now