proxygen
Future.cpp
Go to the documentation of this file.
1 /*
2  * Copyright 2014-present Facebook, Inc.
3  *
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
7  *
8  * http://www.apache.org/licenses/LICENSE-2.0
9  *
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.
15  */
16 
17 #include <folly/futures/Future.h>
18 #include <folly/Likely.h>
21 
22 namespace folly {
23 
24 // Instantiate the most common Future types to save compile time
25 template class SemiFuture<Unit>;
26 template class SemiFuture<bool>;
27 template class SemiFuture<int>;
28 template class SemiFuture<int64_t>;
29 template class SemiFuture<std::string>;
30 template class SemiFuture<double>;
31 template class Future<Unit>;
32 template class Future<bool>;
33 template class Future<int>;
34 template class Future<int64_t>;
35 template class Future<std::string>;
36 template class Future<double>;
37 } // namespace folly
38 
39 namespace folly {
40 namespace futures {
41 
43  std::shared_ptr<Timekeeper> tks;
44  if (LIKELY(!tk)) {
46  tk = tks.get();
47  }
48 
49  if (UNLIKELY(!tk)) {
50  return makeFuture<Unit>(FutureNoTimekeeper());
51  }
52 
53  return tk->after(dur);
54 }
55 
56 } // namespace futures
57 } // namespace folly
std::shared_ptr< Timekeeper > getTimekeeperSingleton()
Future< Unit > sleep(Duration dur, Timekeeper *tk)
Definition: Future.cpp:42
#define LIKELY(x)
Definition: Likely.h:47
—— Concurrent Priority Queue Implementation ——
Definition: AtomicBitSet.h:29
std::chrono::milliseconds Duration
Definition: Types.h:36
#define UNLIKELY(x)
Definition: Likely.h:48
virtual Future< Unit > after(Duration dur)=0