vector.cc 2.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122
  1. /**
  2. * Copyright (c) 2016-present, Facebook, Inc.
  3. * All rights reserved.
  4. *
  5. * This source code is licensed under the MIT license found in the
  6. * LICENSE file in the root directory of this source tree.
  7. */
  8. #include "vector.h"
  9. #include <assert.h>
  10. #include <cmath>
  11. #include <iomanip>
  12. #include <utility>
  13. #include "matrix.h"
  14. #include "qmatrix.h"
  15. namespace fasttext {
  16. Vector::Vector(int64_t m) : data_(m) {}
  17. Vector::Vector(Vector&& other) noexcept : data_(std::move(other.data_)) {}
  18. Vector& Vector::operator=(Vector&& other) {
  19. data_ = std::move(other.data_);
  20. return *this;
  21. }
  22. void Vector::zero() {
  23. std::fill(data_.begin(), data_.end(), 0.0);
  24. }
  25. real Vector::norm() const {
  26. real sum = 0;
  27. for (int64_t i = 0; i < size(); i++) {
  28. sum += data_[i] * data_[i];
  29. }
  30. return std::sqrt(sum);
  31. }
  32. void Vector::mul(real a) {
  33. for (int64_t i = 0; i < size(); i++) {
  34. data_[i] *= a;
  35. }
  36. }
  37. void Vector::addVector(const Vector& source) {
  38. assert(size() == source.size());
  39. for (int64_t i = 0; i < size(); i++) {
  40. data_[i] += source.data_[i];
  41. }
  42. }
  43. void Vector::addVector(const Vector& source, real s) {
  44. assert(size() == source.size());
  45. for (int64_t i = 0; i < size(); i++) {
  46. data_[i] += s * source.data_[i];
  47. }
  48. }
  49. void Vector::addRow(const Matrix& A, int64_t i) {
  50. assert(i >= 0);
  51. assert(i < A.size(0));
  52. assert(size() == A.size(1));
  53. for (int64_t j = 0; j < A.size(1); j++) {
  54. data_[j] += A.at(i, j);
  55. }
  56. }
  57. void Vector::addRow(const Matrix& A, int64_t i, real a) {
  58. assert(i >= 0);
  59. assert(i < A.size(0));
  60. assert(size() == A.size(1));
  61. for (int64_t j = 0; j < A.size(1); j++) {
  62. data_[j] += a * A.at(i, j);
  63. }
  64. }
  65. void Vector::addRow(const QMatrix& A, int64_t i) {
  66. assert(i >= 0);
  67. A.addToVector(*this, i);
  68. }
  69. void Vector::mul(const Matrix& A, const Vector& vec) {
  70. assert(A.size(0) == size());
  71. assert(A.size(1) == vec.size());
  72. for (int64_t i = 0; i < size(); i++) {
  73. data_[i] = A.dotRow(vec, i);
  74. }
  75. }
  76. void Vector::mul(const QMatrix& A, const Vector& vec) {
  77. assert(A.getM() == size());
  78. assert(A.getN() == vec.size());
  79. for (int64_t i = 0; i < size(); i++) {
  80. data_[i] = A.dotRow(vec, i);
  81. }
  82. }
  83. int64_t Vector::argmax() {
  84. real max = data_[0];
  85. int64_t argmax = 0;
  86. for (int64_t i = 1; i < size(); i++) {
  87. if (data_[i] > max) {
  88. max = data_[i];
  89. argmax = i;
  90. }
  91. }
  92. return argmax;
  93. }
  94. std::ostream& operator<<(std::ostream& os, const Vector& v) {
  95. os << std::setprecision(5);
  96. for (int64_t j = 0; j < v.size(); j++) {
  97. os << v[j] << ' ';
  98. }
  99. return os;
  100. }
  101. } // namespace fasttext