carpenterlee / jcfinternals Goto Github PK
View Code? Open in Web Editor NEW深入理解Java集合框架
License: Other
jcfinternals's People
Contributors
Stargazers
Watchers
Forkers
fengzhentian qmgeng truejasonfans djnxy conchz alexguo88 yangphere supernow yame2009 lushuner greyireland dong111 luo634501217 dbaxyx halfapple aaaaaaron tombeer2011 zjpjohn lozvx zmjios xiangzhurui dexterlabcn cycle-chen joshuaswan gregecho wentium wangyoo mnmlist djoel1107 hellolong expacted arnold0617 jiaxiang-liu claudiusjxk opensource-huawei gentlekevin ks1024 actorking sunyudong hl123 sudohello aloneshun kira2will yuez1989 plumferry peiyaoyao zhangxiaopengmm dxyoo7 zheng-zhi swabber-kun androidforkers u20024804 sunjiankun126 adrianliu haoyangyu liyang1069 lsk-kun kbiao superbshun linzhengbupt fanlehai jayzyyzyy yanghaitao0410 pxshuo163 neulyp toneylyx chaxiu gnahz-eh apple006 aarontl fuzw123 imxtyler bingowangzhb hualebin wangzhiwubigdata chensdraw linzhenglearn liuzhisheng1226 drizztcc xietiantian xaylei jq8chu funkyer scapegoat1630 liqing201104 q88535448 wyc192273 crazyexception fly365 qianxuejun jiangying000 tataguig git-sky zhenlanghuo yanmeng991 timeouts guoyaxiang sicheng20 1194826389 gata2ojcfinternals's Issues
发现错别字
- 位于JCFInternals/markdown/5-TreeSet and TreeMap.md
- 红黑树是一种近似平衡的二叉查找树，它能够确保任何一个节点的左右子树的高度差不会超过二者中较低那个的一陪
關於PriorityQueue的remove情況2應該還有其他情形需要處理?
以範例那張圖為例
假設remove的是15 也就是index=5的那個元素
在siftDown後那個位置會變成9, heap不對, 因此應該還需要檢查
if (queue[i] == moved) {
siftUp(i, moved);
}
关于 2019_campus_apply 引用 JCFInternals 说明
博主你好，我在我的仓库 2019_campus_apply 中引用了一些本仓库的一些源码分析和部分示例图，无商业用途，开源免费。也欢迎群主能够加入一起交流，QQ 1002039945
图裂了
PNG图片完全都打不开
博主什么时候更新Java8的HashMap
Java8的HashMap做了相当多的优化,当桶上的链表节点大于8的话就转换为红黑树了,测试在hash极不均匀的情况下相比JDK7有明显的性能提升,等待你的分析博客了
WeekHashMap弱引用
”WeekHashMap 的这个特点特别适用于需要缓存的场景“ —— 针对博主说的这句话想到的：既然WeekHashMap是弱引用，那么不管内存是否紧张value都有可能会被回收 ; 而软引用，只有当内存不足时才会被回收，那岂不是用软引用更合适，而弱引用在内存泄漏方面更合适一些，博主怎么看？
Stack & Queue
| Stack Method | Equivalent Deque Method | 说明 |
|---|---|---|
push(e) |
addFirst(e) |
向栈顶插入元素，失败则抛出异常 |
| 无 | offerFirst(e) |
向栈顶插入元素，失败则返回false |
pop() |
removeFirst() |
获取并删除栈顶元素，失败则抛出异常 |
| 无 | pollFirst() |
获取并删除栈顶元素，失败则返回null |
peek() |
peekFirst() |
获取但不删除栈顶元素，失败则抛出异常 |
| 无 | peekFirst() |
获取但不删除栈顶元素，失败则返回null |
| Stack Method | Equivalent Deque Method | 说明 |
|---|---|---|
push(e) |
addFirst(e) |
向栈顶插入元素，失败则抛出异常 |
| 无 | offerFirst(e) |
向栈顶插入元素，失败则返回false |
pop() |
removeFirst() |
获取并删除栈顶元素，失败则抛出异常 |
| 无 | pollFirst() |
获取并删除栈顶元素，失败则返回null |
peek() |
getFirst() |
获取但不删除栈顶元素，失败则抛出异常 |
| 无 | peekFirst() |
获取但不删除栈顶元素，失败则返回null |
ArrayDequeue中疑问.
易理解
5-TreeSet and TreeMap.md
寻找节点后继
t的右孩子为空，则t的后继是其第一个向左走的祖先。
->
虽然代码是ch == p.right 表述是否应换为"第一个向右走的祖先"?
另外 文中所说的情况1~6 是哪些呢?望答主不吝赐教
LinkedList 标示图箭头问题
add(int index, E element)，方法的 解释箭头 有两个下一个。
Stack and Queue
由于官方更推荐使用AarryDeque用作栈和队列，加之上一篇已经讲解过LinkedList，本文将着重讲解ArrayDeque的具体实现。
拼写错误
Recommend Projects
-
React
A declarative, efficient, and flexible JavaScript library for building user interfaces.
-
Vue.js
🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.
-
Typescript
TypeScript is a superset of JavaScript that compiles to clean JavaScript output.
-
TensorFlow
An Open Source Machine Learning Framework for Everyone
-
Django
The Web framework for perfectionists with deadlines.
-
Laravel
A PHP framework for web artisans
-
D3
Bring data to life with SVG, Canvas and HTML. 📊📈🎉
-
Recommend Topics
-
javascript
JavaScript (JS) is a lightweight interpreted programming language with first-class functions.
-
web
Some thing interesting about web. New door for the world.
-
server
A server is a program made to process requests and deliver data to clients.
-
Machine learning
Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.
-
Visualization
Some thing interesting about visualization, use data art
-
Game
Some thing interesting about game, make everyone happy.
Recommend Org
-
Facebook
We are working to build community through open source technology. NB: members must have two-factor auth.
-
Microsoft
Open source projects and samples from Microsoft.
-
Google
Google ❤️ Open Source for everyone.
-
Alibaba
Alibaba Open Source for everyone
-
D3
Data-Driven Documents codes.
-
Tencent
China tencent open source team.