<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>远走高飞</title><link>http://blog.csdn.net/relianceslee/</link><description /><dc:language>zh-CN</dc:language><lastUpdateTime>Fri, 18 Aug 2006 17:04:53 GMT</lastUpdateTime><ttl>60</ttl><item><dc:creator>relianceslee</dc:creator><title>C++中的enum和nested class使用简介</title><link>http://blog.csdn.net/relianceslee/archive/2006/08/18/1094755.aspx</link><pubDate>Fri, 18 Aug 2006 17:05:00 GMT</pubDate><guid>http://blog.csdn.net/relianceslee/archive/2006/08/18/1094755.aspx</guid><wfw:comment>http://blog.csdn.net/relianceslee/comments/1094755.aspx</wfw:comment><comments>http://blog.csdn.net/relianceslee/archive/2006/08/18/1094755.aspx#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/relianceslee/comments/commentRss/1094755.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=1094755</trackback:ping><description>simply intruduce the usage of enum and nested class in C++ by a simple example.&lt;img src ="http://blog.csdn.net/relianceslee/aggbug/1094755.aspx" width = "1" height = "1" /&gt;</description></item><item><dc:creator>relianceslee</dc:creator><title>C++中的enum和nested class使用简介</title><link>http://blog.csdn.net/relianceslee/archive/2006/08/18/1094728.aspx</link><pubDate>Fri, 18 Aug 2006 17:01:00 GMT</pubDate><guid>http://blog.csdn.net/relianceslee/archive/2006/08/18/1094728.aspx</guid><wfw:comment>http://blog.csdn.net/relianceslee/comments/1094728.aspx</wfw:comment><comments>http://blog.csdn.net/relianceslee/archive/2006/08/18/1094728.aspx#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/relianceslee/comments/commentRss/1094728.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=1094728</trackback:ping><description>simply intruduce the usage of enum and nested class in C++ by a simple example.&lt;img src ="http://blog.csdn.net/relianceslee/aggbug/1094728.aspx" width = "1" height = "1" /&gt;</description></item><item><dc:creator>relianceslee</dc:creator><title>Asynchronous I/O一段介绍异步I/O</title><link>http://blog.csdn.net/relianceslee/archive/2006/08/18/1093222.aspx</link><pubDate>Fri, 18 Aug 2006 14:32:00 GMT</pubDate><guid>http://blog.csdn.net/relianceslee/archive/2006/08/18/1093222.aspx</guid><wfw:comment>http://blog.csdn.net/relianceslee/comments/1093222.aspx</wfw:comment><comments>http://blog.csdn.net/relianceslee/archive/2006/08/18/1093222.aspx#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/relianceslee/comments/commentRss/1093222.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=1093222</trackback:ping><description>Asynchronous I/O means non-blocking I/O. If a process attempts to read or write using the normal, synchronous read() or write() system calls, then it must wait until the hardware has completed the physical I/O, so that it can be informed of the success or failure of the operation (and to receive the results in the case of a successful read). The execution of the process is blocked while it waits for the results of the system call. This is synchronous or blocking I/O. &lt;img src ="http://blog.csdn.net/relianceslee/aggbug/1093222.aspx" width = "1" height = "1" /&gt;</description></item><item><dc:creator>relianceslee</dc:creator><title>[转贴]关于Debug和Release之本质区别 </title><link>http://blog.csdn.net/relianceslee/archive/2006/08/18/1092104.aspx</link><pubDate>Fri, 18 Aug 2006 11:32:00 GMT</pubDate><guid>http://blog.csdn.net/relianceslee/archive/2006/08/18/1092104.aspx</guid><wfw:comment>http://blog.csdn.net/relianceslee/comments/1092104.aspx</wfw:comment><comments>http://blog.csdn.net/relianceslee/archive/2006/08/18/1092104.aspx#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/relianceslee/comments/commentRss/1092104.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=1092104</trackback:ping><description>--------------------------------------
本文主要包含如下内容：
1. Debug 和 Release 编译方式的本质区别
2. 哪些情况下 Release 版会出错
3. 怎样“调试” Release 版的程序
--------------------------------------&lt;img src ="http://blog.csdn.net/relianceslee/aggbug/1092104.aspx" width = "1" height = "1" /&gt;</description></item><item><dc:creator>relianceslee</dc:creator><title>Linux之线程同步篇</title><link>http://blog.csdn.net/relianceslee/archive/2006/07/21/952861.aspx</link><pubDate>Fri, 21 Jul 2006 14:21:00 GMT</pubDate><guid>http://blog.csdn.net/relianceslee/archive/2006/07/21/952861.aspx</guid><wfw:comment>http://blog.csdn.net/relianceslee/comments/952861.aspx</wfw:comment><comments>http://blog.csdn.net/relianceslee/archive/2006/07/21/952861.aspx#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/relianceslee/comments/commentRss/952861.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=952861</trackback:ping><description>主要说了线程同步的知识，包括互斥量，信号灯，条件变量等&lt;img src ="http://blog.csdn.net/relianceslee/aggbug/952861.aspx" width = "1" height = "1" /&gt;</description></item><item><dc:creator>relianceslee</dc:creator><title>Linux之线程篇</title><link>http://blog.csdn.net/relianceslee/archive/2006/07/21/952829.aspx</link><pubDate>Fri, 21 Jul 2006 14:18:00 GMT</pubDate><guid>http://blog.csdn.net/relianceslee/archive/2006/07/21/952829.aspx</guid><wfw:comment>http://blog.csdn.net/relianceslee/comments/952829.aspx</wfw:comment><comments>http://blog.csdn.net/relianceslee/archive/2006/07/21/952829.aspx#Feedback</comments><slash:comments>1</slash:comments><wfw:commentRss>http://blog.csdn.net/relianceslee/comments/commentRss/952829.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=952829</trackback:ping><description>本文主要介绍了线程的指示，包括创建，终结，线程特有存储等。&lt;img src ="http://blog.csdn.net/relianceslee/aggbug/952829.aspx" width = "1" height = "1" /&gt;</description></item><item><dc:creator>relianceslee</dc:creator><title>Linux之进程篇</title><link>http://blog.csdn.net/relianceslee/archive/2006/07/21/952804.aspx</link><pubDate>Fri, 21 Jul 2006 14:15:00 GMT</pubDate><guid>http://blog.csdn.net/relianceslee/archive/2006/07/21/952804.aspx</guid><wfw:comment>http://blog.csdn.net/relianceslee/comments/952804.aspx</wfw:comment><comments>http://blog.csdn.net/relianceslee/archive/2006/07/21/952804.aspx#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/relianceslee/comments/commentRss/952804.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=952804</trackback:ping><description>本文主要介绍了Linux中进程的一些知识，包括如何创建，终结，等待等等。&lt;img src ="http://blog.csdn.net/relianceslee/aggbug/952804.aspx" width = "1" height = "1" /&gt;</description></item><item><dc:creator>relianceslee</dc:creator><title>TCP/UDP</title><link>http://blog.csdn.net/relianceslee/archive/2006/06/13/795139.aspx</link><pubDate>Tue, 13 Jun 2006 17:13:00 GMT</pubDate><guid>http://blog.csdn.net/relianceslee/archive/2006/06/13/795139.aspx</guid><wfw:comment>http://blog.csdn.net/relianceslee/comments/795139.aspx</wfw:comment><comments>http://blog.csdn.net/relianceslee/archive/2006/06/13/795139.aspx#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/relianceslee/comments/commentRss/795139.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=795139</trackback:ping><description>UDP为用户数据报协议，提供无连接服务，每个数据报都有一定长度。UDP不关心数据是否发送成功，这一切需要上层来保证。
TCP为传输控制协议，提供面向连接，给用户提供全双工的字节流。TCP关心确认、超时和重传等细节。tcp提供流量控制，告诉对方自己的通告窗口（advertised window）&lt;img src ="http://blog.csdn.net/relianceslee/aggbug/795139.aspx" width = "1" height = "1" /&gt;</description></item><item><dc:creator>relianceslee</dc:creator><title>简单进程和信号处理</title><link>http://blog.csdn.net/relianceslee/archive/2006/05/17/742626.aspx</link><pubDate>Wed, 17 May 2006 13:53:00 GMT</pubDate><guid>http://blog.csdn.net/relianceslee/archive/2006/05/17/742626.aspx</guid><wfw:comment>http://blog.csdn.net/relianceslee/comments/742626.aspx</wfw:comment><comments>http://blog.csdn.net/relianceslee/archive/2006/05/17/742626.aspx#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/relianceslee/comments/commentRss/742626.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=742626</trackback:ping><description>主要介绍了如何创建一个新的进程、对信号的捕捉和屏蔽等处理&lt;img src ="http://blog.csdn.net/relianceslee/aggbug/742626.aspx" width = "1" height = "1" /&gt;</description></item><item><dc:creator>relianceslee</dc:creator><title>数学题求解</title><link>http://blog.csdn.net/relianceslee/archive/2006/05/15/736275.aspx</link><pubDate>Mon, 15 May 2006 16:29:00 GMT</pubDate><guid>http://blog.csdn.net/relianceslee/archive/2006/05/15/736275.aspx</guid><wfw:comment>http://blog.csdn.net/relianceslee/comments/736275.aspx</wfw:comment><comments>http://blog.csdn.net/relianceslee/archive/2006/05/15/736275.aspx#Feedback</comments><slash:comments>1</slash:comments><wfw:commentRss>http://blog.csdn.net/relianceslee/comments/commentRss/736275.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=736275</trackback:ping><description>有这么一道数学题：
  *       *     *
 ---- + ---- + ---- =1
  **     **     **
 *为1~9的数字，每个数字必须用且只能用一次。分母为两位数。 

可以用排列的生成算法枚举所有的情况（当然，还有其他方法，但最好要优化）&lt;img src ="http://blog.csdn.net/relianceslee/aggbug/736275.aspx" width = "1" height = "1" /&gt;</description></item><item><dc:creator>relianceslee</dc:creator><title>类成员函数指针</title><link>http://blog.csdn.net/relianceslee/archive/2006/05/15/733431.aspx</link><pubDate>Mon, 15 May 2006 16:03:00 GMT</pubDate><guid>http://blog.csdn.net/relianceslee/archive/2006/05/15/733431.aspx</guid><wfw:comment>http://blog.csdn.net/relianceslee/comments/733431.aspx</wfw:comment><comments>http://blog.csdn.net/relianceslee/archive/2006/05/15/733431.aspx#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/relianceslee/comments/commentRss/733431.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=733431</trackback:ping><description>类的成员函数分为两种，一种是静态函数，另外一种是非静态函数。&lt;img src ="http://blog.csdn.net/relianceslee/aggbug/733431.aspx" width = "1" height = "1" /&gt;</description></item><item><dc:creator>relianceslee</dc:creator><title>选择排序、插入排序、希尔排序</title><link>http://blog.csdn.net/relianceslee/archive/2006/05/11/723767.aspx</link><pubDate>Thu, 11 May 2006 10:57:00 GMT</pubDate><guid>http://blog.csdn.net/relianceslee/archive/2006/05/11/723767.aspx</guid><wfw:comment>http://blog.csdn.net/relianceslee/comments/723767.aspx</wfw:comment><comments>http://blog.csdn.net/relianceslee/archive/2006/05/11/723767.aspx#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/relianceslee/comments/commentRss/723767.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=723767</trackback:ping><description>三个基本排序的C++算法实现&lt;img src ="http://blog.csdn.net/relianceslee/aggbug/723767.aspx" width = "1" height = "1" /&gt;</description></item><item><dc:creator>relianceslee</dc:creator><title>Hash散列算法详细解析（三） </title><link>http://blog.csdn.net/relianceslee/archive/2006/05/11/723755.aspx</link><pubDate>Thu, 11 May 2006 10:54:00 GMT</pubDate><guid>http://blog.csdn.net/relianceslee/archive/2006/05/11/723755.aspx</guid><wfw:comment>http://blog.csdn.net/relianceslee/comments/723755.aspx</wfw:comment><comments>http://blog.csdn.net/relianceslee/archive/2006/05/11/723755.aspx#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/relianceslee/comments/commentRss/723755.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=723755</trackback:ping><description>关键词： ripemd128    ripemd160    ripemd256    ripemd320                 &lt;img src ="http://blog.csdn.net/relianceslee/aggbug/723755.aspx" width = "1" height = "1" /&gt;</description></item><item><dc:creator>relianceslee</dc:creator><title>Hash散列算法详细解析（二）</title><link>http://blog.csdn.net/relianceslee/archive/2006/05/11/723748.aspx</link><pubDate>Thu, 11 May 2006 10:53:00 GMT</pubDate><guid>http://blog.csdn.net/relianceslee/archive/2006/05/11/723748.aspx</guid><wfw:comment>http://blog.csdn.net/relianceslee/comments/723748.aspx</wfw:comment><comments>http://blog.csdn.net/relianceslee/archive/2006/05/11/723748.aspx#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/relianceslee/comments/commentRss/723748.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=723748</trackback:ping><description>Hash散列算法详细解析（二）&lt;img src ="http://blog.csdn.net/relianceslee/aggbug/723748.aspx" width = "1" height = "1" /&gt;</description></item><item><dc:creator>relianceslee</dc:creator><title>Hash散列算法详细解析（一）</title><link>http://blog.csdn.net/relianceslee/archive/2006/05/11/723741.aspx</link><pubDate>Thu, 11 May 2006 10:51:00 GMT</pubDate><guid>http://blog.csdn.net/relianceslee/archive/2006/05/11/723741.aspx</guid><wfw:comment>http://blog.csdn.net/relianceslee/comments/723741.aspx</wfw:comment><comments>http://blog.csdn.net/relianceslee/archive/2006/05/11/723741.aspx#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/relianceslee/comments/commentRss/723741.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=723741</trackback:ping><description>传统hash函数的定义：一个hash函数满足下列条件：

对于不定长度的输入有一个固定的输出 
输出容易计算&lt;img src ="http://blog.csdn.net/relianceslee/aggbug/723741.aspx" width = "1" height = "1" /&gt;</description></item></channel></rss>