BitMagic-C++
|
Example: sparse_vector<> scan search (non-ordered set functionality) More...
#include <iostream>
#include <vector>
#include <chrono>
#include <algorithm>
#include <random>
#include <stdexcept>
#include "bm.h"
#include "bmsparsevec.h"
#include "bmsparsevec_algo.h"
#include "bmtimer.h"
#include "bmundef.h"
Go to the source code of this file.
Typedefs | |
typedef bm::sparse_vector< bm::id_t, bm::bvector<> > | sparse_vector_u32 |
Functions | |
std::mt19937 | gen (rand_dev()) |
More... | |
std::uniform_int_distribution | rand_dis (1, value_max) |
More... | |
static void | generate_test_set (std::vector< unsigned > &vect, bm::bvector<> &bv_null, sparse_vector_u32 &sv) |
More... | |
static void | vector_search (const std::vector< unsigned > &vect, const bm::bvector<> &bv_null, unsigned value, bm::bvector<> &bv_res) |
More... | |
void | print_bvector (const bm::bvector<> &bv) |
More... | |
int | main (void) |
More... | |
Variables | |
const unsigned | value_max = 1250000 |
const unsigned | test_size = 250000000 |
More... | |
std::random_device | rand_dev |
bm::chrono_taker ::duration_map_type | timing_map |
More... | |
Example: sparse_vector<> scan search (non-ordered set functionality)
Definition in file svsample06.cpp.