blob: 9a36814a7b9457bb693748906d7977040c45aa14 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
|
#pragma once
#include "coding/read_write_utils.hpp"
#include "base/assert.hpp"
#include "std/algorithm.hpp"
#include "std/utility.hpp"
#include "std/vector.hpp"
namespace gen
{
template <class T> class Accumulator
{
protected:
vector<T> m_data;
public:
typedef T ValueT;
void Add(T const & t) { m_data.push_back(t); }
template <class TSink> void Flush(TSink & sink) const
{
rw::WriteVectorOfPOD(sink, m_data);
}
template <class TSource> void Read(TSource & src)
{
rw::ReadVectorOfPOD(src, m_data);
}
};
class OsmID2FeatureID : public Accumulator<pair<uint64_t /* osm id */, uint32_t /* feature id */>>
{
typedef Accumulator<ValueT> BaseT;
struct LessID
{
bool operator() (ValueT const & r1, ValueT const & r2) const { return r1.first < r2.first; }
bool operator() (uint64_t const & r1, ValueT const & r2) const { return r1 < r2.first; }
bool operator() (ValueT const & r1, uint64_t const & r2) const { return r1.first < r2; }
};
public:
template <class TSink> void Flush(TSink & sink)
{
sort(m_data.begin(), m_data.end());
for (size_t i = 1; i < m_data.size(); ++i)
CHECK_NOT_EQUAL(m_data[i-1].first, m_data[i].first, ());
BaseT::Flush(sink);
}
uint32_t GetFeatureID(uint64_t osmID) const
{
vector<ValueT>::const_iterator i = lower_bound(m_data.begin(), m_data.end(), osmID, LessID());
if (i != m_data.end() && i->first == osmID)
return i->second;
else
return 0;
}
template <class Fn>
void ForEach(Fn && fn) const
{
for (auto const & v : m_data)
fn(v);
}
};
} // namespace gen
|
