15#include <unordered_set>
24template<
typename Value>
37 if (
m_set.insert(value).second)
67 std::unordered_set<Value>
m_set;
75template<
typename Key,
typename Value>
81 void set(
const Key &name,
const Value &value)
87 bool get(
const Key &name, Value *result)
const
101 std::vector<Value> result;
104 result.push_back(it->second);
128 template<
typename Key,
typename U,
typename Caller,
typename CallerData>
152 m_queue.push_back(std::move(t));
165 T t = std::move(
m_queue.front());
178 T t = std::move(
m_queue.front());
192 T t = std::move(
m_queue.front());
202 T t = std::move(
m_queue.back());
218 T t = std::move(
m_queue.back());
232 T t = std::move(
m_queue.back());
247 bool empty =
q->getQueue().empty();
248 q->getMutex().unlock();
250 q->getSignal().post();
253 auto begin() {
return q->getQueue().begin(); }
254 auto end() {
return q->getQueue().end(); }
256 auto erase(
typename std::deque<T>::iterator it) {
257 return q->getQueue().erase(it);
262 q->getMutex().lock();
282template<
typename K,
typename V>
286 LRUCache(
size_t limit,
void (*cache_miss)(
void *data,
const K &key, V *dest),
296 m_limit = std::max<size_t>(1, limit);
308 auto it =
m_map.find(key);
310 if (it !=
m_map.end()) {
317 if (entry.first !=
m_queue.begin()) {
342 typedef typename std::pair<typename std::list<K>::iterator, V>
cache_entry;
369template<
typename K,
typename V>
374 static_assert(std::is_default_constructible<V>::value,
375 "Value type must be default constructible");
376 static_assert(std::is_constructible<bool, V>::value,
377 "Value type must be convertible to bool");
378 static_assert(std::is_move_assignable<V>::value,
379 "Value type must be move-assignable");
397 const V &
get(const K &key)
const {
399 auto it =
m_new.find(key);
400 if (it !=
m_new.end())
413 void put(
const K &key,
const V &value) {
430 void put(
const K &key, V &&value) {
441 m_new[key] = std::move(value);
450 auto it =
m_new.find(key);
451 if (it !=
m_new.end()) {
452 ret = std::move(it->second);
460 ret = std::move(it->second);
481 assert(
m_new.empty());
486 n += !it.second ? 0 : 1;
519 static constexpr size_t unknown =
static_cast<size_t>(-1);
524 if (!
m_new.empty()) {
547 assert(
m->m_iterating);
549 if (!
m->m_iterating) {
551 m->collect_garbage();
555 auto begin() {
return m->m_values.cbegin(); }
556 auto end() {
return m->m_values.cend(); }
560 assert(
m->m_iterating < std::numeric_limits<
decltype(
m_iterating)>::max());
#define DISABLE_CLASS_COPY(C)
Definition basic_macros.h:26
#define ALLOW_CLASS_MOVE(C)
Definition basic_macros.h:32
ItemNotFoundException(const std::string &s)
Definition exceptions.h:68
size_t m_limit
Definition container.h:347
cache_type m_map
Definition container.h:349
LRUCache(size_t limit, void(*cache_miss)(void *data, const K &key, V *dest), void *data)
Definition container.h:286
void setLimit(size_t limit)
Definition container.h:294
const V * lookupCache(const K &key)
Definition container.h:306
void * m_cache_miss_data
Definition container.h:346
std::map< K, cache_entry > cache_type
Definition container.h:343
std::pair< typename std::list< K >::iterator, V > cache_entry
Definition container.h:342
void invalidate()
Definition container.h:300
std::list< K > m_queue
Definition container.h:351
void(*) m_cache_miss(void *data, const K &key, V *dest)
Definition container.h:345
Definition container.h:371
const void *& get(const u16 &key) const
Definition container.h:397
size_t m_garbage
Definition container.h:572
void * mapped_type
Definition container.h:382
~ModifySafeMap()
Definition container.h:389
u16 key_type
Definition container.h:381
void clear()
Definition container.h:505
size_t size() const
Definition container.h:475
auto iter()
Definition container.h:503
void put(const K &key, V &&value)
Definition container.h:430
ModifySafeMap()
Definition container.h:384
V take(const K &key)
Definition container.h:447
static constexpr size_t GC_MIN_SIZE
Definition container.h:574
static constexpr size_t unknown
Definition container.h:519
void put(const K &key, const V &value)
Definition container.h:413
void collect_garbage()
Definition container.h:531
bool empty() const
Definition container.h:491
bool remove(const K &key)
Definition container.h:470
std::map< u16, void * > m_values
Definition container.h:568
unsigned int m_iterating
Definition container.h:570
static const void * null_value
Definition container.h:516
void merge_new()
Definition container.h:522
std::map< u16, void * > m_new
Definition container.h:569
std::vector< Value > getValues() const
Definition container.h:98
bool get(const Key &name, Value *result) const
Definition container.h:87
std::map< Key, Value > m_values
Definition container.h:115
std::mutex m_mutex
Definition container.h:116
void set(const Key &name, const Value &value)
Definition container.h:81
void clear()
Definition container.h:108
friend class RequestQueue
Definition container.h:129
bool empty() const
Definition container.h:133
void push_back(T &&t)
Definition container.h:148
std::deque< MeshUpdateResult > m_queue
Definition container.h:273
Semaphore m_signal
Definition container.h:275
T pop_front(u32 wait_time_max_ms)
Definition container.h:173
T pop_back(u32 wait_time_max_ms=0)
Definition container.h:197
T pop_frontNoEx()
Definition container.h:186
T pop_backNoEx()
Definition container.h:226
std::deque< T > & getQueue()
Definition container.h:271
std::mutex m_mutex
Definition container.h:274
auto iterLocked()
Definition container.h:237
Semaphore & getSignal()
Definition container.h:269
T pop_backNoEx(u32 wait_time_max_ms)
Definition container.h:213
T pop_frontNoEx(u32 wait_time_max_ms)
Definition container.h:160
void push_back(const T &t)
Definition container.h:139
std::mutex & getMutex()
Definition container.h:268
Definition semaphore.h:18
void post(unsigned int num=1)
Definition semaphore.cpp:70
void wait()
Definition semaphore.cpp:85
Definition container.h:26
size_t size() const
Definition container.h:56
void pop_front()
Definition container.h:45
bool push_back(const Value &value)
Definition container.h:35
std::queue< Value > m_queue
Definition container.h:68
const Value & front() const
Definition container.h:51
bool empty() const
Definition container.h:61
std::unordered_set< Value > m_set
Definition container.h:67
#define sanity_check(expr)
Definition debug.h:74
std::lock_guard< std::mutex > MutexAutoLock
Definition mutex_auto_lock.h:31
ModifySafeMap< K, V > * m
Definition container.h:564
IterationHelper(ModifySafeMap< K, V > *parent)
Definition container.h:559
~IterationHelper()
Definition container.h:546
auto end()
Definition container.h:556
auto begin()
Definition container.h:555
auto end()
Definition container.h:254
auto erase(typename std::deque< T >::iterator it)
Definition container.h:256
IterationHelper(MutexedQueue< T > *parent)
Definition container.h:261
~IterationHelper()
Definition container.h:246
auto begin()
Definition container.h:253
MutexedQueue< T > * q
Definition container.h:265