friend class boost::iterator_core_access;
template<class,class> friend class csl_iterator;
- void increment() { node_ = node_->next(); };
+ void increment() { node_ = node_->next(); }
bool equal(const csl_iterator& other) const { return node_ == other.node_; }
value_type& dereference() const { return node_->data(); }
const_range_type castToConst() const {
return const_range_type(*this);
- };
+ }
// Works only for Range<const char*> and Range<char*>
int compare(const const_range_type& o) const {
std::vector<T> dep_states;
T result() {
return state;
- };
+ }
// execReset() runs DAG & clears all nodes except for source
void execReset() {
this->dag->go().get();
this->dag->reset();
- };
+ }
void exec() {
this->dag->go().get();
- };
- virtual void operator()(){};
+ }
+ virtual void operator()(){}
explicit FutureDAGFunctor(T init_val) : state(init_val) {}
FutureDAGFunctor() : state() {}
- virtual ~FutureDAGFunctor(){};
+ virtual ~FutureDAGFunctor(){}
};
} // folly
Path(folly::StringPiece baseDir, folly::StringPiece subDir,
folly::StringPiece file);
- folly::StringPiece baseDir() const { return baseDir_; };
+ folly::StringPiece baseDir() const { return baseDir_; }
folly::StringPiece subDir() const { return subDir_; }
folly::StringPiece file() const { return file_; }
PreBlockAttempts = 300,
};
- explicit Baton(intptr_t state) : waitingFiber_(state){};
+ explicit Baton(intptr_t state) : waitingFiber_(state){}
void postHelper(intptr_t new_value);
void postThread();
typename std::iterator_traits<InputIterator>::value_type::value_type T;
struct CollectAnyContext {
- CollectAnyContext() {};
+ CollectAnyContext() {}
Promise<std::pair<size_t, Try<T>>> p;
std::atomic<bool> done {false};
};
typename std::iterator_traits<InputIterator>::value_type::value_type T;
struct CollectAnyWithoutExceptionContext {
- CollectAnyWithoutExceptionContext(){};
+ CollectAnyWithoutExceptionContext(){}
Promise<std::pair<size_t, T>> p;
std::atomic<bool> done{false};
std::atomic<size_t> nFulfilled{0};
UnorderedReduceContext(T&& memo, F&& fn, size_t n)
: lock_(), memo_(makeFuture<T>(std::move(memo))),
func_(std::move(fn)), numThens_(0), numFutures_(n), promise_()
- {};
+ {}
folly::MicroSpinLock lock_; // protects memo_ and numThens_
Future<T> memo_;
F func_;
template<typename T,
typename = detail::resultOf<T, Args...>>
static constexpr std::true_type
- check(std::nullptr_t) { return std::true_type{}; };
+ check(std::nullptr_t) { return std::true_type{}; }
template<typename>
static constexpr std::false_type
- check(...) { return std::false_type{}; };
+ check(...) { return std::false_type{}; }
typedef decltype(check<F>(nullptr)) type;
static constexpr bool value = type::value;
void work() {
puller_ | *ops_ | pusher_;
- };
+ }
public:
Executor(size_t threads, const Ops* ops)
WriteRequest(AsyncSocket* socket, WriteCallback* callback) :
socket_(socket), callback_(callback) {}
- virtual void start() {};
+ virtual void start() {}
virtual void destroy() = 0;
*/
virtual void readBufferAvailable(std::unique_ptr<IOBuf> /*readBuf*/)
- noexcept {};
+ noexcept {}
/**
* readEOF() will be invoked when the transport is closed.
hmac.hash_init(md, key);
hmac.hash_update(data);
hmac.hash_final(out);
- };
+ }
static void hmac(
MutableByteRange out,
const EVP_MD* md,
struct Node {
size_t copies = 0;
- Node() noexcept {};
+ Node() noexcept {}
Node(const Node& n) noexcept { copies = n.copies; ++copies; }
Node(Node&& n) noexcept { swap(copies, n.copies); ++copies; }
};