Ttykuu

Why "Having chlorophyll without photosynthesis is actually very dangerous" and "like living with a bomb"?

Where does SFDX store details about scratch orgs?

Is it canonical bit space?

How to show the equivalence between the regularized regression and their constraint formulas using KKT

Took a trip to a parallel universe, need help deciphering

Assassin's bullet with mercury

If a Gelatinous Cube takes up the entire space of a Pit Trap, what happens when a creature falls into the trap but succeeds on the saving throw?

Watching something be written to a file live with tail

How to model explosives?

Doing something right before you need it - expression for this?

I would say: "You are another teacher", but she is a woman and I am a man

Were any external disk drives stacked vertically?

If human space travel is limited by the G force vulnerability, is there a way to counter G forces?

Will google still index a page if I use a $_SESSION variable?

Facing a paradox: Earnshaw's theorem in one dimension

Do I have a twin with permutated remainders?

Why is Collection not simply treated as Collection<?>

What exploit are these user agents trying to use?

Infinite Abelian subgroup of infinite non Abelian group example

Emailing HOD to enhance faculty application

Is "remove commented out code" correct English?

Should I tell management that I intend to leave due to bad software development practices?

Is there a hemisphere-neutral way of specifying a season?

When a company launches a new product do they "come out" with a new product or do they "come up" with a new product?

Cache with limited size; If full remove the oldest

An LRU cache templateLRU Cache with a static variable for garbage valueTask-Based Multithreading Library - Implemented using FibersConcurrent FIFO in C++11Implementation of LRU cacheC++ Threaded LoggerNpuzzle solver using A* with Manhattan + Linear Conflict (Updated Code)Leetcode #146. LRUCache solution in Java (Doubly Linked List + HashMap)LRU Cache in C++11Symbolic algebra using a generic smart pointer class

.everyoneloves__top-leaderboard:empty,.everyoneloves__mid-leaderboard:empty,.everyoneloves__bot-mid-leaderboard:empty margin-bottom:0;

0

$begingroup$

Here is a class that stores a single value into the limited cache. If cache is full, it will remove the oldest element to make a space for a new value.
I'm using 2 structures to accomplish this because I need a fast lookup. I'm not very confident this is the best approach.
Cache will contain a small amount of data (lets say 1000 elements).

#include <unordered_set>
#include <queue>

template <class T>
class Cache

private:
 int _maxSize;
 std::unordered_set<T> _set;
 std::queue<T> _queue;

public:
 explicit Cache(int maxSize) : _maxSize(maxSize)

 bool add(T value)
 if(_set.find(value) == _set.end()) // // if not exists in set
 if(_set.size() == _maxSize) // if set is 'full'
 _set.erase(_queue.front()); // delete the oldest value from the set
 _queue.pop(); // delete oldest value from queue
 
 _queue.push(value); // push new value into queue
 _set.insert(value); // insert new value into set
 return true;
 
 return false;
 

 int size()
 return static_cast<int>(_set.size());
 
;

c++ performance c++11 cache

share

edited 1 min ago

Boy

asked 8 mins ago

BoyBoy

1012

New contributor

Boy is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

$endgroup$

add a comment | 

0

$begingroup$

Here is a class that stores a single value into the limited cache. If cache is full, it will remove the oldest element to make a space for a new value.
I'm using 2 structures to accomplish this because I need a fast lookup. I'm not very confident this is the best approach.
Cache will contain a small amount of data (lets say 1000 elements).

#include <unordered_set>
#include <queue>

template <class T>
class Cache

private:
 int _maxSize;
 std::unordered_set<T> _set;
 std::queue<T> _queue;

public:
 explicit Cache(int maxSize) : _maxSize(maxSize)

 bool add(T value)
 if(_set.find(value) == _set.end()) // // if not exists in set
 if(_set.size() == _maxSize) // if set is 'full'
 _set.erase(_queue.front()); // delete the oldest value from the set
 _queue.pop(); // delete oldest value from queue
 
 _queue.push(value); // push new value into queue
 _set.insert(value); // insert new value into set
 return true;
 
 return false;
 

 int size()
 return static_cast<int>(_set.size());
 
;

c++ performance c++11 cache

share

edited 1 min ago

Boy

asked 8 mins ago

BoyBoy

1012

New contributor

Boy is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

$endgroup$

add a comment | 

$begingroup$

Here is a class that stores a single value into the limited cache. If cache is full, it will remove the oldest element to make a space for a new value.
I'm using 2 structures to accomplish this because I need a fast lookup. I'm not very confident this is the best approach.
Cache will contain a small amount of data (lets say 1000 elements).

#include <unordered_set>
#include <queue>

template <class T>
class Cache

private:
 int _maxSize;
 std::unordered_set<T> _set;
 std::queue<T> _queue;

public:
 explicit Cache(int maxSize) : _maxSize(maxSize)

 bool add(T value)
 if(_set.find(value) == _set.end()) // // if not exists in set
 if(_set.size() == _maxSize) // if set is 'full'
 _set.erase(_queue.front()); // delete the oldest value from the set
 _queue.pop(); // delete oldest value from queue
 
 _queue.push(value); // push new value into queue
 _set.insert(value); // insert new value into set
 return true;
 
 return false;
 

 int size()
 return static_cast<int>(_set.size());
 
;

c++ performance c++11 cache

share

edited 1 min ago

Boy

asked 8 mins ago

BoyBoy

1012

New contributor

Boy is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

$endgroup$

#include <unordered_set>
#include <queue>

template <class T>
class Cache

private:
 int _maxSize;
 std::unordered_set<T> _set;
 std::queue<T> _queue;

public:
 explicit Cache(int maxSize) : _maxSize(maxSize)

 bool add(T value)
 if(_set.find(value) == _set.end()) // // if not exists in set
 if(_set.size() == _maxSize) // if set is 'full'
 _set.erase(_queue.front()); // delete the oldest value from the set
 _queue.pop(); // delete oldest value from queue
 
 _queue.push(value); // push new value into queue
 _set.insert(value); // insert new value into set
 return true;
 
 return false;
 

 int size()
 return static_cast<int>(_set.size());
 
;

share

edited 1 min ago

Boy

asked 8 mins ago

BoyBoy

1012

New contributor

Boy is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

share

edited 1 min ago

Boy

asked 8 mins ago

BoyBoy

1012

New contributor

Boy is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

asked 8 mins ago

BoyBoy

1012

New contributor

Boy is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

asked 8 mins ago

BoyBoy

1012