1 /* Copyright (c) 2016-2020. The SimGrid Team.
2 * All rights reserved. */
4 /* This program is free software; you can redistribute it and/or modify it
5 * under the terms of the license (GNU LGPL) which comes with this package. */
7 #ifndef XBT_UTILITY_HPP
8 #define XBT_UTILITY_HPP
16 /** @brief A hash which works with more stuff
18 * It can hash pairs: the standard hash currently doesn't include this.
20 template <class X> class hash : public std::hash<X> {
23 template <class X, class Y> class hash<std::pair<X, Y>> {
25 std::size_t operator()(std::pair<X, Y> const& x) const
29 return h1(x.first) ^ h2(x.second);
33 /** @brief Comparator class for using with std::priority_queue or boost::heap.
35 * Compare two std::pair by their first element (of type double), and return true when the first is greater than the
36 * second. Useful to have priority queues with the smallest element on top.
38 template <class Pair> class HeapComparator {
40 bool operator()(const Pair& a, const Pair& b) const { return a.first > b.first; }
43 /** @brief Erase an element given by reference from a boost::intrusive::list.
45 template <class List, class Elem> inline void intrusive_erase(List& list, Elem& elem)
47 list.erase(list.iterator_to(elem));