remove some const; release 0.2.6

Author: Mr-Python-in-China

library/mrpython/lazy_segment_tree.hpp

@@ -15,10 +15,10 @@ class lazy_segment_tree {
   std::vector<Lazy> lazy;
   std::vector<size_t> size;
   size_t n;
-  Lazy const lazyInit;
-  MergeFunction const mergeData;
-  OperateFunction const operate;
-  MergeLazyFunction const mergeLazy;
+  Lazy lazyInit;
+  MergeFunction mergeData;
+  OperateFunction operate;
+  MergeLazyFunction mergeLazy;
   void build(void) {
     data.reserve(2 * n - 1), size.reserve(2 * n - 1);
     for (size_t i = n; i < 2 * n - 1; ++i) {

library/mrpython/sparse_table.hpp

@@ -18,7 +18,7 @@ using std::size_t;
  */
 template <typename T, typename MergeFunction> class sparse_table {
   std::vector<std::vector<T>> table;
-  MergeFunction const merge;
+  MergeFunction merge;
 
  public:
   template <typename InputIterator>

library/mrpython/typical_segment_tree.hpp

@@ -18,7 +18,7 @@ template <typename T, typename MergeFunction> class typical_segment_tree {
   std::vector<T> data;
   std::vector<size_t> size;
   size_t n;
-  MergeFunction const merge;
+  MergeFunction merge;
   void build(void) {
     data.reserve(2 * n - 1), size.reserve(2 * n - 1);
     for (size_t i = n; i < 2 * n - 1; ++i) {

package.json

@@ -2,7 +2,7 @@
   "name": "mp-oi-library",
   "displayName": "mp-oi-library",
   "description": "Some algorithms and data structures template for competitive programming.",
-  "version": "0.2.5",
+  "version": "0.2.6",
   "repository": "https://github.com/Mr-Python-in-China/mp-oi-library",
   "license": "LGPL-3.0-only",
   "author": {