BitMagic-C++
|
Example: sparse_vector<> lower bound search. More...
#include <iostream>
#include <vector>
#include <chrono>
#include <algorithm>
#include <random>
#include <stdexcept>
#include "bm.h"
#include "bmsparsevec.h"
#include "bmsparsevec_algo.h"
Go to the source code of this file.
Typedefs | |
typedef bm::sparse_vector< bm::id_t, bm::bvector<> > | sparse_vector_u32 |
Functions | |
static void | generate_set (vector< unsigned > &vec) |
static void | insertion_sort (sparse_vector_u32 &sv, const vector< unsigned > &vec) |
int | main (void) |
Example: sparse_vector<> lower bound search.
Definition in file svsample07.cpp.
typedef bm::sparse_vector<bm::id_t, bm::bvector<> > sparse_vector_u32 |
Definition at line 46 of file svsample07.cpp.
|
static |
|
static |
Definition at line 72 of file svsample07.cpp.
References bm::sparse_vector< Val, BV >::insert(), and bm::sparse_vector_scanner< SV >::lower_bound().
Referenced by main().
int main | ( | void | ) |
Definition at line 90 of file svsample07.cpp.
References bm::sparse_vector< Val, BV >::begin(), bm::sparse_vector< Val, BV >::const_iterator, bm::sparse_vector< Val, BV >::end(), generate_set(), insertion_sort(), and bm::sparse_vector< Val, BV >::optimize().