使用类名来命名锚点

diguage · diguage · commit d59ad4cb8f8d · 2025-06-13T11:54:38.000+08:00
diff --git a/docs/java.io.Serializable.adoc b/docs/java.io.Serializable.adoc
@@ -1,4 +1,4 @@
-[#io-Serializable]
+[[java.io.Serializable]]
 = `Serializable`
 
 [{java_src_attr}]
diff --git a/docs/java.lang.ClassLoader.adoc b/docs/java.lang.ClassLoader.adoc
@@ -1,4 +1,4 @@
-[#lang-ClassLoader]
+[[java.lang.ClassLoader]]
 = ClassLoader
 
 虽然对 `ClassLoader` 的双亲委派流程比较了解，但是一直没有仔细专研过代码实现。今天翻看代码，代码写的简单明了：
diff --git a/docs/java.lang.String.adoc b/docs/java.lang.String.adoc
@@ -1,4 +1,4 @@
-[#lang-String]
+[[java.lang.String]]
 = `String`
 
 [{java_src_attr}]
diff --git a/docs/java.lang.Thread.adoc b/docs/java.lang.Thread.adoc
@@ -1,4 +1,4 @@
-[#lang-Thread]
+[[java.lang.Thread]]
 = Thread
 
 在JDK1.2之后，Java线程模型已经确定了基于操作系统原生线程模型实现。
diff --git a/docs/java.lang.ThreadLocal.adoc b/docs/java.lang.ThreadLocal.adoc
@@ -1,4 +1,4 @@
-[#lang-ThreadLocal]
+[[java.lang.ThreadLocal]]
 = ThreadLocal
 
 原以为神秘兮兮的 `ThreadLocal` 是何方神圣？没想到，点开代码，竟然如此简单明了，直接上代码：
diff --git a/docs/java.lang.reflect.Field.adoc b/docs/java.lang.reflect.Field.adoc
@@ -1,4 +1,4 @@
-[#reflect-Field]
+[[java.lang.reflect.Field]]
 = Field
 
 属性操作方法 `Field#set(Object obj, Object value)` 和 `Field#get(Object obj)` 底层都是委托到 `jdk.internal.reflect.FieldAccessor` 实现。
diff --git a/docs/java.lang.reflect.Proxy.adoc b/docs/java.lang.reflect.Proxy.adoc
@@ -1,4 +1,4 @@
-[#reflect-Proxy]
+[[java.lang.reflect.Proxy]]
 = Proxy
 
 [{java_src_attr}]
diff --git a/docs/java.net.ServerSocket.adoc b/docs/java.net.ServerSocket.adoc
@@ -1,4 +1,4 @@
-[#net-ServerSocket]
+[[java.net.ServerSocket]]
 = ServerSocket
 
 在纠结了 N 久之后，终于动手写程序完成了 Socket 全双工实验。实验证实，Socket 在接受的同时，还可以发送报文。
diff --git a/docs/java.util.AbstractCollection.adoc b/docs/java.util.AbstractCollection.adoc
@@ -1,3 +1,3 @@
-[#util-AbstractCollection]
+[[java.util.AbstractCollection]]
 = AbstractCollection
 
diff --git a/docs/java.util.AbstractList.adoc b/docs/java.util.AbstractList.adoc
@@ -1,3 +1,3 @@
-[#util-AbstractList]
+[[java.util.AbstractList]]
 = AbstractList
 
diff --git a/docs/java.util.AbstractMap.adoc b/docs/java.util.AbstractMap.adoc
@@ -1,4 +1,4 @@
-[#util-AbstractMap]
+[[java.util.AbstractMap]]
 = AbstractMap
 
 
diff --git a/docs/java.util.AbstractQueue.adoc b/docs/java.util.AbstractQueue.adoc
@@ -1,3 +1,3 @@
-[#util-AbstractQueue]
+[[java.util.AbstractQueue]]
 = AbstractQueue
 
diff --git a/docs/java.util.AbstractSequentialList.adoc b/docs/java.util.AbstractSequentialList.adoc
@@ -1,4 +1,4 @@
-[#util-AbstractSequentialList]
+[[java.util.AbstractSequentialList]]
 = AbstractSequentialList
 
 == 类图
diff --git a/docs/java.util.AbstractSet.adoc b/docs/java.util.AbstractSet.adoc
@@ -1,3 +1,3 @@
-[#util-AbstractSet]
+[[java.util.AbstractSet]]
 = AbstractSet
 
diff --git a/docs/java.util.ArrayDeque.adoc b/docs/java.util.ArrayDeque.adoc
@@ -1,3 +1,3 @@
-[#util-ArrayDeque]
+[[java.util.ArrayDeque]]
 = ArrayDeque
 
diff --git a/docs/java.util.ArrayList.adoc b/docs/java.util.ArrayList.adoc
@@ -1,4 +1,4 @@
-[#util-ArrayList]
+[[java.util.ArrayList]]
 = `ArrayList`
 
 对于每种抽象数据类型并不存在什么法则来告诉我们必须要有哪些操作，这是一个设计决策。--《数据结构与算法分析》
diff --git a/docs/java.util.Arrays.adoc b/docs/java.util.Arrays.adoc
@@ -1,2 +1,2 @@
-[#util-Arrays]
+[[java.util.Array]]
 = 工具类 `Arrays`
diff --git a/docs/java.util.BitSet.adoc b/docs/java.util.BitSet.adoc
@@ -1,3 +1,3 @@
-[#util-BitSet]
+[[java.util.BitSet]]
 = BitSet
 
diff --git a/docs/java.util.Collection.adoc b/docs/java.util.Collection.adoc
@@ -1,4 +1,4 @@
-[#util-Collection]
+[[java.util.Collection]]
 = Collection
 
 有一个问题，我们思考一下：如果让你设计 JDK 集合框架，你会怎么设计？说的更具体一些，现在需要一个可以包含重复对象的 `Aggregation` 集合，请问怎么设计？
diff --git a/docs/java.util.Collections.adoc b/docs/java.util.Collections.adoc
@@ -1,2 +1,2 @@
-[#util-Collections]
+[[java.util.Collection]]
 = 工具类 `Collections`
diff --git a/docs/java.util.Date.adoc b/docs/java.util.Date.adoc
@@ -1,4 +1,4 @@
-[#util-Date]
+[[java.util.Date]]
 = `Date`
 
 [{java_src_attr}]
diff --git a/docs/java.util.Deque.adoc b/docs/java.util.Deque.adoc
@@ -1,3 +1,3 @@
-[#util-Deque]
+[[java.util.Deque]]
 = Deque
 
diff --git a/docs/java.util.Dictionary.adoc b/docs/java.util.Dictionary.adoc
@@ -1,3 +1,3 @@
-[#util-Dictionary]
+[[java.util.Dictionary]]
 = Dictionary
 
diff --git a/docs/java.util.EnumMap.adoc b/docs/java.util.EnumMap.adoc
@@ -1,3 +1,3 @@
-[#util-EnumMap]
+[[java.util.EnumMap]]
 = EnumMap
 
diff --git a/docs/java.util.EnumSet.adoc b/docs/java.util.EnumSet.adoc
@@ -1,3 +1,3 @@
-[#util-EnumSet]
+[[java.util.EnumSet]]
 = EnumSet
 
diff --git a/docs/java.util.HashMap.adoc b/docs/java.util.HashMap.adoc
@@ -1,4 +1,4 @@
-[#util-HashMap]
+[[java.util.HashMap]]
 = HashMap
 
 == HashMap 问题集
diff --git a/docs/java.util.HashSet.adoc b/docs/java.util.HashSet.adoc
@@ -1,4 +1,4 @@
-[#util-HashSet]
+[[java.util.HashSet]]
 = HashSet
 
 == Redis 中的 Set
diff --git a/docs/java.util.Hashtable.adoc b/docs/java.util.Hashtable.adoc
@@ -1,4 +1,4 @@
-[#util-Hashtable]
+[[java.util.Hashtable]]
 = Hashtable
 
 image::assets/images/Hashtable-lock.png[]
diff --git a/docs/java.util.IdentityHashMap.adoc b/docs/java.util.IdentityHashMap.adoc
@@ -1,3 +1,3 @@
-[#util-IdentityHashMap]
+[[java.util.IdentityHashMap]]
 = IdentityHashMap
 
diff --git a/docs/java.util.Iterator.adoc b/docs/java.util.Iterator.adoc
@@ -1,4 +1,4 @@
-[#util-Iterator]
+[[java.util.Iterator]]
 = 迭代器 Iterator、 Enumeration、 Spliterator 与 Iterable
 
 == 涉及代码
diff --git a/docs/java.util.LinkedHashMap.adoc b/docs/java.util.LinkedHashMap.adoc
@@ -1,4 +1,4 @@
-[#util-LinkedHashMap]
+[[java.util.LinkedHashMap]]
 = LinkedHashMap
 
 
diff --git a/docs/java.util.LinkedHashSet.adoc b/docs/java.util.LinkedHashSet.adoc
@@ -1,3 +1,3 @@
-[#util-LinkedHashSet]
+[[java.util.LinkedHashSet]]
 = LinkedHashSet
 
diff --git a/docs/java.util.LinkedList.adoc b/docs/java.util.LinkedList.adoc
@@ -1,4 +1,4 @@
-[#util-LinkedList]
+[[java.util.LinkedList]]
 = LinkedList
 
 `LinkedList` 底层使用的是 双向链表 数据结构（JDK1.6 之前为循环链表，JDK1.7 取消了循环。注意双向链表和双向循环链表的区别。）
diff --git a/docs/java.util.List.adoc b/docs/java.util.List.adoc
@@ -1,3 +1,3 @@
-[#util-List]
+[[java.util.List]]
 = List
 
diff --git a/docs/java.util.Map.adoc b/docs/java.util.Map.adoc
@@ -1,3 +1,3 @@
-[#util-Map]
+[[java.util.Map]]
 = Map
 
diff --git a/docs/java.util.NavigableMap.adoc b/docs/java.util.NavigableMap.adoc
@@ -1,3 +1,3 @@
-[#util-NavigableMap]
+[[java.util.NavigableMap]]
 = NavigableMap
 
diff --git a/docs/java.util.NavigableSet.adoc b/docs/java.util.NavigableSet.adoc
@@ -1,3 +1,3 @@
-[#util-NavigableSet]
+[[java.util.NavigableSet]]
 = NavigableSet
 
diff --git a/docs/java.util.PriorityQueue.adoc b/docs/java.util.PriorityQueue.adoc
@@ -1,4 +1,4 @@
-[#util-PriorityQueue]
+[[java.util.PriorityQueue]]
 = PriorityQueue
 
 对于 `PriorityQueue` 来说，最重要的一点就是要清楚他是基于堆结构实现，可以用它来实现优先队列。
diff --git a/docs/java.util.Queue.adoc b/docs/java.util.Queue.adoc
@@ -1,3 +1,3 @@
-[#util-Queue]
+[[java.util.Queue]]
 = Queue
 
diff --git a/docs/java.util.ServiceLoader.adoc b/docs/java.util.ServiceLoader.adoc
@@ -1,4 +1,4 @@
-[#util-ServiceLoader]
+[[java.util.ServiceLoader]]
 = `ServiceLoader`
 
 [{java_src_attr}]
diff --git a/docs/java.util.Set.adoc b/docs/java.util.Set.adoc
@@ -1,3 +1,3 @@
-[#util-Set]
+[[java.util.Set]]
 = Set
 
diff --git a/docs/java.util.SortedMap.adoc b/docs/java.util.SortedMap.adoc
@@ -1,3 +1,3 @@
-[#util-SortedMap]
+[[java.util.SortedMap]]
 = SortedMap
 
diff --git a/docs/java.util.SortedSet.adoc b/docs/java.util.SortedSet.adoc
@@ -1,4 +1,4 @@
-[#util-SortedSet]
+[[java.util.SortedSet]]
 = SortedSet
 
 == Redis 的 SkipList
diff --git a/docs/java.util.Stack.adoc b/docs/java.util.Stack.adoc
@@ -1,4 +1,4 @@
-[#util-Stack]
+[[java.util.Stack]]
 = Stack
 
 [plantuml,{diagram_attr}]
diff --git a/docs/java.util.TreeMap.adoc b/docs/java.util.TreeMap.adoc
@@ -1,4 +1,4 @@
-[#util-TreeMap]
+[[java.util.TreeMap]]
 = TreeMap
 
 先看一个问题：
diff --git a/docs/java.util.TreeSet.adoc b/docs/java.util.TreeSet.adoc
@@ -1,3 +1,3 @@
-[#util-TreeSet]
+[[java.util.TreeSet]]
 = TreeSet
 
diff --git a/docs/java.util.Vector.adoc b/docs/java.util.Vector.adoc
@@ -1,4 +1,4 @@
-[#util-Vector]
+[[java.util.Vector]]
 = Vector
 
 [plantuml,{diagram_attr}]
diff --git a/docs/java.util.WeakHashMap.adoc b/docs/java.util.WeakHashMap.adoc
@@ -1,3 +1,3 @@
-[#util-WeakHashMap]
+[[java.util.WeakHashMap]]
 = WeakHashMap
 
diff --git a/docs/java.util.concurrent.ArrayBlockingQueue.adoc b/docs/java.util.concurrent.ArrayBlockingQueue.adoc
@@ -1,4 +1,4 @@
-[#concurrent-ArrayBlockingQueue]
+[[java.util.concurrent.ArrayBlockingQueue]]
 = ArrayBlockingQueue
 
 image::assets/images/BlockingQueue.png[align="center"]
diff --git a/docs/java.util.concurrent.CompletableFuture.adoc b/docs/java.util.concurrent.CompletableFuture.adoc
@@ -1,4 +1,4 @@
-[#concurrent-CompletableFuture]
+[[java.util.concurrent.CompletableFuture]]
 = CompletableFuture
 
 Java 中的 Promise。
diff --git a/docs/java.util.concurrent.ConcurrentHashMap.adoc b/docs/java.util.concurrent.ConcurrentHashMap.adoc
@@ -1,4 +1,4 @@
-[#concurrent-ConcurrentHashMap]
+[[java.util.concurrent.ConcurrentHashMap]]
 = `ConcurrentHashMap`
 
 
diff --git a/docs/java.util.concurrent.ConcurrentLinkedQueue.adoc b/docs/java.util.concurrent.ConcurrentLinkedQueue.adoc
@@ -1,4 +1,4 @@
-[#concurrent-ConcurrentLinkedQueue]
+[[java.util.concurrent.ConcurrentLinkedQueue]]
 = ConcurrentLinkedQueue
 
 `ConcurrentLinkedQueue` 主要使用 CAS 非阻塞算法来实现线程安全。这是一个非阻塞队列。对比来看，`LinkedBlockingQueue` 是一个可以阻塞的队列。
diff --git a/docs/java.util.concurrent.ConcurrentSkipListMap.adoc b/docs/java.util.concurrent.ConcurrentSkipListMap.adoc
@@ -1,4 +1,4 @@
-[#concurrent-ConcurrentSkipListMap]
+[[java.util.concurrent.ConcurrentSkipListMap]]
 = `ConcurrentSkipListMap`
 
 没想到 JDK 中，居然有跳跃表的实现！
diff --git a/docs/java.util.concurrent.CopyOnWriteArrayList.adoc b/docs/java.util.concurrent.CopyOnWriteArrayList.adoc
@@ -1,4 +1,4 @@
-[#concurrent-CopyOnWriteArrayList]
+[[java.util.concurrent.CopyOnWriteArrayList]]
 = CopyOnWriteArrayList
 
 xref:java.util.concurrent.locks.ReentrantReadWriteLock.adoc[`ReentrantReadWriteLock`] 读写锁的思想非常类似，也就是读读共享、写写互斥、读写互斥、写读互斥。JDK 中提供了 `CopyOnWriteArrayList` 类比相比于在读写锁的思想又更进一步。为了将读取的性能发挥到极致，`CopyOnWriteArrayList` 读取是完全不用加锁的，并且更厉害的是：写入也不会阻塞读取操作。只有写入和写入之间需要进行同步等待。这样一来，读操作的性能就会大幅度提升。
diff --git a/docs/java.util.concurrent.CountDownLatch.adoc b/docs/java.util.concurrent.CountDownLatch.adoc
@@ -1,4 +1,4 @@
-[#concurrent-CountDownLatch]
+[[id=java.util.concurrent.CountDownLatch]]
 = CountDownLatch
 
 "Count Down" 在英语中意为倒计数，一个典型场景就是火箭🚀发射时的倒计时。它允许一个或多个线程等待其他线程完成操作。
diff --git a/docs/java.util.concurrent.CyclicBarrier.adoc b/docs/java.util.concurrent.CyclicBarrier.adoc
@@ -1,4 +1,4 @@
-[#concurrent-CyclicBarrier]
+[[java.util.concurrent.CyclicBarrier]]
 = CyclicBarrier
 
 [{java_src_attr}]
diff --git a/docs/java.util.concurrent.DelayQueue.adoc b/docs/java.util.concurrent.DelayQueue.adoc
@@ -1,4 +1,4 @@
-[#concurrent-DelayQueue]
+[[java.util.concurrent.DelayQueue]]
 = DelayQueue
 
 `DelayQueue` 对元素进行持有直到一个特定的延迟到期。注入其中的元素必须实现 `java.util.concurrent.Delayed` 接口，该接口定义:
diff --git a/docs/java.util.concurrent.Exchanger.adoc b/docs/java.util.concurrent.Exchanger.adoc
@@ -1,2 +1,2 @@
-[#concurrent-Exchanger]
+[[java.util.concurrent.Exchanger]]
 = Exchanger
diff --git a/docs/java.util.concurrent.Flow.adoc b/docs/java.util.concurrent.Flow.adoc
@@ -1,4 +1,4 @@
-[#concurrent-Flow]
+[[java.util.concurrent.Flow]]
 = `Flow`
 
 
diff --git a/docs/java.util.concurrent.ForkJoinPool.adoc b/docs/java.util.concurrent.ForkJoinPool.adoc
@@ -1,4 +1,4 @@
-[#concurrent-ForkJoinPool]
+[[java.util.concurrent.ForkJoinPool]]
 = ForkJoinPool
 
 image::assets/images/ForkJoinPool-fork-join.webp[]
diff --git a/docs/java.util.concurrent.ForkJoinTask.adoc b/docs/java.util.concurrent.ForkJoinTask.adoc
@@ -1,4 +1,4 @@
-[#concurrent-ForkJoinTask]
+[[java.util.concurrent.ForkJoinTask]]
 = ForkJoinTask
 
 == 类图
diff --git a/docs/java.util.concurrent.Future.adoc b/docs/java.util.concurrent.Future.adoc
@@ -1,4 +1,4 @@
-[#concurrent-Future]
+[[java.util.concurrent.Future]]
 = JUC 包基础类分析
 
 JUC 包中有一些提交比较小的类，这类类单列出来重量太小，不够篇幅。
diff --git a/docs/java.util.concurrent.FutureTask.adoc b/docs/java.util.concurrent.FutureTask.adoc
@@ -1,4 +1,4 @@
-[#concurrent-FutureTask]
+[[java.util.concurrent.FutureTask]]
 = FutureTask
 
 == 类图
diff --git a/docs/java.util.concurrent.LinkedBlockingQueue.adoc b/docs/java.util.concurrent.LinkedBlockingQueue.adoc
@@ -1,4 +1,4 @@
-[#concurrent-LinkedBlockingQueue]
+[[java.util.concurrent.LinkedBlockingQueue]]
 = LinkedBlockingQueue
 
 `LinkedBlockingQueue` 底层是一个单向链表结构。如果需要的话，这一链式结构可以选择一个上限。如果没有定义上限，将使用 `Integer.MAX_VALUE` 作为上限。
diff --git a/docs/java.util.concurrent.Phaser.adoc b/docs/java.util.concurrent.Phaser.adoc
@@ -1,2 +1,4 @@
-[#concurrent-Phaser]
+[[id=java.util.concurrent.Phaser]]
 = Phaser
+
+可以用于取代 ``
diff --git a/docs/java.util.concurrent.PriorityBlockingQueue.adoc b/docs/java.util.concurrent.PriorityBlockingQueue.adoc
@@ -1,4 +1,4 @@
-[#concurrent-PriorityBlockingQueue]
+[[java.util.concurrent.PriorityBlockingQueue]]
 = PriorityBlockingQueue
 
 `PriorityBlockingQueue` 是一个支持优先级的无界阻塞队列。默认情况下元素采用自然顺序进行排序，也可以通过自定义类实现 `compareTo()` 方法来指定元素排序规则，或者初始化时通过构造器参数 `Comparator` 来指定排序规则。
diff --git a/docs/java.util.concurrent.ScheduledThreadPoolExecutor.adoc b/docs/java.util.concurrent.ScheduledThreadPoolExecutor.adoc
@@ -1,4 +1,4 @@
-[#concurrent-ScheduledThreadPoolExecutor]
+[[java.util.concurrent.ScheduledThreadPoolExecutor]]
 = `ScheduledThreadPoolExecutor`
 
 `Timer`、`ScheduledThreadPool` 和 `DelayQueue`，总结的说下它们都是通过优先队列来获取最早需要执行的任务，因此插入和删除任务的时间复杂度都为 O(logn)，并且 `Timer` 、`ScheduledThreadPool` 的周期性任务是通过重置任务的下一次执行时间来完成的。
diff --git a/docs/java.util.concurrent.Semaphore.adoc b/docs/java.util.concurrent.Semaphore.adoc
@@ -1,4 +1,4 @@
-[#concurrent-Semaphore]
+[[java.util.concurrent.Semaphore]]
 = Semaphore
 
 信号量
diff --git a/docs/java.util.concurrent.ThreadPoolExecutor.adoc b/docs/java.util.concurrent.ThreadPoolExecutor.adoc
@@ -1,4 +1,4 @@
-[#concurrent-ThreadPoolExecutor]
+[[java.util.concurrent.ThreadPoolExecutor]]
 = ThreadPoolExecutor 源码分析
 
 [cols="9,33,9,38",options="header"]
diff --git a/docs/java.util.concurrent.adoc b/docs/java.util.concurrent.adoc
@@ -1,4 +1,4 @@
-[#concurrent-overview]
+[[concurrent.overview]]
 = 并发库概述
 
 image::assets/images/java-concurrent-overview.png[]
diff --git a/docs/java.util.concurrent.atomic.AtomicInteger.adoc b/docs/java.util.concurrent.atomic.AtomicInteger.adoc
@@ -1,4 +1,4 @@
-[#concurrent-atomic-AtomicInteger]
+[[java.util.concurrent.atomic.AtomicInteger]]
 = AtomicInteger
 
 `AtomicInteger` 类主要利用 CAS (compare and swap) + volatile 和 native 方法来保证原子操作，从而避免 `synchronized` 的高开销，执行效率大为提升。
diff --git a/docs/java.util.concurrent.atomic.LongAdder.adoc b/docs/java.util.concurrent.atomic.LongAdder.adoc
diff --git a/docs/java.util.concurrent.locks.AbstractQueuedSynchronizer.adoc b/docs/java.util.concurrent.locks.AbstractQueuedSynchronizer.adoc
diff --git a/docs/java.util.concurrent.locks.LockSupport.adoc b/docs/java.util.concurrent.locks.LockSupport.adoc
diff --git a/docs/java.util.concurrent.locks.ReentrantLock.adoc b/docs/java.util.concurrent.locks.ReentrantLock.adoc
diff --git a/docs/java.util.concurrent.locks.ReentrantReadWriteLock.adoc b/docs/java.util.concurrent.locks.ReentrantReadWriteLock.adoc
diff --git a/docs/java.util.concurrent.locks.StampedLock.adoc b/docs/java.util.concurrent.locks.StampedLock.adoc
diff --git a/docs/java.util.regex.Pattern.adoc b/docs/java.util.regex.Pattern.adoc
