A
lgorithmique
N
umérique
D
istribuée
Public GIT Repository
projects
/
simgrid.git
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
raw
|
inline
| side by side
RegionSnap: only use pointers to regions for sake of simplicity
[simgrid.git]
/
include
/
xbt
/
utility.hpp
diff --git
a/include/xbt/utility.hpp
b/include/xbt/utility.hpp
index
e577631
..
2a2c382
100644
(file)
--- a/
include/xbt/utility.hpp
+++ b/
include/xbt/utility.hpp
@@
-1,4
+1,4
@@
-/* Copyright (c) 2016-201
7
. The SimGrid Team.
+/* Copyright (c) 2016-201
9
. The SimGrid Team.
* All rights reserved. */
/* This program is free software; you can redistribute it and/or modify it
* All rights reserved. */
/* This program is free software; you can redistribute it and/or modify it
@@
-22,6
+22,13
@@
public:
bool operator()(const Pair& a, const Pair& b) const { return a.first > b.first; }
};
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.
// integer_sequence and friends from C++14
// We need them to implement `apply` from C++17.
@@
-50,10
+57,6
@@
public:
*/
template<class T, T... N>
class integer_sequence {
*/
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 {
};
namespace bits {