@Override public T preprocess(T value, Object... hints) { init(value, hints); return (T) binarySerializer.preprocess(value); }
private OSBTreeCursor<K, ORID> iterateEntriesBetweenDescOrder(K keyFrom, final boolean fromInclusive, K keyTo, final boolean toInclusive) { keyFrom = keySerializer.preprocess(keyFrom, (Object[]) keyTypes); keyTo = keySerializer.preprocess(keyTo, (Object[]) keyTypes); keyFrom = enhanceFromCompositeKeyBetweenDesc(keyFrom, fromInclusive); keyTo = enhanceToCompositeKeyBetweenDesc(keyTo, toInclusive); return new OSBTreeCursorBackward(keyFrom, keyTo, fromInclusive, toInclusive); }
private OSBTreeCursor<K, ORID> iterateEntriesBetweenAscOrder(K keyFrom, final boolean fromInclusive, K keyTo, final boolean toInclusive) { keyFrom = keySerializer.preprocess(keyFrom, (Object[]) keyTypes); keyTo = keySerializer.preprocess(keyTo, (Object[]) keyTypes); keyFrom = enhanceFromCompositeKeyBetweenAsc(keyFrom, fromInclusive); keyTo = enhanceToCompositeKeyBetweenAsc(keyTo, toInclusive); return new OSBTreeCursorForward(keyFrom, keyTo, fromInclusive, toInclusive); }
private OSBTreeCursor<K, V> iterateEntriesBetweenAscOrder(K keyFrom, final boolean fromInclusive, K keyTo, final boolean toInclusive) { keyFrom = keySerializer.preprocess(keyFrom, (Object[]) keyTypes); keyTo = keySerializer.preprocess(keyTo, (Object[]) keyTypes); keyFrom = enhanceFromCompositeKeyBetweenAsc(keyFrom, fromInclusive); keyTo = enhanceToCompositeKeyBetweenAsc(keyTo, toInclusive); return new OSBTreeCursorForward(keyFrom, keyTo, fromInclusive, toInclusive); }
private OSBTreeCursor<K, V> iterateEntriesBetweenDescOrder(K keyFrom, final boolean fromInclusive, K keyTo, final boolean toInclusive) { keyFrom = keySerializer.preprocess(keyFrom, (Object[]) keyTypes); keyTo = keySerializer.preprocess(keyTo, (Object[]) keyTypes); keyFrom = enhanceFromCompositeKeyBetweenDesc(keyFrom, fromInclusive); keyTo = enhanceToCompositeKeyBetweenDesc(keyTo, toInclusive); return new OSBTreeCursorBackward(keyFrom, keyTo, fromInclusive, toInclusive); }
private OSBTreeCursor<K, ORID> iterateEntriesBetweenDescOrder(K keyFrom, final boolean fromInclusive, K keyTo, final boolean toInclusive) { keyFrom = keySerializer.preprocess(keyFrom, (Object[]) keyTypes); keyTo = keySerializer.preprocess(keyTo, (Object[]) keyTypes); keyFrom = enhanceFromCompositeKeyBetweenDesc(keyFrom, fromInclusive); keyTo = enhanceToCompositeKeyBetweenDesc(keyTo, toInclusive); return new OSBTreeCursorBackward(keyFrom, keyTo, fromInclusive, toInclusive); }
private OSBTreeCursor<K, ORID> iterateEntriesBetweenAscOrder(K keyFrom, final boolean fromInclusive, K keyTo, final boolean toInclusive) { keyFrom = keySerializer.preprocess(keyFrom, (Object[]) keyTypes); keyTo = keySerializer.preprocess(keyTo, (Object[]) keyTypes); keyFrom = enhanceFromCompositeKeyBetweenAsc(keyFrom, fromInclusive); keyTo = enhanceToCompositeKeyBetweenAsc(keyTo, toInclusive); return new OSBTreeCursorForward(keyFrom, keyTo, fromInclusive, toInclusive); }
private OSBTreeCursor<K, ORID> iterateEntriesMajorAsc(K key, final boolean inclusive) { key = keySerializer.preprocess(key, (Object[]) keyTypes); key = enhanceCompositeKeyMajorAsc(key, inclusive); return new OSBTreeCursorForward(key, null, inclusive, false); }
private OSBTreeCursor<K, ORID> iterateEntriesMinorDesc(K key, final boolean inclusive) { key = keySerializer.preprocess(key, (Object[]) keyTypes); key = enhanceCompositeKeyMinorDesc(key, inclusive); return new OSBTreeCursorBackward(null, key, false, inclusive); }
private OSBTreeCursor<K, V> iterateEntriesMinorAsc(K key, final boolean inclusive) { key = keySerializer.preprocess(key, (Object[]) keyTypes); key = enhanceCompositeKeyMinorAsc(key, inclusive); return new OSBTreeCursorForward(null, key, false, inclusive); }
private OSBTreeCursor<K, V> iterateEntriesMajorDesc(K key, final boolean inclusive) { key = keySerializer.preprocess(key, (Object[]) keyTypes); key = enhanceCompositeKeyMajorDesc(key, inclusive); return new OSBTreeCursorBackward(key, null, inclusive, false); }
private OSBTreeCursor<K, ORID> iterateEntriesMinorAsc(K key, final boolean inclusive) { key = keySerializer.preprocess(key, (Object[]) keyTypes); key = enhanceCompositeKeyMinorAsc(key, inclusive); return new OSBTreeCursorForward(null, key, false, inclusive); }
private OSBTreeCursor<K, ORID> iterateEntriesMinorAsc(K key, final boolean inclusive) { key = keySerializer.preprocess(key, (Object[]) keyTypes); key = enhanceCompositeKeyMinorAsc(key, inclusive); return new OSBTreeCursorForward(null, key, false, inclusive); }
private OSBTreeCursor<K, V> iterateEntriesMinorDesc(K key, final boolean inclusive) { key = keySerializer.preprocess(key, (Object[]) keyTypes); key = enhanceCompositeKeyMinorDesc(key, inclusive); return new OSBTreeCursorBackward(null, key, false, inclusive); }
private OSBTreeCursor<K, ORID> iterateEntriesMinorDesc(K key, final boolean inclusive) { key = keySerializer.preprocess(key, (Object[]) keyTypes); key = enhanceCompositeKeyMinorDesc(key, inclusive); return new OSBTreeCursorBackward(null, key, false, inclusive); }
private OSBTreeCursor<K, V> iterateEntriesMajorAsc(K key, final boolean inclusive) { key = keySerializer.preprocess(key, (Object[]) keyTypes); key = enhanceCompositeKeyMajorAsc(key, inclusive); return new OSBTreeCursorForward(key, null, inclusive, false); }
private OSBTreeCursor<K, ORID> iterateEntriesMajorAsc(K key, final boolean inclusive) { key = keySerializer.preprocess(key, (Object[]) keyTypes); key = enhanceCompositeKeyMajorAsc(key, inclusive); return new OSBTreeCursorForward(key, null, inclusive, false); }
private OSBTreeCursor<K, ORID> iterateEntriesMajorDesc(K key, final boolean inclusive) { acquireSharedLock(); try { key = keySerializer.preprocess(key, (Object[]) keyTypes); key = enhanceCompositeKeyMajorDesc(key, inclusive); return new OSBTreeCursorBackward(key, null, inclusive, false); } finally { releaseSharedLock(); } }
private OSBTreeCursor<K, ORID> iterateEntriesMajorDesc(K key, final boolean inclusive) { acquireSharedLock(); try { key = keySerializer.preprocess(key, (Object[]) keyTypes); key = enhanceCompositeKeyMajorDesc(key, inclusive); return new OSBTreeCursorBackward(key, null, inclusive, false); } finally { releaseSharedLock(); } }
private boolean put(K key, V value, OBaseIndexEngine.Validator<K, V> validator) throws IOException { boolean rollback = false; final OAtomicOperation atomicOperation = startAtomicOperation(true); try { acquireExclusiveLock(); try { checkNullSupport(key); if (key != null) { final int keySize = keySerializer.getObjectSize(key, (Object[]) keyTypes); if (keySize > MAX_KEY_SIZE) { throw new OTooBigIndexKeyException( "Key size is more than allowed, operation was canceled. Current key size " + keySize + ", allowed " + MAX_KEY_SIZE, getName()); } } key = keySerializer.preprocess(key, (Object[]) keyTypes); final boolean putResult = doPut(key, value, validator, atomicOperation); return putResult; } finally { releaseExclusiveLock(); } } catch (final Exception e) { rollback = true; throw e; } finally { endAtomicOperation(rollback); } }