2 * Copyright 2014 Facebook, Inc.
4 * Licensed under the Apache License, Version 2.0 (the "License");
5 * you may not use this file except in compliance with the License.
6 * You may obtain a copy of the License at
8 * http://www.apache.org/licenses/LICENSE-2.0
10 * Unless required by applicable law or agreed to in writing, software
11 * distributed under the License is distributed on an "AS IS" BASIS,
12 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
13 * See the License for the specific language governing permissions and
14 * limitations under the License.
23 #include <type_traits>
26 #include <folly/MoveWrapper.h>
27 #include <folly/futures/Deprecated.h>
28 #include <folly/futures/DrivableExecutor.h>
29 #include <folly/futures/Promise.h>
30 #include <folly/futures/Try.h>
31 #include <folly/futures/FutureException.h>
32 #include <folly/futures/detail/Types.h>
36 template <class> struct Promise;
39 struct isFuture : std::false_type {
44 struct isFuture<Future<T>> : std::true_type {
49 struct isTry : std::false_type {};
52 struct isTry<Try<T>> : std::true_type {};
56 template <class> struct Core;
57 template <class...> struct VariadicContext;
59 template<typename F, typename... Args>
60 using resultOf = decltype(std::declval<F>()(std::declval<Args>()...));
62 template <typename...>
65 template <typename Arg, typename... Args>
66 struct ArgType<Arg, Args...> {
72 typedef void FirstArg;
75 template <bool isTry, typename F, typename... Args>
77 typedef resultOf<F, Args...> Result;
80 template<typename F, typename... Args>
83 typename = detail::resultOf<T, Args...>>
84 static constexpr std::true_type
85 check(std::nullptr_t) { return std::true_type{}; };
88 static constexpr std::false_type
89 check(...) { return std::false_type{}; };
91 typedef decltype(check<F>(nullptr)) type;
92 static constexpr bool value = type::value;
95 template<typename T, typename F>
96 struct callableResult {
97 typedef typename std::conditional<
98 callableWith<F>::value,
99 detail::argResult<false, F>,
100 typename std::conditional<
101 callableWith<F, Try<T>&&>::value,
102 detail::argResult<true, F, Try<T>&&>,
103 typename std::conditional<
104 callableWith<F, Try<T>&>::value,
105 detail::argResult<true, F, Try<T>&>,
106 typename std::conditional<
107 callableWith<F, T&&>::value,
108 detail::argResult<false, F, T&&>,
109 detail::argResult<false, F, T&>>::type>::type>::type>::type Arg;
110 typedef isFuture<typename Arg::Result> ReturnsFuture;
111 typedef Future<typename ReturnsFuture::Inner> Return;
115 struct callableResult<void, F> {
116 typedef typename std::conditional<
117 callableWith<F>::value,
118 detail::argResult<false, F>,
119 typename std::conditional<
120 callableWith<F, Try<void>&&>::value,
121 detail::argResult<true, F, Try<void>&&>,
122 detail::argResult<true, F, Try<void>&>>::type>::type Arg;
123 typedef isFuture<typename Arg::Result> ReturnsFuture;
124 typedef Future<typename ReturnsFuture::Inner> Return;
127 template <typename L>
128 struct Extract : Extract<decltype(&L::operator())> { };
130 template <typename Class, typename R, typename... Args>
131 struct Extract<R(Class::*)(Args...) const> {
132 typedef isFuture<R> ReturnsFuture;
133 typedef Future<typename ReturnsFuture::Inner> Return;
134 typedef typename ReturnsFuture::Inner RawReturn;
135 typedef typename ArgType<Args...>::FirstArg FirstArg;
138 template <typename Class, typename R, typename... Args>
139 struct Extract<R(Class::*)(Args...)> {
140 typedef isFuture<R> ReturnsFuture;
141 typedef Future<typename ReturnsFuture::Inner> Return;
142 typedef typename ReturnsFuture::Inner RawReturn;
143 typedef typename ArgType<Args...>::FirstArg FirstArg;
150 /// This namespace is for utility functions that would usually be static
151 /// members of Future, except they don't make sense there because they don't
152 /// depend on the template type (rather, on the type of their arguments in
153 /// some cases). This is the least-bad naming scheme we could think of. Some
154 /// of the functions herein have really-likely-to-collide names, like "map"
157 /// Returns a Future that will complete after the specified duration. The
158 /// Duration typedef of a `std::chrono` duration type indicates the
159 /// resolution you can expect to be meaningful (milliseconds at the time of
160 /// writing). Normally you wouldn't need to specify a Timekeeper, we will
161 /// use the global futures timekeeper (we run a thread whose job it is to
162 /// keep time for futures timeouts) but we provide the option for power
165 /// The Timekeeper thread will be lazily created the first time it is
166 /// needed. If your program never uses any timeouts or other time-based
167 /// Futures you will pay no Timekeeper thread overhead.
168 Future<void> sleep(Duration, Timekeeper* = nullptr);
170 /// Create a Future chain from a sequence of callbacks. i.e.
172 /// f.then(a).then(b).then(c);
174 /// where f is a Future<A> and the result of the chain is a Future<Z>
177 /// f.then(chain<A,Z>(a, b, c));
178 // If anyone figures how to get chain to deduce A and Z, I'll buy you a drink.
179 template <class A, class Z, class... Callbacks>
180 std::function<Future<Z>(Try<A>)>
181 chain(Callbacks... fns);
187 typedef T value_type;
190 Future(Future const&) = delete;
191 Future& operator=(Future const&) = delete;
194 Future(Future&&) noexcept;
195 Future& operator=(Future&&);
198 template <class F = T>
200 Future(const typename std::enable_if<!std::is_void<F>::value, F>::type& val);
202 template <class F = T>
204 Future(typename std::enable_if<!std::is_void<F>::value, F>::type&& val);
206 template <class F = T,
207 typename std::enable_if<std::is_void<F>::value, int>::type = 0>
212 /** Return the reference to result. Should not be called if !isReady().
213 Will rethrow the exception if an exception has been
216 typename std::add_lvalue_reference<T>::type
218 typename std::add_lvalue_reference<const T>::type
221 /// Returns an inactive Future which will call back on the other side of
222 /// executor (when it is activated).
224 /// NB remember that Futures activate when they destruct. This is good,
225 /// it means that this will work:
227 /// f.via(e).then(a).then(b);
229 /// a and b will execute in the same context (the far side of e), because
230 /// the Future (temporary variable) created by via(e) does not call back
231 /// until it destructs, which is after then(a) and then(b) have been wired
234 /// But this is still racy:
236 /// f = f.via(e).then(a);
238 // The ref-qualifier allows for `this` to be moved out so we
239 // don't get access-after-free situations in chaining.
240 // https://akrzemi1.wordpress.com/2014/06/02/ref-qualifiers/
241 template <typename Executor>
242 Future<T> via(Executor* executor) &&;
244 /// This variant creates a new future, where the ref-qualifier && version
245 /// moves `this` out. This one is less efficient but avoids confusing users
246 /// when "return f.via(x);" fails.
247 template <typename Executor>
248 Future<T> via(Executor* executor) &;
250 /** True when the result (or exception) is ready. */
251 bool isReady() const;
253 /** A reference to the Try of the value */
256 /// Block until the future is fulfilled. Returns the value (moved out), or
257 /// throws the exception. The future must not already have a callback.
260 /// Block until the future is fulfilled, or until timed out. Returns the
261 /// value (moved out), or throws the exception (which might be a TimedOut
265 /// Call e->drive() repeatedly until the future is fulfilled. Examples
266 /// of DrivableExecutor include EventBase and ManualExecutor. Returns the
267 /// value (moved out), or throws the exception.
268 T getVia(DrivableExecutor* e);
270 /** When this Future has completed, execute func which is a function that
280 Func shall return either another Future or a value.
282 A Future for the return type of func is returned.
284 Future<string> f2 = f1.then([](Try<T>&&) { return string("foo"); });
286 The Future given to the functor is ready, and the functor may call
287 value(), which may rethrow if this has captured an exception. If func
288 throws, the exception will be captured in the Future that is returned.
290 /* TODO n3428 and other async frameworks have something like then(scheduler,
291 Future), we might want to support a similar API which could be
292 implemented a little more efficiently than
293 f.via(executor).then(callback) */
294 template <typename F, typename R = detail::callableResult<T, F>>
295 typename R::Return then(F func) {
296 typedef typename R::Arg Arguments;
297 return thenImplementation<F, R>(std::move(func), Arguments());
300 /// Variant where func is an member function
302 /// struct Worker { R doWork(Try<T>); }
305 /// Future<R> f2 = f1.then(&Worker::doWork, w);
307 /// This is just sugar for
309 /// f1.then(std::bind(&Worker::doWork, w));
310 template <typename R, typename Caller, typename... Args>
311 Future<typename isFuture<R>::Inner>
312 then(R(Caller::*func)(Args...), Caller *instance);
314 /// Convenience method for ignoring the value and creating a Future<void>.
315 /// Exceptions still propagate.
318 /// Set an error callback for this Future. The callback should take a single
319 /// argument of the type that you want to catch, and should return a value of
320 /// the same type as this Future, or a Future of that type (see overload
321 /// below). For instance,
325 /// throw std::runtime_error("oh no!");
328 /// .onError([] (std::runtime_error& e) {
329 /// LOG(INFO) << "std::runtime_error: " << e.what();
330 /// return -1; // or makeFuture<int>(-1)
333 typename std::enable_if<
334 !detail::Extract<F>::ReturnsFuture::value,
338 /// Overload of onError where the error callback returns a Future<T>
340 typename std::enable_if<
341 detail::Extract<F>::ReturnsFuture::value,
345 /// Like onError, but for timeouts. example:
347 /// Future<int> f = makeFuture<int>(42)
348 /// .delayed(long_time)
349 /// .onTimeout(short_time,
350 /// []() -> int{ return -1; });
354 /// Future<int> f = makeFuture<int>(42)
355 /// .delayed(long_time)
356 /// .onTimeout(short_time,
357 /// []() { return makeFuture<int>(some_exception); });
359 Future<T> onTimeout(Duration, F&& func, Timekeeper* = nullptr);
361 /// This is not the method you're looking for.
363 /// This needs to be public because it's used by make* and when*, and it's
364 /// not worth listing all those and their fancy template signatures as
365 /// friends. But it's not for public consumption.
367 void setCallback_(F&& func);
369 /// A Future's callback is executed when all three of these conditions have
370 /// become true: it has a value (set by the Promise), it has a callback (set
371 /// by then), and it is active (active by default).
373 /// Inactive Futures will activate upon destruction.
374 Future<T>& activate() & {
378 Future<T>& deactivate() & {
382 Future<T> activate() && {
384 return std::move(*this);
386 Future<T> deactivate() && {
388 return std::move(*this);
392 return core_->isActive();
396 void raise(E&& exception) {
397 raise(make_exception_wrapper<typename std::remove_reference<E>::type>(
398 std::move(exception)));
401 /// Raise an interrupt. If the promise holder has an interrupt
402 /// handler it will be called and potentially stop asynchronous work from
403 /// being done. This is advisory only - a promise holder may not set an
404 /// interrupt handler, or may do anything including ignore. But, if you know
405 /// your future supports this the most likely result is stopping or
406 /// preventing the asynchronous operation (if in time), and the promise
407 /// holder setting an exception on the future. (That may happen
408 /// asynchronously, of course.)
409 void raise(exception_wrapper interrupt);
412 raise(FutureCancellation());
415 /// Throw TimedOut if this Future does not complete within the given
416 /// duration from now. The optional Timeekeeper is as with futures::sleep().
417 Future<T> within(Duration, Timekeeper* = nullptr);
419 /// Throw the given exception if this Future does not complete within the
420 /// given duration from now. The optional Timeekeeper is as with
421 /// futures::sleep().
423 Future<T> within(Duration, E exception, Timekeeper* = nullptr);
425 /// Delay the completion of this Future for at least this duration from
426 /// now. The optional Timekeeper is as with futures::sleep().
427 Future<T> delayed(Duration, Timekeeper* = nullptr);
429 /// Block until this Future is complete. Returns a reference to this Future.
432 /// Overload of wait() for rvalue Futures
433 Future<T>&& wait() &&;
435 /// Block until this Future is complete or until the given Duration passes.
436 /// Returns a reference to this Future
437 Future<T>& wait(Duration) &;
439 /// Overload of wait(Duration) for rvalue Futures
440 Future<T>&& wait(Duration) &&;
442 /// Call e->drive() repeatedly until the future is fulfilled. Examples
443 /// of DrivableExecutor include EventBase and ManualExecutor. Returns a
444 /// reference to this Future so that you can chain calls if desired.
445 /// value (moved out), or throws the exception.
446 Future<T>& waitVia(DrivableExecutor* e) &;
448 /// Overload of waitVia() for rvalue Futures
449 Future<T>&& waitVia(DrivableExecutor* e) &&;
452 typedef detail::Core<T>* corePtr;
454 // shared core state object
458 Future(corePtr obj) : core_(obj) {}
462 void throwIfInvalid() const;
464 friend class Promise<T>;
466 // Variant: returns a value
467 // e.g. f.then([](Try<T> t){ return t.value(); });
468 template <typename F, typename R, bool isTry, typename... Args>
469 typename std::enable_if<!R::ReturnsFuture::value, typename R::Return>::type
470 thenImplementation(F func, detail::argResult<isTry, F, Args...>);
472 // Variant: returns a Future
473 // e.g. f.then([](Try<T> t){ return makeFuture<T>(t); });
474 template <typename F, typename R, bool isTry, typename... Args>
475 typename std::enable_if<R::ReturnsFuture::value, typename R::Return>::type
476 thenImplementation(F func, detail::argResult<isTry, F, Args...>);
480 Make a completed Future by moving in a value. e.g.
483 auto f = makeFuture(std::move(foo));
487 auto f = makeFuture<string>("foo");
490 Future<typename std::decay<T>::type> makeFuture(T&& t);
492 /** Make a completed void Future. */
493 Future<void> makeFuture();
495 /** Make a completed Future by executing a function. If the function throws
496 we capture the exception, otherwise we capture the result. */
500 typename std::enable_if<
501 !std::is_reference<F>::value, bool>::type sdf = false)
502 -> Future<decltype(func())>;
507 -> Future<decltype(func())>;
509 /// Make a failed Future from an exception_ptr.
510 /// Because the Future's type cannot be inferred you have to specify it, e.g.
512 /// auto f = makeFuture<string>(std::current_exception());
514 Future<T> makeFuture(std::exception_ptr const& e) DEPRECATED;
516 /// Make a failed Future from an exception_wrapper.
518 Future<T> makeFuture(exception_wrapper ew);
520 /** Make a Future from an exception type E that can be passed to
521 std::make_exception_ptr(). */
522 template <class T, class E>
523 typename std::enable_if<std::is_base_of<std::exception, E>::value,
525 makeFuture(E const& e);
527 /** Make a Future out of a Try */
529 Future<T> makeFuture(Try<T>&& t);
532 * Return a new Future that will call back on the given Executor.
533 * This is just syntactic sugar for makeFuture().via(executor)
535 * @param executor the Executor to call back on
537 * @returns a void Future that will call back on the given executor
539 template <typename Executor>
540 Future<void> via(Executor* executor);
542 /** When all the input Futures complete, the returned Future will complete.
543 Errors do not cause early termination; this Future will always succeed
544 after all its Futures have finished (whether successfully or with an
547 The Futures are moved in, so your copies are invalid. If you need to
548 chain further from these Futures, use the variant with an output iterator.
550 This function is thread-safe for Futures running on different threads. But
551 if you are doing anything non-trivial after, you will probably want to
552 follow with `via(executor)` because it will complete in whichever thread the
553 last Future completes in.
555 The return type for Future<T> input is a Future<std::vector<Try<T>>>
557 template <class InputIterator>
558 Future<std::vector<Try<
559 typename std::iterator_traits<InputIterator>::value_type::value_type>>>
560 whenAll(InputIterator first, InputIterator last);
562 /// This version takes a varying number of Futures instead of an iterator.
563 /// The return type for (Future<T1>, Future<T2>, ...) input
564 /// is a Future<std::tuple<Try<T1>, Try<T2>, ...>>.
565 /// The Futures are moved in, so your copies are invalid.
566 template <typename... Fs>
567 typename detail::VariadicContext<
568 typename std::decay<Fs>::type::value_type...>::type
571 /** The result is a pair of the index of the first Future to complete and
572 the Try. If multiple Futures complete at the same time (or are already
573 complete when passed in), the "winner" is chosen non-deterministically.
575 This function is thread-safe for Futures running on different threads.
577 template <class InputIterator>
580 Try<typename std::iterator_traits<InputIterator>::value_type::value_type>>>
581 whenAny(InputIterator first, InputIterator last);
583 /** when n Futures have completed, the Future completes with a vector of
584 the index and Try of those n Futures (the indices refer to the original
585 order, but the result vector will be in an arbitrary order)
589 template <class InputIterator>
590 Future<std::vector<std::pair<
592 Try<typename std::iterator_traits<InputIterator>::value_type::value_type>>>>
593 whenN(InputIterator first, InputIterator last, size_t n);
597 #include <folly/futures/Future-inl.h>