Packages
rocksdb
2.1.0
3.1.1
3.1.0
3.0.0
2.6.2
2.6.1
retired
2.6.0
retired
2.5.0
2.4.1
2.4.0
2.3.0
2.2.0
2.1.0
2.0.0
1.9.0
1.8.0
1.7.0
1.6.0
1.5.1
1.5.0
1.4.0
1.3.2
1.3.1
1.3.0
1.2.0
1.1.1
1.1.0
1.0.0
0.26.2
0.26.1
0.26.0
0.25.0
0.24.0
0.23.3
0.23.2
0.23.1
0.23.0
0.22.0
0.21.0
0.20.1
0.20.0
0.19.0
0.18.0
0.17.0
0.16.0
0.15.0
0.14.0
0.13.1
0.13.0
0.12.0
0.11.0
0.10.0
0.9.1
0.9.0
0.8.2
0.8.1
0.8.0
0.7.1
0.7.0
0.6.4
0.6.3
0.6.2
0.6.1
0.6.0
RocksDB for Erlang
Current section
Files
Jump to
Current section
Files
deps/rocksdb/utilities/persistent_cache/persistent_cache_util.h
// Copyright (c) 2013, Facebook, Inc. All rights reserved.
// This source code is licensed under both the GPLv2 (found in the
// COPYING file in the root directory) and Apache 2.0 License
// (found in the LICENSE.Apache file in the root directory).
#pragma once
#include <limits>
#include <list>
#include "util/mutexlock.h"
namespace ROCKSDB_NAMESPACE {
//
// Simple synchronized queue implementation with the option of
// bounding the queue
//
// On overflow, the elements will be discarded
//
template <class T>
class BoundedQueue {
public:
explicit BoundedQueue(
const size_t max_size = std::numeric_limits<size_t>::max())
: cond_empty_(&lock_), max_size_(max_size) {}
virtual ~BoundedQueue() {}
void Push(T&& t) {
MutexLock _(&lock_);
if (max_size_ != std::numeric_limits<size_t>::max() &&
size_ + t.Size() >= max_size_) {
// overflow
return;
}
size_ += t.Size();
q_.push_back(std::move(t));
cond_empty_.SignalAll();
}
T Pop() {
MutexLock _(&lock_);
while (q_.empty()) {
cond_empty_.Wait();
}
T t = std::move(q_.front());
size_ -= t.Size();
q_.pop_front();
return t;
}
size_t Size() const {
MutexLock _(&lock_);
return size_;
}
private:
mutable port::Mutex lock_;
port::CondVar cond_empty_;
std::list<T> q_;
size_t size_ = 0;
const size_t max_size_;
};
} // namespace ROCKSDB_NAMESPACE