<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[iFleetingtime的博客]]></title><description><![CDATA[游走在二进制与四分音符之间。]]></description><link>https://blog.youkuaiyun.com/iFleetingtime</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; iFleetingtime]]></copyright><item><title><![CDATA[关于Integer与int拆箱装箱的总结]]></title><link>https://blog.youkuaiyun.com/iFleetingtime/article/details/78983821</link><guid>https://blog.youkuaiyun.com/iFleetingtime/article/details/78983821</guid><author>iFleetingtime</author><pubDate>Fri, 05 Jan 2018 17:51:49 +0800</pubDate><description><![CDATA[Integer与int拆箱装箱， Integer部分方法源码解析，拆装箱例子解析。]]></description><category></category></item><item><title><![CDATA[JVM 之 OopMap 和 RememberedSet]]></title><link>https://blog.youkuaiyun.com/iFleetingtime/article/details/78934379</link><guid>https://blog.youkuaiyun.com/iFleetingtime/article/details/78934379</guid><author>iFleetingtime</author><pubDate>Fri, 29 Dec 2017 19:16:22 +0800</pubDate><description><![CDATA[OopMap 用于枚举GCRoots，RememberedSet记录了新生代对象被老年代对象引用的关系。]]></description><category></category></item><item><title><![CDATA[二叉树遍历的非递归Java实现]]></title><link>https://blog.youkuaiyun.com/iFleetingtime/article/details/78870870</link><guid>https://blog.youkuaiyun.com/iFleetingtime/article/details/78870870</guid><author>iFleetingtime</author><pubDate>Fri, 22 Dec 2017 10:53:54 +0800</pubDate><description><![CDATA[二叉树遍历的非递归Java实现]]></description><category></category></item><item><title><![CDATA[红-黑树 插入节点的Java代码实现]]></title><link>https://blog.youkuaiyun.com/iFleetingtime/article/details/78850384</link><guid>https://blog.youkuaiyun.com/iFleetingtime/article/details/78850384</guid><author>iFleetingtime</author><pubDate>Wed, 20 Dec 2017 10:32:04 +0800</pubDate><description><![CDATA[红-黑树本质上就是一个二叉搜索树，在二叉树上添加了一些强制性的规则，来维持二叉树的平衡性。红-黑树的平衡是在插入节点的过程中(删除也是，本文只实现插入)取得的。 对一个要插入的数据项，插入过程要一直检查，确保不会破坏红-黑树的规则。如果破坏了，程序就会进行纠正，根据需要更改树的结构。通过维持树的规则，进而保持了树的平衡。]]></description><category></category></item><item><title><![CDATA[平衡树与非平衡树简介]]></title><link>https://blog.youkuaiyun.com/iFleetingtime/article/details/78849514</link><guid>https://blog.youkuaiyun.com/iFleetingtime/article/details/78849514</guid><author>iFleetingtime</author><pubDate>Wed, 20 Dec 2017 09:28:55 +0800</pubDate><description><![CDATA[平衡树与非平衡树的简单介绍。]]></description><category></category></item><item><title><![CDATA[关于二叉搜索树功能的Java实现]]></title><link>https://blog.youkuaiyun.com/iFleetingtime/article/details/78836638</link><guid>https://blog.youkuaiyun.com/iFleetingtime/article/details/78836638</guid><author>iFleetingtime</author><pubDate>Mon, 18 Dec 2017 20:12:39 +0800</pubDate><description><![CDATA[二叉搜索树添加，删除，遍历Java代码实现。]]></description><category></category></item></channel></rss>