remove old way which doesnt work anymore

Author: lrvideckis

library/data_structures_[l,r)/seg_tree.hpp

@@ -9,12 +9,10 @@
 //!   st.max_right(l, r, [&](int m, ll value) {
 //!     // l < m <= r
 //!     // value = op(a[l], a[l+1], ..., a[m-1])
-//!     return value <= x;
 //!   });
 //!   st.min_left(l, r, [&](int m, ll value) {
 //!     // l <= m < r
 //!     // value = op(a[m], ..., a[r-2], a[r-1])
-//!     return value <= x;
 //!   });
 //! @endcode
 //! @time O(n + q log n)

library/data_structures_[l,r]/seg_tree.hpp

@@ -8,12 +8,10 @@
 //!   st.max_right(l, r, [&](int m, ll value) {
 //!     // l <= m <= r
 //!     // value = op(a[l], a[l+1], ..., a[m])
-//!     return value <= x;
 //!   });
 //!   st.min_left(l, r, [&](int m, ll value) {
 //!     // l <= m <= r
 //!     // value = op(a[m], ..., a[r-1], a[r])
-//!     return value <= x;
 //!   });
 //! @endcode
 //! @time O(n + q log n)