随笔分类 -  源码理解

摘要:1.HashMap方法是如何保证容量大小始终为2的整次幂的? static final int tableSizeFor(int cap) { int n = cap - 1; n |= n >>> 1; n |= n >>> 2; n |= n >>> 4; n |= n >>> 8; n |= 阅读全文
posted @ 2023-05-17 16:32 TriggerMaker 阅读(5) 评论(0) 推荐(0)