Skip to content

[pull] master from Snailclimb:master #159

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
pull merged 6 commits into from
Jul 13, 2021
Merged

[pull] master from Snailclimb:master #159

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
6 commits
Select commit Hold shift + click to select a range
144736c
fix: 更新数据链路层图示
LiuKay Jul 11, 2021
aefa2cc
修复包命名反例
VinterHe Jul 12, 2021
ab6a36b
Update basis.md
Snailclimb Jul 13, 2021
e0ecaa6
Merge pull request #1273 from LiuKay/master
Snailclimb Jul 13, 2021
874a58b
Update 计算机网络知识总结.md
Snailclimb Jul 13, 2021
5cf515e
Merge pull request #1274 from VinterHe/patch-5
Snailclimb Jul 13, 2021
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion docs/network/计算机网络知识总结.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -163,7 +163,7 @@

## 3. 数据链路层（Data Link Layer）

![数据链路层](https://img-blog.csdnimg.cn/img_convert/8d24d1684552fa9cc824ce72b3087637.png)
![数据链路层](https://guide-blog-images.oss-cn-shenzhen.aliyuncs.com/java-guide-blog/2-data-link-layer.svg)

### 3.1. 基本术语

Expand Down
2 changes: 1 addition & 1 deletion docs/operating-system/basis.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -337,7 +337,7 @@

- **OPT 页面置换算法（最佳页面置换算法）** ：最佳(Optimal, OPT)置换算法所选择的被淘汰页面将是以后永不使用的，或者是在最长时间内不再被访问的页面,这样可以保证获得最低的缺页率。但由于人们目前无法预知进程在内存下的若千页面中哪个是未来最长时间内不再被访问的，因而该算法无法实现。一般作为衡量其他置换算法的方法。
- **FIFO（First In First Out） 页面置换算法（先进先出页面置换算法）** : 总是淘汰最先进入内存的页面，即选择在内存中驻留时间最久的页面进行淘汰。
- **LRU （Least Currently Used）页面置换算法（最近最久未使用页面置换算法）** ：LRU算法赋予每个页面一个访问字段，用来记录一个页面自上次被访问以来所经历的时间 T，当须淘汰一个页面时，选择现有页面中其 T 值最大的，即最近最久未使用的页面予以淘汰。
- **LRU （Least Recently Used）页面置换算法（最近最久未使用页面置换算法）** ：LRU算法赋予每个页面一个访问字段，用来记录一个页面自上次被访问以来所经历的时间 T，当须淘汰一个页面时，选择现有页面中其 T 值最大的，即最近最久未使用的页面予以淘汰。
- **LFU （Least Frequently Used）页面置换算法（最少使用页面置换算法）** : 该置换算法选择在之前时期使用最少的页面作为淘汰页。

## Reference
Expand Down
2 changes: 1 addition & 1 deletion docs/system-design/naming.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -123,7 +123,7 @@ void shouldGet200StatusCodoWhenRequestIsValid() {

正例： `org.apache.dubbo.common.threadlocal`

反例： ~~`org.apache.dubbo.common.threadLocal`~~
反例： ~~`org.apache_dubbo.Common.threadLocals`~~

**5.抽象类命名使用 Abstract 开头**。

Expand Down