Fri, 18 Aug 2006 17:05:00 GMThttp://blog.csdn.net/relianceslee/http://blog.csdn.net/relianceslee/archive/2006/08/18/1094755.aspxhttp://blog.csdn.net/relianceslee/comments/1094755.aspx0http://blog.csdn.net/relianceslee/comments/commentRss/1094755.aspxhttp://tb.blog.csdn.net/TrackBack.aspx?PostId=1094755simply intruduce the usage of enum and nested class in C++ by a simple example.<img src ="http://blog.csdn.net/relianceslee/aggbug/1094755.aspx" width = "1" height = "1" />Sat, 19 Aug 2006 01:05:00 +0800reliancesleehttp://blog.csdn.net/relianceslee/archive/2006/08/18/1094755.aspx#Feedbackhttp://blog.csdn.net/relianceslee/archive/2006/08/18/1094755.aspxreliancesleehttp://blog.csdn.net/relianceslee/archive/2006/08/18/1094728.aspxhttp://blog.csdn.net/relianceslee/comments/1094728.aspx0http://blog.csdn.net/relianceslee/comments/commentRss/1094728.aspxhttp://tb.blog.csdn.net/TrackBack.aspx?PostId=1094728simply intruduce the usage of enum and nested class in C++ by a simple example.<img src ="http://blog.csdn.net/relianceslee/aggbug/1094728.aspx" width = "1" height = "1" />Sat, 19 Aug 2006 01:01:00 +0800reliancesleehttp://blog.csdn.net/relianceslee/archive/2006/08/18/1094728.aspx#Feedbackhttp://blog.csdn.net/relianceslee/archive/2006/08/18/1094728.aspxreliancesleehttp://blog.csdn.net/relianceslee/archive/2006/08/18/1093222.aspxhttp://blog.csdn.net/relianceslee/comments/1093222.aspx0http://blog.csdn.net/relianceslee/comments/commentRss/1093222.aspxhttp://tb.blog.csdn.net/TrackBack.aspx?PostId=1093222Asynchronous 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. <img src ="http://blog.csdn.net/relianceslee/aggbug/1093222.aspx" width = "1" height = "1" />Fri, 18 Aug 2006 22:32:00 +0800reliancesleehttp://blog.csdn.net/relianceslee/archive/2006/08/18/1093222.aspx#Feedbackhttp://blog.csdn.net/relianceslee/archive/2006/08/18/1093222.aspxreliancesleehttp://blog.csdn.net/relianceslee/archive/2006/08/18/1092104.aspxhttp://blog.csdn.net/relianceslee/comments/1092104.aspx0http://blog.csdn.net/relianceslee/comments/commentRss/1092104.aspxhttp://tb.blog.csdn.net/TrackBack.aspx?PostId=1092104-------------------------------------- 本文主要包含如下内容： 1. Debug 和 Release 编译方式的本质区别 2. 哪些情况下 Release 版会出错 3. 怎样“调试” Release 版的程序 --------------------------------------<img src ="http://blog.csdn.net/relianceslee/aggbug/1092104.aspx" width = "1" height = "1" />Fri, 18 Aug 2006 19:32:00 +0800reliancesleehttp://blog.csdn.net/relianceslee/archive/2006/08/18/1092104.aspx#Feedbackhttp://blog.csdn.net/relianceslee/archive/2006/08/18/1092104.aspxreliancesleehttp://blog.csdn.net/relianceslee/archive/2006/07/21/952861.aspxhttp://blog.csdn.net/relianceslee/comments/952861.aspx0http://blog.csdn.net/relianceslee/comments/commentRss/952861.aspxhttp://tb.blog.csdn.net/TrackBack.aspx?PostId=952861主要说了线程同步的知识，包括互斥量，信号灯，条件变量等<img src ="http://blog.csdn.net/relianceslee/aggbug/952861.aspx" width = "1" height = "1" />Fri, 21 Jul 2006 22:21:00 +0800reliancesleehttp://blog.csdn.net/relianceslee/archive/2006/07/21/952861.aspx#Feedbackhttp://blog.csdn.net/relianceslee/archive/2006/07/21/952861.aspxreliancesleehttp://blog.csdn.net/relianceslee/archive/2006/07/21/952829.aspxhttp://blog.csdn.net/relianceslee/comments/952829.aspx1http://blog.csdn.net/relianceslee/comments/commentRss/952829.aspxhttp://tb.blog.csdn.net/TrackBack.aspx?PostId=952829本文主要介绍了线程的指示，包括创建，终结，线程特有存储等。<img src ="http://blog.csdn.net/relianceslee/aggbug/952829.aspx" width = "1" height = "1" />Fri, 21 Jul 2006 22:18:00 +0800reliancesleehttp://blog.csdn.net/relianceslee/archive/2006/07/21/952829.aspx#Feedbackhttp://blog.csdn.net/relianceslee/archive/2006/07/21/952829.aspxreliancesleehttp://blog.csdn.net/relianceslee/archive/2006/07/21/952804.aspxhttp://blog.csdn.net/relianceslee/comments/952804.aspx0http://blog.csdn.net/relianceslee/comments/commentRss/952804.aspxhttp://tb.blog.csdn.net/TrackBack.aspx?PostId=952804本文主要介绍了Linux中进程的一些知识，包括如何创建，终结，等待等等。<img src ="http://blog.csdn.net/relianceslee/aggbug/952804.aspx" width = "1" height = "1" />Fri, 21 Jul 2006 22:15:00 +0800reliancesleehttp://blog.csdn.net/relianceslee/archive/2006/07/21/952804.aspx#Feedbackhttp://blog.csdn.net/relianceslee/archive/2006/07/21/952804.aspxreliancesleehttp://blog.csdn.net/relianceslee/archive/2006/06/13/795139.aspxhttp://blog.csdn.net/relianceslee/comments/795139.aspx0http://blog.csdn.net/relianceslee/comments/commentRss/795139.aspxhttp://tb.blog.csdn.net/TrackBack.aspx?PostId=795139UDP为用户数据报协议，提供无连接服务，每个数据报都有一定长度。UDP不关心数据是否发送成功，这一切需要上层来保证。 TCP为传输控制协议，提供面向连接，给用户提供全双工的字节流。TCP关心确认、超时和重传等细节。tcp提供流量控制，告诉对方自己的通告窗口（advertised window）<img src ="http://blog.csdn.net/relianceslee/aggbug/795139.aspx" width = "1" height = "1" />Wed, 14 Jun 2006 01:13:00 +0800reliancesleehttp://blog.csdn.net/relianceslee/archive/2006/06/13/795139.aspx#Feedbackhttp://blog.csdn.net/relianceslee/archive/2006/06/13/795139.aspxreliancesleehttp://blog.csdn.net/relianceslee/archive/2006/05/17/742626.aspxhttp://blog.csdn.net/relianceslee/comments/742626.aspx0http://blog.csdn.net/relianceslee/comments/commentRss/742626.aspxhttp://tb.blog.csdn.net/TrackBack.aspx?PostId=742626主要介绍了如何创建一个新的进程、对信号的捕捉和屏蔽等处理<img src ="http://blog.csdn.net/relianceslee/aggbug/742626.aspx" width = "1" height = "1" />Wed, 17 May 2006 21:53:00 +0800reliancesleehttp://blog.csdn.net/relianceslee/archive/2006/05/17/742626.aspx#Feedbackhttp://blog.csdn.net/relianceslee/archive/2006/05/17/742626.aspxreliancesleehttp://blog.csdn.net/relianceslee/archive/2006/05/15/736275.aspxhttp://blog.csdn.net/relianceslee/comments/736275.aspx1http://blog.csdn.net/relianceslee/comments/commentRss/736275.aspxhttp://tb.blog.csdn.net/TrackBack.aspx?PostId=736275有这么一道数学题： * * * ---- + ---- + ---- =1 ** ** ** *为1~9的数字，每个数字必须用且只能用一次。分母为两位数。 可以用排列的生成算法枚举所有的情况（当然，还有其他方法，但最好要优化）<img src ="http://blog.csdn.net/relianceslee/aggbug/736275.aspx" width = "1" height = "1" />Tue, 16 May 2006 00:29:00 +0800reliancesleehttp://blog.csdn.net/relianceslee/archive/2006/05/15/736275.aspx#Feedbackhttp://blog.csdn.net/relianceslee/archive/2006/05/15/736275.aspxrelianceslee