<< RESIZE_STAMP_SHIFT)return;finishing = advance = true;//最后退出的线程要重新check下是否全部迁移完毕i = n; // recheck before commit}}else if ((f = tabAt(tab, i)) == null)advance = casTabAt(tab, i, null, fwd);else if ((fh = f.hash) == MOVED)advance = true; // already processed//迁移node节点else {synchronized (f) {if (tabAt(tab, i) == f) {Node ln, hn;//链表迁移if (fh >= 0) {int runBit = fhNode lastRun = f;for (Node p = f.next; p != null; p = p.next) {int b = p.hashif (b != runBit) {runBit = b;lastRun = p;}}if (runBit == 0) {ln = lastRun;hn = null;}else {hn = lastRun;ln = null;}//将node链表 , 分成2个新的node链表for (Node p = f; p != lastRun; p = p.next) {int ph = p.hash; K pk = p.key; V pv = p.val;if ((phelsehn = new Node(ph, pk, pv, hn);}//将新node链表赋给nextTabsetTabAt(nextTab, i, ln);setTabAt(nextTab, i + n, hn);setTabAt(tab, i, fwd);advance = true;}//红黑树迁移else if (f instanceof TreeBin) {TreeBin t = (TreeBin)f;TreeNode lo = null, loTail = null;TreeNode hi = null, hiTail = null;int lc = 0, hc = 0;for (Node e = t.first; e != null; e = e.next) {int h = e.hash;TreeNode p = new TreeNode(h, e.key, e.val, null, null);if ((helseloTail.next = p;loTail = p;++lc;}else {if ((p.prev = hiTail) == null)hi = p;elsehiTail.next = p;hiTail = p;++hc;}}ln = (lc <= UNTREEIFY_THRESHOLD) ? untreeify(lo) :(hc != 0) ? new TreeBin(lo) : t;hn = (hc <= UNTREEIFY_THRESHOLD) ? untreeify(hi) :(lc != 0) ? new TreeBin(hi) : t;setTabAt(nextTab, i, ln);setTabAt(nextTab, i + n, hn);setTabAt(tab, i, fwd);advance = true;}}}}}}作者:故人
出处:
突击并发编程JUC系列演示代码地址:
推荐阅读
-
孩子生日,我们娘俩的晚餐,网友:家常美味,这才是幸福
-
-
尾盘|2020.11.17,明日反弹后,就需要注意风险
-
-
-
-
四川省拥有绝佳地理位置的一个县级市,素有“川西明珠”美誉
-
中国|外交部回应美副国务卿访台:必将采取正当反制措施
-
茅台酒|茅台酒厂怎么防止员工偷酒喝?老员工笑了:敢喝一口算我输
-
直播吧|再同尤文争冠!那不勒斯自2000年以来第3次杀入意杯决赛
-
-
苹果手机|iPhone SE3再次曝光:不再是「小钢炮」
-
[CC聊游戏]凯最真实,花木兰一句话成为玩家信仰,谁的台词最好听?宫本逗比
-
-
-
工人日报:200元就能买到“死亡证明”,视法律为何物?
-
-
-
-
秘方|奶奶腌黄瓜的秘方,加入一点它,爽口又开胃,关键是保存时间还长