Hashiryo's Library

This documentation is automatically generated by competitive-verifier/competitive-verifier

View the Project on GitHub hashiryo/Library

:heavy_check_mark: test/alone/vec.unit_test.cpp

Depends on

Code

// competitive-verifier: STANDALONE

// 特に 型推論 auto で受け取っても正しく動作するかテストする。
#include <cassert>
#include "src/LinearAlgebra/Vector.hpp"

using namespace std;
void vec_int_test() {
 {
  Vector<int> x(3);
  assert(x.size() == 3);
  assert(x[0] == 0);
  assert(x[1] == 0);
  assert(x[2] == 0);
 }
 {
  Vector<int> x(3, 2);
  assert(x.size() == 3);
  assert(x[0] == 2);
  assert(x[1] == 2);
  assert(x[2] == 2);
 }
 {
  Vector<int> x= {1, 2, 3}, y= {1, 2, 3};
  assert(x == y);
 }
 {
  Vector<int> x= {1, 2, 3}, y= {1, 2, 4};
  assert(x != y);
 }
 Vector<int> x= {1, 2, 3};
 assert(x.size() == 3);
 {
  auto y= x;
  assert(y[0] == 1);
  assert(y[1] == 2);
  assert(y[2] == 3);
 }
 {
  auto y= x * 2;
  assert(y[0] == 2);
  assert(y[1] == 4);
  assert(y[2] == 6);
  static_assert(is_same_v<decltype(y), Vector<int>>);
 }
 {
  Vector<int> y= {4, 5, 6};
  auto z= x + y;
  assert(z[0] == 5);
  assert(z[1] == 7);
  assert(z[2] == 9);
  static_assert(is_same_v<decltype(z), Vector<int>>);
 }
 {
  Vector<int> y= {4, 5, 6};
  assert(dot(x, y) == 32);
 }
 {
  x[0]= 2;
  assert(x[0] == 2);
  assert(x[1] == 2);
  assert(x[2] == 3);
 }
}
void vec_bool_test() {
 {
  Vector<bool> x(3);
  assert(x.size() == 3);
  assert(x[0] == 0);
  assert(x[1] == 0);
  assert(x[2] == 0);
 }
 {
  Vector<bool> x(3, 1);
  assert(x.size() == 3);
  assert(x[0] == 1);
  assert(x[1] == 1);
  assert(x[2] == 1);
 }
 {
  Vector<bool> x= {1, 0, 1}, y= {1, 0, 1};
  assert(x == y);
 }
 {
  Vector<bool> x= {1, 0, 1}, y= {1, 0, 0};
  assert(x != y);
 }
 {
  Vector<bool> x(127), y(127);
  x[126]= 1;
  assert(x != y);
 }
 {
  Vector<bool> x(128), y(128);
  x[127]= 1;
  assert(x != y);
 }
 {
  Vector<bool> x(129), y(129);
  x[128]= 1;
  assert(x != y);
 }
 Vector<bool> x= {1, 0, 1};
 assert(x.size() == 3);
 {
  auto y= x;
  assert(y[0] == 1);
  assert(y[1] == 0);
  assert(y[2] == 1);
 }
 {
  auto y= x * 1;
  assert(y[0] == 1);
  assert(y[1] == 0);
  assert(y[2] == 1);
  static_assert(is_same_v<decltype(y), Vector<bool>>);
 }
 {
  auto y= x * 0;
  assert(y[0] == 0);
  assert(y[1] == 0);
  assert(y[2] == 0);
  static_assert(is_same_v<decltype(y), Vector<bool>>);
 }
 {
  Vector<bool> y= {0, 1, 1};
  auto z= x + y;
  assert(z[0] == 1);
  assert(z[1] == 1);
  assert(z[2] == 0);
  static_assert(is_same_v<decltype(z), Vector<bool>>);
 }
 {
  Vector<bool> y= {0, 1, 1};
  assert(dot(x, y) == 1);
 }
 {
  x[0]= 0;
  assert(x[0] == 0);
  assert(x[1] == 0);
  assert(x[2] == 1);
 }
}
signed main() {
 vec_int_test();
 vec_bool_test();
 return 0;
}
#line 1 "test/alone/vec.unit_test.cpp"
// competitive-verifier: STANDALONE

// 特に 型推論 auto で受け取っても正しく動作するかテストする。
#include <cassert>
#line 2 "src/LinearAlgebra/Vector.hpp"
#include <cstdint>
#include <iostream>
#include <valarray>
namespace _la_internal {
using namespace std;
template <class R> struct Vector {
 valarray<R> dat;
 Vector()= default;
 Vector(size_t n): dat(n) {}
 Vector(size_t n, const R &v): dat(v, n) {}
 Vector(const initializer_list<R> &v): dat(v) {}
 R &operator[](int i) { return dat[i]; }
 const R &operator[](int i) const { return dat[i]; }
 bool operator==(const Vector &r) const {
  if (dat.size() != r.dat.size()) return false;
  for (int i= dat.size(); i--;)
   if (dat[i] != r.dat[i]) return false;
  return true;
 }
 bool operator!=(const Vector &r) const { return !(*this == r); }
 explicit operator bool() const { return dat.size(); }
 Vector operator-() const { return Vector(dat.size())-= *this; }
 Vector &operator+=(const Vector &r) { return dat+= r.dat, *this; }
 Vector &operator-=(const Vector &r) { return dat-= r.dat, *this; }
 Vector &operator*=(const R &r) { return dat*= r, *this; }
 Vector operator+(const Vector &r) const { return Vector(*this)+= r; }
 Vector operator-(const Vector &r) const { return Vector(*this)-= r; }
 Vector operator*(const R &r) const { return Vector(*this)*= r; }
 size_t size() const { return dat.size(); }
 friend R dot(const Vector<R> &a, const Vector<R> &b) { return assert(a.size() == b.size()), (a.dat * b.dat).sum(); }
};
using u128= __uint128_t;
using u64= uint64_t;
using u8= uint8_t;
class Ref {
 u128 *ref;
 u8 i;
public:
 Ref(u128 *ref, u8 i): ref(ref), i(i) {}
 Ref &operator=(const Ref &r) { return *this= bool(r); }
 Ref &operator=(bool b) { return *ref&= ~(u128(1) << i), *ref|= u128(b) << i, *this; }
 Ref &operator|=(bool b) { return *ref|= u128(b) << i, *this; }
 Ref &operator&=(bool b) { return *ref&= ~(u128(!b) << i), *this; }
 Ref &operator^=(bool b) { return *ref^= u128(b) << i, *this; }
 operator bool() const { return (*ref >> i) & 1; }
};
template <> class Vector<bool> {
 size_t n;
public:
 valarray<u128> dat;
 Vector(): n(0) {}
 Vector(size_t n): n(n), dat((n + 127) >> 7) {}
 Vector(size_t n, bool b): n(n), dat(-u128(b), (n + 127) >> 7) {
  if (int k= n & 127; k) dat[dat.size() - 1]&= (u128(1) << k) - 1;
 }
 Vector(const initializer_list<bool> &v): n(v.size()), dat((n + 127) >> 7) {
  int i= 0;
  for (bool b: v) dat[i >> 7]|= u128(b) << (i & 127), ++i;
 }
 Ref operator[](int i) { return {begin(dat) + (i >> 7), u8(i & 127)}; }
 bool operator[](int i) const { return (dat[i >> 7] >> (i & 127)) & 1; }
 bool operator==(const Vector &r) const {
  if (dat.size() != r.dat.size()) return false;
  for (int i= dat.size(); i--;)
   if (dat[i] != r.dat[i]) return false;
  return true;
 }
 bool operator!=(const Vector &r) const { return !(*this == r); }
 explicit operator bool() const { return n; }
 Vector operator-() const { return Vector(*this); }
 Vector &operator+=(const Vector &r) { return dat^= r.dat, *this; }
 Vector &operator-=(const Vector &r) { return dat^= r.dat, *this; }
 Vector &operator*=(bool b) { return dat*= b, *this; }
 Vector operator+(const Vector &r) const { return Vector(*this)+= r; }
 Vector operator-(const Vector &r) const { return Vector(*this)-= r; }
 Vector operator*(bool b) const { return Vector(*this)*= b; }
 size_t size() const { return n; }
 friend bool dot(const Vector<bool> &a, const Vector<bool> &b) {
  assert(a.size() == b.size());
  u128 v= 0;
  for (int i= a.dat.size(); i--;) v^= a.dat[i] & b.dat[i];
  return __builtin_parityll(v >> 64) ^ __builtin_parityll(u64(v));
 }
};
template <class R> Vector<R> operator*(const R &r, const Vector<R> &v) { return v * r; }
template <class R> ostream &operator<<(ostream &os, const Vector<R> &v) {
 os << '[';
 for (int _= 0, __= v.size(); _ < __; ++_) os << (_ ? ", " : "") << v[_];
 return os << ']';
}
}
using _la_internal::Vector;
#line 6 "test/alone/vec.unit_test.cpp"

using namespace std;
void vec_int_test() {
 {
  Vector<int> x(3);
  assert(x.size() == 3);
  assert(x[0] == 0);
  assert(x[1] == 0);
  assert(x[2] == 0);
 }
 {
  Vector<int> x(3, 2);
  assert(x.size() == 3);
  assert(x[0] == 2);
  assert(x[1] == 2);
  assert(x[2] == 2);
 }
 {
  Vector<int> x= {1, 2, 3}, y= {1, 2, 3};
  assert(x == y);
 }
 {
  Vector<int> x= {1, 2, 3}, y= {1, 2, 4};
  assert(x != y);
 }
 Vector<int> x= {1, 2, 3};
 assert(x.size() == 3);
 {
  auto y= x;
  assert(y[0] == 1);
  assert(y[1] == 2);
  assert(y[2] == 3);
 }
 {
  auto y= x * 2;
  assert(y[0] == 2);
  assert(y[1] == 4);
  assert(y[2] == 6);
  static_assert(is_same_v<decltype(y), Vector<int>>);
 }
 {
  Vector<int> y= {4, 5, 6};
  auto z= x + y;
  assert(z[0] == 5);
  assert(z[1] == 7);
  assert(z[2] == 9);
  static_assert(is_same_v<decltype(z), Vector<int>>);
 }
 {
  Vector<int> y= {4, 5, 6};
  assert(dot(x, y) == 32);
 }
 {
  x[0]= 2;
  assert(x[0] == 2);
  assert(x[1] == 2);
  assert(x[2] == 3);
 }
}
void vec_bool_test() {
 {
  Vector<bool> x(3);
  assert(x.size() == 3);
  assert(x[0] == 0);
  assert(x[1] == 0);
  assert(x[2] == 0);
 }
 {
  Vector<bool> x(3, 1);
  assert(x.size() == 3);
  assert(x[0] == 1);
  assert(x[1] == 1);
  assert(x[2] == 1);
 }
 {
  Vector<bool> x= {1, 0, 1}, y= {1, 0, 1};
  assert(x == y);
 }
 {
  Vector<bool> x= {1, 0, 1}, y= {1, 0, 0};
  assert(x != y);
 }
 {
  Vector<bool> x(127), y(127);
  x[126]= 1;
  assert(x != y);
 }
 {
  Vector<bool> x(128), y(128);
  x[127]= 1;
  assert(x != y);
 }
 {
  Vector<bool> x(129), y(129);
  x[128]= 1;
  assert(x != y);
 }
 Vector<bool> x= {1, 0, 1};
 assert(x.size() == 3);
 {
  auto y= x;
  assert(y[0] == 1);
  assert(y[1] == 0);
  assert(y[2] == 1);
 }
 {
  auto y= x * 1;
  assert(y[0] == 1);
  assert(y[1] == 0);
  assert(y[2] == 1);
  static_assert(is_same_v<decltype(y), Vector<bool>>);
 }
 {
  auto y= x * 0;
  assert(y[0] == 0);
  assert(y[1] == 0);
  assert(y[2] == 0);
  static_assert(is_same_v<decltype(y), Vector<bool>>);
 }
 {
  Vector<bool> y= {0, 1, 1};
  auto z= x + y;
  assert(z[0] == 1);
  assert(z[1] == 1);
  assert(z[2] == 0);
  static_assert(is_same_v<decltype(z), Vector<bool>>);
 }
 {
  Vector<bool> y= {0, 1, 1};
  assert(dot(x, y) == 1);
 }
 {
  x[0]= 0;
  assert(x[0] == 0);
  assert(x[1] == 0);
  assert(x[2] == 1);
 }
}
signed main() {
 vec_int_test();
 vec_bool_test();
 return 0;
}
Back to top page