WhenN-inl.h File Reference

#include <folly/Optional.h>
#include <folly/fibers/FiberManagerInternal.h>
#include <folly/fibers/ForEach.h>

Go to the source code of this file.

Namespaces
	folly
	—— Concurrent Priority Queue Implementation ——
	folly::fibers

Functions
template<class InputIterator >
std::vector< typename std::enable_if< !std::is_same< invoke_result_t< typename std::iterator_traits< InputIterator >::value_type >, void >::value, typename std::pair< size_t, invoke_result_t< typename std::iterator_traits< InputIterator >::value_type > > >::type >	folly::fibers::collectN (InputIterator first, InputIterator last, size_t n)
template<class InputIterator >
std::enable_if< std::is_same< invoke_result_t< typename std::iterator_traits< InputIterator >::value_type >, void >::value, std::vector< size_t > >::type	folly::fibers::collectN (InputIterator first, InputIterator last, size_t n)
template<class InputIterator >
std::vector< typename std::enable_if< !std::is_same< invoke_result_t< typename std::iterator_traits< InputIterator >::value_type >, void >::value, invoke_result_t< typename std::iterator_traits< InputIterator >::value_type > >::type >	folly::fibers::collectAll (InputIterator first, InputIterator last)
template<class InputIterator >
std::enable_if< std::is_same< invoke_result_t< typename std::iterator_traits< InputIterator >::value_type >, void >::value, void >::type	folly::fibers::collectAll (InputIterator first, InputIterator last)
template<class InputIterator >
std::enable_if< !std::is_same< invoke_result_t< typename std::iterator_traits< InputIterator >::value_type >, void >::value, typename std::pair< size_t, invoke_result_t< typename std::iterator_traits< InputIterator >::value_type > > >::type	folly::fibers::collectAny (InputIterator first, InputIterator last)
template<class InputIterator >
std::enable_if< std::is_same< invoke_result_t< typename std::iterator_traits< InputIterator >::value_type >, void >::value, size_t >::type	folly::fibers::collectAny (InputIterator first, InputIterator last)