37 cout <<
"size = " << array.
size() <<
endl;
39 for (
size_t i = 0; i < array.
size(); ++i)
40 cout << array[i] <<
" ";
48 for (
int i = 0; i < 20; i++)
57 for (
int i = 30; i < 40; i++)
67 ofstream
out(
"test.bits");
71 ifstream
in(
"test.bits");
Space-efficient bit array implementation.
Contiguous array of bits.
void load(std::istream &input)
Loads an array of bits from a file.
constexpr size_t size() const noexcept
Returns the dimension of the bit array.
void save(std::ostream &output) const
Saves the bit sequence in a text file.
Main namespace for Aleph-w library functions.
Divide_Conquer_DP_Result< Cost > divide_and_conquer_partition_dp(const size_t groups, const size_t n, Transition_Cost_Fn transition_cost, const Cost inf=dp_optimization_detail::default_inf< Cost >())
Optimize partition DP using divide-and-conquer optimization.
void print(BitArray &array)