#include "Define.h"
#include "MapUtils.h"
#include "Random.h"
#include <algorithm>
#include <iterator>
#include <stdexcept>
#include <type_traits>
#include <utility>
#include <vector>
Go to the source code of this file.
|
| template<class C > |
| void | Trinity::Containers::RandomResize (C &container, std::size_t requestedSize) |
| |
| template<class C , class Predicate > |
| void | Trinity::Containers::RandomResize (C &container, Predicate &&predicate, std::size_t requestedSize) |
| |
| template<class C > |
| auto | Trinity::Containers::SelectRandomContainerElement (C const &container) -> typename std::add_const< decltype(*std::begin(container))>::type & |
| |
| template<class C > |
| auto | Trinity::Containers::SelectRandomWeightedContainerElement (C const &container, std::vector< double > weights) -> decltype(std::begin(container)) |
| |
| template<class C , class Fn > |
| auto | Trinity::Containers::SelectRandomWeightedContainerElement (C const &container, Fn weightExtractor) -> decltype(std::begin(container)) |
| |
| template<class C > |
| void | Trinity::Containers::RandomShuffle (C &container) |
| | Reorder the elements of the container randomly.
|
| |
| template<class Iterator1 , class Iterator2 > |
| bool | Trinity::Containers::Intersects (Iterator1 first1, Iterator1 last1, Iterator2 first2, Iterator2 last2) |
| |
| template<typename Container , typename Predicate > |
| void | Trinity::Containers::Impl::EraseIfMoveAssignable (Container &c, Predicate p) |
| |
| template<typename Container , typename Predicate > |
| void | Trinity::Containers::Impl::EraseIfNotMoveAssignable (Container &c, Predicate p) |
| |
| template<typename Container , typename Predicate > |
| void | Trinity::Containers::EraseIf (Container &c, Predicate p) |
| |