<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>求职 on haifeiWu</title><link>https://haifeiWu.github.io/tags/%E6%B1%82%E8%81%8C/</link><description>Recent content in 求职 on haifeiWu</description><generator>Hugo -- gohugo.io</generator><language>zh-cn</language><managingEditor>whfstudio@163.com (haifeiWu)</managingEditor><webMaster>whfstudio@163.com (haifeiWu)</webMaster><copyright>© 2016～2026 haifeiWu</copyright><lastBuildDate>Thu, 02 Aug 2018 14:23:33 +0800</lastBuildDate><atom:link href="https://haifeiWu.github.io/tags/%E6%B1%82%E8%81%8C/index.xml" rel="self" type="application/rss+xml"/><item><title>聊聊 JDK 非阻塞队列源码（CAS 实现）</title><link>https://haifeiWu.github.io/posts/liaoliao-jdk-feizuseduilieyuanma-casshixian/</link><pubDate>Thu, 02 Aug 2018 14:23:33 +0800</pubDate><author>whfstudio@163.com (haifeiWu)</author><guid>https://haifeiWu.github.io/posts/liaoliao-jdk-feizuseduilieyuanma-casshixian/</guid><description>正如上篇文章聊聊 JDK 阻塞队列源码（ReentrantLock 实现）所说，队列在我们现实生活中队列随处可见，最经典的就是去银行办理业务，超市买东西排队等。今天楼主要讲的就是 JDK 中安全队列的另一种实现使用 CAS 算法实现的安全队列。</description></item></channel></rss>