update docs again

Author: lrvideckis

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

@@ -1,4 +1,12 @@
 #pragma once
+//! @code
+//!   bit.walk([&](int r, ll sum) -> bool {
+//!     // sum = a[0] + a[1] + ... + a[r - 1]
+//!   });
+//!   int r = bit.walk2(sum);
+//!   // Returns min r s.t. sum of [0,r] >= sum
+//!   // Returns n if sum of [0,n-1] < sum
+//! @endcode
 //! @time O(n + q log n)
 //! @space O(n)
 // NOLINTNEXTLINE(readability-identifier-naming)

library/data_structures_[l,r)/bit_uncommon/walk.hpp

@@ -1,6 +1,3 @@
-//! Requires sum of [i,i] >= 0
-//! Returns min r s.t. sum of [0,r] >= sum
-//! Returns n if sum of [0,n-1] < sum
 int walk2(ll sum) {
   if (sum <= 0) return -1;
   int r = 0;

library/data_structures_[l,r)/bit_uncommon/walk_lambda.hpp

@@ -1,8 +1,3 @@
-//! @code
-//!   bit.walk([&](int r, ll sum) -> bool {
-//!     // sum = a[0] + a[1] + ... + a[r - 1]
-//!   });
-//! @endcode
 void walk(const auto& f) {
   ll sum = 0;
   for (int i = bit_floor(size(s)), r = 0; i; i /= 2)

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

@@ -1,4 +1,12 @@
 #pragma once
+//! @code
+//!   bit.walk([&](int r, ll sum) -> bool {
+//!     // sum = a[0] + a[1] + ... + a[r]
+//!   });
+//!   int r = bit.walk2(sum);
+//!   // Returns min r s.t. sum of [0,r] >= sum
+//!   // Returns n if sum of [0,n-1] < sum
+//! @endcode
 //! @time O(n + q log n)
 //! @space O(n)
 // NOLINTNEXTLINE(readability-identifier-naming)

library/data_structures_[l,r]/bit_uncommon/walk_lambda.hpp

@@ -1,8 +1,3 @@
-//! @code
-//!   bit.walk([&](int r, ll sum) -> bool {
-//!     // sum = a[0] + a[1] + ... + a[r]
-//!   });
-//! @endcode
 void walk(const auto& f) {
   ll sum = 0;
   for (int i = bit_floor(size(s)), r = 0; i; i /= 2)