{"id":95163,"date":"2026-08-16T11:56:57","date_gmt":"2026-08-16T03:56:57","guid":{"rendered":"https:\/\/www.wsisp.com\/helps\/95163.html"},"modified":"2026-08-16T11:56:57","modified_gmt":"2026-08-16T03:56:57","slug":"java%e5%9f%ba%e7%a1%80%e7%9f%a5%e8%af%86%e7%82%b9","status":"publish","type":"post","link":"https:\/\/www.wsisp.com\/helps\/95163.html","title":{"rendered":"java\u57fa\u7840\u77e5\u8bc6\u70b9"},"content":{"rendered":"

\u7b2c\u4e8c\u7ae0JAVA\u96c6\u5408\u6846\u67b6<\/h3>\n

Java\u96c6\u5408\u6846\u67b6\u662f\u9762\u8bd5\u7edd\u5bf9\u91cd\u70b9，\u5c24\u5176\u662f HashMap\u3001ConcurrentHashMap \u7684\u6e90\u7801\u7ea7\u7406\u89e3\u3002<\/p>\n

2.1 ArrayList vs LinkedList<\/h3>\n

\"\u5728\u8fd9\u91cc\u63d2\u5165\u56fe\u7247\u63cf\u8ff0\"
\n2.1.1 ArrayList \u6269\u5bb9\u673a\u5236
\nArrayList \u7684\u6269\u5bb9\u662f\u9762\u8bd5\u9ad8\u9891\u8003\u70b9<\/p>\n

\/\/ ArrayList\u6269\u5bb9\u6e90\u7801（JDK 8）<\/span>
\n\/\/ \u9ed8\u8ba4\u521d\u59cb\u5bb9\u91cf：10（JDK7+\u662f\u61d2\u521d\u59cb\u5316，new ArrayList()\u65f6\u662f\u7a7a\u6570\u7ec4，\u9996\u6b21add\u624d\u6269\u5bb9\u523010）<\/span>
\nprivate<\/span> static<\/span> final<\/span> int<\/span> DEFAULT_CAPACITY<\/span> =<\/span> 10<\/span>;<\/span>
\nprivate<\/span> static<\/span> final<\/span> Object<\/span>[<\/span>]<\/span> EMPTY_ELEMENTDATA<\/span> =<\/span> {<\/span>}<\/span>;<\/span>
\nprivate<\/span> static<\/span> final<\/span> Object<\/span>[<\/span>]<\/span> DEFAULTCAPACITY_EMPTY_ELEMENTDATA<\/span> =<\/span> {<\/span>}<\/span>;<\/span><\/p>\n

public<\/span> boolean<\/span> add<\/span>(<\/span>E<\/span> e)<\/span> {<\/span>
\n ensureCapacityInternal<\/span>(<\/span>size +<\/span> 1<\/span>)<\/span>;<\/span>
\n elementData[<\/span>size++<\/span>]<\/span> =<\/span> e;<\/span>
\n return<\/span> true<\/span>;<\/span>
\n}<\/span><\/p>\n

private<\/span> void<\/span> grow<\/span>(<\/span>int<\/span> minCapacity)<\/span> {<\/span>
\n int<\/span> oldCapacity =<\/span> elementData.<\/span>length;<\/span>
\n \/\/ \u6269\u5bb91.5\u500d：oldCapacity + oldCapacity >> 1<\/span>
\n int<\/span> newCapacity =<\/span> oldCapacity +<\/span> (<\/span>oldCapacity >><\/span> 1<\/span>)<\/span>;<\/span>
\n if<\/span> (<\/span>newCapacity –<\/span> minCapacity <<\/span> 0<\/span>)<\/span>
\n newCapacity =<\/span> minCapacity;<\/span>
\n if<\/span> (<\/span>newCapacity –<\/span> MAX_ARRAY_SIZE<\/span> ><\/span> 0<\/span>)<\/span>
\n newCapacity =<\/span> hugeCapacity<\/span>(<\/span>minCapacity)<\/span>;<\/span>
\n \/\/ Arrays.copyOf \u5e95\u5c42\u8c03\u7528 System.arraycopy（native\u65b9\u6cd5），\u6df1\u62f7\u8d1d\u6570\u7ec4<\/span>
\n elementData =<\/span> Arrays<\/span>.<\/span>copyOf<\/span>(<\/span>elementData,<\/span> newCapacity)<\/span>;<\/span>
\n}<\/span><\/p>\n

\/\/ \u793a\u4f8b：\u5bb9\u91cf\u53d8\u5316<\/span>
\n\/\/ add\u7b2c1\u4e2a\u5143\u7d20: 0 \u2192 10<\/span>
\n\/\/ add\u7b2c11\u4e2a\u5143\u7d20: 10 \u2192 15 (10+10\/2)<\/span>
\n\/\/ add\u7b2c16\u4e2a\u5143\u7d20: 15 \u2192 22 (15+15\/2=22)<\/span>
\n\/\/ \u6269\u5bb9\u5f00\u9500：\u6bcf\u6b21\u6269\u5bb9\u9700\u8981\u5c06\u65e7\u6570\u7ec4\u7684\u5143\u7d20\u590d\u5236\u5230\u65b0\u6570\u7ec4，\u65f6\u95f4\u590d\u6742\u5ea6O(n)<\/span><\/p>\n

2.2 HashMap（\u8d85\u7ea7\u91cd\u70b9）<\/h3>\n

\u26a0\ufe0f HashMap \u662f\u4e2d\u5382\u9762\u8bd5\u6700\u9ad8\u9891\u7684\u8003\u70b9，\u6ca1\u6709\u4e4b\u4e00！\u9700\u8981\u8fbe\u5230\u6e90\u7801\u7ea7\u638c\u63e1\u3002<\/p>\n

2.2.1 JDK7 vs JDK8 \u6570\u636e\u7ed3\u6784\u5dee\u5f02
\nJDK7：\u6570\u7ec4 + \u94fe\u8868（\u5934\u63d2\u6cd5）
\nJDK8：\u6570\u7ec4 + \u94fe\u8868 + \u7ea2\u9ed1\u6811（\u5c3e\u63d2\u6cd5），\u5f53\u94fe\u8868\u957f\u5ea6 \u2265 8 \u4e14\u6570\u7ec4\u957f\u5ea6 \u2265 64，\u94fe\u8868\u8f6c\u4e3a\u7ea2\u9ed1\u6811
\n\u7ea2\u9ed1\u6811\u9000\u5316\u4e3a\u94fe\u8868\u7684\u6761\u4ef6：\u5f53\u7ea2\u9ed1\u6811\u8282\u70b9\u6570 \u2264 6 \u65f6，\u9000\u5316\u4e3a\u94fe\u8868（\u4e2d\u95f4\u5dee 7 \u662f\u4e3a\u4e86\u907f\u514d\u9891\u7e41\u8f6c\u6362\u7684\u7f13\u51b2）<\/p>\n

2.2.2 HashMap put \u6d41\u7a0b（\u5fc5\u987b\u80cc\u719f）<\/p>\n

final<\/span> V<\/span> putVal<\/span>(<\/span>int<\/span> hash,<\/span> K<\/span> key,<\/span> V<\/span> value,<\/span> boolean<\/span> onlyIfAbsent,<\/span> boolean<\/span> evict)<\/span> {<\/span>
\n Node<\/span><<\/span>K<\/span>,<\/span>V<\/span>><\/span><\/span>[<\/span>]<\/span> tab;<\/span> Node<\/span><<\/span>K<\/span>,<\/span>V<\/span>><\/span><\/span> p;<\/span> int<\/span> n,<\/span> i;<\/span><\/p>\n

\/\/ \u6b65\u9aa41：\u6570\u7ec4\u4e3a\u7a7a \u2192 \u521d\u59cb\u5316（resize）<\/span>
\n if<\/span> (<\/span>(<\/span>tab =<\/span> table)<\/span> ==<\/span> null<\/span> ||<\/span> (<\/span>n =<\/span> tab.<\/span>length)<\/span> ==<\/span> 0<\/span>)<\/span>
\n n =<\/span> (<\/span>tab =<\/span> resize<\/span>(<\/span>)<\/span>)<\/span>.<\/span>length;<\/span><\/p>\n

\/\/ \u6b65\u9aa42：\u8ba1\u7b97\u4e0b\u6807，\u8be5\u4f4d\u7f6e\u4e3a\u7a7a \u2192 \u76f4\u63a5\u653e\u5165<\/span>
\n \/\/ \u4e0b\u6807\u8ba1\u7b97：i = (n-1) & hash<\/span>
\n if<\/span> (<\/span>(<\/span>p =<\/span> tab[<\/span>i =<\/span> (<\/span>n –<\/span> 1<\/span>)<\/span> &<\/span> hash]<\/span>)<\/span> ==<\/span> null<\/span>)<\/span>
\n tab[<\/span>i]<\/span> =<\/span> newNode<\/span>(<\/span>hash,<\/span> key,<\/span> value,<\/span> null<\/span>)<\/span>;<\/span><\/p>\n

else<\/span> {<\/span>
\n Node<\/span><<\/span>K<\/span>,<\/span>V<\/span>><\/span><\/span> e;<\/span> K<\/span> k;<\/span>
\n \/\/ \u6b65\u9aa43：\u8be5\u4f4d\u7f6e\u6709\u8282\u70b9，\u4e14key\u76f8\u540c \u2192 \u8986\u76d6\u65e7\u503c<\/span>
\n if<\/span> (<\/span>p.<\/span>hash ==<\/span> hash &&<\/span> (<\/span>(<\/span>k =<\/span> p.<\/span>key)<\/span> ==<\/span> key ||<\/span> (<\/span>key !=<\/span> null<\/span> &&<\/span> key.<\/span>equals<\/span>(<\/span>k)<\/span>)<\/span>)<\/span>)<\/span>
\n e =<\/span> p;<\/span>
\n \/\/ \u6b65\u9aa44：\u8be5\u4f4d\u7f6e\u662f\u7ea2\u9ed1\u6811\u8282\u70b9 \u2192 \u63d2\u5165\u6811\u4e2d<\/span>
\n else<\/span> if<\/span> (<\/span>p instanceof<\/span> TreeNode<\/span>)<\/span>
\n e =<\/span> (<\/span>(<\/span>TreeNode<\/span><<\/span>K<\/span>,<\/span>V<\/span>><\/span><\/span>)<\/span>p)<\/span>.<\/span>putTreeVal<\/span>(<\/span>this<\/span>,<\/span> tab,<\/span> hash,<\/span> key,<\/span> value)<\/span>;<\/span>
\n \/\/ \u6b65\u9aa45：\u8be5\u4f4d\u7f6e\u662f\u94fe\u8868\u8282\u70b9 \u2192 \u904d\u5386\u94fe\u8868<\/span>
\n else<\/span> {<\/span>
\n for<\/span> (<\/span>int<\/span> binCount =<\/span> 0<\/span>;<\/span> ;<\/span> ++<\/span>binCount)<\/span> {<\/span>
\n if<\/span> (<\/span>(<\/span>e =<\/span> p.<\/span>next)<\/span> ==<\/span> null<\/span>)<\/span> {<\/span>
\n p.<\/span>next =<\/span> newNode<\/span>(<\/span>hash,<\/span> key,<\/span> value,<\/span> null<\/span>)<\/span>;<\/span>
\n \/\/ \u94fe\u8868\u957f\u5ea6 \u2265 8（TREEIFY_THRESHOLD）\u2192 \u8f6c\u4e3a\u7ea2\u9ed1\u6811<\/span>
\n if<\/span> (<\/span>binCount >=<\/span> TREEIFY_THRESHOLD<\/span> –<\/span> 1<\/span>)<\/span>
\n treeifyBin<\/span>(<\/span>tab,<\/span> hash)<\/span>;<\/span>
\n break<\/span>;<\/span>
\n }<\/span>
\n \/\/ \u627e\u5230\u76f8\u540ckey \u2192 \u8df3\u51fa<\/span>
\n if<\/span> (<\/span>e.<\/span>hash ==<\/span> hash &&<\/span> (<\/span>(<\/span>k =<\/span> e.<\/span>key)<\/span> ==<\/span> key ||<\/span> (<\/span>key !=<\/span> null<\/span> &&<\/span> key.<\/span>equals<\/span>(<\/span>k)<\/span>)<\/span>)<\/span>)<\/span>
\n break<\/span>;<\/span>
\n p =<\/span> e;<\/span>
\n }<\/span>
\n }<\/span>
\n \/\/ \u6b65\u9aa46：e != null \u8bf4\u660ekey\u5df2\u5b58\u5728，\u8986\u76d6\u65e7\u503c<\/span>
\n if<\/span> (<\/span>e !=<\/span> null<\/span>)<\/span> {<\/span>
\n V<\/span> oldValue =<\/span> e.<\/span>value;<\/span>
\n if<\/span> (<\/span>!<\/span>onlyIfAbsent ||<\/span> oldValue ==<\/span> null<\/span>)<\/span>
\n e.<\/span>value =<\/span> value;<\/span>
\n afterNodeAccess<\/span>(<\/span>e)<\/span>;<\/span> \/\/ LinkedHashMap\u7528<\/span>
\n return<\/span> oldValue;<\/span>
\n }<\/span>
\n }<\/span>
\n ++<\/span>modCount;<\/span>
\n \/\/ \u6b65\u9aa47：size > threshold \u2192 \u6269\u5bb9<\/span>
\n if<\/span> (<\/span>++<\/span>size ><\/span> threshold)<\/span>
\n resize<\/span>(<\/span>)<\/span>;<\/span>
\n afterNodeInsertion<\/span>(<\/span>evict)<\/span>;<\/span>
\n return<\/span> null<\/span>;<\/span>
\n}<\/span><\/p>\n

2.2.3 HashMap \u6269\u5bb9\u673a\u5236<\/p>\n

final<\/span> Node<\/span><<\/span>K<\/span>,<\/span>V<\/span>><\/span><\/span>[<\/span>]<\/span> resize<\/span>(<\/span>)<\/span> {<\/span>
\n \/\/ … \u7701\u7565\u90e8\u5206\u4ee3\u7801<\/span>
\n \/\/ \u65b0\u5bb9\u91cf = \u65e7\u5bb9\u91cf * 2<\/span>
\n \/\/ \u65b0\u9608\u503c = \u65e7\u9608\u503c * 2<\/span><\/p>\n

\/\/ JDK8 \u7684\u4f18\u5316：rehash\u4e0d\u9700\u8981\u91cd\u65b0\u8ba1\u7b97hash<\/span>
\n \/\/ \u6269\u5bb9\u540e，\u8282\u70b9\u8981\u4e48\u5728\u539f\u4f4d\u7f6e j，\u8981\u4e48\u5728\u539f\u4f4d\u7f6e j + oldCap<\/span>
\n \/\/ \u539f\u7406：\u4e0b\u6807 = hash & (newCap-1)，newCap-1 \u6bd4 oldCap-1 \u591a\u4e86\u4e00\u4f4d\u9ad8\u4f4dbit<\/span>
\n \/\/ \u5982\u679c hash \u4e2d\u8be5\u9ad8\u4f4dbit=0 \u2192 \u4f4d\u7f6e\u4e0d\u53d8<\/span>
\n \/\/ \u5982\u679c hash \u4e2d\u8be5\u9ad8\u4f4dbit=1 \u2192 \u4f4d\u7f6e\u53d8\u4e3a j + oldCap<\/span>
\n do<\/span> {<\/span>
\n next =<\/span> e.<\/span>next;<\/span>
\n \/\/ (e.hash & oldCap) == 0 \u2192 \u4f4d\u7f6e\u4e0d\u53d8<\/span>
\n if<\/span> (<\/span>(<\/span>e.<\/span>hash &<\/span> oldCap)<\/span> ==<\/span> 0<\/span>)<\/span> {<\/span>
\n if<\/span> (<\/span>loTail ==<\/span> null<\/span>)<\/span> loHead =<\/span> e;<\/span>
\n else<\/span> loTail.<\/span>next =<\/span> e;<\/span>
\n loTail =<\/span> e;<\/span>
\n }<\/span>
\n \/\/ (e.hash & oldCap) != 0 \u2192 \u4f4d\u7f6e\u53d8\u4e3a j + oldCap<\/span>
\n else<\/span> {<\/span>
\n if<\/span> (<\/span>hiTail ==<\/span> null<\/span>)<\/span> hiHead =<\/span> e;<\/span>
\n else<\/span> hiTail.<\/span>next =<\/span> e;<\/span>
\n hiTail =<\/span> e;<\/span>
\n }<\/span>
\n }<\/span> while<\/span> (<\/span>(<\/span>e =<\/span> next)<\/span> !=<\/span> null<\/span>)<\/span>;<\/span>
\n}<\/span><\/p>\n

2.2.4 \u9ad8\u9891\u9762\u8bd5\u95ee\u9898\u6c47\u603b<\/p>\n

Q1: \u4e3a\u4ec0\u4e48\u8d1f\u8f7d\u56e0\u5b50\u662f 0.75？
\n\u7a7a\u95f4\u5229\u7528\u7387\u548c\u65f6\u95f4\u6548\u7387\u7684\u6298\u4e2d\u3002\u8d1f\u8f7d\u56e0\u5b50\u8d8a\u5927，\u7a7a\u95f4\u5229\u7528\u7387\u8d8a\u9ad8\u4f46\u51b2\u7a81\u6982\u7387\u589e\u52a0；\u8d1f\u8f7d\u56e0\u5b50\u8d8a\u5c0f，\u51b2\u7a81\u6982\u7387\u8d8a\u4f4e\u4f46\u7a7a\u95f4\u6d6a\u8d39\u589e\u591a\u3002\u6839\u636e\u6cca\u677e\u5206\u5e03，0.75\u65f6\u94fe\u8868\u957f\u5ea6\u8fbe\u52308\u7684\u6982\u7387\u7ea6\u4e3a0.00000006，\u662f\u7edf\u8ba1\u5b66\u4e0a\u7684\u5e73\u8861\u70b9\u3002
\nQ2: \u4e3a\u4ec0\u4e48\u5bb9\u91cf\u662f 2 \u7684\u5e42？
\n\u25cf1. \u65b9\u4fbf\u53d6\u6a21\u8fd0\u7b97：hash % n \u7b49\u4ef7\u4e8e hash & (n-1)，\u4f4d\u8fd0\u7b97\u6548\u7387\u8fdc\u9ad8\u4e8e\u53d6\u6a21
\n\u25cf2. \u6269\u5bb9\u65f6\u6570\u636e\u8fc1\u79fb\u66f4\u9ad8\u6548：\u4e0d\u9700\u8981\u91cd\u65b0\u8ba1\u7b97 hash，\u53ea\u9700\u5224\u65ad (e.hash & oldCap)
\n\u25cf3. \u4f7f\u5143\u7d20\u5206\u5e03\u66f4\u5747\u5300：2\u7684\u5e42-1 \u7684\u4e8c\u8fdb\u5236\u5168\u662f1，\u4e0e hash \u505a & \u8fd0\u7b97\u80fd\u5747\u5300\u5206\u5e03
\nQ3: \u4e3a\u4ec0\u4e48\u7ea2\u9ed1\u6811\u9608\u503c\u662f 8？
\n\u6839\u636e\u6cca\u677e\u5206\u5e03\u7edf\u8ba1，\u5728\u8d1f\u8f7d\u56e0\u5b50 0.75 \u65f6，\u94fe\u8868\u957f\u5ea6\u8fbe\u5230 8 \u7684\u6982\u7387\u4e0d\u5230\u5343\u4e07\u5206\u4e4b\u4e00\u3002\u4f46\u4e00\u65e6\u51fa\u73b0（\u5982\u88ab\u6076\u610f\u653b\u51fb\u6784\u9020\u5927\u91cf hash \u51b2\u7a81），\u94fe\u8868\u67e5\u8be2\u9000\u5316\u5230 O(n)，\u8f6c\u7ea2\u9ed1\u6811\u540e\u53ef\u4fdd\u8bc1 O(log n)\u3002\u8fd9\u4e5f\u662f\u4e3a\u4ec0\u4e48 Redis\u3001Nginx \u7b49\u4e5f\u9009\u62e9 8 \u4f5c\u4e3a\u8f6c\u6811\u9608\u503c\u3002
\nQ4: JDK7 \u6269\u5bb9\u4e3a\u4ec0\u4e48\u53ef\u80fd\u5bfc\u81f4\u6b7b\u5faa\u73af（CPU 100%）？
\nJDK7 \u91c7\u7528\u5934\u63d2\u6cd5，\u5728\u591a\u7ebf\u7a0b\u540c\u65f6\u6269\u5bb9\u65f6，\u53ef\u80fd\u5bfc\u81f4\u94fe\u8868\u5f62\u6210\u73af\u5f62，\u9020\u6210 get() \u65f6\u6b7b\u5faa\u73af\u548c CPU 100%\u3002JDK8 \u6539\u4e3a\u5c3e\u63d2\u6cd5\u89e3\u51b3\u4e86\u6b7b\u5faa\u73af\u95ee\u9898，\u4f46 HashMap \u4ecd\u7136\u4e0d\u662f\u7ebf\u7a0b\u5b89\u5168\u7684（\u53ef\u80fd\u4e22\u6570\u636e\u3001size \u4e0d\u51c6\u786e），\u591a\u7ebf\u7a0b\u573a\u666f\u5e94\u4f7f\u7528 ConcurrentHashMap\u3002
\nQ5: HashMap \u7684 hash \u51fd\u6570\u4e3a\u4ec0\u4e48\u8fd9\u6837\u8bbe\u8ba1？<\/p>\n

\/\/ hashCode \u7684\u9ad816\u4f4d\u4e0e\u4f4e16\u4f4d\u505a\u5f02\u6216，\u589e\u52a0\u4f4e\u4f4d\u7684\u968f\u673a\u6027<\/span>
\nstatic<\/span> final<\/span> int<\/span> hash<\/span>(<\/span>Object<\/span> key)<\/span> {<\/span>
\n int<\/span> h;<\/span>
\n return<\/span> (<\/span>key ==<\/span> null<\/span>)<\/span> ?<\/span> 0<\/span> :<\/span> (<\/span>h =<\/span> key.<\/span>hashCode<\/span>(<\/span>)<\/span>)<\/span> ^<\/span> (<\/span>h >>><\/span> 16<\/span>)<\/span>;<\/span>
\n}<\/span>
\n\/\/ \u539f\u56e0：\u8ba1\u7b97\u4e0b\u6807\u65f6\u662f (n-1) & hash，\u5f53 n \u8f83\u5c0f\u65f6（\u598216，n-1=15=00001111），<\/span>
\n\/\/ \u53ea\u4f7f\u7528 hash \u7684\u4f4e4\u4f4d，\u9ad8\u4f4d\u65e0\u6cd5\u53c2\u4e0e\u8fd0\u7b97\u3002\u901a\u8fc7\u9ad816\u4f4d\u5f02\u6216\u4f4e16\u4f4d，<\/span>
\n\/\/ \u5c06\u9ad8\u4f4d\u7684\u5f71\u54cd\u6269\u6563\u5230\u4f4e\u4f4d，\u4f7f\u6563\u5217\u66f4\u5747\u5300\u3002<\/span><\/p>\n

2.3 ConcurrentHashMap<\/h3>\n

\u26a0\ufe0f ConcurrentHashMap \u662f\u5e76\u53d1\u7f16\u7a0b\u9762\u8bd5\u7684\u6838\u5fc3\u8003\u70b9，\u5fc5\u987b\u6e05\u695a JDK7 \u5206\u6bb5\u9501\u548c JDK8 CAS+synchronized \u7684\u533a\u522b\u3002<\/p>\n

2.3.1 JDK7 \u5206\u6bb5\u9501\u673a\u5236<\/p>\n

JDK7 \u7684 ConcurrentHashMap \u91c7\u7528\u5206\u6bb5\u9501（Segment）\u673a\u5236，\u9ed8\u8ba4 16 \u4e2a Segment，\u6bcf\u4e2a Segment \u5185\u90e8\u662f\u4e00\u4e2a\u72ec\u7acb\u7684 HashMap\u3002\u4e0d\u540c Segment \u53ef\u4ee5\u5e76\u53d1\u64cd\u4f5c，\u5e76\u53d1\u5ea6\u4e3a 16\u3002<\/p>\n

\/\/ JDK7 \u7ed3\u6784\u793a\u610f<\/span>
\n\/\/ ConcurrentHashMap<\/span>
\n\/\/ \u251c\u2500\u2500 Segment[0] (\u7ee7\u627f ReentrantLock)<\/span>
\n\/\/ \u2502 \u251c\u2500\u2500 HashEntry \u2192 HashEntry \u2192 … (\u94fe\u8868)<\/span>
\n\/\/ \u2502 \u2514\u2500\u2500 …<\/span>
\n\/\/ \u251c\u2500\u2500 Segment[1]<\/span>
\n\/\/ \u2502 \u2514\u2500\u2500 …<\/span>
\n\/\/ \u2514\u2500\u2500 Segment[15]<\/span>
\n\/\/ \u2514\u2500\u2500 …<\/span><\/p>\n

\/\/ put \u6d41\u7a0b<\/span>
\npublic<\/span> V<\/span> put<\/span>(<\/span>K<\/span> key,<\/span> V<\/span> value)<\/span> {<\/span>
\n int<\/span> hash =<\/span> hash<\/span>(<\/span>key)<\/span>;<\/span>
\n int<\/span> segmentIndex =<\/span> (<\/span>hash >>><\/span> segmentShift)<\/span> &<\/span> segmentMask;<\/span> \/\/ \u5b9a\u4f4dSegment<\/span>
\n Segment<\/span><<\/span>K<\/span>,<\/span>V<\/span>><\/span><\/span> segment =<\/span> ensureSegment<\/span>(<\/span>segmentIndex)<\/span>;<\/span>
\n return<\/span> segment.<\/span>put<\/span>(<\/span>key,<\/span> hash,<\/span> value,<\/span> false<\/span>)<\/span>;<\/span>
\n}<\/span>
\n\/\/ Segment.put() \u5185\u90e8\u5148 lock()，\u7136\u540e\u6267\u884c\u7c7b\u4f3c\u4e8e HashMap \u7684 put \u6d41\u7a0b<\/span><\/p>\n

2.3.2 JDK8 CAS + synchronized \u673a\u5236
\nJDK8 \u5b8c\u5168\u91cd\u6784\u4e86 ConcurrentHashMap，\u653e\u5f03\u4e86\u5206\u6bb5\u9501，\u6539\u7528\u66f4\u7ec6\u7c92\u5ea6\u7684\u9501\u7b56\u7565：
\n\u25cf\u6570\u7ec4\u4e3a\u7a7a\u65f6：CAS \u521d\u59cb\u5316\u6570\u7ec4
\n\u25cf\u6876\u4f4d\u7f6e\u4e3a\u7a7a\u65f6：CAS \u63d2\u5165\u8282\u70b9（\u65e0\u9501）
\n\u25cf\u6876\u4f4d\u7f6e\u4e0d\u4e3a\u7a7a\u65f6：synchronized \u9501\u4f4f\u8be5\u6876\u7684\u5934\u8282\u70b9（\u94fe\u8868\u5934\/\u6811\u6839）
\n\u25cf\u6269\u5bb9\u65f6：\u591a\u7ebf\u7a0b\u534f\u4f5c\u6269\u5bb9，\u6bcf\u4e2a\u7ebf\u7a0b\u5206\u914d\u4e00\u6bb5\u533a\u95f4\u8fc1\u79fb\u6570\u636e<\/p>\n

\/\/ JDK8 put \u6838\u5fc3\u903b\u8f91<\/span>
\nfinal<\/span> V<\/span> putVal<\/span>(<\/span>K<\/span> key,<\/span> V<\/span> value,<\/span> boolean<\/span> onlyIfAbsent)<\/span> {<\/span>
\n \/\/ 1. \u8ba1\u7b97hash：spread() \u4f7fhash\u4e3a\u6b63\u6570(\u8d1f\u6570\u6709\u7279\u6b8a\u542b\u4e49)<\/span>
\n int<\/span> hash =<\/span> spread<\/span>(<\/span>key.<\/span>hashCode<\/span>(<\/span>)<\/span>)<\/span>;<\/span><\/p>\n

\/\/ 2. \u6b7b\u5faa\u73af + CAS<\/span>
\n for<\/span> (<\/span>Node<\/span><<\/span>K<\/span>,<\/span>V<\/span>><\/span><\/span>[<\/span>]<\/span> tab =<\/span> table;<\/span>;<\/span>)<\/span> {<\/span>
\n \/\/ 3. \u6570\u7ec4\u4e3a\u7a7a \u2192 CAS\u521d\u59cb\u5316\u6570\u7ec4（\u53ea\u6709\u4e00\u4e2a\u7ebf\u7a0b\u6210\u529f）<\/span>
\n if<\/span> (<\/span>tab ==<\/span> null<\/span>)<\/span> {<\/span>
\n \/\/ CAS\u64cd\u4f5c initTable()<\/span>
\n }<\/span>
\n \/\/ 4. \u6876\u4f4d\u7f6e\u4e3a\u7a7a \u2192 CAS\u653e\u5165\u8282\u70b9（\u65e0\u9501）<\/span>
\n else<\/span> if<\/span> (<\/span>(<\/span>f =<\/span> tabAt<\/span>(<\/span>tab,<\/span> i =<\/span> (<\/span>n –<\/span> 1<\/span>)<\/span> &<\/span> hash)<\/span>)<\/span> ==<\/span> null<\/span>)<\/span> {<\/span>
\n if<\/span> (<\/span>casTabAt<\/span>(<\/span>tab,<\/span> i,<\/span> null<\/span>,<\/span> new<\/span> Node<\/span><<\/span>K<\/span>,<\/span>V<\/span>><\/span><\/span>(<\/span>hash,<\/span> key,<\/span> value)<\/span>)<\/span>)<\/span>
\n break<\/span>;<\/span>
\n }<\/span>
\n \/\/ 5. Moved\u8282\u70b9 \u2192 \u5e2e\u52a9\u6269\u5bb9<\/span>
\n else<\/span> if<\/span> (<\/span>(<\/span>fh =<\/span> f.<\/span>hash)<\/span> ==<\/span> MOVED<\/span>)<\/span> {<\/span>
\n tab =<\/span> helpTransfer<\/span>(<\/span>tab,<\/span> f)<\/span>;<\/span>
\n }<\/span>
\n \/\/ 6. \u6876\u4f4d\u7f6e\u6709\u8282\u70b9 \u2192 synchronized\u9501\u4f4f\u5934\u8282\u70b9<\/span>
\n else<\/span> {<\/span>
\n synchronized<\/span> (<\/span>f)<\/span> {<\/span>
\n \/\/ \u5982\u679c\u8282\u70b9\u662f\u94fe\u8868 \u2192 \u904d\u5386\u94fe\u8868<\/span>
\n \/\/ \u5982\u679c\u8282\u70b9\u662f\u6811 \u2192 \u904d\u5386\u6811<\/span>
\n \/\/ size+1<\/span>
\n }<\/span>
\n }<\/span>
\n }<\/span>
\n}<\/span><\/p>\n

2.3.3 ConcurrentHashMap \u7684 sizeCtl \u542b\u4e49<\/p>\n

\u25cfsizeCtl = 0：\u9ed8\u8ba4\u503c，\u8868\u793a\u6570\u7ec4\u672a\u521d\u59cb\u5316
\n\u25cfsizeCtl = -1：\u8868\u793a\u6b63\u5728\u521d\u59cb\u5316\u6570\u7ec4
\n\u25cfsizeCtl > 0 \u4e14\u6570\u7ec4\u4e3anull：\u521d\u59cb\u5316\u5bb9\u91cf
\n\u25cfsizeCtl > 0 \u4e14\u6570\u7ec4\u5df2\u521d\u59cb\u5316：\u4e0b\u6b21\u6269\u5bb9\u7684\u9608\u503c
\n\u25cfsizeCtl < -1：-(1 + \u6269\u5bb9\u7ebf\u7a0b\u6570)，\u5982 -3 \u8868\u793a\u6709 2 \u4e2a\u7ebf\u7a0b\u5728\u6269\u5bb9<\/p>\n

2.4 HashSet \/ TreeSet \/ LinkedHashMap<\/h3>\n

2.4.1 HashSet<\/p>\n

HashSet \u5e95\u5c42\u57fa\u4e8e HashMap \u5b9e\u73b0，\u5143\u7d20\u4f5c\u4e3a HashMap \u7684 key，value \u662f\u4e00\u4e2a\u56fa\u5b9a\u7684\u865a\u62df\u5bf9\u8c61（PRESENT = new Object()）\u3002<\/p>\n

\/\/ HashSet \u672c\u8d28<\/span>
\npublic<\/span> class<\/span> HashSet<\/span><<\/span>E<\/span>><\/span><\/span> {<\/span>
\n private<\/span> transient<\/span> HashMap<\/span><<\/span>E<\/span>,<\/span>Object<\/span>><\/span><\/span> map;<\/span>
\n private<\/span> static<\/span> final<\/span> Object<\/span> PRESENT<\/span> =<\/span> new<\/span> Object<\/span>(<\/span>)<\/span>;<\/span><\/p>\n

public<\/span> boolean<\/span> add<\/span>(<\/span>E<\/span> e)<\/span> {<\/span>
\n return<\/span> map.<\/span>put<\/span>(<\/span>e,<\/span> PRESENT<\/span>)<\/span> ==<\/span> null<\/span>;<\/span> \/\/ \u5229\u7528HashMap\u7684key\u4e0d\u91cd\u590d\u7279\u6027<\/span>
\n }<\/span>
\n public<\/span> boolean<\/span> contains<\/span>(<\/span>Object<\/span> o)<\/span> {<\/span>
\n return<\/span> map.<\/span>containsKey<\/span>(<\/span>o)<\/span>;<\/span>
\n }<\/span>
\n public<\/span> boolean<\/span> remove<\/span>(<\/span>Object<\/span> o)<\/span> {<\/span>
\n return<\/span> map.<\/span>remove<\/span>(<\/span>o)<\/span> ==<\/span> PRESENT<\/span>;<\/span>
\n }<\/span>
\n}<\/span><\/p>\n

2.4.2 TreeSet<\/p>\n

TreeSet \u5e95\u5c42\u57fa\u4e8e TreeMap（\u7ea2\u9ed1\u6811），\u5143\u7d20\u6709\u5e8f（\u81ea\u7136\u6392\u5e8f\u6216 Comparator \u6392\u5e8f），\u67e5\u8be2\u65f6\u95f4\u590d\u6742\u5ea6 O(log n)\u3002
\n2.4.3 LinkedHashMap<\/p>\n

LinkedHashMap \u7ee7\u627f HashMap，\u5728\u5176\u57fa\u7840\u4e0a\u6dfb\u52a0\u4e86\u53cc\u5411\u94fe\u8868\u6765\u7ef4\u62a4\u5143\u7d20\u7684\u63d2\u5165\u987a\u5e8f\u6216\u8bbf\u95ee\u987a\u5e8f\u3002\u8fd9\u662f\u5b9e\u73b0 LRU \u7f13\u5b58\u7684\u57fa\u7840\u3002<\/p>\n

\/\/ LinkedHashMap \u7684\u6838\u5fc3：\u81ea\u5b9a\u4e49\u7684 Entry \u8282\u70b9<\/span>
\nstatic<\/span> class<\/span> Entry<\/span><<\/span>K<\/span>,<\/span>V<\/span>><\/span><\/span> extends<\/span> HashMap.<\/span>Node<\/span><<\/span>K<\/span>,<\/span>V<\/span>><\/span><\/span> {<\/span>
\n Entry<\/span><<\/span>K<\/span>,<\/span>V<\/span>><\/span><\/span> before,<\/span> after;<\/span> \/\/ \u53cc\u5411\u94fe\u8868\u7684\u524d\u540e\u6307\u9488<\/span>
\n Entry<\/span>(<\/span>int<\/span> hash,<\/span> K<\/span> key,<\/span> V<\/span> value,<\/span> Node<\/span><<\/span>K<\/span>,<\/span>V<\/span>><\/span><\/span> next)<\/span> {<\/span>
\n super<\/span>(<\/span>hash,<\/span> key,<\/span> value,<\/span> next)<\/span>;<\/span>
\n }<\/span>
\n}<\/span><\/p>\n

\/\/ accessOrder = true：\u6309\u8bbf\u95ee\u987a\u5e8f\u6392\u5e8f（LRU\u7f13\u5b58\u7684\u6838\u5fc3\u914d\u7f6e）<\/span>
\n\/\/ accessOrder = false：\u6309\u63d2\u5165\u987a\u5e8f\u6392\u5e8f（\u9ed8\u8ba4）<\/span>
\nLinkedHashMap<\/span><<\/span>String<\/span>,<\/span> Integer<\/span>><\/span><\/span> map =<\/span> new<\/span> LinkedHashMap<\/span><<\/span>><\/span><\/span>(<\/span>16<\/span>,<\/span> 0.75f<\/span>,<\/span> true<\/span>)<\/span>;<\/span><\/p>\n","protected":false},"excerpt":{"rendered":"

\u7b2c\u4e8c\u7ae0JAVA\u96c6\u5408\u6846\u67b6
\nJava\u96c6\u5408\u6846\u67b6\u662f\u9762\u8bd5\u7edd\u5bf9\u91cd\u70b9，\u5c24\u5176\u662f HashMap\u3001ConcurrentHashMap \u7684\u6e90\u7801\u7ea7\u7406\u89e3\u3002
\n2.1 ArrayList vs LinkedList2.1.1 ArrayList \u6269\u5bb9\u673a\u5236
\nArrayList \u7684\u6269\u5bb9\u662f\u9762\u8bd5\u9ad8\u9891\u8003\u70b9
\n\/\/ ArrayList\u6269\u5bb9\u6e90\u7801（JDK 8）
\n\/\/ \u9ed8\u8ba4\u521d\u59cb\u5bb9\u91cf：10（JDK7\u662f\u61d2\u521d\u59cb\u5316，new ArrayList()<\/p>\n","protected":false},"author":2,"featured_media":95162,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1],"tags":[99,190],"topic":[],"class_list":["post-95163","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-server","tag-java","tag-190"],"yoast_head":"\njava\u57fa\u7840\u77e5\u8bc6\u70b9 - \u7f51\u7855\u4e92\u8054\u5e2e\u52a9\u4e2d\u5fc3<\/title>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/www.wsisp.com\/helps\/95163.html\" \/>\n<meta property=\"og:locale\" content=\"zh_CN\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"java\u57fa\u7840\u77e5\u8bc6\u70b9 - \u7f51\u7855\u4e92\u8054\u5e2e\u52a9\u4e2d\u5fc3\" \/>\n<meta property=\"og:description\" content=\"\u7b2c\u4e8c\u7ae0JAVA\u96c6\u5408\u6846\u67b6 Java\u96c6\u5408\u6846\u67b6\u662f\u9762\u8bd5\u7edd\u5bf9\u91cd\u70b9，\u5c24\u5176\u662f HashMap\u3001ConcurrentHashMap \u7684\u6e90\u7801\u7ea7\u7406\u89e3\u3002 2.1 ArrayList vs LinkedList2.1.1 ArrayList \u6269\u5bb9\u673a\u5236 ArrayList \u7684\u6269\u5bb9\u662f\u9762\u8bd5\u9ad8\u9891\u8003\u70b9 \/\/ ArrayList\u6269\u5bb9\u6e90\u7801（JDK 8） \/\/ \u9ed8\u8ba4\u521d\u59cb\u5bb9\u91cf：10（JDK7\u662f\u61d2\u521d\u59cb\u5316，new ArrayList()\" \/>\n<meta property=\"og:url\" content=\"https:\/\/www.wsisp.com\/helps\/95163.html\" \/>\n<meta property=\"og:site_name\" content=\"\u7f51\u7855\u4e92\u8054\u5e2e\u52a9\u4e2d\u5fc3\" \/>\n<meta property=\"article:published_time\" content=\"2026-08-16T03:56:57+00:00\" \/>\n<meta property=\"og:image\" content=\"https:\/\/www.wsisp.com\/helps\/wp-content\/uploads\/2026\/08\/20260816035655-6a813507a62fc.png\" \/>\n<meta name=\"author\" content=\"admin\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:label1\" content=\"\u4f5c\u8005\" \/>\n\t<meta name=\"twitter:data1\" content=\"admin\" \/>\n\t<meta name=\"twitter:label2\" content=\"\u9884\u8ba1\u9605\u8bfb\u65f6\u95f4\" \/>\n\t<meta name=\"twitter:data2\" content=\"5 \u5206\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\/\/schema.org\",\"@graph\":[{\"@type\":\"WebPage\",\"@id\":\"https:\/\/www.wsisp.com\/helps\/95163.html\",\"url\":\"https:\/\/www.wsisp.com\/helps\/95163.html\",\"name\":\"java\u57fa\u7840\u77e5\u8bc6\u70b9 - \u7f51\u7855\u4e92\u8054\u5e2e\u52a9\u4e2d\u5fc3\",\"isPartOf\":{\"@id\":\"https:\/\/www.wsisp.com\/helps\/#website\"},\"datePublished\":\"2026-08-16T03:56:57+00:00\",\"dateModified\":\"2026-08-16T03:56:57+00:00\",\"author\":{\"@id\":\"https:\/\/www.wsisp.com\/helps\/#\/schema\/person\/358e386c577a3ab51c4493330a20ad41\"},\"breadcrumb\":{\"@id\":\"https:\/\/www.wsisp.com\/helps\/95163.html#breadcrumb\"},\"inLanguage\":\"zh-Hans\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/www.wsisp.com\/helps\/95163.html\"]}]},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/www.wsisp.com\/helps\/95163.html#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"\u9996\u9875\",\"item\":\"https:\/\/www.wsisp.com\/helps\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"java\u57fa\u7840\u77e5\u8bc6\u70b9\"}]},{\"@type\":\"WebSite\",\"@id\":\"https:\/\/www.wsisp.com\/helps\/#website\",\"url\":\"https:\/\/www.wsisp.com\/helps\/\",\"name\":\"\u7f51\u7855\u4e92\u8054\u5e2e\u52a9\u4e2d\u5fc3\",\"description\":\"\u9999\u6e2f\u670d\u52a1\u5668_\u9999\u6e2f\u4e91\u670d\u52a1\u5668\u8d44\u8baf_\u670d\u52a1\u5668\u5e2e\u52a9\u6587\u6863_\u670d\u52a1\u5668\u6559\u7a0b\",\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"https:\/\/www.wsisp.com\/helps\/?s={search_term_string}\"},\"query-input\":\"required name=search_term_string\"}],\"inLanguage\":\"zh-Hans\"},{\"@type\":\"Person\",\"@id\":\"https:\/\/www.wsisp.com\/helps\/#\/schema\/person\/358e386c577a3ab51c4493330a20ad41\",\"name\":\"admin\",\"image\":{\"@type\":\"ImageObject\",\"inLanguage\":\"zh-Hans\",\"@id\":\"https:\/\/www.wsisp.com\/helps\/#\/schema\/person\/image\/\",\"url\":\"https:\/\/gravatar.wp-china-yes.net\/avatar\/?s=96&d=mystery\",\"contentUrl\":\"https:\/\/gravatar.wp-china-yes.net\/avatar\/?s=96&d=mystery\",\"caption\":\"admin\"},\"sameAs\":[\"http:\/\/wp.wsisp.com\"],\"url\":\"https:\/\/www.wsisp.com\/helps\/author\/admin\"}]}<\/script>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"java\u57fa\u7840\u77e5\u8bc6\u70b9 - \u7f51\u7855\u4e92\u8054\u5e2e\u52a9\u4e2d\u5fc3","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"https:\/\/www.wsisp.com\/helps\/95163.html","og_locale":"zh_CN","og_type":"article","og_title":"java\u57fa\u7840\u77e5\u8bc6\u70b9 - \u7f51\u7855\u4e92\u8054\u5e2e\u52a9\u4e2d\u5fc3","og_description":"\u7b2c\u4e8c\u7ae0JAVA\u96c6\u5408\u6846\u67b6 Java\u96c6\u5408\u6846\u67b6\u662f\u9762\u8bd5\u7edd\u5bf9\u91cd\u70b9，\u5c24\u5176\u662f HashMap\u3001ConcurrentHashMap \u7684\u6e90\u7801\u7ea7\u7406\u89e3\u3002 2.1 ArrayList vs LinkedList2.1.1 ArrayList \u6269\u5bb9\u673a\u5236 ArrayList \u7684\u6269\u5bb9\u662f\u9762\u8bd5\u9ad8\u9891\u8003\u70b9 \/\/ ArrayList\u6269\u5bb9\u6e90\u7801（JDK 8） \/\/ \u9ed8\u8ba4\u521d\u59cb\u5bb9\u91cf：10（JDK7\u662f\u61d2\u521d\u59cb\u5316，new ArrayList()","og_url":"https:\/\/www.wsisp.com\/helps\/95163.html","og_site_name":"\u7f51\u7855\u4e92\u8054\u5e2e\u52a9\u4e2d\u5fc3","article_published_time":"2026-08-16T03:56:57+00:00","og_image":[{"url":"https:\/\/www.wsisp.com\/helps\/wp-content\/uploads\/2026\/08\/20260816035655-6a813507a62fc.png"}],"author":"admin","twitter_card":"summary_large_image","twitter_misc":{"\u4f5c\u8005":"admin","\u9884\u8ba1\u9605\u8bfb\u65f6\u95f4":"5 \u5206"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"WebPage","@id":"https:\/\/www.wsisp.com\/helps\/95163.html","url":"https:\/\/www.wsisp.com\/helps\/95163.html","name":"java\u57fa\u7840\u77e5\u8bc6\u70b9 - \u7f51\u7855\u4e92\u8054\u5e2e\u52a9\u4e2d\u5fc3","isPartOf":{"@id":"https:\/\/www.wsisp.com\/helps\/#website"},"datePublished":"2026-08-16T03:56:57+00:00","dateModified":"2026-08-16T03:56:57+00:00","author":{"@id":"https:\/\/www.wsisp.com\/helps\/#\/schema\/person\/358e386c577a3ab51c4493330a20ad41"},"breadcrumb":{"@id":"https:\/\/www.wsisp.com\/helps\/95163.html#breadcrumb"},"inLanguage":"zh-Hans","potentialAction":[{"@type":"ReadAction","target":["https:\/\/www.wsisp.com\/helps\/95163.html"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/www.wsisp.com\/helps\/95163.html#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"\u9996\u9875","item":"https:\/\/www.wsisp.com\/helps"},{"@type":"ListItem","position":2,"name":"java\u57fa\u7840\u77e5\u8bc6\u70b9"}]},{"@type":"WebSite","@id":"https:\/\/www.wsisp.com\/helps\/#website","url":"https:\/\/www.wsisp.com\/helps\/","name":"\u7f51\u7855\u4e92\u8054\u5e2e\u52a9\u4e2d\u5fc3","description":"\u9999\u6e2f\u670d\u52a1\u5668_\u9999\u6e2f\u4e91\u670d\u52a1\u5668\u8d44\u8baf_\u670d\u52a1\u5668\u5e2e\u52a9\u6587\u6863_\u670d\u52a1\u5668\u6559\u7a0b","potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/www.wsisp.com\/helps\/?s={search_term_string}"},"query-input":"required name=search_term_string"}],"inLanguage":"zh-Hans"},{"@type":"Person","@id":"https:\/\/www.wsisp.com\/helps\/#\/schema\/person\/358e386c577a3ab51c4493330a20ad41","name":"admin","image":{"@type":"ImageObject","inLanguage":"zh-Hans","@id":"https:\/\/www.wsisp.com\/helps\/#\/schema\/person\/image\/","url":"https:\/\/gravatar.wp-china-yes.net\/avatar\/?s=96&d=mystery","contentUrl":"https:\/\/gravatar.wp-china-yes.net\/avatar\/?s=96&d=mystery","caption":"admin"},"sameAs":["http:\/\/wp.wsisp.com"],"url":"https:\/\/www.wsisp.com\/helps\/author\/admin"}]}},"_links":{"self":[{"href":"https:\/\/www.wsisp.com\/helps\/wp-json\/wp\/v2\/posts\/95163","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.wsisp.com\/helps\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.wsisp.com\/helps\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.wsisp.com\/helps\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/www.wsisp.com\/helps\/wp-json\/wp\/v2\/comments?post=95163"}],"version-history":[{"count":0,"href":"https:\/\/www.wsisp.com\/helps\/wp-json\/wp\/v2\/posts\/95163\/revisions"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/www.wsisp.com\/helps\/wp-json\/wp\/v2\/media\/95162"}],"wp:attachment":[{"href":"https:\/\/www.wsisp.com\/helps\/wp-json\/wp\/v2\/media?parent=95163"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.wsisp.com\/helps\/wp-json\/wp\/v2\/categories?post=95163"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.wsisp.com\/helps\/wp-json\/wp\/v2\/tags?post=95163"},{"taxonomy":"topic","embeddable":true,"href":"https:\/\/www.wsisp.com\/helps\/wp-json\/wp\/v2\/topic?post=95163"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}