fix bugs for lazy_segment_tree and it's test

Author: Mr-Python-in-China

.github/workflows/testLibrary.yml

@@ -30,4 +30,4 @@ jobs:
       - name: Test
         run: |
           cd library
-          ./test.exe --gtest_repeat=8
+          ./test.exe --gtest_repeat=20

library/makefile

@@ -2,7 +2,7 @@ STDCXX ?= c++14
 
 CXX ?= g++
 
-CXXFLAGS = -Wall -Wextra -g -I. -MMD -std=$(STDCXX)
+CXXFLAGS = -Wall -Wextra -g -I. -MMD -std=$(STDCXX) -O2
 
 TARGET = test.exe
 

library/mrpython/lazy_segment_tree.hpp

@@ -103,6 +103,7 @@ class lazy_segment_tree {
         n(len),
         lazyInit(lazyInitVal),
         mergeData(mergeDataFun),
+        operate(OperateFun),
         mergeLazy(mergeTagFun) {
     build();
   }

library/test/lazy_segment_tree/lazy_segment_tree_add_add.cpp

@@ -19,12 +19,13 @@ TEST(lazy_segment_tree, add) {
     if (l > r) std::swap(l, r);
     assert(l < r + 1);
     if (operator_dist(gen)) {
-      int ans = std::accumulate(a.begin() + l, a.begin() + r + 1, (unsigned)0);
+      unsigned ans =
+          std::accumulate(a.begin() + l, a.begin() + r + 1, (unsigned)0);
       EXPECT_EQ(tree.get(l, r + 1), ans);
     } else {
       unsigned value = val_dist(gen);
-      for (std::size_t i = l; i < r; ++i) a[i] += value;
-      tree.set(l, r, value);
+      for (std::size_t i = l; i < r + 1; ++i) a[i] += value;
+      tree.set(l, r + 1, value);
     }
   }
 }