public long addStatements(final ISPO[] stmts, final int numStmts, final IElementFilter<ISPO> filter) { if (numStmts == 0) return 0; return addStatements(new ChunkedArrayIterator<ISPO>(numStmts, stmts, null/* keyOrder */), filter); }
/** * Return the backing array. * * @see #getBufferCount() */ public E[] array() { assertOpen(); return buffer; }
@Override public E[] nextChunk(final IKeyOrder<E> keyOrder) { if (keyOrder == null) throw new IllegalArgumentException(); final E[] chunk = nextChunk(); if (!keyOrder.equals(getKeyOrder())) { // sort into the required order. Arrays.sort(chunk, 0, chunk.length, keyOrder.getComparator()); } return chunk; }
@Override public E next() { if (!hasNext()) { throw new NoSuchElementException(); } return buffer[i++]; // current = buffer[i++]; // // return current; }
@Override public E next() { if (!hasNext()) { throw new NoSuchElementException(); } return buffer[i++]; // current = buffer[i++]; // // return current; }
/** * Delegates to {@link #flush(IChunkedOrderedIterator)} */ @Override final protected long flush(final int n, final R[] a) { final IChunkedOrderedIterator<R> itr = new ChunkedArrayIterator<R>(n, a, null/* keyOrder(unknown) */); return flush(itr); }
@Override public E[] nextChunk(final IKeyOrder<E> keyOrder) { if (keyOrder == null) throw new IllegalArgumentException(); final E[] chunk = nextChunk(); if (!keyOrder.equals(getKeyOrder())) { // sort into the required order. Arrays.sort(chunk, 0, chunk.length, keyOrder.getComparator()); } return chunk; }
public E[] nextChunk() { if (!hasNext()) {
/** * Return the backing array. * * @see #getBufferCount() */ public E[] array() { assertOpen(); return buffer; }
public Long call() { return r .addJustifications(new ChunkedArrayIterator<Justification>( b.length, b, null/* keyOrder */)); } });
public E[] nextChunk() { if (!hasNext()) {
public long addStatements(final ISPO[] stmts, final int numStmts) { if (numStmts == 0) return 0; return addStatements(new ChunkedArrayIterator<ISPO>(numStmts, stmts, null/* keyOrder */), null /* filter */); }
@Override protected long flush(final int n, final ISPO[] a) { final long l = tempStore.removeStatements( new ChunkedArrayIterator<ISPO>(n, a, null), false); counter += l; return l; }
/** * Delegates to {@link #flush(IChunkedOrderedIterator)} */ @Override final protected long flush(final int n, final R[] a) { final IChunkedOrderedIterator<R> itr = new ChunkedArrayIterator<R>(n, a, null/* keyOrder(unknown) */); return flush(itr); }
public Long call() { return r .addJustifications(new ChunkedArrayIterator<Justification>( b.length, b, null/* keyOrder */)); } });
@Override protected long flush(final int n, final ISPO[] a) { final long l = tempStore.removeStatements( new ChunkedArrayIterator<ISPO>(n, a, null), false); counter += l; return l; }
public long addStatements(final ISPO[] stmts, final int numStmts) { if (numStmts == 0) return 0; return addStatements(new ChunkedArrayIterator<ISPO>(numStmts, stmts, null/* keyOrder */), null /* filter */); }
public long addStatements(final ISPO[] stmts, final int numStmts, final IElementFilter<ISPO> filter) { if (numStmts == 0) return 0; return addStatements(new ChunkedArrayIterator<ISPO>(numStmts, stmts, null/* keyOrder */), filter); }
public long removeStatements(final ISPO[] stmts, final int numStmts) { return removeStatements(new ChunkedArrayIterator<ISPO>(numStmts, stmts, null/* keyOrder */), true/*computeClosureForStatementIdentifiers*/); }
public long removeStatements(final ISPO[] stmts, final int numStmts) { return removeStatements(new ChunkedArrayIterator<ISPO>(numStmts, stmts, null/* keyOrder */), true/*computeClosureForStatementIdentifiers*/); }