map = storage.createTreeMap(name) .valuesOutsideNodesEnable() .counterEnable() .keySerializer(getBTreeKeySerializerFromClass(keyClass)) .valueSerializer(getSerializerFromClass(valueClass))
this.records = this.journalDB.createTreeMap(RECORDS_FIELD) .keySerializer(BTreeKeySerializer.ZERO_OR_POSITIVE_LONG) .counterEnable() .makeOrGet(); Atomic.String journalAtomic = this.journalDB.getAtomicString(JOURNAL_ID_FIELD);
this.records = this.journalDB.createTreeMap(RECORDS_FIELD) .keySerializer(BTreeKeySerializer.ZERO_OR_POSITIVE_LONG) .counterEnable() .makeOrGet(); Atomic.String journalAtomic = this.journalDB.getAtomicString(JOURNAL_ID_FIELD);
this.isNew = true; this.options = db.createHashMap(name + "/options").makeOrGet(); this.keysByValue = db.createTreeMap(name).counterEnable().comparator(valueSerializer.getComparator()) .keySerializer(valueSerializer).makeOrGet();
this.isNew = true; this.options = db.createHashMap(name + "/options").makeOrGet(); this.keysByValue = db.createTreeMap(name).counterEnable().comparator(valueSerializer.getComparator()) .keySerializer(valueSerializer).makeOrGet();
@Override public SortingBuffer<K, V> make() { BTreeMapMaker maker = db(useHeap).createTreeMap(name).keySerializer(keySerializer).valueSerializer(valueSerializer); if (keepsize) maker = maker.counterEnable(); NavigableMap<K, V> buffer = maker.make(); return new CloseableSortingBuffer<K, V>(name, useHeap, buffer); } }
@Override public SortingBuffer<K, V> make() { BTreeMapMaker maker = db(useHeap).createTreeMap(name).keySerializer(keySerializer).valueSerializer(valueSerializer); if (keepsize) maker = maker.counterEnable(); NavigableMap<K, V> buffer = maker.make(); return new CloseableSortingBuffer<K, V>(name, useHeap, buffer); } }
@Override public SortingBuffer<K, V> make() { Comparator<UniqueKey<K>> comparator = this.keyComparator != null ? new UniqueKeyComparator<K>(keyComparator) : new ComparableUniqueKeyComparator<K>(); BTreeKeySerializer<UniqueKey<K>> uniqueKeySerializer = new UniqueKeyBTreeSerializer<K>(keySerializer, comparator); BTreeMapMaker maker = db(useHeap).createTreeMap(name).keySerializer(uniqueKeySerializer) .valueSerializer(valueSerializer); if (keepsize) maker = maker.counterEnable(); NavigableMap<UniqueKey<K>, V> buffer = maker.make(); return new CloseableSortingBufferWithDuplicates<K, V>(name, useHeap, buffer); } }
@Override public SortingBuffer<K, V> make() { Comparator<UniqueKey<K>> comparator = this.keyComparator != null ? new UniqueKeyComparator<K>(keyComparator) : new ComparableUniqueKeyComparator<K>(); BTreeKeySerializer<UniqueKey<K>> uniqueKeySerializer = new UniqueKeyBTreeSerializer<K>(keySerializer, comparator); BTreeMapMaker maker = db(useHeap).createTreeMap(name).keySerializer(uniqueKeySerializer) .valueSerializer(valueSerializer); if (keepsize) maker = maker.counterEnable(); NavigableMap<UniqueKey<K>, V> buffer = maker.make(); return new CloseableSortingBufferWithDuplicates<K, V>(name, useHeap, buffer); } }