container_utility.h File Reference

Go to the source code of this file.

Namespaces
namespace	mcrl2
	A class that takes a linear process specification and checks all tau-summands of that LPS for confluence.
namespace	mcrl2::utilities
namespace	mcrl2::utilities::detail

Functions
template<typename Map >
Map::mapped_type	mcrl2::utilities::detail::map_element (const Map &m, const typename Map::key_type &key)
	Returns the value corresponding to the given key in the map m. If the key is not present, an exception is thrown.
template<typename Map >
Map::mapped_type	mcrl2::utilities::detail::mapped_value (const Map &m, const typename Map::key_type &key, const typename Map::mapped_type &undefined_value)
template<typename Container >
bool	mcrl2::utilities::detail::contains (const Container &c, const typename Container::value_type &v)
	Returns the value corresponding to the given key in the set m. If the key is not present, an exception is thrown.
template<typename T >
bool	mcrl2::utilities::detail::contains (const std::set< T > &c, const typename std::set< T >::value_type &v)
template<typename T >
bool	mcrl2::utilities::detail::contains (const std::multiset< T > &c, const typename std::multiset< T >::value_type &v)
template<typename T >
bool	mcrl2::utilities::detail::contains (const std::unordered_set< T > &c, const typename std::set< T >::value_type &v)
template<typename Key , typename T >
bool	mcrl2::utilities::detail::has_key (const std::map< Key, T > &c, const Key &v)
	Returns the value corresponding to the given key in the set m. If the key is not present, an exception is thrown.
template<typename Key , typename T >
bool	mcrl2::utilities::detail::has_key (const std::multimap< Key, T > &c, const Key &v)
	Returns the value corresponding to the given key in the set m. If the key is not present, an exception is thrown.
template<typename Container >
Container::value_type	mcrl2::utilities::detail::pick_element (Container &v)
template<typename T , typename Container >
void	mcrl2::utilities::detail::set_insert (std::set< T > &s, const Container &c)
template<typename T , typename Container >
void	mcrl2::utilities::detail::set_remove (std::set< T > &s, const Container &c)
template<typename ContainerT , typename PredicateT >
void	mcrl2::utilities::detail::remove_if (ContainerT &items, const PredicateT &predicate)
template<typename InputIterator1 , typename InputIterator2 >
bool	mcrl2::utilities::detail::has_empty_intersection (InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2)
	Returns true if the sorted ranges [first1, ..., last1) and [first2, ..., last2) have an empty intersection.
template<typename SetContainer1 , typename SetContainer2 >
bool	mcrl2::utilities::detail::has_empty_intersection (const SetContainer1 &s1, const SetContainer2 &s2)
template<typename T >
std::set< T >	mcrl2::utilities::detail::set_union (const std::set< T > &x, const std::set< T > &y)
	Returns the union of two sets.
template<typename T >
std::set< T >	mcrl2::utilities::detail::set_difference (const std::set< T > &x, const std::set< T > &y)
	Returns the difference of two sets.
template<typename T >
std::set< T >	mcrl2::utilities::detail::set_intersection (const std::set< T > &x, const std::set< T > &y)
	Returns the intersection of two sets.
template<typename T >
bool	mcrl2::utilities::detail::set_includes (const std::set< T > &x, const std::set< T > &y)
	Returns if y is included in x.
template<typename T >
std::vector< T >	mcrl2::utilities::detail::as_vector (const std::set< T > &x)
template<typename T >
std::set< T >	mcrl2::utilities::detail::as_set (const std::vector< T > &x)