Implementing Stacks & Queues

What queue principle is being applied in this cache implementation?

class LRUCache {
  constructor(capacity) {
    this.capacity = capacity;
    this.cache = new Map();
  }
  
  get(key) {
    if (!this.cache.has(key)) return -1;
    const value = this.cache.get(key);
    this.cache.delete(key);
    this.cache.set(key, value);
    return value;
  }
  
  put(key, value) {
    if (this.cache.has(key)) this.cache.delete(key);
    else if (this.cache.size >= this.capacity) {
      this.cache.delete(this.cache.keys().next().value);
    }
    this.cache.set(key, value);
  }
}

Priority queuing
Round-robin scheduling
Least recently used
This implements LRU caching using queue principles: 1) Maintains access order of elements, 2) Removes least recently used item when full, 3) Moves accessed items to 'back' of queue, 4) Implements efficient O(1) operations using Map, 5) Combines hash table and queue concepts, 6) Common in memory management systems, 7) Optimal for fixed-size caches, 8) Demonstrates practical application of queue ordering.
First-in-first-out

Next Question (13/20)