private TreeCursor readyCursorValueOp(LHashTable.ObjEntry<TreeCursor> entry, LocalTransaction txn) throws IOException { TreeCursor c = entry.value; LocalTransaction oldTxn = c.mTxn; c.mTxn = txn; if (oldTxn != txn) { c.findNearby(c.mKey); } return c; }
public void run() throws IOException { if (lock != null) { txn.push(lock); } TreeCursor tc = ce.mCursor; tc.mTxn = txn; tc.findNearby(key); } });
@Override public boolean cursorFind(long cursorId, long txnId, byte[] key) throws IOException { LHashTable.ObjEntry<TreeCursor> entry = mCursors.get(cursorId); if (entry != null) { LocalTransaction txn = txn(txnId); if (txn != null) { TreeCursor c = entry.value; c.mTxn = txn; c.findNearby(key); } } return true; }
c.findNearby(key);
@Override public boolean cursorStore(long cursorId, long txnId, byte[] key, byte[] value) throws IOException { LHashTable.ObjEntry<TreeCursor> entry = mCursors.get(cursorId); if (entry != null) { LocalTransaction txn = txn(txnId); if (txn != null) { TreeCursor c = entry.value; c.mTxn = txn; c.findNearby(key); c.store(value); c.mValue = Cursor.NOT_LOADED; } } return true; }
arraycopy(prefix, 0, key, 0, 8); key[8] = (byte) 0xff; cursor.findNearby(key); } else { cursor.findNearby(decrementReverseUnsignedVar(key, 8));
arraycopy(prefix, 0, key, 0, 8); key[8] = (byte) 0xff; cursor.findNearby(key); } else { cursor.findNearby(decrementReverseUnsignedVar(key, 8));
arraycopy(prefix, 0, key, 0, 8); key[8] = (byte) 0xff; cursor.findNearby(key); } else { cursor.findNearby(decrementReverseUnsignedVar(key, 8));
cursor.findNearby(lowKey);
cursor.findNearby(lowKey);
cursor.findNearby(lowKey);