| ▼ core | |
| ▼ vbl | |
| ▼ io | |
| vbl_io_array_1d.h | |
| vbl_io_array_1d.hxx | Binary IO functions for vbl_array_1d<T> |
| vbl_io_array_2d.h | |
| vbl_io_array_2d.hxx | Binary IO functions for vbl_array_2d<T> |
| vbl_io_array_3d.h | |
| vbl_io_array_3d.hxx | Binary IO functions for vbl_array_3d<T> |
| vbl_io_bounding_box.h | |
| vbl_io_bounding_box.hxx | |
| vbl_io_quadruple.h | Binary IO functions for vbl_quadruple<S, T, U> |
| vbl_io_quadruple.hxx | Binary IO functions for vbl_quadruple<S, T, U, V> |
| vbl_io_smart_ptr.h | Serialised binary IO functions for vbl_smart_ptr<T> |
| vbl_io_smart_ptr.hxx | Serialised binary IO functions for vbl_smart_ptr<T> |
| vbl_io_sparse_array_1d.h | |
| vbl_io_sparse_array_2d.h | |
| vbl_io_sparse_array_3d.h | |
| vbl_io_sparse_array_base.h | |
| vbl_io_sparse_array_base.hxx | |
| vbl_io_triple.h | Binary IO functions for vbl_triple<S, T, U> |
| vbl_io_triple.hxx | Binary IO functions for vbl_triple<S, T, U> |
| vbl_array_1d.h | A simple container |
| vbl_array_1d.hxx | |
| vbl_array_2d.h | Contains class for a templated 2d array |
| vbl_array_2d.hxx | |
| vbl_array_3d.h | Contains class for templated 3d array |
| vbl_array_3d.hxx | |
| vbl_attributes.h | Find summary attributes of an array |
| vbl_attributes.hxx | |
| vbl_batch_compact_multimap.h | Like a smaller and slightly faster vcl_batch_multimap but without the pair<key, value> sequence |
| vbl_batch_multimap.h | Like a faster std::multimap but using only a single block of memory, and no fast insertion or deletion |
| vbl_big_sparse_array_3d.h | Sparse 3D array |
| vbl_big_sparse_array_3d.hxx | |
| vbl_bit_array_2d.cxx | |
| vbl_bit_array_2d.h | Contains class for a 2d bit array; interface as vbl_array_2d<T> |
| vbl_bit_array_3d.cxx | |
| vbl_bit_array_3d.h | Classes vbl_bit_array_3d_base and vbl_bit_array_3d |
| vbl_bool_ostream.cxx | |
| vbl_bool_ostream.h | |
| vbl_bounding_box.h | Contains a bounding box class |
| vbl_bounding_box.hxx | |
| vbl_checked_delete.h | |
| vbl_disjoint_sets.cxx | |
| vbl_disjoint_sets.h | Implements a disjoint set (union, find) |
| vbl_edge.cxx | |
| vbl_edge.h | A class representing a graph edge with integer vertex ids |
| vbl_fwd.h | |
| vbl_graph_partition.cxx | |
| vbl_graph_partition.h | Partitions a graph into disjoint connected components |
| vbl_local_minima.h | Find local minima in arrays |
| vbl_local_minima.hxx | |
| vbl_qsort.cxx | |
| vbl_qsort.h | Collection of common predicates for library sort routines |
| vbl_quadruple.h | Templated 4-tuple |
| vbl_quadruple.hxx | |
| vbl_ref_count.h | |
| vbl_scoped_ptr.h | Scoped pointer lifted from BOOST |
| vbl_shared_pointer.h | Non-intrusive smart pointers |
| vbl_smart_ptr.h | Contains a templated smart pointer class |
| vbl_smart_ptr.hxx | |
| vbl_sort.cxx | |
| vbl_sort.h | Collection of common predicates for sorting |
| vbl_sort.hxx | |
| vbl_sparse_array_1d.h | Sparse array allowing space efficient access of the form s[3000]=2 |
| vbl_sparse_array_1d.hxx | |
| vbl_sparse_array_2d.h | Space efficient 2d array |
| vbl_sparse_array_2d.hxx | |
| vbl_sparse_array_3d.h | Space efficient 3d array |
| vbl_sparse_array_3d.hxx | |
| vbl_sparse_array_base.h | Base class for sparse arrays |
| vbl_sparse_array_base.hxx | Contains a base class for sparse arrays |
| vbl_triple.h | Templated 3-tuple |
| vbl_triple.hxx | |
