Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Showing content from https://TheAlgorithms.github.io/C-Plus-Plus/dc/daa/lru__cache2_8cpp_source.html below:

TheAlgorithms/C++: others/lru_cache2.cpp Source File

<

K,

V>

<

K,

V>

std::unordered_map<K, CacheNode<K, V> *>

->prev = node_ptr;

(

== node_ptr) {

CacheNode<K, V> *prev = node_ptr->

;

CacheNode<K, V> *next = node_ptr->

;

node_ptr->

=

;

node_ptr->

=

;

CacheNode<K, V> *temp =

;

->next =

;

(K key, V value) {

[key]->data.second = value;

CacheNode<K, V> *newNode =

CacheNode<K, V>({key, value});

std::runtime_error(

);

V value =

[key]->data.second;

assert(cache.

() == 0);

assert(cache.

());

assert(cache.

() == 2);

assert(!cache.

());

assert(cache.

(1) == 10);

assert(cache.

(-2) == 20);

cache.

(-3, -30);

assert(cache.

() == 5);

assert(!cache.

());

}

(

std::runtime_error &e) {

assert(std::string(e.what()) ==

);

assert(cache.

(-2) == 20);

assert(cache.

(-3) == -30);

assert(cache.

(4) == 40);

assert(cache.

(5) == -50);

assert(cache.

(6) == 60);

std::cout <<

;

Node for a doubly linked list with data, prev and next pointers.

D_Node< T > * next

next node in the doubly linked list

D_Node< T > * prev

previous node in the doubly linked list

CacheNode< K, V > * head

head of the doubly linked list

int size() const

Returns the number of items present in the cache.

void push_front(CacheNode< K, V > *node_ptr)

push the node to the front of the linked list.

CacheNode< K, V > * tail

tail of the doubly linked list

void put(K key, V value)

upsert a key-value pair

~LRUCache()

destructs the cache, iterates on the map and deletes every node present in the cache.

LRUCache(int _capacity)

Constructor, Initialize the head and tail pointers to nullptr and initialize the _capacity of the cac...

std::unordered_map< K, CacheNode< K, V > * > node_map

maps the key to the node address

void pop_back()

pop the last node in the linked list.

bool empty() const

returns whether the cache is empty or not

V get(K key)

get the value of the key-value pair if exists

void make_recent(CacheNode< K, V > *node_ptr)

move the existing node in the list to the beginning of the list.

std::uint32_t _capacity

maximum capacity of the cache

int capacity() const

Returns the total capacity of the cache.

static void test()

self test implementations

RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4