Algorithms to assist the STL. More...
Go to the source code of this file.
Functions | |
| template<typename T > | |
| bool | aurora::equivalent (const T &lhs, const T &rhs) |
| Determines whether two values are considered equivalent in sorting. More... | |
| template<typename ForwardIterator , typename T > | |
| ForwardIterator | aurora::binarySearch (ForwardIterator first, ForwardIterator last, const T &value) |
| Binary search for value in iterator range. More... | |
| template<typename Container , typename Iterator > | |
| void | aurora::eraseUnordered (Container &c, Iterator itr) |
| Erase element using swap-and-pop_back idiom. More... | |
| template<typename Container , typename Value > | |
| void | aurora::remove (Container &c, const Value &v) |
| Erase-remove idiom. More... | |
| template<typename Container , typename Predicate > | |
| void | aurora::removeIf (Container &c, const Predicate &p) |
| Erase-remove-if idiom. More... | |
| template<typename Queue > | |
| Queue::value_type | aurora::pop (Queue &q) |
| Pop from queue with return value. More... | |
| template<typename Queue > | |
| void | aurora::clearQueue (Queue &q) |
| Clear std::queue. More... | |
| template<typename AssocContainer , typename Key > | |
| AssocContainer::mapped_type & | aurora::mapAt (AssocContainer &map, const Key &k) |
| Returns the value type for a specific key. More... | |
Algorithms to assist the STL.