https://blog.youkuaiyun.com/lyy_222zh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/lyy_222/article/details/157619815https://blog.youkuaiyun.com/lyy_222/article/details/157619815lyy_222Sun, 01 Feb 2026 23:04:07 +0800 若桶为空则 CAS 插入节点 -> 若为链表 / 红黑树，则 synchronized 锁住当前桶的头节点后操作 -> 链表长度达到阈值且数组容量≥64则转为红黑树。：synchronized 锁哈希桶头节点 + CAS。数组 (Node[]) + 链表 / 红黑树。锁粒度更细（单个桶），并发度更高。：Segment 分段锁。数组 (Segment[]) + 数组 (HashEntry[]) + 链表。锁的粒度是 Segment。Java线程状态定义在。]]>https://blog.youkuaiyun.com/lyy_222/article/details/157464288https://blog.youkuaiyun.com/lyy_222/article/details/157464288lyy_222Wed, 28 Jan 2026 09:58:13 +0800https://blog.youkuaiyun.com/lyy_222/article/details/157425388https://blog.youkuaiyun.com/lyy_222/article/details/157425388lyy_222Tue, 27 Jan 2026 09:06:20 +0800https://blog.youkuaiyun.com/lyy_222/article/details/157359476https://blog.youkuaiyun.com/lyy_222/article/details/157359476lyy_222Sun, 25 Jan 2026 14:29:00 +0800https://blog.youkuaiyun.com/lyy_222/article/details/157257104https://blog.youkuaiyun.com/lyy_222/article/details/157257104lyy_222Thu, 22 Jan 2026 17:28:49 +0800https://blog.youkuaiyun.com/lyy_222/article/details/157222622https://blog.youkuaiyun.com/lyy_222/article/details/157222622lyy_222Wed, 21 Jan 2026 21:16:53 +0800https://blog.youkuaiyun.com/lyy_222/article/details/139125559https://blog.youkuaiyun.com/lyy_222/article/details/139125559lyy_222Wed, 22 May 2024 20:35:08 +0800