<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>xiaopei的博客 - c/c++</title><link>http://blog.csdn.net/hxxiaopei/category/240551.aspx</link><description>c/c++ 编程和基本技巧</description><dc:language>zh-CN</dc:language><lastUpdateTime>Tue, 29 Jul 2008 13:43:00 GMT</lastUpdateTime><ttl>60</ttl><item><dc:creator>xiaopei</dc:creator><title>valgrind memcheck 错误分析</title><link>http://blog.csdn.net/hxxiaopei/archive/2008/07/29/2730440.aspx</link><pubDate>Tue, 29 Jul 2008 13:43:00 GMT</pubDate><guid>http://blog.csdn.net/hxxiaopei/archive/2008/07/29/2730440.aspx</guid><wfw:comment>http://blog.csdn.net/hxxiaopei/comments/2730440.aspx</wfw:comment><comments>http://blog.csdn.net/hxxiaopei/archive/2008/07/29/2730440.aspx#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/hxxiaopei/comments/commentRss/2730440.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=2730440</trackback:ping><description>valgrind memcheck 错误分析&lt;img src ="http://blog.csdn.net/hxxiaopei/aggbug/2730440.aspx" width = "1" height = "1" /&gt;</description></item><item><dc:creator>xiaopei</dc:creator><title>防止内存泄露 Linux下用Valgrind做检查 </title><link>http://blog.csdn.net/hxxiaopei/archive/2008/07/29/2728376.aspx</link><pubDate>Tue, 29 Jul 2008 09:15:00 GMT</pubDate><guid>http://blog.csdn.net/hxxiaopei/archive/2008/07/29/2728376.aspx</guid><wfw:comment>http://blog.csdn.net/hxxiaopei/comments/2728376.aspx</wfw:comment><comments>http://blog.csdn.net/hxxiaopei/archive/2008/07/29/2728376.aspx#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/hxxiaopei/comments/commentRss/2728376.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=2728376</trackback:ping><description>防止内存泄露 Linux下用Valgrind做检查 &lt;img src ="http://blog.csdn.net/hxxiaopei/aggbug/2728376.aspx" width = "1" height = "1" /&gt;</description></item><item><dc:creator>xiaopei</dc:creator><title>自动添加注释(转)</title><link>http://blog.csdn.net/hxxiaopei/archive/2008/07/27/2720495.aspx</link><pubDate>Sun, 27 Jul 2008 20:30:00 GMT</pubDate><guid>http://blog.csdn.net/hxxiaopei/archive/2008/07/27/2720495.aspx</guid><wfw:comment>http://blog.csdn.net/hxxiaopei/comments/2720495.aspx</wfw:comment><comments>http://blog.csdn.net/hxxiaopei/archive/2008/07/27/2720495.aspx#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/hxxiaopei/comments/commentRss/2720495.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=2720495</trackback:ping><description>自动添加注释&lt;img src ="http://blog.csdn.net/hxxiaopei/aggbug/2720495.aspx" width = "1" height = "1" /&gt;</description></item><item><dc:creator>xiaopei</dc:creator><title>gcc命令行详解</title><link>http://blog.csdn.net/hxxiaopei/archive/2008/07/20/2679714.aspx</link><pubDate>Sun, 20 Jul 2008 10:29:00 GMT</pubDate><guid>http://blog.csdn.net/hxxiaopei/archive/2008/07/20/2679714.aspx</guid><wfw:comment>http://blog.csdn.net/hxxiaopei/comments/2679714.aspx</wfw:comment><comments>http://blog.csdn.net/hxxiaopei/archive/2008/07/20/2679714.aspx#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/hxxiaopei/comments/commentRss/2679714.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=2679714</trackback:ping><description>gcc使用详解&lt;img src ="http://blog.csdn.net/hxxiaopei/aggbug/2679714.aspx" width = "1" height = "1" /&gt;</description></item><item><dc:creator>xiaopei</dc:creator><title>谈谈Unicode编码</title><link>http://blog.csdn.net/hxxiaopei/archive/2008/07/16/2658003.aspx</link><pubDate>Wed, 16 Jul 2008 07:48:00 GMT</pubDate><guid>http://blog.csdn.net/hxxiaopei/archive/2008/07/16/2658003.aspx</guid><wfw:comment>http://blog.csdn.net/hxxiaopei/comments/2658003.aspx</wfw:comment><comments>http://blog.csdn.net/hxxiaopei/archive/2008/07/16/2658003.aspx#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/hxxiaopei/comments/commentRss/2658003.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=2658003</trackback:ping><description>&amp;lt;H1 class=firstHeading&amp;gt;&amp;lt;DIV id=jump-to-nav&amp;gt;&amp;lt;A href="http://asc.alibaba-inc.com/wiki/index.php/%E8%B0%88%E8%B0%88Unicode%E7%BC%96%E7%A0%81#searchInput"&amp;gt;&amp;lt;/A&amp;gt;&amp;lt;/DIV&amp;gt;&amp;lt;/H1&amp;gt;&amp;lt;DIV id=bodyContent&amp;gt;&amp;lt;P&amp;gt;问题一：使用Windows记事本的“另存为”，可以在GBK、Unicode、Unicode big endian和UTF-8这几种编码方式间相互转换。同样是txt文件，Windows是怎样识别编码方式的呢？ &amp;lt;/P&amp;gt;&amp;lt;P&amp;gt;我很早前就发现Unicode、Unicode big endian和UTF-8编码的txt文件的开头会多出几个字节，分别是FF、FE（Unicode）,FE、FF（Unicode big endian）,EF、BB、BF（UTF-8）。但这些标记是基于什么标准呢？ &amp;lt;/P&amp;&lt;img src ="http://blog.csdn.net/hxxiaopei/aggbug/2658003.aspx" width = "1" height = "1" /&gt;</description></item><item><dc:creator>xiaopei</dc:creator><title>stdarg的一些理解</title><link>http://blog.csdn.net/hxxiaopei/archive/2008/07/14/2646607.aspx</link><pubDate>Mon, 14 Jul 2008 08:39:00 GMT</pubDate><guid>http://blog.csdn.net/hxxiaopei/archive/2008/07/14/2646607.aspx</guid><wfw:comment>http://blog.csdn.net/hxxiaopei/comments/2646607.aspx</wfw:comment><comments>http://blog.csdn.net/hxxiaopei/archive/2008/07/14/2646607.aspx#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/hxxiaopei/comments/commentRss/2646607.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=2646607</trackback:ping><description>stdarg的一些理解&lt;img src ="http://blog.csdn.net/hxxiaopei/aggbug/2646607.aspx" width = "1" height = "1" /&gt;</description></item><item><dc:creator>xiaopei</dc:creator><title>文件缓冲区</title><link>http://blog.csdn.net/hxxiaopei/archive/2008/07/07/2622667.aspx</link><pubDate>Mon, 07 Jul 2008 19:09:00 GMT</pubDate><guid>http://blog.csdn.net/hxxiaopei/archive/2008/07/07/2622667.aspx</guid><wfw:comment>http://blog.csdn.net/hxxiaopei/comments/2622667.aspx</wfw:comment><comments>http://blog.csdn.net/hxxiaopei/archive/2008/07/07/2622667.aspx#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/hxxiaopei/comments/commentRss/2622667.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=2622667</trackback:ping><description>最近处理数据，经常需要读一行数据，处理，写入文件，采用fprintf函数效率很低，好的做法就是先把数据写入缓冲区，然后缓冲区满后再写入文件，这样减少IO操作。下面吧这个功能封装，构造函数需要写入输出文件路径已经缓冲区大小，然后writeToFile函数实现将字符串写入文件，最后用close来关键文件以及清空缓冲区 &lt;img src ="http://blog.csdn.net/hxxiaopei/aggbug/2622667.aspx" width = "1" height = "1" /&gt;</description></item><item><dc:creator>xiaopei</dc:creator><title>昨天看了一下 Ctraps and pitfalls，有些细节以前确实没注意过。</title><link>http://blog.csdn.net/hxxiaopei/archive/2008/06/25/2584129.aspx</link><pubDate>Wed, 25 Jun 2008 07:54:00 GMT</pubDate><guid>http://blog.csdn.net/hxxiaopei/archive/2008/06/25/2584129.aspx</guid><wfw:comment>http://blog.csdn.net/hxxiaopei/comments/2584129.aspx</wfw:comment><comments>http://blog.csdn.net/hxxiaopei/archive/2008/06/25/2584129.aspx#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/hxxiaopei/comments/commentRss/2584129.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=2584129</trackback:ping><description>c陷阱与缺陷&lt;img src ="http://blog.csdn.net/hxxiaopei/aggbug/2584129.aspx" width = "1" height = "1" /&gt;</description></item><item><dc:creator>xiaopei</dc:creator><title>程序员应该学C语言的十个理由</title><link>http://blog.csdn.net/hxxiaopei/archive/2006/11/27/1416243.aspx</link><pubDate>Mon, 27 Nov 2006 08:36:00 GMT</pubDate><guid>http://blog.csdn.net/hxxiaopei/archive/2006/11/27/1416243.aspx</guid><wfw:comment>http://blog.csdn.net/hxxiaopei/comments/1416243.aspx</wfw:comment><comments>http://blog.csdn.net/hxxiaopei/archive/2006/11/27/1416243.aspx#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/hxxiaopei/comments/commentRss/1416243.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=1416243</trackback:ping><description>每个程序员在他们的编程事业生涯当中都应该学C语言。C语言有太多不容忽视的好处。它不仅可以带来更多的工作机会，而且也会在总体上让你对计算机有更多的了解。
&lt;img src ="http://blog.csdn.net/hxxiaopei/aggbug/1416243.aspx" width = "1" height = "1" /&gt;</description></item><item><dc:creator>xiaopei</dc:creator><title>红黑树(RBTree)的分析和实现</title><link>http://blog.csdn.net/hxxiaopei/archive/2006/11/25/1413993.aspx</link><pubDate>Sat, 25 Nov 2006 16:53:00 GMT</pubDate><guid>http://blog.csdn.net/hxxiaopei/archive/2006/11/25/1413993.aspx</guid><wfw:comment>http://blog.csdn.net/hxxiaopei/comments/1413993.aspx</wfw:comment><comments>http://blog.csdn.net/hxxiaopei/archive/2006/11/25/1413993.aspx#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/hxxiaopei/comments/commentRss/1413993.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=1413993</trackback:ping><description>红黑树的分析和具体实现&lt;img src ="http://blog.csdn.net/hxxiaopei/aggbug/1413993.aspx" width = "1" height = "1" /&gt;</description></item><item><dc:creator>xiaopei</dc:creator><title>数据结构：最小堆/哈希表/二叉树/平衡二叉树/红黑树的意义（什么情况下使用）</title><link>http://blog.csdn.net/hxxiaopei/archive/2006/11/19/1395719.aspx</link><pubDate>Sun, 19 Nov 2006 10:27:00 GMT</pubDate><guid>http://blog.csdn.net/hxxiaopei/archive/2006/11/19/1395719.aspx</guid><wfw:comment>http://blog.csdn.net/hxxiaopei/comments/1395719.aspx</wfw:comment><comments>http://blog.csdn.net/hxxiaopei/archive/2006/11/19/1395719.aspx#Feedback</comments><slash:comments>1</slash:comments><wfw:commentRss>http://blog.csdn.net/hxxiaopei/comments/commentRss/1395719.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=1395719</trackback:ping><description>数据结构：最小堆 哈希表 二叉树 平衡二叉树/红黑树的意义，也就是在什么情况下使用什么数据结构&lt;img src ="http://blog.csdn.net/hxxiaopei/aggbug/1395719.aspx" width = "1" height = "1" /&gt;</description></item><item><dc:creator>xiaopei</dc:creator><title>[topCoder-每日一二题]--[6]----动态规划</title><link>http://blog.csdn.net/hxxiaopei/archive/2006/11/16/1388940.aspx</link><pubDate>Thu, 16 Nov 2006 21:15:00 GMT</pubDate><guid>http://blog.csdn.net/hxxiaopei/archive/2006/11/16/1388940.aspx</guid><wfw:comment>http://blog.csdn.net/hxxiaopei/comments/1388940.aspx</wfw:comment><comments>http://blog.csdn.net/hxxiaopei/archive/2006/11/16/1388940.aspx#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/hxxiaopei/comments/commentRss/1388940.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=1388940</trackback:ping><description>利用动态规划求最小耗费，要求是相邻房子的颜色不同&lt;img src ="http://blog.csdn.net/hxxiaopei/aggbug/1388940.aspx" width = "1" height = "1" /&gt;</description></item><item><dc:creator>xiaopei</dc:creator><title>求结构长度笔试题的分析。</title><link>http://blog.csdn.net/hxxiaopei/archive/2006/11/12/1379932.aspx</link><pubDate>Sun, 12 Nov 2006 11:15:00 GMT</pubDate><guid>http://blog.csdn.net/hxxiaopei/archive/2006/11/12/1379932.aspx</guid><wfw:comment>http://blog.csdn.net/hxxiaopei/comments/1379932.aspx</wfw:comment><comments>http://blog.csdn.net/hxxiaopei/archive/2006/11/12/1379932.aspx#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/hxxiaopei/comments/commentRss/1379932.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=1379932</trackback:ping><description>如何求一个结构的长度，使用sizeof &lt;img src ="http://blog.csdn.net/hxxiaopei/aggbug/1379932.aspx" width = "1" height = "1" /&gt;</description></item><item><dc:creator>xiaopei</dc:creator><title>多关键字排序问题</title><link>http://blog.csdn.net/hxxiaopei/archive/2006/11/02/1362822.aspx</link><pubDate>Thu, 02 Nov 2006 15:14:00 GMT</pubDate><guid>http://blog.csdn.net/hxxiaopei/archive/2006/11/02/1362822.aspx</guid><wfw:comment>http://blog.csdn.net/hxxiaopei/comments/1362822.aspx</wfw:comment><comments>http://blog.csdn.net/hxxiaopei/archive/2006/11/02/1362822.aspx#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/hxxiaopei/comments/commentRss/1362822.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=1362822</trackback:ping><description>多关键字排序问题&lt;img src ="http://blog.csdn.net/hxxiaopei/aggbug/1362822.aspx" width = "1" height = "1" /&gt;</description></item><item><dc:creator>xiaopei</dc:creator><title>[topCoder-每日一二题]--[3]</title><link>http://blog.csdn.net/hxxiaopei/archive/2006/11/02/1362791.aspx</link><pubDate>Thu, 02 Nov 2006 14:56:00 GMT</pubDate><guid>http://blog.csdn.net/hxxiaopei/archive/2006/11/02/1362791.aspx</guid><wfw:comment>http://blog.csdn.net/hxxiaopei/comments/1362791.aspx</wfw:comment><comments>http://blog.csdn.net/hxxiaopei/archive/2006/11/02/1362791.aspx#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/hxxiaopei/comments/commentRss/1362791.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=1362791</trackback:ping><description>只有两个状态的字符串向01状态转化&lt;img src ="http://blog.csdn.net/hxxiaopei/aggbug/1362791.aspx" width = "1" height = "1" /&gt;</description></item></channel></rss>