-/* Copyright (c) 2016. The SimGrid Team.
+/* Copyright (c) 2016-2019. The SimGrid Team.
* All rights reserved. */
/* This program is free software; you can redistribute it and/or modify it
* under the terms of the license (GNU LGPL) which comes with this package. */
+#ifndef XBT_UTILITY_HPP
+#define XBT_UTILITY_HPP
+
#include <tuple>
namespace simgrid {
namespace xbt {
+/** @brief Comparator class for using with std::priority_queue or boost::heap.
+ *
+ * Compare two std::pair by their first element (of type double), and return true when the first is greater than the
+ * second. Useful to have priority queues with the smallest element on top.
+ */
+template <class Pair> class HeapComparator {
+public:
+ bool operator()(const Pair& a, const Pair& b) const { return a.first > b.first; }
+};
+
+/** @brief Erase an element given by reference from a boost::intrusive::list.
+ */
+template <class List, class Elem> inline void intrusive_erase(List& list, Elem& elem)
+{
+ list.erase(list.iterator_to(elem));
+}
+
// integer_sequence and friends from C++14
// We need them to implement `apply` from C++17.
*/
template<class T, T... N>
class integer_sequence {
- static constexpr std::size_t size()
- {
- return std::tuple_size<decltype(std::make_tuple(N...))>::value;
- }
};
namespace bits {
template<class T, long long N, long long... M>
struct make_integer_sequence :
- public make_integer_sequence<T, N-1, N-1, M...>
+ make_integer_sequence<T, N-1, N-1, M...>
{};
template<class T, long long... M>
struct make_integer_sequence<T, 0, M...> {
}
}
+#endif