mirror of
https://github.com/systemed/tilemaker
synced 2025-02-21 13:24:09 +01:00
5b96711a09
CompactNodeStore doesn't know how to compute if it contains a node, which is a prerequisite for sharding. The two settings don't make much sense together: sharding will create N CompactNodeStores, which each will take as much memory as a single one, since each will likely have a large node ID. This differs from BinarySearchNodeStore and SortedNodeStore, where each of the N store instances will take roughly 1/N memory. Instead: - fail faster and more clearly by throwing if CompactNodeStore.contains is called - don't enable sharding if --compact is passed
86 lines
2.4 KiB
C++
86 lines
2.4 KiB
C++
#ifndef _NODE_STORES_H
|
|
#define _NODE_STORES_H
|
|
|
|
#include <mutex>
|
|
#include <memory>
|
|
#include "node_store.h"
|
|
#include "sorted_node_store.h"
|
|
#include "sharded_node_store.h"
|
|
#include "mmap_allocator.h"
|
|
|
|
class BinarySearchNodeStore : public NodeStore
|
|
{
|
|
|
|
public:
|
|
using internal_element_t = std::pair<ShardedNodeID, LatpLon>;
|
|
using map_t = std::deque<internal_element_t, mmap_allocator<internal_element_t>>;
|
|
|
|
void reopen() override;
|
|
void finalize(size_t threadNum) override;
|
|
LatpLon at(NodeID i) const override;
|
|
size_t size() const override;
|
|
void insert(const std::vector<element_t>& elements) override;
|
|
void clear() override {
|
|
reopen();
|
|
}
|
|
void batchStart() override {}
|
|
|
|
bool contains(size_t shard, NodeID id) const override;
|
|
NodeStore& shard(size_t shard) override { return *this; }
|
|
const NodeStore& shard(size_t shard) const override { return *this; }
|
|
size_t shards() const override { return 1; }
|
|
|
|
|
|
private:
|
|
mutable std::mutex mutex;
|
|
std::vector<std::shared_ptr<map_t>> mLatpLons;
|
|
|
|
uint32_t shardPart(NodeID id) const {
|
|
uint32_t rv = id >> 32;
|
|
return rv;
|
|
}
|
|
|
|
uint32_t idPart(NodeID id) const { return id; }
|
|
};
|
|
|
|
class CompactNodeStore : public NodeStore
|
|
{
|
|
|
|
public:
|
|
using element_t = std::pair<NodeID, LatpLon>;
|
|
using map_t = std::deque<LatpLon, mmap_allocator<LatpLon>>;
|
|
|
|
void reopen() override;
|
|
LatpLon at(NodeID i) const override;
|
|
size_t size() const override;
|
|
void insert(const std::vector<element_t>& elements) override;
|
|
void clear() override;
|
|
void finalize(size_t numThreads) override {}
|
|
void batchStart() override {}
|
|
|
|
// CompactNodeStore has no metadata to know whether or not it contains
|
|
// a node, so it's not suitable for use in sharded scenarios
|
|
bool contains(size_t shard, NodeID id) const override { throw std::runtime_error("CompactNodeStore does not support contains"); }
|
|
NodeStore& shard(size_t shard) override { return *this; }
|
|
const NodeStore& shard(size_t shard) const override { return *this; }
|
|
size_t shards() const override { return 1; }
|
|
|
|
private:
|
|
// @brief Insert a latp/lon pair.
|
|
// @param i OSM ID of a node
|
|
// @param coord a latp/lon pair to be inserted
|
|
// @invariant The OSM ID i must be larger than previously inserted OSM IDs of nodes
|
|
// (though unnecessarily for current impl, future impl may impose that)
|
|
void insert_back(NodeID i, LatpLon coord) {
|
|
if(i >= mLatpLons->size())
|
|
mLatpLons->resize(i + 1);
|
|
(*mLatpLons)[i] = coord;
|
|
}
|
|
|
|
|
|
mutable std::mutex mutex;
|
|
std::shared_ptr<map_t> mLatpLons;
|
|
};
|
|
|
|
|
|
#endif
|