<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>treeroot的专栏 - 源码分析</title><link>http://blog.csdn.net/treeroot/category/40425.aspx</link><description /><dc:language>zh-CN</dc:language><lastUpdateTime>Sat, 22 Jul 2006 22:08:00 GMT</lastUpdateTime><ttl>60</ttl><item><dc:creator>treeroot</dc:creator><title>我见过的最长的表达式</title><link>http://blog.csdn.net/treeroot/archive/2004/11/09/174210.aspx</link><pubDate>Tue, 09 Nov 2004 15:33:00 GMT</pubDate><guid>http://blog.csdn.net/treeroot/archive/2004/11/09/174210.aspx</guid><wfw:comment>http://blog.csdn.net/treeroot/comments/174210.aspx</wfw:comment><comments>http://blog.csdn.net/treeroot/archive/2004/11/09/174210.aspx#Feedback</comments><slash:comments>5</slash:comments><wfw:commentRss>http://blog.csdn.net/treeroot/comments/commentRss/174210.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=174210</trackback:ping><description>长就一个字&lt;img src ="http://blog.csdn.net/treeroot/aggbug/174210.aspx" width = "1" height = "1" /&gt;</description></item><item><dc:creator>treeroot</dc:creator><title>一个庸俗的实现：HashSet</title><link>http://blog.csdn.net/treeroot/archive/2004/09/21/112246.aspx</link><pubDate>Tue, 21 Sep 2004 19:16:00 GMT</pubDate><guid>http://blog.csdn.net/treeroot/archive/2004/09/21/112246.aspx</guid><wfw:comment>http://blog.csdn.net/treeroot/comments/112246.aspx</wfw:comment><comments>http://blog.csdn.net/treeroot/archive/2004/09/21/112246.aspx#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/treeroot/comments/commentRss/112246.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=112246</trackback:ping><description>HashSet的实现非常简单，因为它使用了HashMap。&lt;img src ="http://blog.csdn.net/treeroot/aggbug/112246.aspx" width = "1" height = "1" /&gt;</description></item><item><dc:creator>treeroot</dc:creator><title>AbstractSet源码</title><link>http://blog.csdn.net/treeroot/archive/2004/09/21/112219.aspx</link><pubDate>Tue, 21 Sep 2004 18:51:00 GMT</pubDate><guid>http://blog.csdn.net/treeroot/archive/2004/09/21/112219.aspx</guid><wfw:comment>http://blog.csdn.net/treeroot/comments/112219.aspx</wfw:comment><comments>http://blog.csdn.net/treeroot/archive/2004/09/21/112219.aspx#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/treeroot/comments/commentRss/112219.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=112219</trackback:ping><description>分析了AbstractSet的实现。&lt;img src ="http://blog.csdn.net/treeroot/aggbug/112219.aspx" width = "1" height = "1" /&gt;</description></item><item><dc:creator>treeroot</dc:creator><title>源码分析:HashMap</title><link>http://blog.csdn.net/treeroot/archive/2004/09/20/111104.aspx</link><pubDate>Mon, 20 Sep 2004 22:43:00 GMT</pubDate><guid>http://blog.csdn.net/treeroot/archive/2004/09/20/111104.aspx</guid><wfw:comment>http://blog.csdn.net/treeroot/comments/111104.aspx</wfw:comment><comments>http://blog.csdn.net/treeroot/archive/2004/09/20/111104.aspx#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/treeroot/comments/commentRss/111104.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=111104</trackback:ping><description>比较深入的分析了HashMap的实现，不过对其中很多不是很关键的东西都忽略了。&lt;img src ="http://blog.csdn.net/treeroot/aggbug/111104.aspx" width = "1" height = "1" /&gt;</description></item><item><dc:creator>treeroot</dc:creator><title>源码分析：LinkedList和Java中的指针操作</title><link>http://blog.csdn.net/treeroot/archive/2004/09/18/108790.aspx</link><pubDate>Sat, 18 Sep 2004 13:35:00 GMT</pubDate><guid>http://blog.csdn.net/treeroot/archive/2004/09/18/108790.aspx</guid><wfw:comment>http://blog.csdn.net/treeroot/comments/108790.aspx</wfw:comment><comments>http://blog.csdn.net/treeroot/archive/2004/09/18/108790.aspx#Feedback</comments><slash:comments>4</slash:comments><wfw:commentRss>http://blog.csdn.net/treeroot/comments/commentRss/108790.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=108790</trackback:ping><description>本文分析了LinkedList的实现，已经java中如何实现指针的功能，还比较了ArrayList和LinkedList。&lt;img src ="http://blog.csdn.net/treeroot/aggbug/108790.aspx" width = "1" height = "1" /&gt;</description></item><item><dc:creator>treeroot</dc:creator><title>ArrayList源码分析</title><link>http://blog.csdn.net/treeroot/archive/2004/09/16/107041.aspx</link><pubDate>Thu, 16 Sep 2004 20:26:00 GMT</pubDate><guid>http://blog.csdn.net/treeroot/archive/2004/09/16/107041.aspx</guid><wfw:comment>http://blog.csdn.net/treeroot/comments/107041.aspx</wfw:comment><comments>http://blog.csdn.net/treeroot/archive/2004/09/16/107041.aspx#Feedback</comments><slash:comments>1</slash:comments><wfw:commentRss>http://blog.csdn.net/treeroot/comments/commentRss/107041.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=107041</trackback:ping><description>比较详细的分析了ArrayList的实现过程，并且给了一个总结，通过对代码的理解，更有利于高效的使用ArrayList。&lt;img src ="http://blog.csdn.net/treeroot/aggbug/107041.aspx" width = "1" height = "1" /&gt;</description></item><item><dc:creator>treeroot</dc:creator><title>AbstractList源码分析</title><link>http://blog.csdn.net/treeroot/archive/2004/09/14/104743.aspx</link><pubDate>Tue, 14 Sep 2004 22:55:00 GMT</pubDate><guid>http://blog.csdn.net/treeroot/archive/2004/09/14/104743.aspx</guid><wfw:comment>http://blog.csdn.net/treeroot/comments/104743.aspx</wfw:comment><comments>http://blog.csdn.net/treeroot/archive/2004/09/14/104743.aspx#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/treeroot/comments/commentRss/104743.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=104743</trackback:ping><description>比较详细的分析了AbstractList的实现。&lt;img src ="http://blog.csdn.net/treeroot/aggbug/104743.aspx" width = "1" height = "1" /&gt;</description></item><item><dc:creator>treeroot</dc:creator><title>AbstractCollection源码分析</title><link>http://blog.csdn.net/treeroot/archive/2004/09/11/101622.aspx</link><pubDate>Sat, 11 Sep 2004 21:31:00 GMT</pubDate><guid>http://blog.csdn.net/treeroot/archive/2004/09/11/101622.aspx</guid><wfw:comment>http://blog.csdn.net/treeroot/comments/101622.aspx</wfw:comment><comments>http://blog.csdn.net/treeroot/archive/2004/09/11/101622.aspx#Feedback</comments><slash:comments>1</slash:comments><wfw:commentRss>http://blog.csdn.net/treeroot/comments/commentRss/101622.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=101622</trackback:ping><description>分析AbstractCollection的方法实现以及一些需要注意的问题.&lt;img src ="http://blog.csdn.net/treeroot/aggbug/101622.aspx" width = "1" height = "1" /&gt;</description></item><item><dc:creator>treeroot</dc:creator><title>String转换成Integer源码分析</title><link>http://blog.csdn.net/treeroot/archive/2004/09/02/92923.aspx</link><pubDate>Thu, 02 Sep 2004 21:49:00 GMT</pubDate><guid>http://blog.csdn.net/treeroot/archive/2004/09/02/92923.aspx</guid><wfw:comment>http://blog.csdn.net/treeroot/comments/92923.aspx</wfw:comment><comments>http://blog.csdn.net/treeroot/archive/2004/09/02/92923.aspx#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/treeroot/comments/commentRss/92923.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=92923</trackback:ping><description>本文简单的分析了字符串到整形的转换过程,设计的类有Ingeter,String,Byte,Short,Character等等.&lt;img src ="http://blog.csdn.net/treeroot/aggbug/92923.aspx" width = "1" height = "1" /&gt;</description></item></channel></rss>