Class List
Here are the classes, structs, unions and interfaces with brief descriptions:
vbl_bool_ostream::high_low
vbl_batch_compact_multimap< K, T, C >::input_compareA comparator to sort input data, by ignoring the value in pair<key, value>
vbl_disjoint_sets::node
vbl_bool_ostream::on_off
vbl_bool_ostream::true_false
vbl_batch_multimap< K, T, C >::value_compare_t
vbl_array_1d< T >A simple container
vbl_array_2d< T >Simple 2D array
vbl_array_3d< T >Templated 3-dimensional array
vbl_batch_compact_multimap< K, T, C >A fast read and batch-write map-style collection
vbl_batch_multimap< K, T, C >A fast read and batch-write map-style collection
vbl_big_sparse_array_3d< T >
vbl_bit_array_2dSimple 2D bit array
vbl_bit_array_3d
vbl_bool_ostream
vbl_bounding_box< T, DIM >A class to hold and update a bounding box
vbl_bounding_box_base< T, DIM_ >
vbl_disjoint_sets
vbl_edge
vbl_quadruple< T1, T2, T3, T4 >Templated 4-tuple
vbl_ref_count
vbl_scoped_ptr< T >Vbl_scoped_ptr mimics a built-in pointer except that it guarantees deletion of the object pointed to, either on destruction of the vbl_scoped_ptr or via an explicit reset()
vbl_shared_pointer< T >Non-intrusive smart pointers
vbl_shared_pointer_data
vbl_smart_ptr< T >A templated smart pointer class
vbl_smart_ptr_T_as_string< T >
vbl_sort_helper< T >Collection of common predicates for sorting
vbl_sparse_array_1d< T >Sparse array allowing space efficient access of the form s[3000] = 2;
vbl_sparse_array_2d< T >Sparse 2D array allowing space efficient access of the form s(300,700) =2
vbl_sparse_array_3d< T >Sparse 3d array allowing space efficient access
vbl_sparse_array_base< T, Index >A fully featured sparse array which devolves indexing to its templated type
vbl_triple< T1, T2, T3 >Templated 3-tuple