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
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
|
#pragma once
#include <iostream>
#include <sstream>
#include <string>
#include <unordered_map>
#include <vector>
#include "util.hh"
#include "types.hh"
using namespace std;
namespace Sv {
template<typename K, typename V>
struct SparseVector {
unordered_map<K,V> m_;
V zero = 0.f;
SparseVector() {};
SparseVector(string& s)
{
from_s(this, s);
};
void
insert(K k, V v) { m_[k] = v; };
V
dot(SparseVector& other)
{
V r;
unordered_map<K,V>* o = &m_;
auto b = m_.cbegin();
auto e = m_.cend();
if (other.size() < size()) {
b = other.m_.cbegin();
e = other.m_.cend();
o = &other.m_;
}
for (auto it = b; it != e; it++)
r += it->second * o->at(it->first);
return r;
};
size_t
size()
{
return m_.size();
}
V&
operator[](const K& k)
{
return at(k);
};
const V&
at(const K& k) const
{
if (m_.find(k) == m_.end())
return zero;
else
return m_.at(k);
}
SparseVector
operator+(const SparseVector& other) const
{
SparseVector<K,V> v;
v.m_.insert(m_.cbegin(), m_.cend());
v.m_.insert(other.m_.cbegin(), other.m_.cend());
for (const auto it: v.m_)
v.m_[it.first] = this->at(it.first) + other.at(it.first);
return v;
};
SparseVector&
operator+=(const SparseVector& other)
{
for (const auto it: other.m_)
m_[it.first] += it.second;
return *this;
};
SparseVector
operator-(const SparseVector& other) const
{
SparseVector<K,V> v;
v.m_.insert(m_.cbegin(), m_.cend());
v.m_.insert(other.m_.cbegin(), other.m_.cend());
for (const auto it: v.m_)
v.m_[it.first] = this->at(it.first) - other.at(it.first);
return v;
};
SparseVector&
operator-=(const SparseVector& other)
{
for (const auto it: other.m_)
m_[it.first] -= it.second;
return *this;
};
SparseVector
operator*(V f) const
{
SparseVector<K,V> v;
for (const auto it: m_)
v.m_[it.first] = this->at(it.first) * f;
return v;
};
SparseVector&
operator*=(V f)
{
for (const auto it: m_)
m_[it.first] *= f;
return *this;
};
static void
from_s(SparseVector* w, const string& s)
{
stringstream ss(s);
while (!ss.eof()) {
string t;
ss >> t;
size_t eq = t.find_first_of("=");
if (eq == string::npos) {
return;
}
t.replace(eq, 1, " ");
stringstream tt(t);
K k; V v;
tt >> k >> v;
w->m_.emplace(k.substr(k.find_first_of("\"")+1, k.find_last_of("\"")-1), v);
}
}
ostream&
repr(ostream& os) const
{
os << "SparseVector<{";
for (auto it = m_.cbegin(); it != m_.cend(); it++) {
os << "'" << it->first << "'=" << it->second;
if (next(it) != m_.end())
os << ", ";
}
os << "}>";
return os;
};
ostream&
escaped(ostream& os, bool quote_keys=false) const {
for (auto it = m_.cbegin(); it != m_.cend(); it++) {
if (quote_keys) os << '"';
os << util::json_escape(it->first);
if (quote_keys) os << '"';
os << "=" << it->second;
if (next(it) != m_.cend()) os << " ";
}
return os;
};
friend ostream&
operator<<(ostream& os, const SparseVector& v)
{
return v.repr(os);
}
};
} // namespace
|
