Silly utility to sort vectors indirectly. More...
#include "larcorealg/CoreUtils/makeValueIndex.h"
#include "larcorealg/CoreUtils/MetaUtils.h"
#include <vector>
#include <algorithm>
#include <memory>
#include <iterator>
#include <utility>
#include <type_traits>
Go to the source code of this file.
Namespaces | |
util | |
Namespace for general, non-LArSoft-specific utilities. | |
util::details | |
Functions | |
template<typename Coll > | |
auto | util::makePointerVector (Coll &coll) |
Creates a STL vector with pointers to data from another collection. More... | |
template<typename Coll , typename PtrColl > | |
void | util::MoveFromPointers (Coll &dest, PtrColl &src) |
Moves the content from a collection of pointers to one of data. More... | |
template<typename Coll , typename Sorter > | |
void | util::SortByPointers (Coll &coll, Sorter sorter) |
Applies sorting indirectly, minimizing data copy. More... | |
template<typename Coll , typename Sorter > | |
void | util::SortUniquePointers (Coll &coll, Sorter &&sorter) |
Sorts a vector of unique pointers using a C pointer sorter. More... | |
template<typename Coll , typename PtrColl > | |
void | util::details::moveFromPointersImplBase (Coll &dest, PtrColl &src) |
Silly utility to sort vectors indirectly.
This library is header-only.
Definition in file SortByPointers.h.