Function test2

code/data-structures/fenwick_tree.test.cpp:116–148

}

void test2() {
  int n = 5000;
  fenwick_tree_sq ft(n);
  fake_fenwick_tree fft(n);
  for (int i = 0; i < 100000; i++) {
    int op = randint(0, 4);
    if (op == 0) {
      int at = randint(0, n-1);
      assert_equal(range_query(ft, at, at), fft.rsq(at, at));
    } else if (op == 1) {
      int j = randint(0, n-1),
        k = randint(j, n-1);
      // assert_equal(ft.rsq(j, k), fft.rsq(j, k));
      assert_equal(range_query(ft, j, k), fft.rsq(j, k));
    } else if (op == 2) {
      int at = randint(0, n-1);
      assert_equal(range_query(ft, 0, at), fft.rsq(at));
    } else if (op == 3) {
      int j = randint(0, n-1),
        k = randint(j, n-1),
        v = randint(-1337, 1337);
      // ft.update(j, k, v);
      range_update(ft, j, k, v);
      fft.update(j, k, v);
    } else {
      int at = randint(0, n-1),
        upd = randint(-1337, 1337);
      range_update(ft, at, at, upd);
      // ft.update(at, upd);
      fft.update(at, upd);
    }
  }
}

void test() {
  test1();