RetroSearch Browse

Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Showing content from http://www.ncbi.nlm.nih.gov/IEB/ToolBox/CPP_DOC/doxyhtml/classbm_1_1heap__vector.html below:

NCBI C++ ToolKit: bm::heap_vector< Val, BVAlloc, trivial_type

Search Toolkit Book for bm::heap_vector

Simple heap allocated vector based on bvector allocator. More...

#include <util/bitset/bmbuffer.h>

template<typename Val, typename BVAlloc, bool trivial_type>
class bm::heap_vector< Val, BVAlloc, trivial_type >

Simple heap allocated vector based on bvector allocator.

Definition at line 341 of file bmbuffer.h.

◆ buffer_type

template<typename Val , typename BVAlloc , bool trivial_type>

Definition at line 345 of file bmbuffer.h.

◆ bv_allocator_type

template<typename Val , typename BVAlloc , bool trivial_type>

Definition at line 344 of file bmbuffer.h.

◆ size_type

template<typename Val , typename BVAlloc , bool trivial_type>

Definition at line 347 of file bmbuffer.h.

◆ value_type

template<typename Val , typename BVAlloc , bool trivial_type>

Definition at line 346 of file bmbuffer.h.

◆ heap_vector() [1/2]

template<typename Val , typename BVAlloc , bool trivial_type>

Definition at line 349 of file bmbuffer.h.

◆ heap_vector() [2/2]

template<typename Val , typename BVAlloc , bool trivial_type>

Definition at line 352 of file bmbuffer.h.

◆ ~heap_vector()

template<typename Val , typename BVAlloc , bool trivial_type>

Definition at line 384 of file bmbuffer.h.

◆ add()

template<typename Val , typename BVAlloc , bool trivial_type>

Add element to the end of the vector, return reference.

Returns: reference the the last element

Definition at line 539 of file bmbuffer.h.

Referenced by TestHeapVector().

◆ at() [1/2]

template<typename Val , typename BVAlloc , bool trivial_type>

◆ at() [2/2]

template<typename Val , typename BVAlloc , bool trivial_type>

Definition at line 426 of file bmbuffer.h.

◆ begin()

template<typename Val , typename BVAlloc , bool trivial_type>

Definition at line 434 of file bmbuffer.h.

◆ capacity()

template<typename Val , typename BVAlloc , bool trivial_type>

◆ data()

template<typename Val , typename BVAlloc , bool trivial_type>

Definition at line 399 of file bmbuffer.h.

Referenced by bm::aggregator< BV >::combine_and_sub(), bm::aggregator< BV >::pipeline< Opt >::complete(), bm::aggregator< BV >::pipeline< Opt >::complete_arg_group(), bm::deserializer< BV, DEC >::deserializer(), bm::str_sparse_vector< CharType, BV, STR_SIZE >::const_reference::get(), bm::str_sparse_vector< CharType, BV, STR_SIZE >::reference::get(), bm::interval_enumerator< BV >::go_to_impl(), bm::aggregator< BV >::process_bit_blocks_and(), bm::aggregator< BV >::process_bit_blocks_sub(), bm::sparse_vector_scanner< SV, S_FACTOR >::remap_tosv(), and bm::xor_scanner< BV >::sync_nb_vect().

◆ empty()

template<typename Val , typename BVAlloc , bool trivial_type>

Definition at line 449 of file bmbuffer.h.

◆ operator=()

template<typename Val , typename BVAlloc , bool trivial_type>

Definition at line 366 of file bmbuffer.h.

◆ operator[]() [1/2]

template<typename Val , typename BVAlloc , bool trivial_type>

Definition at line 406 of file bmbuffer.h.

◆ operator[]() [2/2]

template<typename Val , typename BVAlloc , bool trivial_type>

Definition at line 412 of file bmbuffer.h.

◆ push_back()

template<typename Val , typename BVAlloc , bool trivial_type>

◆ push_back_no_check()

template<typename Val , typename BVAlloc , bool trivial_type>

◆ reserve()

template<typename Val , typename BVAlloc , bool trivial_type>

◆ reset()

template<typename Val , typename BVAlloc , bool trivial_type>

◆ resize()

template<typename Val , typename BVAlloc , bool trivial_type>

vector resize

Parameters: new_size - new number of elements init_destroy_values - need to init or destroy values false - skip construction/destruction

Definition at line 480 of file bmbuffer.h.

Referenced by bm::str_sparse_vector< CharType, BV, STR_SIZE >::const_reference::const_reference(), bm::compressed_collection_deserializer< CBC >::deserialize(), bm::deserializer< BV, DEC >::deserializer(), bm::xor_scanner< BV >::free_blocks(), bm::interval_enumerator< BV >::go_to_impl(), bm::heap_vector< const bm::word_t *, allocator_type, true >::operator=(), bm::simple_queue< Value, BVAlloc, trivial_type >::pop(), bm::str_sparse_vector< CharType, BV, STR_SIZE >::reference::reference(), bm::sparse_vector_scanner< SV, S_FACTOR >::remap_tosv(), bm::aggregator< bvector_type >::arg_groups::reset(), bm::bv_ref_vector< BV >::reset(), bm::heap_vector< const bm::word_t *, allocator_type, true >::reset(), bm::sparse_vector_serial_layout< SV >::resize_slices(), bm::xor_scanner< BV >::search_best_xor_mask(), bm::serializer< BV >::serializer(), bm::xor_scanner< BV >::sync_nb_vect(), TestHeapVector(), and bm::simple_queue< Value, BVAlloc, trivial_type >::try_pop().

◆ resize_internal()

template<typename Val , typename BVAlloc , bool trivial_type>

◆ resize_no_check()

template<typename Val , typename BVAlloc , bool trivial_type>

resize without content preservation or capacity verification

Definition at line 528 of file bmbuffer.h.

◆ resize_no_copy()

template<typename Val , typename BVAlloc , bool trivial_type>

◆ size()

template<typename Val , typename BVAlloc , bool trivial_type>

Definition at line 439 of file bmbuffer.h.

Referenced by bm::heap_vector< const bm::word_t *, allocator_type, true >::add(), bm::aggregator< BV >::arg_groups::add(), bm::heap_vector< const bm::word_t *, allocator_type, true >::at(), bm::aggregator< BV >::combine_and_sub(), bm::aggregator< BV >::pipeline< Opt >::complete(), bm::aggregator< BV >::pipeline< Opt >::complete_arg_group(), bm::aggregator< BV >::pipeline< Opt >::complete_arg_sub_group(), bm::xor_scanner< BV >::compute_sim_model(), bm::xor_scanner< BV >::deoptimize_gap_blocks(), bm::simple_queue< Value, BVAlloc, trivial_type >::empty(), bm::xor_scanner< BV >::free_blocks(), bm::simple_queue< Value, BVAlloc, trivial_type >::front(), bm::interval_enumerator< BV >::go_to_impl(), bm::heap_vector< const bm::word_t *, allocator_type, true >::heap_vector(), bm::heap_vector< const bm::word_t *, allocator_type, true >::operator=(), bm::heap_vector< const bm::word_t *, allocator_type, true >::operator[](), bm::simple_queue< Value, BVAlloc, trivial_type >::pop(), bm::aggregator< BV >::process_bit_blocks_and(), bm::aggregator< BV >::process_bit_blocks_or(), bm::aggregator< BV >::process_bit_blocks_sub(), bm::aggregator< BV >::process_gap_blocks_and(), bm::aggregator< BV >::process_gap_blocks_or(), bm::aggregator< BV >::process_gap_blocks_sub(), bm::heap_vector< const bm::word_t *, allocator_type, true >::push_back(), bm::heap_vector< const bm::word_t *, allocator_type, true >::push_back_no_check(), bm::heap_vector< const bm::word_t *, allocator_type, true >::reserve(), bm::heap_vector< const bm::word_t *, allocator_type, true >::resize(), bm::bv_ref_vector< BV >::resize_xor_matrix(), bm::xor_scanner< BV >::search_best_xor_mask(), bm::aggregator< bvector_type >::pipeline::size(), bm::simple_queue< Value, BVAlloc, trivial_type >::size(), bm::bv_ref_vector< BV >::size(), bm::xor_scanner< BV >::sync_nb_vect(), TestHeapVector(), bm::simple_queue< Value, BVAlloc, trivial_type >::try_pop(), bm::simple_queue< Value, BVAlloc, trivial_type >::try_push(), bm::aggregator< bvector_type >::pipeline::unique_vectors(), and bm::heap_vector< const bm::word_t *, allocator_type, true >::~heap_vector().

◆ swap()

template<typename Val , typename BVAlloc , bool trivial_type>

◆ throw_range_error()

template<typename Val , typename BVAlloc , bool trivial_type>

void bm::heap_vector< Val, BVAlloc, trivial_type >::throw_range_error ( const char * err_msg ) const inlineprotected ◆ value_size()

template<typename Val , typename BVAlloc , bool trivial_type>

inlinestaticprotectednoexcept

Definition at line 588 of file bmbuffer.h.

Referenced by bm::heap_vector< const bm::word_t *, allocator_type, true >::add(), bm::heap_vector< const bm::word_t *, allocator_type, true >::capacity(), bm::heap_vector< const bm::word_t *, allocator_type, true >::heap_vector(), bm::heap_vector< const bm::word_t *, allocator_type, true >::operator=(), bm::heap_vector< const bm::word_t *, allocator_type, true >::push_back(), bm::heap_vector< const bm::word_t *, allocator_type, true >::push_back_no_check(), bm::heap_vector< const bm::word_t *, allocator_type, true >::reserve(), bm::heap_vector< const bm::word_t *, allocator_type, true >::resize(), bm::heap_vector< const bm::word_t *, allocator_type, true >::resize_internal(), bm::heap_vector< const bm::word_t *, allocator_type, true >::resize_no_check(), bm::heap_vector< const bm::word_t *, allocator_type, true >::resize_no_copy(), bm::heap_vector< const bm::word_t *, allocator_type, true >::size(), and bm::heap_vector< const bm::word_t *, allocator_type, true >::~heap_vector().

◆ buffer_

template<typename Val , typename BVAlloc , bool trivial_type>

Definition at line 605 of file bmbuffer.h.

Referenced by bm::heap_vector< const bm::word_t *, allocator_type, true >::add(), bm::heap_vector< const bm::word_t *, allocator_type, true >::at(), bm::heap_vector< const bm::word_t *, allocator_type, true >::begin(), bm::heap_vector< const bm::word_t *, allocator_type, true >::capacity(), bm::heap_vector< const bm::word_t *, allocator_type, true >::data(), bm::heap_vector< const bm::word_t *, allocator_type, true >::empty(), bm::heap_vector< const bm::word_t *, allocator_type, true >::heap_vector(), bm::heap_vector< const bm::word_t *, allocator_type, true >::operator=(), bm::heap_vector< const bm::word_t *, allocator_type, true >::operator[](), bm::heap_vector< const bm::word_t *, allocator_type, true >::push_back(), bm::heap_vector< const bm::word_t *, allocator_type, true >::push_back_no_check(), bm::heap_vector< const bm::word_t *, allocator_type, true >::reserve(), bm::heap_vector< const bm::word_t *, allocator_type, true >::reset(), bm::heap_vector< const bm::word_t *, allocator_type, true >::resize(), bm::heap_vector< const bm::word_t *, allocator_type, true >::resize_internal(), bm::heap_vector< const bm::word_t *, allocator_type, true >::resize_no_check(), bm::heap_vector< const bm::word_t *, allocator_type, true >::resize_no_copy(), bm::heap_vector< const bm::word_t *, allocator_type, true >::size(), bm::heap_vector< const bm::word_t *, allocator_type, true >::swap(), and bm::heap_vector< const bm::word_t *, allocator_type, true >::~heap_vector().

The documentation for this class was generated from the following file:

include/util/bitset/bmbuffer.h

RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4