#include <algorithm>
#include <set>
Go to the source code of this file.
◆ set_difference()
template<class T >
std::set<T> flecsi::util::set_difference |
( |
const std::set< T > & |
s1, |
|
|
const std::set< T > & |
s2 |
|
) |
| |
|
inline |
Convenience function wrapper around std::set_difference function. This version computes the difference of two sets and returns the result as a set.
- Parameters
-
s1 | The first set of the difference. |
s2 | The second set of the difference. |
- Returns
- A set containing the difference of s1 with s2.
◆ set_intersection()
template<class T >
std::set<T> flecsi::util::set_intersection |
( |
const std::set< T > & |
s1, |
|
|
const std::set< T > & |
s2 |
|
) |
| |
|
inline |
Convenience function wrapper around std::set_intersection function. This version computes the intersection of two sets and returns the result as a set.
- Parameters
-
s1 | The first set of the intersection. |
s2 | The second set of the intersection. |
- Returns
- A set containing the intersection of s1 with s2.
◆ set_union()
template<class T >
std::set<T> flecsi::util::set_union |
( |
const std::set< T > & |
s1, |
|
|
const std::set< T > & |
s2 |
|
) |
| |
|
inline |
Convenience function wrapper around std::set_union function. This version computes the union of two sets and returns the result as a set.
- Parameters
-
s1 | The first set of the union. |
s2 | The second set of the union. |
- Returns
- A set containing the union of s1 with s2.