﻿<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:trackback="http://madskills.com/public/xml/rss/module/trackback/" xmlns:wfw="http://wellformedweb.org/CommentAPI/" xmlns:slash="http://purl.org/rss/1.0/modules/slash/"><channel><title>BlogJava-【原汁咖啡】-随笔分类-Thread</title><link>http://www.blogjava.net/lzqdiy/category/21645.html</link><description>Java我选择，我喜欢。</description><language>zh-cn</language><lastBuildDate>Tue, 17 Apr 2007 03:10:02 GMT</lastBuildDate><pubDate>Tue, 17 Apr 2007 03:10:02 GMT</pubDate><ttl>60</ttl><item><title>一种实现生产者－消费者问题的新方法</title><link>http://www.blogjava.net/lzqdiy/archive/2007/03/25/106205.html</link><dc:creator>我为J狂</dc:creator><author>我为J狂</author><pubDate>Sun, 25 Mar 2007 06:17:00 GMT</pubDate><guid>http://www.blogjava.net/lzqdiy/archive/2007/03/25/106205.html</guid><wfw:comment>http://www.blogjava.net/lzqdiy/comments/106205.html</wfw:comment><comments>http://www.blogjava.net/lzqdiy/archive/2007/03/25/106205.html#Feedback</comments><slash:comments>1</slash:comments><wfw:commentRss>http://www.blogjava.net/lzqdiy/comments/commentRss/106205.html</wfw:commentRss><trackback:ping>http://www.blogjava.net/lzqdiy/services/trackbacks/106205.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 从ArrayBlockingQueue类中的put和take方法中联想到的算法。&nbsp;&nbsp;<a href='http://www.blogjava.net/lzqdiy/archive/2007/03/25/106205.html'>阅读全文</a><img src ="http://www.blogjava.net/lzqdiy/aggbug/106205.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.blogjava.net/lzqdiy/" target="_blank">我为J狂</a> 2007-03-25 14:17 <a href="http://www.blogjava.net/lzqdiy/archive/2007/03/25/106205.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>