.valuesOutsideNodesEnable() .counterEnable() .keySerializer(getBTreeKeySerializerFromClass(keyClass)) .valueSerializer(getSerializerFromClass(valueClass)) .makeOrGet();
.keySerializer(BTreeKeySerializer.ZERO_OR_POSITIVE_LONG) .valueSerializer(new NodeSerializer()) .makeOrGet(); .keySerializer(BTreeKeySerializer.ZERO_OR_POSITIVE_LONG) .valueSerializer(new WaySerializer()) .makeOrGet(); .keySerializer(BTreeKeySerializer.ZERO_OR_POSITIVE_LONG) .makeOrGet(); this.relations = relations;
.keySerializer(BTreeKeySerializer.ZERO_OR_POSITIVE_LONG) .counterEnable() .makeOrGet();
.keySerializer(BTreeKeySerializer.ZERO_OR_POSITIVE_LONG) .counterEnable() .makeOrGet();
this.options = db.createHashMap(name + "/options").makeOrGet(); this.keysByValue = db.createTreeMap(name).counterEnable().comparator(valueSerializer.getComparator()) .keySerializer(valueSerializer).makeOrGet();
this.options = db.createHashMap(name + "/options").makeOrGet(); this.keysByValue = db.createTreeMap(name).counterEnable().comparator(valueSerializer.getComparator()) .keySerializer(valueSerializer).makeOrGet();
private void initTaxonCache() throws PropertyEnricherException { DB db = initDb("taxonCache"); String taxonCacheName = "taxonCacheById"; if (db.exists(taxonCacheName)) { resolvedIdToTaxonMap = db.getTreeMap(taxonCacheName); } else { LOG.info("local taxon cache of [" + taxonCache.getResource() + "] building..."); StopWatch watch = new StopWatch(); watch.start(); try { resolvedIdToTaxonMap = db .createTreeMap(taxonCacheName) .pumpPresort(100000) .pumpIgnoreDuplicates() .pumpSource(taxonCacheIterator(taxonCache)) .keySerializer(BTreeKeySerializer.STRING) .make(); } catch (IOException e) { throw new PropertyEnricherException("failed to instantiate taxonCache: [" + e.getMessage() + "]", e); } watch.stop(); logCacheLoadStats(watch.getTime(), resolvedIdToTaxonMap.size()); LOG.info("local taxon cache of [" + taxonCache.getResource() + "] built."); watch.reset(); } }
/** * Create a new DataStore. * @param directory Where should it be created? * @param dataFile What should it be called? */ public SpatialDataStore(File directory, String dataFile, Serializer serializer, Integer cacheSize) { this.dataFile = dataFile; if(!directory.exists()) directory.mkdirs(); spatialId = new IdStore(directory, dataFile); DBMaker dbm = DBMaker.newFileDB(new File(directory, dataFile + ".db")) .mmapFileEnableIfSupported() .cacheLRUEnable() .cacheSize(cacheSize) .closeOnJvmShutdown(); db = dbm.make(); BTreeMapMaker maker = db.createTreeMap(dataFile) .valueSerializer(serializer) .keySerializer(BTreeKeySerializer.ZERO_OR_POSITIVE_LONG); map = maker.makeOrGet(); tileIndex = db.createTreeSet(dataFile + "_tileIndex") .serializer(BTreeKeySerializer.TUPLE3).makeOrGet(); }
@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); } }
@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); } }
public StreetDataStore(File directory, String dataFile, Serializer serializer, Integer cacheSize) { super(directory, dataFile, serializer, cacheSize); BTreeMapMaker idMapMaker = db.createTreeMap(dataFile + "_segmentIndex") .valueSerializer(Serializer.LONG) .keySerializer(BTreeKeySerializer.TUPLE3); segmentIndex = idMapMaker.makeOrGet(); BTreeMapMaker segmentTypeMapMaker = db.createTreeMap(dataFile + "_segmentTypeIndex") .valueSerializer(Serializer.INTEGER) .keySerializer(BTreeKeySerializer.ZERO_OR_POSITIVE_LONG); segmentTypeMap = segmentTypeMapMaker.makeOrGet(); }