Example: how to use bm::aggregator<> for logical operations. More...
#include <stdlib.h>#include <iostream>#include <vector>#include <memory>#include "bm.h"#include "bmaggregator.h"#include "bmundef.h"
Include dependency graph for sample16.cpp:
Go to the source code of this file.
Functions | |
| template<class T > | |
| void | PrintContainer (T first, T last) |
| More... | |
| int | main (void) |
| More... | |
Variables | |
| const unsigned | max_vectors = 10 |
| More... | |
Detailed Description
Example: how to use bm::aggregator<> for logical operations.
bm::aggregator<> uses cache blocking techniques and bandwidth optimizations to do logical operations (OR, AND, AND-SUB) faster, than if we do it by combining bit-vectors one by one, sequentially.
Definition in file sample16.cpp.
