5 #include <boost/range/algorithm/find.hpp>
14 template <
typename Range>
15 std::queue<typename Range::value_type>
18 auto res = std::queue<typename Range::value_type>{};
26 template <
typename T,
typename Container>
29 has(
const std::queue<T, Container>& s,
const T& e)
31 return boost::find(s, e) != std::end(s);
std::queue< typename Range::value_type > make_queue(const Range &range)
The content of cont as a queue.
ATTRIBUTE_PURE bool has(const boost::container::flat_set< Key, Compare, Allocator > &s, const Key &e)
Whether e is member of s.