mirror of
https://github.com/mozilla/gecko-dev.git
synced 2024-10-19 16:25:38 +00:00
99fa3bca94
This is on top of #15888. Only the second commit needs review. We put the more recently used item last, so iterating then from left to right is pointless. Source-Repo: https://github.com/servo/servo Source-Revision: 7fa4a94bb154449702e5ae9422c3008a5195c714 --HG-- extra : subtree_source : https%3A//hg.mozilla.org/projects/converted-servo-linear extra : subtree_revision : fbf4742c4186ad27bd4d5ccd3e2319a5b0748b55
68 lines
1.9 KiB
Rust
68 lines
1.9 KiB
Rust
/* This Source Code Form is subject to the terms of the Mozilla Public
|
|
* License, v. 2.0. If a copy of the MPL was not distributed with this
|
|
* file, You can obtain one at http://mozilla.org/MPL/2.0/. */
|
|
|
|
//! A simple LRU cache.
|
|
|
|
#![deny(missing_docs)]
|
|
|
|
use std::{iter, slice};
|
|
|
|
/// A LRU cache used to store a set of at most `n` elements at the same time.
|
|
///
|
|
/// Currently used for the style sharing candidate cache.
|
|
pub struct LRUCache<K> {
|
|
entries: Vec<K>,
|
|
cache_size: usize,
|
|
}
|
|
|
|
/// A iterator over the items of the LRU cache.
|
|
pub type LRUCacheIterator<'a, K> = iter::Rev<slice::Iter<'a, K>>;
|
|
|
|
/// A iterator over the mutable items of the LRU cache.
|
|
pub type LRUCacheMutIterator<'a, K> = iter::Rev<slice::IterMut<'a, K>>;
|
|
|
|
impl<K: PartialEq> LRUCache<K> {
|
|
/// Create a new LRU cache with `size` elements at most.
|
|
pub fn new(size: usize) -> Self {
|
|
LRUCache {
|
|
entries: vec![],
|
|
cache_size: size,
|
|
}
|
|
}
|
|
|
|
#[inline]
|
|
/// Touch a given position, and put it in the last item on the list.
|
|
pub fn touch(&mut self, pos: usize) {
|
|
let last_index = self.entries.len() - 1;
|
|
if pos != last_index {
|
|
let entry = self.entries.remove(pos);
|
|
self.entries.push(entry);
|
|
}
|
|
}
|
|
|
|
/// Iterate over the contents of this cache, from more to less recently
|
|
/// used.
|
|
pub fn iter(&self) -> LRUCacheIterator<K> {
|
|
self.entries.iter().rev()
|
|
}
|
|
|
|
/// Iterate mutably over the contents of this cache.
|
|
pub fn iter_mut(&mut self) -> LRUCacheMutIterator<K> {
|
|
self.entries.iter_mut().rev()
|
|
}
|
|
|
|
/// Insert a given key in the cache.
|
|
pub fn insert(&mut self, key: K) {
|
|
if self.entries.len() == self.cache_size {
|
|
self.entries.remove(0);
|
|
}
|
|
self.entries.push(key);
|
|
}
|
|
|
|
/// Evict all elements from the cache.
|
|
pub fn evict_all(&mut self) {
|
|
self.entries.clear();
|
|
}
|
|
}
|