docs: spell out kactl macros in doc comments to match expanded main branch

Author: Cameron Custer

library/contest/random.hpp

@@ -5,7 +5,7 @@
 //!   uint64_t x1 = rng();
 //!   mt19937 rng; // fixed seed for debugging
 //!   int x2 = rnd(0, 1); //random number in [0,1]
-//!   ll x3 = rnd(ll(1), ll(1e18));
+//!   int64_t x3 = rnd(int64_t(1), int64_t(1e18));
 //! @endcode
 mt19937 rng(
   chrono::steady_clock::now().time_since_epoch().count());

library/convolution/gcd_convolution.hpp

@@ -2,7 +2,7 @@
 //! @code
 //!   auto gcd_conv = gcd_convolution(a, b);
 //! @endcode
-//! sz(a)==sz(b)
+//! ssize(a)==ssize(b)
 //! gcd_conv[k] = sum of (a[i]*b[j])
 //!   for all pairs (i,j) where gcd(i,j)==k
 //! @time O(n log n)

library/convolution/lcm_convolution.hpp

@@ -2,7 +2,7 @@
 //! @code
 //!   auto lcm_conv = lcm_convolution(a, b);
 //! @endcode
-//! sz(a)==sz(b)
+//! ssize(a)==ssize(b)
 //! lcm_conv[k] = sum of (a[i]*b[j])
 //!   for all pairs (i,j) where lcm(i,j)==k
 //! @time O(n log n)

library/convolution/xor_convolution.hpp

@@ -2,8 +2,8 @@
 #include "../math/mod_division.hpp"
 //! https://codeforces.com/blog/entry/127823
 //! @code
-//!   vi c = xor_conv(a, b);
-//!   // must have sz(a) == sz(b) == a power of 2
+//!   vector<int> c = xor_conv(a, b);
+//!   // must have ssize(a) == ssize(b) == a power of 2
 //!   // c[k] = sum of a[i]*b[j] where i^j==k
 //! @endcode
 //! @time O(n log n)

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

@@ -1,7 +1,7 @@
 #pragma once
 //! @code
 //!   BIT bit(n);
-//!   bit.walk([&](int r, ll sum) -> bool {
+//!   bit.walk([&](int r, int64_t sum) -> bool {
 //!     // sum = a[0] + a[1] + ... + a[r - 1]
 //!   });
 //!   int r = bit.walk2(sum);

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

@@ -7,12 +7,12 @@
 //!   });
 //!   tree st(n, LLONG_MAX, ranges::min);
 //!   int m1 = st.max_right(l, r,
-//!     [&](int m, ll value) -> bool {
+//!     [&](int m, int64_t value) -> bool {
 //!       // l < m <= r
 //!       // value = op(a[l], a[l+1], ..., a[m-1])
 //!     }); // max m such that f holds; l if none
 //!   int m2 = st.min_left(l, r,
-//!     [&](int m, ll value) -> bool {
+//!     [&](int m, int64_t value) -> bool {
 //!       // l <= m < r
 //!       // value = op(a[m], ..., a[r-2], a[r-1])
 //!     }); // min m such that f holds; r if none

library/data_structures_[l,r)/seg_tree_uncommon/find_first.hpp

@@ -1,9 +1,9 @@
 #pragma once
 //! @code
 //!   seg_tree st(n);
-//!   st.find_first(l, r, [&](ll x, int tl, int tr) ->
-//!   bool {
-//!   });
+//!   st.find_first(l, r,
+//!     [&](int64_t x, int tl, int tr) -> bool {
+//!     });
 //! @endcode
 //! @param l,r defines range [l, r)
 //! @param f defines a function that returns 1 if the

library/data_structures_[l,r)/seg_tree_uncommon/find_last.hpp

@@ -1,9 +1,9 @@
 #pragma once
 //! @code
 //!   seg_tree st(n);
-//!   st.find_last(l, r, [&](ll x, int tl, int tr) ->
-//!   bool {
-//!   });
+//!   st.find_last(l, r,
+//!     [&](int64_t x, int tl, int tr) -> bool {
+//!     });
 //! @endcode
 //! @param l,r defines range [l, r)
 //! @param f defines a function that returns 1 if the

library/data_structures_[l,r)/seg_tree_uncommon/wavelet_matrix.hpp

@@ -2,7 +2,7 @@
 #include "wavelet_bit_vec.hpp"
 //! https://nyaannyaan.github.io/library/data-structure-2d/wavelet-matrix.hpp
 //! @code
-//!   vector<ll> a(n);
+//!   vector<int64_t> a(n);
 //!   wavelet_matrix wm(a, 30); // 0 <= a[i] < (1<<30)
 //!   wm.kth(l, r, k); //(k+1)th smallest number in [l,r)
 //!   wm.kth(l, r, 0); //min in [l,r)

library/data_structures_[l,r)/uncommon/permutation_tree.hpp

@@ -7,7 +7,7 @@
 //! [p[v].mn_idx, p[v].mn_idx+p[v].len) index range
 //! [p[v].mn_num, p[v].mn_num+p[v].len) number range
 //! indexes [0, n) of ch are leaves
-//! indexes [n, sz(ch)) of ch are internal nodes
+//! indexes [n, ssize(ch)) of ch are internal nodes
 //! @time O(n)
 //! @space O(n)
 struct perm_tree {