-
Notifications
You must be signed in to change notification settings - Fork 0
/
BbVector.cpp
60 lines (48 loc) · 1.09 KB
/
BbVector.cpp
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
#include "BbVector.hpp"
using namespace std;
namespace BbMath
{
// Scalar product of 2 BbVectors
double product_xTy(const BbVectorD& lval, const BbVectorD& rval)
{
if (lval.size() == 0 || rval.size() == 0)
{
return 0.;
}
if (lval.size() != rval.size())
{
throw std::length_error("Sizes don't match!!\n");
}
return std::inner_product(lval.cbegin(), lval.cend(), rval.cbegin(), 0.);
}
// Element by element product of 2 BbVectors
BbVectorD dot_product(const BbVectorD& lval, const BbVectorD& rval)
{
if (lval.size() != rval.size())
{
throw std::length_error("Sizes don't match!!\n");
}
size_t n = lval.size();
BbVectorD ret(n);
for (size_t i = 1; i <= n; ++i)
{
ret[i] = lval[i]*rval[i];
}
return ret;
}
// Element by element division of 2 BbVectors
BbVectorD dot_division(const BbVectorD& lval, const BbVectorD& rval)
{
if (lval.size() != rval.size())
{
throw std::length_error("Sizes don't match!!\n");
}
size_t n = lval.size();
BbVectorD ret(n);
for (size_t i = 1; i <= n; ++i)
{
ret[i] = lval[i]/rval[i];
}
return ret;
}
}