Ttykuu

Stopping power of mountain vs road bike

Today is the Center

Is it possible to run Internet Explorer on OS X El Capitan?

Watching something be written to a file live with tail

Can a rocket refuel on Mars from water?

Took a trip to a parallel universe, need help deciphering

Twin primes whose sum is a cube

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

What is the word for reserving something for yourself before others do?

How to prevent "they're falling in love" trope

Where does SFDX store details about scratch orgs?

Why is it a bad idea to hire a hitman to eliminate most corrupt politicians?

What's the point of deactivating Num Lock on login screens?

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

How can saying a song's name be a copyright violation?

How can I tell someone that I want to be his or her friend?

AES: Why is it a good practice to use only the first 16bytes of a hash for encryption?

I Accidentally Deleted a Stock Terminal Theme

Assassin's bullet with mercury

Fully-Firstable Anagram Sets

Could gravitational lensing be used to protect a spaceship from a laser?

What mechanic is there to disable a threat instead of killing it?

Facing a paradox: Earnshaw's theorem in one dimension

Etiquette around loan refinance - decision is going to cost first broker a lot of money

Cache with size limit

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

asked 2 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

asked 2 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

asked 2 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

asked 2 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

asked 2 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 2 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 2 mins ago

BoyBoy

1012