|
OpenVDB
4.0.2
|
Concurrent, page-based, dynamically-sized linear data structure with O(1) random access and STL-compliant iterators. It is primarily intended for applications that involve multi-threading push_back of (a possibly unkown number of) elements into a dynamically growing linear array, and fast random access to said elements. More...
#include <vector>#include <cassert>#include <iostream>#include <algorithm>#include <tbb/atomic.h>#include <tbb/spin_mutex.h>#include <tbb/parallel_for.h>#include <tbb/parallel_sort.h>Go to the source code of this file.
Classes | |
| class | PagedArray< ValueT, Log2PageSize, TableT > |
| Concurrent, page-based, dynamically-sized linear data structure with O(1) random access and STL-compliant iterators. It is primarily intended for applications that concurrently insert (a possibly unkown number of) elements into a dynamically growing linear array, and fast random access to said elements. More... | |
| class | PagedArray< ValueT, Log2PageSize, TableT >::ValueBuffer |
| class | PagedArray< ValueT, Log2PageSize, TableT >::ConstIterator |
| class | PagedArray< ValueT, Log2PageSize, TableT >::Iterator |
| class | PagedArray< ValueT, Log2PageSize, TableT >::Page |
Namespaces | |
| openvdb | |
| openvdb::v4_0_2 | |
| openvdb::v4_0_2::util | |
Concurrent, page-based, dynamically-sized linear data structure with O(1) random access and STL-compliant iterators. It is primarily intended for applications that involve multi-threading push_back of (a possibly unkown number of) elements into a dynamically growing linear array, and fast random access to said elements.
1.8.13