How to use

values

method

in

it.unimi.dsi.fastutil.ints.Int2ObjectSortedMap

public Selection lessThan(int value) {
  Selection selection = new BitmapBackedSelection();
  Int2ObjectSortedMap<IntArrayList> head = index.headMap(value);  // we add 1 to get values equal to the arg
  for (IntArrayList keys : head.values()) {
    addAllToSelection(keys, selection);
  }
  return selection;
}

public Selection atMost(int value) {
  Selection selection = new BitmapBackedSelection();
  Int2ObjectSortedMap<IntArrayList> head = index.headMap(value + 1);  // we add 1 to get values equal to the arg
  for (IntArrayList keys : head.values()) {
    addAllToSelection(keys, selection);
  }
  return selection;
}

public Selection atLeast(int value) {
  Selection selection = new BitmapBackedSelection();
  Int2ObjectSortedMap<IntArrayList> tail = index.tailMap(value);
  for (IntArrayList keys : tail.values()) {
    addAllToSelection(keys, selection);
  }
  return selection;
}

public Selection greaterThan(int value) {
  Selection selection = new BitmapBackedSelection();
  Int2ObjectSortedMap<IntArrayList> tail = index.tailMap(value + 1);
  for (IntArrayList keys : tail.values()) {
    addAllToSelection(keys, selection);
  }
  return selection;
}

public Selection lessThan(int value) {
  Selection selection = new BitmapBackedSelection();
  Int2ObjectSortedMap<IntArrayList> head = index.headMap(value); // we add 1 to get values equal to the arg
  for (IntArrayList keys : head.values()) {
    addAllToSelection(keys, selection);
  }
  return selection;
}

public Selection greaterThan(int value) {
  Selection selection = new BitmapBackedSelection();
  Int2ObjectSortedMap<IntArrayList> tail = index.tailMap(value + 1);
  for (IntArrayList keys : tail.values()) {
    addAllToSelection(keys, selection);
  }
  return selection;
}

public Selection greaterThan(int value) {
  Selection selection = new BitmapBackedSelection();
  Int2ObjectSortedMap<IntArrayList> tail = index.tailMap(value + 1);
  for (IntArrayList keys : tail.values()) {
    addAllToSelection(keys, selection);
  }
  return selection;
}

public Selection atMost(int value) {
  Selection selection = new BitmapBackedSelection();
  Int2ObjectSortedMap<IntArrayList> head = index.headMap(value + 1);  // we add 1 to get values equal to the arg
  for (IntArrayList keys : head.values()) {
    addAllToSelection(keys, selection);
  }
  return selection;
}

public Selection atLeast(int value) {
  Selection selection = new BitmapBackedSelection();
  Int2ObjectSortedMap<IntArrayList> tail = index.tailMap(value);
  for (IntArrayList keys : tail.values()) {
    addAllToSelection(keys, selection);
  }
  return selection;
}

public Selection atMost(int value) {
  Selection selection = new BitmapBackedSelection();
  Int2ObjectSortedMap<IntArrayList> head = index.headMap(value + 1); // we add 1 to get values equal to the arg
  for (IntArrayList keys : head.values()) {
    addAllToSelection(keys, selection);
  }
  return selection;
}

public Selection atLeast(int value) {
  Selection selection = new BitmapBackedSelection();
  Int2ObjectSortedMap<IntArrayList> tail = index.tailMap(value);
  for (IntArrayList keys : tail.values()) {
    addAllToSelection(keys, selection);
  }
  return selection;
}

public Selection lessThan(int value) {
  Selection selection = new BitmapBackedSelection();
  Int2ObjectSortedMap<IntArrayList> head = index.headMap(value);  // we add 1 to get values equal to the arg
  for (IntArrayList keys : head.values()) {
    addAllToSelection(keys, selection);
  }
  return selection;
}

/**
 * Returns the memoized predecessor of the given path
 * @return predecessor node, null if no single predecessor is defined for the entire interval 
 */
public KmerPathNode getParent(KmerPathNode node, int start, int end) {
  AbstractInt2ObjectSortedMap<TraversalNode> cache = memoized.get(node);
  Iterator<TraversalNode> it = cache.tailMap(start).values().iterator();
  if (it.hasNext()) {
    TraversalNode existing = it.next();
    if (existing.node.firstStart() <= start && existing.node.firstEnd() >= end) {
      if (existing.parent != null) {
        return existing.parent.node.node();
      }
    }
  }
  return null;
}
/**

private void memoize_fastutil_sortedmap(TraversalNode node, AbstractInt2ObjectSortedMap<TraversalNode> cache) {
  KmerPathSubnode sn = node.node;
  Iterator<TraversalNode> it = cache.tailMap(sn.firstStart()).values().iterator();