docs: align doc variable names with code

Doc comments referenced le/ri while the actual parameters and loop variables are named l/r. Also fix the functional graph doc to name the returned childs member, correct the find_substr comment, and reformat the cart_k_ary_tree example block.

Author: cameroncuster

library/graphs/uncommon/functional_graph_processor.hpp

@@ -8,7 +8,7 @@
 //!   bool is_on_cycle = (v == root);
 //! @endcode
 //! root = first reachable node on cycle from v
-//! t[v].childs = forest of reversed edges not in cycles
+//! childs = forest of reversed edges not in cycles
 //! @time O(n)
 //! @space O(n)
 auto func_graph(const vi& a) {

library/loops/quotients.hpp

@@ -1,10 +1,10 @@
 #pragma once
 //! https://github.com/tfg50/Competitive-Programming/blob/master/Biblioteca/Math/DivisionTrick.cpp
-//! i-th iteration gives an interval [le_i, ri_i]:
-//!   - for all i in [le_i, ri_i]: n / i is the same
-//!   - le_0 = 1
-//!   - ri_last = n
-//!   - ri_i + 1 = le_(i+1)
+//! i-th iteration gives an interval [l_i, r_i]:
+//!   - for all i in [l_i, r_i]: n / i is the same
+//!   - l_0 = 1
+//!   - r_last = n
+//!   - r_i + 1 = l_(i+1)
 //! @time O(sqrt(n))
 //! @space O(1)
 for (ll l = 1, r; l <= n && (r = n / (n / l)); l = r + 1) 

library/monotonic_stack/cartesian_binary_tree.hpp

@@ -2,8 +2,8 @@
 #include "monotonic_stack.hpp"
 //! @code
 //!   // right-most min is root
-//!   auto le = mono_st(a, less());
-//!   auto p = cart_binary_tree(le);
+//!   auto l = mono_st(a, less());
+//!   auto p = cart_binary_tree(l);
 //!
 //!   // less_equal() -> left-most min is root
 //!   // greater() -> right-most max is root

library/monotonic_stack/cartesian_k_ary_tree.hpp

@@ -20,11 +20,10 @@
 //! p[5] = 9
 //!
 //! @code
-//!     auto le = mono_st(a, less()), p =
-//!     cart_k_ary_tree(a, le); // min cart tree auto le =
-//!     mono_st(a, greater()), p = cart_k_ary_tree(a, le);
-//!     // max cart tree bool is_node = (p[i] < i || a[i]
-//!     != a[p[i]]);
+//!   auto l = mono_st(a, less());    // min cart tree
+//!   auto l = mono_st(a, greater()); // max cart tree
+//!   auto p = cart_k_ary_tree(a, l);
+//!   bool is_node = (p[i] < i || a[i] != a[p[i]]);
 //! @endcode
 //!
 //! @param a,l array and its left-monotonic stack

library/monotonic_stack/monotonic_range.hpp

@@ -1,12 +1,12 @@
 #pragma once
 #include "monotonic_stack.hpp"
 //! @code
-//!   vector<int> le = mono_st(a, less()),
-//!     ri = mono_range(le);
+//!   vector<int> l = mono_st(a, less()),
+//!     r = mono_range(l);
 //!   // less_equal(), greater(), greater_equal()
 //! @endcode
 //! when cmp == less():
-//!   a[le[i]] < a[i] >= a[ri[i]]
+//!   a[l[i]] < a[i] >= a[r[i]]
 //! @time O(n)
 //! @space O(n)
 vi mono_range(const vi& l) {

library/monotonic_stack/monotonic_stack.hpp

@@ -1,10 +1,10 @@
 #pragma once
 //! @code
-//!   vector<int> le = mono_st(a, less());
+//!   vector<int> l = mono_st(a, less());
 //!   // less_equal(), greater(), greater_equal()
 //! @endcode
 //! when cmp == less():
-//!   a[le[i]] < a[i]
+//!   a[l[i]] < a[i]
 //! @time O(n)
 //! @space O(n)
 vi mono_st(const auto& a, const auto& cmp) {

library/strings/suffix_array/find/find_substring.hpp

@@ -8,7 +8,7 @@
 //! requires s_l < n
 //! for all i in [sa_le,sa_ri): s.substr(s_l,s_r-s_l)
 //!   == s.substr(sa[i],s_r-s_l)
-//!   - `r-l` is the # of matches of
+//!   - `sa_ri-sa_le` is the # of matches of
 //!       s.substr(s_l, s_r - s_l) in s.
 //! @time O(log(|s|))
 //! @space O(1)