Codota Logo
IntArray.get
Code IndexAdd Codota to your IDE (free)

How to use
get
method
in
org.h2.util.IntArray

Best Java code snippets using org.h2.util.IntArray.get (Showing top 20 results out of 315)

  • Common ways to obtain IntArray
private void myMethod () {
IntArray i =
  • Codota Iconnew IntArray()
  • Smart code suggestions by Codota
}
origin: apache/ignite

/**
 *
 * @param partsMap Partitions map.
 * @param parts Partitions.
 * @return Result.
 */
private static Map<ClusterNode, IntArray> narrowForQuery(Map<ClusterNode, IntArray> partsMap, int[] parts) {
  if (parts == null)
    return partsMap;
  Map<ClusterNode, IntArray> cp = U.newHashMap(partsMap.size());
  for (Map.Entry<ClusterNode, IntArray> entry : partsMap.entrySet()) {
    IntArray filtered = new IntArray(parts.length);
    IntArray orig = entry.getValue();
    for (int i = 0; i < orig.size(); i++) {
      int p = orig.get(i);
      if (Arrays.binarySearch(parts, p) >= 0)
        filtered.add(p);
    }
    if (filtered.size() > 0)
      cp.put(entry.getKey(), filtered);
  }
  return cp.isEmpty() ? null : cp;
}
origin: com.h2database/h2

private void freeLogPages(IntArray pages) {
  if (trace.isDebugEnabled()) {
    trace.debug("log frees " + pages.get(0) + ".." +
        pages.get(pages.size() - 1));
  }
  Data buffer = getBuffer();
  buffer.writeByte((byte) FREE_LOG);
  int size = pages.size();
  buffer.writeVarInt(size);
  for (int i = 0; i < size; i++) {
    buffer.writeVarInt(pages.get(i));
  }
  write(buffer);
}
origin: com.h2database/h2

private void initNextData() {
  int nextData = trunk == null ? -1 : trunk.getPageData(trunkIndex++);
  if (nextData == -1) {
    int parent = trunkPageId;
    if (trunkNext != 0) {
      trunkPageId = trunkNext;
    }
    int len = PageStreamTrunk.getPagesAddressed(store.getPageSize());
    int[] pageIds = new int[len];
    for (int i = 0; i < len; i++) {
      pageIds[i] = reservedPages.get(i);
    }
    trunkNext = reservedPages.get(len);
    logKey++;
    trunk = PageStreamTrunk.create(store, parent, trunkPageId,
        trunkNext, logKey, pageIds);
    trunkIndex = 0;
    pageCount++;
    trunk.write();
    reservedPages.removeRange(0, len + 1);
    nextData = trunk.getPageData(trunkIndex++);
  }
  data = PageStreamData.create(store, nextData, trunk.getPos(), logKey);
  pageCount++;
  data.initWrite();
}
origin: com.h2database/h2

long nextPage = dataPages.get(0);
dataPages.remove(0);
store.seek(nextPage * pageSize);
origin: com.h2database/h2

ArrayList<Column> columnList = New.arrayList();
for (int i = 0; i < len;) {
  int idx = paramColumnIndex.get(i);
  columnList.add(table.getColumn(idx));
  int mask = masks[idx];
origin: com.h2database/com.springsource.org.h2

int getChild(int i) {
  return pageChildren.get(i);
}
origin: com.h2database/com.springsource.org.h2

int getPageOwner(int page) {
  if (page * BLOCKS_PER_PAGE > fileBlockCount || page >= pageOwners.size()) {
    return FREE_PAGE;
  }
  return pageOwners.get(page);
}
origin: com.h2database/com.springsource.org.h2

public void sort() {
  // insertion sort
  for (int i = 1, j; i < size(); i++) {
    int t = get(i);
    for (j = i - 1; j >= 0 && (get(j) > t); j--) {
      set(j + 1, get(j));
    }
    set(j + 1, t);
  }
}
origin: org.apache.ignite/ignite-indexing

/** */
private Map<ClusterNode, IntArray> narrowForQuery(Map<ClusterNode, IntArray> partsMap, int[] parts) {
  if (parts == null)
    return partsMap;
  Map<ClusterNode, IntArray> cp = U.newHashMap(partsMap.size());
  for (Map.Entry<ClusterNode, IntArray> entry : partsMap.entrySet()) {
    IntArray filtered = new IntArray(parts.length);
    IntArray orig = entry.getValue();
    for (int i = 0; i < orig.size(); i++) {
      int p = orig.get(i);
      if (Arrays.binarySearch(parts, p) >= 0)
        filtered.add(p);
    }
    if (filtered.size() > 0)
      cp.put(entry.getKey(), filtered);
  }
  return cp.isEmpty() ? null : cp;
}
origin: com.h2database/com.springsource.org.h2

private void freeUnusedPages() throws SQLException {
  for (int i = 0; i < pageOwners.size(); i++) {
    if (pageOwners.get(i) != FREE_PAGE && isPageFree(i)) {
      setPageOwner(i, FREE_PAGE);
    }
  }
}
origin: com.h2database/com.springsource.org.h2

SearchRow getFirst(Session session) throws SQLException {
  for (int i = 0; i < pageChildren.size(); i++) {
    BtreePage page = index.getPage(session, pageChildren.get(i));
    if (page != null) {
      return page.getFirst(session);
    }
  }
  return null;
}
origin: org.wowtools/h2

private void freeLogPages(IntArray pages) {
  if (trace.isDebugEnabled()) {
    trace.debug("log frees " + pages.get(0) + ".." +
        pages.get(pages.size() - 1));
  }
  Data buffer = getBuffer();
  buffer.writeByte((byte) FREE_LOG);
  int size = pages.size();
  buffer.writeVarInt(size);
  for (int i = 0; i < size; i++) {
    buffer.writeVarInt(pages.get(i));
  }
  write(buffer);
}
origin: com.eventsourcing/h2

private void freeLogPages(IntArray pages) {
  if (trace.isDebugEnabled()) {
    trace.debug("log frees " + pages.get(0) + ".." +
        pages.get(pages.size() - 1));
  }
  Data buffer = getBuffer();
  buffer.writeByte((byte) FREE_LOG);
  int size = pages.size();
  buffer.writeVarInt(size);
  for (int i = 0; i < size; i++) {
    buffer.writeVarInt(pages.get(i));
  }
  write(buffer);
}
origin: com.h2database/com.springsource.org.h2

private void checkOnePage() throws SQLException {
  pageCheckIndex = (pageCheckIndex + 1) % pages.size();
  int page = pages.get(pageCheckIndex);
  if (file.isPageFree(page) && file.getPageOwner(page) == id) {
    file.freePage(page);
  }
}
origin: com.h2database/com.springsource.org.h2

public void first(BtreeCursor cursor) throws SQLException {
  cursor.push(this, 0);
  BtreePage page = index.getPage(cursor.getSession(), pageChildren.get(0));
  page.first(cursor);
}
 
origin: com.h2database/com.springsource.org.h2

public void previous(BtreeCursor cursor, int i) throws SQLException {
  i--;
  if (i >= 0) {
    cursor.setStackPosition(i);
    BtreePage page = index.getPage(cursor.getSession(), pageChildren.get(i));
    page.last(cursor);
    return;
  }
  previousUpper(cursor);
}
origin: com.h2database/com.springsource.org.h2

public void last(BtreeCursor cursor) throws SQLException {
  int last = pageChildren.size() - 1;
  cursor.push(this, last);
  BtreePage page = index.getPage(cursor.getSession(), pageChildren.get(last));
  page.last(cursor);
}
origin: com.h2database/com.springsource.org.h2

public void next(BtreeCursor cursor, int i) throws SQLException {
  i++;
  if (i <= pageData.size()) {
    cursor.setStackPosition(i);
    BtreePage page = index.getPage(cursor.getSession(), pageChildren.get(i));
    page.first(cursor);
    return;
  }
  nextUpper(cursor);
}
 
origin: com.h2database/com.springsource.org.h2

protected SearchRow getData(int i) throws SQLException {
  SearchRow r = (SearchRow) pageData.get(i);
  if (r == null) {
    int p = pageChildren.get(i + 1);
    Session sysSession = index.getDatabase().getSystemSession();
    BtreePage page = index.getPage(sysSession, p);
    r = page.getFirst(sysSession);
    pageData.set(i, r);
  }
  return r;
}
origin: com.eventsourcing/h2

private void initNextData() {
  int nextData = trunk == null ? -1 : trunk.getPageData(trunkIndex++);
  if (nextData == -1) {
    int parent = trunkPageId;
    if (trunkNext != 0) {
      trunkPageId = trunkNext;
    }
    int len = PageStreamTrunk.getPagesAddressed(store.getPageSize());
    int[] pageIds = new int[len];
    for (int i = 0; i < len; i++) {
      pageIds[i] = reservedPages.get(i);
    }
    trunkNext = reservedPages.get(len);
    logKey++;
    trunk = PageStreamTrunk.create(store, parent, trunkPageId,
        trunkNext, logKey, pageIds);
    trunkIndex = 0;
    pageCount++;
    trunk.write();
    reservedPages.removeRange(0, len + 1);
    nextData = trunk.getPageData(trunkIndex++);
  }
  data = PageStreamData.create(store, nextData, trunk.getPos(), logKey);
  pageCount++;
  data.initWrite();
}
org.h2.utilIntArrayget

Javadoc

Get the value at the given index.

Popular methods of IntArray

  • <init>
    Create an int array with the given values and size.
  • add
  • size
    Get the size of the list.
  • toArray
    Convert this list to an array. The target array must be big enough.
  • hashCode
  • remove
    Remove the value at the given index.
  • ensureCapacity
    Ensure the the underlying array is large enough for the given number of entries.
  • removeRange
    Remove a number of elements.
  • addValueSorted
  • checkCapacity
  • findNextValueIndex
  • removeValue
  • findNextValueIndex,
  • removeValue,
  • set

Popular in Java

  • Running tasks concurrently on multiple threads
  • setScale (BigDecimal)
  • setRequestProperty (URLConnection)
  • getSharedPreferences (Context)
  • Container (java.awt)
    A generic Abstract Window Toolkit(AWT) container object is a component that can contain other AWT co
  • Callable (java.util.concurrent)
    A task that returns a result and may throw an exception. Implementors define a single method with no
  • ThreadPoolExecutor (java.util.concurrent)
    An ExecutorService that executes each submitted task using one of possibly several pooled threads, n
  • Servlet (javax.servlet)
    Defines methods that all servlets must implement.A servlet is a small Java program that runs within
  • JFileChooser (javax.swing)
  • Scheduler (org.quartz)
    This is the main interface of a Quartz Scheduler. A Scheduler maintains a registery of org.quartz
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