NodeEmbedding/vec.h at master · xiaoylu/NodeEmbedding · GitHub

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
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
#ifndef vec_header
#define vec_header

#include <stdio.h>
#include <stdlib.h>
#include <iostream>
#include <math.h>
#include <atomic>

using namespace std;

class Vec
{
public:
  double * vec;
  int m;

  Vec(int m) { this->m = m; vec = new double[m]; clear();};

  ~Vec() { delete[] vec; };

  Vec(const Vec& v)
  {
    this->m = v.m;
    vec = new double[m];
    for (int i = 0; i < m; ++i)
    {
      this->vec[i] = v.vec[i];
    };
  };

  Vec(int m, const atomic<double> *array)
  {
    this->m = m;
    vec = new double[m];
    for (int i = 0; i < m; ++i)
    {
      this->vec[i] = array[i].load(memory_order_relaxed);
    };
    //note if array is dynamically constructed
    //then it should be released somewhere outside
  };

  void clear()
  {
     for (int i = 0;i < m; ++i)
     {
       this->vec[i] = 0;
     }
  }


  int amax() const
  {
     int ret = 0;
     for (int i = 1;i < m; ++i)
     {
       if (this->vec[i] > this->vec[ret])
         ret = i;
     }
     return ret;
  }

  // for compute the accumulative vector H,G, P,Q..
  void accu(const atomic<double> * array,const double mul)
  {
     for (int i = 0;i < m; ++i)
     {
       double tmp = array[i].load(memory_order_relaxed);
       this->vec[i] += ( tmp * mul );
     }
  };

  Vec& operator+=(const atomic<double> *array)
  {
    for (int i = 0;i < m; ++i)
    {
      this->vec[i] += array[i].load(memory_order_relaxed);
    }
    return *this;
  };

  Vec& operator+=(const Vec& other) {
    if (this != &other) {
       for (int i = 0;i < m; ++i)
       {
         this->vec[i] += other.vec[i];
       }
    }
    return *this;
  };

  // assignment
  Vec& operator=(const Vec& other) {
    if (this != &other) {
       for (int i = 0;i < m; ++i)
       {
         this->vec[i] = other.vec[i];
       }
    }
    return *this;
  };

  // inner product
  double operator^(atomic<double> * array)
  {
    double ret = 0;
    for (int i = 0;i < m; ++i)
    {
      double tmp = array[i].load(memory_order_relaxed);
      ret += this->vec[i] * tmp;
    }
    return ret;
  };

  // inner product
  double operator^(const Vec& other)
  {
    double ret = 0;
    for (int i = 0;i < m; ++i)
    {
      ret += this->vec[i] * other.vec[i];
    }
    return ret;
  };

  Vec& operator-=(const Vec& other) {
    for (int i = 0;i < m; ++i)
    {
      this->vec[i] -= other.vec[i];
    }
    return *this;
  };

  Vec& operator*=(const double val)
  {
    for (int i = 0;i < m; ++i)
    {
      this->vec[i] *= val;
    }
    return *this;
  };

  // point-wise product
  Vec& operator%=(const Vec& other)
  {
    for (int i = 0;i < m; ++i)
    {
      this->vec[i] *= other.vec[i];
    }
    return *this;
  };

  void print()
  {
    cout << "<<";
    // for debug
    for (int i = 0; i < m; ++i)
    {
      if (i < m - 3 && i > 5)
      {
        cout << "...";
        i = m - 3;
      }
      cout << this->vec[i] << "\t" ;
    }
    cout << ">>" << m << endl;
  };

  // the L2 norm of a vector
  double norm()
  {
    double sum_square = 0;
    for (int i = 0; i < m; ++i)
    {
      sum_square += vec[i] * vec[i];
    }
    return sqrt(sum_square);
  }

  double getCompAt(int i) { return vec[i]; }
};

// a vector addes another vector
inline Vec operator+(Vec l, const Vec& r)
{
  l += r;
  return l;
}

// vector minus a vector
inline Vec operator-(Vec l, const Vec& r)
{
  l -= r;
  return l;
}

// vector multiples a number
inline Vec operator*(Vec l, const double r)
{
  l *= r;
  return l;
}

// vector divides a number
inline Vec operator/(Vec l, const double r)
{
  l *= (1.0 / r);
  return l;
}

// point-wise product
inline Vec operator%(Vec l, const Vec& r)
{
  l %= r;
  return l;
}
#endif