<?xml version="1.0" encoding="utf-8"?><?xml-stylesheet href='http://feeds.feedsky.com/styles/temp01.xsl' type='text/xsl' ?><!--这是一个由Feedsy提供技术支持的Feed，为了提高读者阅读的体验，以及满足用户美化自己Feed的需要，我们设计了多种精美的Feed模板，提供给大家选择，所有最终呈现出来的样式，皆由用户自愿选择使用，未经许可，任何团体和个人，请不要擅自修改样式或者盗用，这是对于用户选择权的尊重。--><rss xmlns:atom="http://www.w3.org/2005/Atom" xmlns:fs="http://www.feedsky.com/namespace/feed" xmlns:wfw="http://wellformedweb.org/CommentAPI/" xmlns:slash="http://purl.org/rss/1.0/modules/slash/" xmlns:trackback="http://madskills.com/public/xml/rss/module/trackback/" xmlns:dc="http://purl.org/dc/elements/1.1/" version="2.0"><channel><atom:link href="http://feeds.feedsky.com/csdn.net/cuilichen" type="application/rss+xml" rel="self"></atom:link><fs:self_link href="http://feeds.feedsky.com/csdn.net/cuilichen" type="application/rss+xml"></fs:self_link><lastBuildDate>Wed, 06 May 2009 13:30:00 GMT</lastBuildDate><title>cuilichen的专栏</title><link>http://blog.csdn.net/cuilichen/</link><item><title>以整数为key的哈希表</title><link>http://blog.csdn.net/cuilichen/archive/2009/05/06/4154398.aspx</link><wfw:comment>http://blog.csdn.net/cuilichen/comments/4154398.aspx</wfw:comment><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/cuilichen/comments/commentRss/4154398.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=4154398</trackback:ping><description>以整数作为key的哈希表。非线程安全。&lt;img src =&quot;http://blog.csdn.net/cuilichen/aggbug/4154398.aspx&quot; width = &quot;1&quot; height = &quot;1&quot; /&gt;&lt;p class=&quot;fswww1&quot;&gt;&lt;a href=&quot;http://www1.feedsky.com/r/l/csdn.net/cuilichen/223255782/art01.html&quot; target=&quot;_blank&quot;&gt;&lt;img border=&quot;0&quot; ismap=&quot;ismap&quot; src=&quot;http://www1.feedsky.com/r/i/csdn.net/cuilichen/223255782/art01.gif&quot; onerror=&quot;this.style.display='none'&quot; /&gt;&lt;/a&gt;&lt;/p&gt;</description><pubDate>Wed, 06 May 2009 21:30:00 +0800</pubDate><author>cuilichen</author><comments>http://blog.csdn.net/cuilichen/archive/2009/05/06/4154398.aspx#Feedback</comments><guid isPermaLink="false">http://blog.csdn.net/cuilichen/archive/2009/05/06/4154398.aspx</guid><dc:creator>cuilichen</dc:creator><fs:srclink>http://blog.csdn.net/cuilichen/archive/2009/05/06/4154398.aspx</fs:srclink><fs:srcfeed>http://blog.csdn.net/cuilichen/feed.aspx</fs:srcfeed><fs:itemid>csdn.net/cuilichen/~1091055/223255782/1091054</fs:itemid></item><item><title>笔算开n次方</title><link>http://blog.csdn.net/cuilichen/archive/2008/09/03/2872603.aspx</link><wfw:comment>http://blog.csdn.net/cuilichen/comments/2872603.aspx</wfw:comment><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/cuilichen/comments/commentRss/2872603.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=2872603</trackback:ping><description>在J2ME中，有时会用到开方运算，但是MIDP1.0中没有提供该功能。这里使用笔算开方的方式，实现了开任意数的n次方。运算中使用了long作为临时变量类型，在数值较大或者保留位数太多的时候，会出现因为long数值溢出而导致的错误。&lt;img src =&quot;http://blog.csdn.net/cuilichen/aggbug/2872603.aspx&quot; width = &quot;1&quot; height = &quot;1&quot; /&gt;&lt;p class=&quot;fswww1&quot;&gt;&lt;a href=&quot;http://www1.feedsky.com/r/l/csdn.net/cuilichen/223255783/art01.html&quot; target=&quot;_blank&quot;&gt;&lt;img border=&quot;0&quot; ismap=&quot;ismap&quot; src=&quot;http://www1.feedsky.com/r/i/csdn.net/cuilichen/223255783/art01.gif&quot; onerror=&quot;this.style.display='none'&quot; /&gt;&lt;/a&gt;&lt;/p&gt;</description><pubDate>Wed, 03 Sep 2008 19:58:00 +0800</pubDate><author>cuilichen</author><comments>http://blog.csdn.net/cuilichen/archive/2008/09/03/2872603.aspx#Feedback</comments><guid isPermaLink="false">http://blog.csdn.net/cuilichen/archive/2008/09/03/2872603.aspx</guid><dc:creator>cuilichen</dc:creator><fs:srclink>http://blog.csdn.net/cuilichen/archive/2008/09/03/2872603.aspx</fs:srclink><fs:srcfeed>http://blog.csdn.net/cuilichen/feed.aspx</fs:srcfeed><fs:itemid>csdn.net/cuilichen/~1091055/223255783/1091054</fs:itemid></item><item><title>非递归遍历树</title><link>http://blog.csdn.net/cuilichen/archive/2008/09/01/2860234.aspx</link><wfw:comment>http://blog.csdn.net/cuilichen/comments/2860234.aspx</wfw:comment><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/cuilichen/comments/commentRss/2860234.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=2860234</trackback:ping><description>在开发的过程中用到了遍历树的方法。没有使用递归，而是采用栈顶方式实现的。
这里，树是一般的树结构，不单指二叉树。&lt;img src =&quot;http://blog.csdn.net/cuilichen/aggbug/2860234.aspx&quot; width = &quot;1&quot; height = &quot;1&quot; /&gt;&lt;p class=&quot;fswww1&quot;&gt;&lt;a href=&quot;http://www1.feedsky.com/r/l/csdn.net/cuilichen/223255784/art01.html&quot; target=&quot;_blank&quot;&gt;&lt;img border=&quot;0&quot; ismap=&quot;ismap&quot; src=&quot;http://www1.feedsky.com/r/i/csdn.net/cuilichen/223255784/art01.gif&quot; onerror=&quot;this.style.display='none'&quot; /&gt;&lt;/a&gt;&lt;/p&gt;</description><pubDate>Mon, 01 Sep 2008 19:33:00 +0800</pubDate><author>cuilichen</author><comments>http://blog.csdn.net/cuilichen/archive/2008/09/01/2860234.aspx#Feedback</comments><guid isPermaLink="false">http://blog.csdn.net/cuilichen/archive/2008/09/01/2860234.aspx</guid><dc:creator>cuilichen</dc:creator><fs:srclink>http://blog.csdn.net/cuilichen/archive/2008/09/01/2860234.aspx</fs:srclink><fs:srcfeed>http://blog.csdn.net/cuilichen/feed.aspx</fs:srcfeed><fs:itemid>csdn.net/cuilichen/~1091055/223255784/1091054</fs:itemid></item><item><title>二维地图的寻路算法2</title><link>http://blog.csdn.net/cuilichen/archive/2008/08/26/2831907.aspx</link><wfw:comment>http://blog.csdn.net/cuilichen/comments/2831907.aspx</wfw:comment><slash:comments>3</slash:comments><wfw:commentRss>http://blog.csdn.net/cuilichen/comments/commentRss/2831907.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=2831907</trackback:ping><description>二维地图的寻路算法2。本算法得到的解不一定是最优解，但是比普通的回溯算法速度要快。&lt;img src =&quot;http://blog.csdn.net/cuilichen/aggbug/2831907.aspx&quot; width = &quot;1&quot; height = &quot;1&quot; /&gt;&lt;p class=&quot;fswww1&quot;&gt;&lt;a href=&quot;http://www1.feedsky.com/r/l/csdn.net/cuilichen/223255785/art01.html&quot; target=&quot;_blank&quot;&gt;&lt;img border=&quot;0&quot; ismap=&quot;ismap&quot; src=&quot;http://www1.feedsky.com/r/i/csdn.net/cuilichen/223255785/art01.gif&quot; onerror=&quot;this.style.display='none'&quot; /&gt;&lt;/a&gt;&lt;/p&gt;</description><pubDate>Tue, 26 Aug 2008 19:47:00 +0800</pubDate><author>cuilichen</author><comments>http://blog.csdn.net/cuilichen/archive/2008/08/26/2831907.aspx#Feedback</comments><guid isPermaLink="false">http://blog.csdn.net/cuilichen/archive/2008/08/26/2831907.aspx</guid><dc:creator>cuilichen</dc:creator><fs:srclink>http://blog.csdn.net/cuilichen/archive/2008/08/26/2831907.aspx</fs:srclink><fs:srcfeed>http://blog.csdn.net/cuilichen/feed.aspx</fs:srcfeed><fs:itemid>csdn.net/cuilichen/~1091055/223255785/1091054</fs:itemid></item><item><title>二维地图寻路算法</title><link>http://blog.csdn.net/cuilichen/archive/2008/08/21/2808143.aspx</link><wfw:comment>http://blog.csdn.net/cuilichen/comments/2808143.aspx</wfw:comment><slash:comments>8</slash:comments><wfw:commentRss>http://blog.csdn.net/cuilichen/comments/commentRss/2808143.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=2808143</trackback:ping><description>二维地图是游戏中常见的形式。在二维地图中，寻路是我们常见的需求。这里做了一个二维地图寻路的简单算法。&lt;img src =&quot;http://blog.csdn.net/cuilichen/aggbug/2808143.aspx&quot; width = &quot;1&quot; height = &quot;1&quot; /&gt;&lt;p class=&quot;fswww1&quot;&gt;&lt;a href=&quot;http://www1.feedsky.com/r/l/csdn.net/cuilichen/223255786/art01.html&quot; target=&quot;_blank&quot;&gt;&lt;img border=&quot;0&quot; ismap=&quot;ismap&quot; src=&quot;http://www1.feedsky.com/r/i/csdn.net/cuilichen/223255786/art01.gif&quot; onerror=&quot;this.style.display='none'&quot; /&gt;&lt;/a&gt;&lt;/p&gt;</description><pubDate>Fri, 22 Aug 2008 01:49:00 +0800</pubDate><author>cuilichen</author><comments>http://blog.csdn.net/cuilichen/archive/2008/08/21/2808143.aspx#Feedback</comments><guid isPermaLink="false">http://blog.csdn.net/cuilichen/archive/2008/08/21/2808143.aspx</guid><dc:creator>cuilichen</dc:creator><fs:srclink>http://blog.csdn.net/cuilichen/archive/2008/08/21/2808143.aspx</fs:srclink><fs:srcfeed>http://blog.csdn.net/cuilichen/feed.aspx</fs:srcfeed><fs:itemid>csdn.net/cuilichen/~1091055/223255786/1091054</fs:itemid></item><item><title>得到类的绝对路径2</title><link>http://blog.csdn.net/cuilichen/archive/2008/07/22/2690835.aspx</link><wfw:comment>http://blog.csdn.net/cuilichen/comments/2690835.aspx</wfw:comment><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/cuilichen/comments/commentRss/2690835.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=2690835</trackback:ping><description>得到类的绝对路径2&lt;img src =&quot;http://blog.csdn.net/cuilichen/aggbug/2690835.aspx&quot; width = &quot;1&quot; height = &quot;1&quot; /&gt;&lt;p class=&quot;fswww1&quot;&gt;&lt;a href=&quot;http://www1.feedsky.com/r/l/csdn.net/cuilichen/223255787/art01.html&quot; target=&quot;_blank&quot;&gt;&lt;img border=&quot;0&quot; ismap=&quot;ismap&quot; src=&quot;http://www1.feedsky.com/r/i/csdn.net/cuilichen/223255787/art01.gif&quot; onerror=&quot;this.style.display='none'&quot; /&gt;&lt;/a&gt;&lt;/p&gt;</description><pubDate>Tue, 22 Jul 2008 23:23:00 +0800</pubDate><author>cuilichen</author><comments>http://blog.csdn.net/cuilichen/archive/2008/07/22/2690835.aspx#Feedback</comments><guid isPermaLink="false">http://blog.csdn.net/cuilichen/archive/2008/07/22/2690835.aspx</guid><dc:creator>cuilichen</dc:creator><fs:srclink>http://blog.csdn.net/cuilichen/archive/2008/07/22/2690835.aspx</fs:srclink><fs:srcfeed>http://blog.csdn.net/cuilichen/feed.aspx</fs:srcfeed><fs:itemid>csdn.net/cuilichen/~1091055/223255787/1091054</fs:itemid></item><item><title>The fucking TInt64</title><link>http://blog.csdn.net/cuilichen/archive/2008/02/14/2093293.aspx</link><wfw:comment>http://blog.csdn.net/cuilichen/comments/2093293.aspx</wfw:comment><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/cuilichen/comments/commentRss/2093293.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=2093293</trackback:ping><description>TInt64是symbian中的长整型量。在需要较大的数字的时候，我们往往需要使用这个类型的变量。但是TInt64有一个特点，或者说是编译器有一个特点，就是不能直接使用连乘的方式给TInt64的变量赋值。&lt;img src =&quot;http://blog.csdn.net/cuilichen/aggbug/2093293.aspx&quot; width = &quot;1&quot; height = &quot;1&quot; /&gt;&lt;p class=&quot;fswww1&quot;&gt;&lt;a href=&quot;http://www1.feedsky.com/r/l/csdn.net/cuilichen/223255788/art01.html&quot; target=&quot;_blank&quot;&gt;&lt;img border=&quot;0&quot; ismap=&quot;ismap&quot; src=&quot;http://www1.feedsky.com/r/i/csdn.net/cuilichen/223255788/art01.gif&quot; onerror=&quot;this.style.display='none'&quot; /&gt;&lt;/a&gt;&lt;/p&gt;</description><pubDate>Thu, 14 Feb 2008 19:58:00 +0800</pubDate><author>cuilichen</author><comments>http://blog.csdn.net/cuilichen/archive/2008/02/14/2093293.aspx#Feedback</comments><guid isPermaLink="false">http://blog.csdn.net/cuilichen/archive/2008/02/14/2093293.aspx</guid><dc:creator>cuilichen</dc:creator><fs:srclink>http://blog.csdn.net/cuilichen/archive/2008/02/14/2093293.aspx</fs:srclink><fs:srcfeed>http://blog.csdn.net/cuilichen/feed.aspx</fs:srcfeed><fs:itemid>csdn.net/cuilichen/~1091055/223255788/1091054</fs:itemid></item><item><title>Symbian中HBufC的使用</title><link>http://blog.csdn.net/cuilichen/archive/2008/01/03/2021756.aspx</link><wfw:comment>http://blog.csdn.net/cuilichen/comments/2021756.aspx</wfw:comment><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/cuilichen/comments/commentRss/2021756.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=2021756</trackback:ping><description>Symbian中HBufC描述符的创建和使用。&lt;img src =&quot;http://blog.csdn.net/cuilichen/aggbug/2021756.aspx&quot; width = &quot;1&quot; height = &quot;1&quot; /&gt;&lt;p class=&quot;fswww1&quot;&gt;&lt;a href=&quot;http://www1.feedsky.com/r/l/csdn.net/cuilichen/223255789/art01.html&quot; target=&quot;_blank&quot;&gt;&lt;img border=&quot;0&quot; ismap=&quot;ismap&quot; src=&quot;http://www1.feedsky.com/r/i/csdn.net/cuilichen/223255789/art01.gif&quot; onerror=&quot;this.style.display='none'&quot; /&gt;&lt;/a&gt;&lt;/p&gt;</description><pubDate>Fri, 04 Jan 2008 00:22:00 +0800</pubDate><author>cuilichen</author><comments>http://blog.csdn.net/cuilichen/archive/2008/01/03/2021756.aspx#Feedback</comments><guid isPermaLink="false">http://blog.csdn.net/cuilichen/archive/2008/01/03/2021756.aspx</guid><dc:creator>cuilichen</dc:creator><fs:srclink>http://blog.csdn.net/cuilichen/archive/2008/01/03/2021756.aspx</fs:srclink><fs:srcfeed>http://blog.csdn.net/cuilichen/feed.aspx</fs:srcfeed><fs:itemid>csdn.net/cuilichen/~1091055/223255789/1091054</fs:itemid></item><item><title>手机拍照，浏览手机的文件夹，上传照片到服务器</title><link>http://blog.csdn.net/cuilichen/archive/2007/02/28/1516639.aspx</link><wfw:comment>http://blog.csdn.net/cuilichen/comments/1516639.aspx</wfw:comment><slash:comments>1</slash:comments><wfw:commentRss>http://blog.csdn.net/cuilichen/comments/commentRss/1516639.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=1516639</trackback:ping><description>利用J2ME中提供的可选包JSR75提供的功能，浏览手机的文件夹，并且将用户的照片上传到服务器，实现相册的功能。 &lt;img src =&quot;http://blog.csdn.net/cuilichen/aggbug/1516639.aspx&quot; width = &quot;1&quot; height = &quot;1&quot; /&gt;&lt;p class=&quot;fswww1&quot;&gt;&lt;a href=&quot;http://www1.feedsky.com/r/l/csdn.net/cuilichen/223255790/art01.html&quot; target=&quot;_blank&quot;&gt;&lt;img border=&quot;0&quot; ismap=&quot;ismap&quot; src=&quot;http://www1.feedsky.com/r/i/csdn.net/cuilichen/223255790/art01.gif&quot; onerror=&quot;this.style.display='none'&quot; /&gt;&lt;/a&gt;&lt;/p&gt;</description><pubDate>Wed, 28 Feb 2007 19:51:00 +0800</pubDate><author>cuilichen</author><comments>http://blog.csdn.net/cuilichen/archive/2007/02/28/1516639.aspx#Feedback</comments><guid isPermaLink="false">http://blog.csdn.net/cuilichen/archive/2007/02/28/1516639.aspx</guid><dc:creator>cuilichen</dc:creator><fs:srclink>http://blog.csdn.net/cuilichen/archive/2007/02/28/1516639.aspx</fs:srclink><fs:srcfeed>http://blog.csdn.net/cuilichen/feed.aspx</fs:srcfeed><fs:itemid>csdn.net/cuilichen/~1091055/223255790/1091054</fs:itemid></item><item><title>J2ME调用wap浏览器，调用电话功能。</title><link>http://blog.csdn.net/cuilichen/archive/2006/08/14/1062875.aspx</link><wfw:comment>http://blog.csdn.net/cuilichen/comments/1062875.aspx</wfw:comment><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/cuilichen/comments/commentRss/1062875.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=1062875</trackback:ping><description>J2ME调用wap浏览器，调用电话功能。&lt;img src =&quot;http://blog.csdn.net/cuilichen/aggbug/1062875.aspx&quot; width = &quot;1&quot; height = &quot;1&quot; /&gt;&lt;p class=&quot;fswww1&quot;&gt;&lt;a href=&quot;http://www1.feedsky.com/r/l/csdn.net/cuilichen/223255791/art01.html&quot; target=&quot;_blank&quot;&gt;&lt;img border=&quot;0&quot; ismap=&quot;ismap&quot; src=&quot;http://www1.feedsky.com/r/i/csdn.net/cuilichen/223255791/art01.gif&quot; onerror=&quot;this.style.display='none'&quot; /&gt;&lt;/a&gt;&lt;/p&gt;</description><pubDate>Tue, 15 Aug 2006 00:38:00 +0800</pubDate><author>cuilichen</author><comments>http://blog.csdn.net/cuilichen/archive/2006/08/14/1062875.aspx#Feedback</comments><guid isPermaLink="false">http://blog.csdn.net/cuilichen/archive/2006/08/14/1062875.aspx</guid><dc:creator>cuilichen</dc:creator><fs:srclink>http://blog.csdn.net/cuilichen/archive/2006/08/14/1062875.aspx</fs:srclink><fs:srcfeed>http://blog.csdn.net/cuilichen/feed.aspx</fs:srcfeed><fs:itemid>csdn.net/cuilichen/~1091055/223255791/1091054</fs:itemid></item></channel></rss>