fix clang tidy

Author: lrvideckis

library/monotonic_stack/monotonic_stack.hpp

@@ -7,7 +7,7 @@
 //!   a[le[i]] < a[i]
 //! @time O(n)
 //! @space O(n)
-vi mono_st(const auto& a, auto cmp) {
+vi mono_st(const auto& a, const auto& cmp) {
   vi l(sz(a));
   rep(i, 0, sz(a)) for (l[i] = i - 1;
     l[i] >= 0 && !cmp(a[l[i]], a[i]);) l[i] = l[l[i]];

tests/.config/.clang-tidy

@@ -1,5 +1,6 @@
 Checks: >
     -clang-analyzer-core.UndefinedBinaryOperatorResult,
+    -clang-analyzer-core.BitwiseShift,
     bugprone-argument-comment,
     bugprone-assert-side-effect,
     bugprone-bad-signal-to-kill-thread,

tests/library_checker_aizu_tests/math/xor_basis.test.cpp

@@ -26,7 +26,7 @@ int main() {
       int64_t val2 = unordered.shrink(val1);
       assert(val1 == val2);
       for (int64_t v : unordered.b)
-        assert(((1LL << __lg(v)) & val2) == 0);
+        assert((bit_floor((unsigned long long)v) & val2) == 0);
       bool inserted_unordered = unordered.insert(elem);
       bool inserted_ordered_ll = ordered_ll.insert(elem);
       bool inserted_ordered_bitset =

tests/library_checker_aizu_tests/math/xor_basis_intersection.test.cpp

@@ -8,7 +8,7 @@ void check_condition(const basis<int>& b) {
   int n = sz(b.b);
   int or_bits = 0;
   for (int i = n - 1; i >= 0; i--) {
-    int bit_i = 1 << __lg(b.b[i]);
+    int bit_i = bit_floor(unsigned(b.b[i]));
     assert((bit_i & or_bits) == 0);
     or_bits |= b.b[i];
   }