Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
int
Rust
提交
32e521ff
R
Rust
项目概览
int
/
Rust
大约 1 年 前同步成功
通知
1
Star
0
Fork
0
代码
文件
提交
分支
Tags
贡献者
分支图
Diff
Issue
0
列表
看板
标记
里程碑
合并请求
0
DevOps
流水线
流水线任务
计划
Wiki
0
Wiki
分析
仓库
DevOps
项目成员
Pages
R
Rust
项目概览
项目概览
详情
发布
仓库
仓库
文件
提交
分支
标签
贡献者
分支图
比较
Issue
0
Issue
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
Pages
DevOps
DevOps
流水线
流水线任务
计划
分析
分析
仓库分析
DevOps
Wiki
0
Wiki
成员
成员
收起侧边栏
关闭侧边栏
动态
分支图
创建新Issue
流水线任务
提交
Issue看板
体验新版 GitCode,发现更多精彩内容 >>
提交
32e521ff
编写于
7月 26, 2014
作者:
B
bors
浏览文件
操作
浏览文件
下载
差异文件
auto merge of #15941 : treeman/rust/doc-lru, r=alexcrichton
上级
e6e544f2
6bbe92e6
变更
1
隐藏空白更改
内联
并排
Showing
1 changed file
with
85 addition
and
0 deletion
+85
-0
src/libstd/collections/lru_cache.rs
src/libstd/collections/lru_cache.rs
+85
-0
未找到文件。
src/libstd/collections/lru_cache.rs
浏览文件 @
32e521ff
...
...
@@ -92,6 +92,13 @@ fn new(k: K, v: V) -> LruEntry<K, V> {
impl
<
K
:
Hash
+
Eq
,
V
>
LruCache
<
K
,
V
>
{
/// Create an LRU Cache that holds at most `capacity` items.
///
/// # Example
///
/// ```
/// use std::collections::LruCache;
/// let mut cache: LruCache<int, &str> = LruCache::new(10);
/// ```
pub
fn
new
(
capacity
:
uint
)
->
LruCache
<
K
,
V
>
{
let
cache
=
LruCache
{
map
:
HashMap
::
new
(),
...
...
@@ -106,6 +113,18 @@ pub fn new(capacity: uint) -> LruCache<K, V> {
}
/// Put a key-value pair into cache.
///
/// # Example
///
/// ```
/// use std::collections::LruCache;
/// let mut cache = LruCache::new(2);
///
/// cache.put(1i, "a");
/// cache.put(2, "b");
/// assert_eq!(cache.get(&1), Some(&"a"));
/// assert_eq!(cache.get(&2), Some(&"b"));
/// ```
pub
fn
put
(
&
mut
self
,
k
:
K
,
v
:
V
)
{
let
(
node_ptr
,
node_opt
)
=
match
self
.map
.find_mut
(
&
KeyRef
{
k
:
&
k
})
{
Some
(
node
)
=>
{
...
...
@@ -137,6 +156,21 @@ pub fn put(&mut self, k: K, v: V) {
}
/// Return a value corresponding to the key in the cache.
///
/// # Example
///
/// ```
/// use std::collections::LruCache;
/// let mut cache = LruCache::new(2);
///
/// cache.put(1i, "a");
/// cache.put(2, "b");
/// cache.put(2, "c");
/// cache.put(3, "d");
///
/// assert_eq!(cache.get(&1), None);
/// assert_eq!(cache.get(&2), Some(&"c"));
/// ```
pub
fn
get
<
'a
>
(
&
'a
mut
self
,
k
:
&
K
)
->
Option
<&
'a
V
>
{
let
(
value
,
node_ptr_opt
)
=
match
self
.map
.find_mut
(
&
KeyRef
{
k
:
k
})
{
None
=>
(
None
,
None
),
...
...
@@ -156,6 +190,20 @@ pub fn get<'a>(&'a mut self, k: &K) -> Option<&'a V> {
}
/// Remove and return a value corresponding to the key from the cache.
///
/// # Example
///
/// ```
/// use std::collections::LruCache;
/// let mut cache = LruCache::new(2);
///
/// cache.put(2i, "a");
///
/// assert_eq!(cache.pop(&1), None);
/// assert_eq!(cache.pop(&2), Some("a"));
/// assert_eq!(cache.pop(&2), None);
/// assert_eq!(cache.len(), 0);
/// ```
pub
fn
pop
(
&
mut
self
,
k
:
&
K
)
->
Option
<
V
>
{
match
self
.map
.pop
(
&
KeyRef
{
k
:
k
})
{
None
=>
None
,
...
...
@@ -164,12 +212,49 @@ pub fn pop(&mut self, k: &K) -> Option<V> {
}
/// Return the maximum number of key-value pairs the cache can hold.
///
/// # Example
///
/// ```
/// use std::collections::LruCache;
/// let mut cache: LruCache<int, &str> = LruCache::new(2);
/// assert_eq!(cache.capacity(), 2);
/// ```
pub
fn
capacity
(
&
self
)
->
uint
{
self
.max_size
}
/// Change the number of key-value pairs the cache can hold. Remove
/// least-recently-used key-value pairs if necessary.
///
/// # Example
///
/// ```
/// use std::collections::LruCache;
/// let mut cache = LruCache::new(2);
///
/// cache.put(1i, "a");
/// cache.put(2, "b");
/// cache.put(3, "c");
///
/// assert_eq!(cache.get(&1), None);
/// assert_eq!(cache.get(&2), Some(&"b"));
/// assert_eq!(cache.get(&3), Some(&"c"));
///
/// cache.change_capacity(3);
/// cache.put(1i, "a");
/// cache.put(2, "b");
///
/// assert_eq!(cache.get(&1), Some(&"a"));
/// assert_eq!(cache.get(&2), Some(&"b"));
/// assert_eq!(cache.get(&3), Some(&"c"));
///
/// cache.change_capacity(1);
///
/// assert_eq!(cache.get(&1), None);
/// assert_eq!(cache.get(&2), None);
/// assert_eq!(cache.get(&3), Some(&"c"));
/// ```
pub
fn
change_capacity
(
&
mut
self
,
capacity
:
uint
)
{
for
_
in
range
(
capacity
,
self
.len
())
{
self
.remove_lru
();
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录