CppAD: A C++ Algorithmic Differentiation Package
20171217
|
|
inlineprivate |
Does garbage collection when indicated.
This routine should be called when more entries are not being used. If a significant propotion are not being used, the data structure will be compacted.
The size of data_ should equal the number of entries used by the sets plus the number of entries that are not being used data_not_used_. Note that data_[0] never gets used.
Definition at line 342 of file sparse_sizevec.hpp.
Referenced by add_element(), assignment(), binary_intersection(), binary_union(), clear(), post_element(), and process_post().