enumerate/bits.hpp

• View this file on GitHub
• Last update: 2025-01-04 13:02:14+09:00
• Include: #include "enumerate/bits.hpp"

Required by

• graph/count/count_cycle.hpp
• graph/steiner_tree.hpp
• knapsack/subset_sum.hpp
• linalg/hafnian.hpp

Verified with

• test/1_mytest/subset_sum.test.cpp
• test/2_library_checker/linear_algebra/hafnian_of_matrix.test.cpp
• test/3_yukicoder/114.test.cpp
• test/3_yukicoder/2507.test.cpp
• test/3_yukicoder/4_2.test.cpp

Code

template <typename BS, typename F>
void enumerate_bits_bitset(BS& b, int L, int R, F f) {
  if (L >= len(b)) return;
  int p = (b[L] ? L : b._Find_next(L));
  while (p < R) {
    f(p);
    p = b._Find_next(p);
  }
}

#line 1 "enumerate/bits.hpp"
template <typename BS, typename F>
void enumerate_bits_bitset(BS& b, int L, int R, F f) {
  if (L >= len(b)) return;
  int p = (b[L] ? L : b._Find_next(L));
  while (p < R) {
    f(p);
    p = b._Find_next(p);
  }
}

Back to top page