This repository was archived by the owner on Oct 5, 2019. It is now read-only.
forked from facebookresearch/fastText
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathvector.cc
More file actions
137 lines (114 loc) · 2.55 KB
/
vector.cc
File metadata and controls
137 lines (114 loc) · 2.55 KB
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
/**
* Copyright (c) 2016-present, Facebook, Inc.
* All rights reserved.
*
* This source code is licensed under the BSD-style license found in the
* LICENSE file in the root directory of this source tree. An additional grant
* of patent rights can be found in the PATENTS file in the same directory.
*/
#include "vector.h"
#include <assert.h>
#include <iomanip>
#include <cmath>
#include "matrix.h"
#include "qmatrix.h"
namespace fasttext {
Vector::Vector(int64_t m) {
m_ = m;
data_ = new real[m];
}
Vector::~Vector() {
delete[] data_;
}
int64_t Vector::size() const {
return m_;
}
void Vector::zero() {
for (int64_t i = 0; i < m_; i++) {
data_[i] = 0.0;
}
}
real Vector::norm() const {
real sum = 0;
for (int64_t i = 0; i < m_; i++) {
sum += data_[i] * data_[i];
}
return std::sqrt(sum);
}
void Vector::mul(real a) {
for (int64_t i = 0; i < m_; i++) {
data_[i] *= a;
}
}
void Vector::addVector(const Vector& source) {
assert(m_ == source.m_);
for (int64_t i = 0; i < m_; i++) {
data_[i] += source.data_[i];
}
}
void Vector::addVector(const Vector& source, real s) {
assert(m_ == source.m_);
for (int64_t i = 0; i < m_; i++) {
data_[i] += s * source.data_[i];
}
}
void Vector::addRow(const Matrix& A, int64_t i) {
assert(i >= 0);
assert(i < A.m_);
assert(m_ == A.n_);
for (int64_t j = 0; j < A.n_; j++) {
data_[j] += A.at(i, j);
}
}
void Vector::addRow(const Matrix& A, int64_t i, real a) {
assert(i >= 0);
assert(i < A.m_);
assert(m_ == A.n_);
for (int64_t j = 0; j < A.n_; j++) {
data_[j] += a * A.at(i, j);
}
}
void Vector::addRow(const QMatrix& A, int64_t i) {
assert(i >= 0);
A.addToVector(*this, i);
}
void Vector::mul(const Matrix& A, const Vector& vec) {
assert(A.m_ == m_);
assert(A.n_ == vec.m_);
for (int64_t i = 0; i < m_; i++) {
data_[i] = A.dotRow(vec, i);
}
}
void Vector::mul(const QMatrix& A, const Vector& vec) {
assert(A.getM() == m_);
assert(A.getN() == vec.m_);
for (int64_t i = 0; i < m_; i++) {
data_[i] = A.dotRow(vec, i);
}
}
int64_t Vector::argmax() {
real max = data_[0];
int64_t argmax = 0;
for (int64_t i = 1; i < m_; i++) {
if (data_[i] > max) {
max = data_[i];
argmax = i;
}
}
return argmax;
}
real& Vector::operator[](int64_t i) {
return data_[i];
}
const real& Vector::operator[](int64_t i) const {
return data_[i];
}
std::ostream& operator<<(std::ostream& os, const Vector& v)
{
os << std::setprecision(5);
for (int64_t j = 0; j < v.m_; j++) {
os << v.data_[j] << ' ';
}
return os;
}
}