isLouisHsu / isLouisHsu/isLouisHsu.github.io

Least Recently Used Cache | LOUIS' BLOG

Open
#69 0 comments 0 reactions 0 assignees View on GitHub

Nobody has claimed this yet.

ebe1fff113703af31eecf4ff1ca953f8 Gitalk
Dominant language
HTML
Stars
4
Forks
1
PR merge metrics
No merged PRs in 30d

Description

https://louishsu.xyz/2020/06/05/Least-Recently-Used-Cache/

目录 目录 原理介绍 算法设计 put(key, value) get(key) 注意 代码实现 基于双向链表和字典 基于有序字典OrderedDict Reference 原理介绍最近最少使用缓存(Least Recently Usd Cache, LRU Cache)是一种常用的页面置换算法,其设计原则是:如果一个数据在最近一段时间内没有被访问到,那么将来它被访问的几率也很小,那么当

Contributor guide

No contributing guide indexed for this repository

First steps

  1. Read the whole issue, then the project's contributing guide.
  2. Comment on the issue to say you are picking it up — it saves two people doing the same work.
  3. Fork the repository and make your change on a branch.
  4. Open a pull request that references the issue number.

Research direction

Start with the linked LOUIS' BLOG article and inspect the repository's blog content structure to determine whether this issue is meant to add or revise a post. The issue does not name a target file, tests, or a specific change, so the intended scope and completion criteria need clarification before work can begin.

Written by the indexing model from the issue text.

Assessment

Tech stack
python
Domain
content, documentation
Issue type
Documentation
Difficulty
5/5
Estimated time
Over a week
Activity status
Stale
Clarity
Needs clarification
Newbie friendliness
15/100

Get new issues in your inbox

A short digest of beginner-friendly GitHub issues.