Motiejus Jakštys
37e24524c2
git-subtree-dir: deps/cmph git-subtree-mainline:5040f4007bgit-subtree-split:a250982ade
62 lines
1.7 KiB
C++
62 lines
1.7 KiB
C++
#include <cstdio>
|
|
#include <cstdlib>
|
|
|
|
#include "mph_bits.h"
|
|
|
|
using cxxmph::dynamic_2bitset;
|
|
using cxxmph::nextpoweroftwo;
|
|
|
|
int main(int argc, char** argv) {
|
|
dynamic_2bitset small(256, true);
|
|
for (uint32_t i = 0; i < small.size(); ++i) small.set(i, i % 4);
|
|
for (uint32_t i = 0; i < small.size(); ++i) {
|
|
if (small[i] != i % 4) {
|
|
fprintf(stderr, "wrong bits %d at %d expected %d\n", small[i], i, i % 4);
|
|
exit(-1);
|
|
}
|
|
}
|
|
|
|
uint32_t size = 256;
|
|
dynamic_2bitset bits(size, true /* fill with ones */);
|
|
for (uint32_t i = 0; i < size; ++i) {
|
|
if (bits[i] != 3) {
|
|
fprintf(stderr, "wrong bits %d at %d expected %d\n", bits[i], i, 3);
|
|
exit(-1);
|
|
}
|
|
}
|
|
for (uint32_t i = 0; i < size; ++i) bits.set(i, 0);
|
|
for (uint32_t i = 0; i < size; ++i) {
|
|
if (bits[i] != 0) {
|
|
fprintf(stderr, "wrong bits %d at %d expected %d\n", bits[i], i, 0);
|
|
exit(-1);
|
|
}
|
|
}
|
|
for (uint32_t i = 0; i < size; ++i) bits.set(i, i % 4);
|
|
for (uint32_t i = 0; i < size; ++i) {
|
|
if (bits[i] != i % 4) {
|
|
fprintf(stderr, "wrong bits %d at %d expected %d\n", bits[i], i, i % 4);
|
|
exit(-1);
|
|
}
|
|
}
|
|
dynamic_2bitset size_corner1(1);
|
|
if (size_corner1.size() != 1) exit(-1);
|
|
dynamic_2bitset size_corner2(2);
|
|
if (size_corner2.size() != 2) exit(-1);
|
|
(dynamic_2bitset(4, true)).swap(size_corner2);
|
|
if (size_corner2.size() != 4) exit(-1);
|
|
for (uint32_t i = 0; i < size_corner2.size(); ++i) {
|
|
if (size_corner2[i] != 3) exit(-1);
|
|
}
|
|
size_corner2.clear();
|
|
if (size_corner2.size() != 0) exit(-1);
|
|
|
|
dynamic_2bitset empty;
|
|
empty.clear();
|
|
dynamic_2bitset large(1000, true);
|
|
empty.swap(large);
|
|
|
|
if (nextpoweroftwo(3) != 4) exit(-1);
|
|
}
|
|
|
|
|