/** * Set full and actual key. */ final void setKey(_LocalDatabase db, byte[] fullKey) throws IOException { byte[] actualKey = fullKey; if (_Node.calculateAllowedKeyLength(db, fullKey) < 0) { // Key must be fragmented. actualKey = db.fragmentKey(fullKey); } mFullKey = fullKey; mActualKey = actualKey; }
private void setSplitKey(_Tree tree, _Split split, byte[] fullKey) throws IOException { byte[] actualKey = fullKey; _LocalDatabase db = tree.mDatabase; if (calculateAllowedKeyLength(db, fullKey) < 0) { // Key must be fragmented. actualKey = db.fragmentKey(fullKey); } split.setKey(fullKey, actualKey); }
private void setSplitKey(_Tree tree, _Split split, byte[] fullKey) throws IOException { byte[] actualKey = fullKey; _LocalDatabase db = tree.mDatabase; if (calculateAllowedKeyLength(db, fullKey) < 0) { // Key must be fragmented. actualKey = db.fragmentKey(fullKey); } split.setKey(fullKey, actualKey); }
int encodedKeyLen = calculateAllowedKeyLength(db, okey);
int encodedKeyLen = calculateAllowedKeyLength(db, okey);
int encodedKeyLen = calculateAllowedKeyLength(db, okey);
int encodedKeyLen = calculateAllowedKeyLength(db, okey);
int encodedKeyLen = calculateAllowedKeyLength(db, okey);
int encodedKeyLen = calculateAllowedKeyLength(db, okey);
int encodedKeyLen = calculateAllowedKeyLength(db, okey);
int encodedKeyLen = calculateAllowedKeyLength(db, okey);
int encodedKeyLen = calculateAllowedKeyLength(db, okey);
int encodedKeyLen = calculateAllowedKeyLength(db, okey);
newKey = midKey(highPos - 2, this, highPos); newKeyLen = calculateAllowedKeyLength(tree.mDatabase, newKey); if (newKeyLen > 0) { parentPage = parent.mPage;
newKey = midKey(highPos - 2, this, highPos); newKeyLen = calculateAllowedKeyLength(tree.mDatabase, newKey); if (newKeyLen > 0) { parentPage = parent.mPage;
newKey = midKey(highPos - 2, this, highPos); newKeyLen = calculateAllowedKeyLength(tree.mDatabase, newKey); if (newKeyLen > 0) { parentPage = parent.mPage;
newKey = midKey(highPos - 2, this, highPos); newKeyLen = calculateAllowedKeyLength(tree.mDatabase, newKey); if (newKeyLen > 0) { parentPage = parent.mPage;
newKey = midKey(highPos - 2, this, highPos); newKeyLen = calculateAllowedKeyLength(tree.mDatabase, newKey); if (newKeyLen > 0) { parentPage = parent.mPage;
newKey = midKey(highPos - 2, this, highPos); newKeyLen = calculateAllowedKeyLength(tree.mDatabase, newKey); if (newKeyLen > 0) { parentPage = parent.mPage;