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
73
74
75
76
|
#pragma once
#include <algorithm>
#include <cassert>
#include <vector>
namespace ConsensusCore {
namespace detail {
// This is necessary because of dumb C++ linker rules.
// see: http://isocpp.org/wiki/faq/templates#template-friends
// and: http://yosefk.com/c++fqa/templates.html#fqa-35.16 (for hilarious
// rejoinder)
template <typename T>
class VectorL; // fwd
template <typename T>
T Max(const VectorL<T>& v);
template <typename T>
size_t ArgMax(const VectorL<T>& v);
//
// Vector class that stores only a subsequence of the rows
// (SparseVector has a lot of weird functionality built-in, so we can't use it
// without
// cleaning it up/refactoring it quite a bit)
//
template <typename T>
class VectorL
{
private:
std::vector<T> storage_;
size_t beginRow_;
size_t endRow_;
public:
VectorL(int beginRow, int endRow, T defaultVal = T())
: storage_(endRow - beginRow, defaultVal), beginRow_(beginRow), endRow_(endRow)
{
}
T& operator[](size_t pos)
{
assert(beginRow_ <= pos && pos < endRow_);
return storage_[pos - beginRow_];
}
const T& operator[](size_t pos) const
{
assert(beginRow_ <= pos && pos < endRow_);
return storage_[pos - beginRow_];
}
size_t BeginRow() const { return beginRow_; }
size_t EndRow() const { return endRow_; }
friend T Max<>(const VectorL<T>& v);
friend size_t ArgMax<>(const VectorL<T>& v);
};
using std::max_element;
using std::distance;
template <typename T>
T Max(const VectorL<T>& v)
{
return *max_element(v.storage_.begin(), v.storage_.end());
}
template <typename T>
size_t ArgMax(const VectorL<T>& v)
{
return v.beginRow_ +
distance(v.storage_.begin(), max_element(v.storage_.begin(), v.storage_.end()));
}
}
} // ConsensusCore::detail
|
