﻿<?xml version="1.0" encoding="utf-8" standalone="yes"?><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>C++博客-xylyan</title><link>http://www.cppblog.com/xylyan/</link><description /><language>zh-cn</language><lastBuildDate>Tue, 14 Apr 2026 23:09:03 GMT</lastBuildDate><pubDate>Tue, 14 Apr 2026 23:09:03 GMT</pubDate><ttl>60</ttl><item><title>SQL to Mongo Shell to C++ </title><link>http://www.cppblog.com/xylyan/archive/2012/06/11/178422.html</link><dc:creator>意吟</dc:creator><author>意吟</author><pubDate>Mon, 11 Jun 2012 13:27:00 GMT</pubDate><guid>http://www.cppblog.com/xylyan/archive/2012/06/11/178422.html</guid><wfw:comment>http://www.cppblog.com/xylyan/comments/178422.html</wfw:comment><comments>http://www.cppblog.com/xylyan/archive/2012/06/11/178422.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/xylyan/comments/commentRss/178422.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/xylyan/services/trackbacks/178422.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: MongoDB的查询表示为JSON（BSON）对象。此快速参考图表显示了作为SQL的例子，Mongo shell&nbsp;语法，Mongo的C + +驱动程序的语法。MongoDB的（和其他的东西，比如一个索引键模式）中的查询表达式表示为BSON。在C + +中，你可以使用BSONObjBuilder（又名&nbsp;bson::bob&nbsp;）建立BSON对象，或BSON（）宏。下面的...&nbsp;&nbsp;<a href='http://www.cppblog.com/xylyan/archive/2012/06/11/178422.html'>阅读全文</a><img src ="http://www.cppblog.com/xylyan/aggbug/178422.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/xylyan/" target="_blank">意吟</a> 2012-06-11 21:27 <a href="http://www.cppblog.com/xylyan/archive/2012/06/11/178422.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>[转]程序员必知8大排序3大查找 </title><link>http://www.cppblog.com/xylyan/archive/2012/05/11/174598.html</link><dc:creator>意吟</dc:creator><author>意吟</author><pubDate>Fri, 11 May 2012 14:06:00 GMT</pubDate><guid>http://www.cppblog.com/xylyan/archive/2012/05/11/174598.html</guid><wfw:comment>http://www.cppblog.com/xylyan/comments/174598.html</wfw:comment><comments>http://www.cppblog.com/xylyan/archive/2012/05/11/174598.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/xylyan/comments/commentRss/174598.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/xylyan/services/trackbacks/174598.html</trackback:ping><description><![CDATA[<div class="postTitle"><span style="font-size: 18px"><span style="font-family: 宋体" lang="zh-CN">&nbsp;&nbsp;&nbsp;每天都在叫嚣自己会什么技术，什么框架，可否意识到你每天都在被这些新名词、新技术所迷惑，.NET、</span><span style="font-family: Calibri" lang="en-US">XML</span><span style="font-family: 宋体" lang="zh-CN">等等技术固然诱人，可是如果自己的基础不扎实，就像是在云里雾里行走一样，只能看到眼前，不能看到更远的地方。这些新鲜的技术掩盖了许多底层的原理，要想真正的学习技术还是走下云端，扎扎实实的把基础知识学好，有了这些基础，要掌握那些新技术也就很容易了。</span></span></div>
<p style="margin: 0in; font-family: 宋体"><span style="font-size: 18px"></span></p>
<p style="margin: 0in"><span style="font-size: 18px"><span style="font-family: Calibri">要编写出优秀的代码同样要扎实的基础，如果</span><span style="font-family: 宋体">排序和查找</span><span style="font-family: Calibri">算法学的不好，怎么对程序的性能进行优化</span><span style="font-family: 宋体">？废话不多说，本文要介绍的这些排序算法就是基础中的基础，程序员必知！</span></span></p>
<p style="margin: 0in; font-size: 10.5pt"><span style="font-family: 宋体"><img alt="" src="http://my.csdn.net/uploads/201205/04/1336088321_5479.png" /><br /></span></p>
<p style="margin: 0in"><span style="font-family: 宋体"></span></p>
<p style="margin: 0in"><strong><span style="font-size: 16px"><span style="font-family: Calibri" lang="en-US">1</span><span style="font-family: 宋体" lang="zh-CN">、直接插入排序</span></span></strong></p>
<p style="margin: 0in; font-family: 宋体; font-size: 10.5pt"></p>
<p style="margin: 0in; font-size: 10.5pt"><span style="font-family: 宋体" lang="zh-CN">（</span><span style="font-family: Calibri" lang="en-US">1</span><span style="font-family: 宋体" lang="zh-CN">）基本思想：在要排序的一组数中，假设前面(n-1) [n&gt;=2] 个数已经是排</span></p>
<p style="margin: 0in; font-family: 宋体; font-size: 10.5pt">好顺序的，现在要把第n个数插到前面的有序数中，使得这n个数</p>
<p style="margin: 0in; font-family: 宋体; font-size: 10.5pt">也是排好顺序的。如此反复循环，直到全部排好顺序。</p>
<p style="margin: 0in; font-size: 10.5pt"><span style="font-family: 宋体" lang="zh-CN">（</span><span style="font-family: Calibri" lang="en-US">2</span><span style="font-family: 宋体" lang="zh-CN">）实例</span></p><span style="font-size: 10.5pt"><img alt="" src="http://my.csdn.net/uploads/201205/04/1336088374_3035.png" /></span><br />
<p style="margin: 0in"><span style="font-family: 宋体"></span></p>
<p style="margin: 0in; font-family: Calibri; font-size: 10.5pt" lang="en-US"></p>
<p style="margin: 0in"><span style="font-size: 16px"><strong><span style="font-family: Calibri" lang="en-US">2</span><span style="font-family: 宋体" lang="zh-CN">、希尔排序（也称最小增量排序）</span></strong></span></p>
<p style="margin: 0in"><span style="font-size: 16px"><strong><span style="font-family: 宋体" lang="zh-CN"><br /></span></strong></span></p>
<p style="margin: 0in"><span style="font-size: 16px"><span style="font-family: 宋体" lang="zh-CN">（</span><span style="font-family: Calibri" lang="en-US">1</span><span style="font-family: 宋体" lang="zh-CN">）基本思想：算法先将要排序的一组数按某个增量</span><span style="font-family: 'Times New Roman'" lang="en-US">d</span><span style="font-family: 宋体" lang="zh-CN">（</span><span style="font-family: 'Times New Roman'" lang="en-US">n/2,n</span><span style="font-family: 宋体" lang="zh-CN">为要排序数的个数）分成若干组，每组中记录的下标相差</span><span style="font-family: 'Times New Roman'" lang="en-US">d.</span><span style="font-family: 宋体" lang="zh-CN">对每组中全部元素进行直接插入排序，然后再用一个较小的增量（</span><span style="font-family: 'Times New Roman'" lang="en-US">d/2</span><span style="font-family: 宋体" lang="zh-CN">）对它进行分组，在每组中再进行直接插入排序。当增量减到</span><span style="font-family: 'Times New Roman'" lang="en-US">1</span><span style="font-family: 宋体" lang="zh-CN">时，进行直接插入排序后，排序完成。</span></span></p>
<p style="margin: 0in"><span style="font-size: 16px"><span style="font-family: 宋体" lang="zh-CN">（</span><span style="font-family: Calibri" lang="en-US">2</span><span style="font-family: 宋体" lang="zh-CN">）实例：</span></span></p><span style="font-size: 10.5pt"><img alt="" src="http://my.csdn.net/uploads/201205/04/1336088407_7908.png" /></span><br />
<p style="margin: 0in"><span style="font-family: 宋体"></span></p>
<p style="margin: 0in"><span style="font-size: 16px"><strong><span style="font-family: Calibri" lang="en-US"><br /></span></strong></span></p>
<p style="margin: 0in"><span style="font-size: 16px"><strong><span style="font-family: Calibri" lang="en-US">3</span><span style="font-family: 宋体" lang="zh-CN">、简单选择排序</span></strong></span></p>
<p style="margin: 0in"><span style="font-size: 16px"><strong><span style="font-family: 宋体" lang="zh-CN"><br /></span></strong></span></p>
<p style="margin: 0in"><span style="font-size: 16px"><span style="font-family: 宋体" lang="zh-CN">（</span><span style="font-family: Calibri" lang="en-US">1</span><span style="font-family: 宋体" lang="zh-CN">）基本思想：在要排序的一组数中，选出最小的一个数与第一个位置的数交换；</span></span></p>
<p style="margin: 0in; font-family: 宋体"><span style="font-size: 16px">然后在剩下的数当中再找最小的与第二个位置的数交换，如此循环到倒数第二个数和最后一个数比较为止。</span></p>
<p style="margin: 0in"><span style="font-size: 16px"><span style="font-family: 宋体" lang="zh-CN">（</span><span style="font-family: Calibri" lang="en-US">2</span><span style="font-family: 宋体" lang="zh-CN">）实例：</span></span></p><span style="font-size: 10.5pt"><img alt="" src="http://my.csdn.net/uploads/201205/04/1336088443_8270.png" /></span><br />
<p style="margin: 0in"><span style="font-family: 宋体"></span></p>
<p style="margin: 0in; font-size: 10.5pt"><strong><span style="font-family: Calibri" lang="en-US"><br /></span></strong></p>
<p style="margin: 0in"><strong><span style="font-size: 16px"><span style="font-family: Calibri" lang="en-US">4</span><span style="font-family: SimSun" lang="zh-CN">、堆排序</span></span></strong></p>
<p style="margin: 0in"><strong><span style="font-family: SimSun" lang="zh-CN"><span style="font-size: 16px"><br /></span></span></strong></p>
<p style="margin: 0in"><span style="font-size: 16px"><span style="font-family: SimSun" lang="zh-CN">（</span><span style="font-family: Calibri" lang="en-US">1</span><span style="font-family: SimSun" lang="zh-CN">）基本思想：堆排序是一种树形选择排序，是对直接选择排序的有效改进。</span></span></p>
<p style="margin: 0in; font-family: SimSun"><span style="font-size: 16px">堆的定义如下：具有n个元素的序列（h1,h2,...,hn),当且仅当满足（hi&gt;=h2i,hi&gt;=2i+1）或（hi&lt;=h2i,hi&lt;=2i+1）(i=1,2,...,n/2)时称之为堆。在这里只讨论满足前者条件的堆。由堆的定义可以看出，堆顶元素（即第一个元素）必为最大项（大顶堆）。完全二叉树可以很直观地表示堆的结构。堆顶为根，其它为左子树、右子树。初始时把要排序的数的序列看作是一棵顺序存储的二叉树，调整它们的存储序，使之成为一个堆，这时堆的根节点的数最大。然后将根节点与堆的最后一个节点交换。然后对前面(n-1)个数重新调整使之成为堆。依此类推，直到只有两个节点的堆，并对它们作交换，最后得到有n个节点的有序序列。从算法描述来看，堆排序需要两个过程，一是建立堆，二是堆顶与堆的最后一个元素交换位置。所以堆排序有两个函数组成。一是建堆的渗透函数，二是反复调用渗透函数实现排序的函数。</span></p>
<p style="margin: 0in"><span style="font-size: 16px"><span style="font-family: SimSun" lang="zh-CN">（</span><span style="font-family: Calibri" lang="en-US">2</span><span style="font-family: SimSun" lang="zh-CN">）实例：</span></span></p>
<p style="margin: 0in"><span style="font-size: 16px"><span style="font-family: SimSun" lang="zh-CN">初始序列：</span><span style="font-family: Calibri" lang="en-US">46,79,56,38,40,84</span></span></p>
<p style="margin: 0in; font-family: 宋体"><span style="font-size: 16px">建堆：</span></p><span style="font-size: 10.5pt"><img alt="" src="http://my.csdn.net/uploads/201205/04/1336088492_9340.png" /></span><br />
<p style="margin: 0in"><span style="font-family: 宋体"></span></p>
<p style="margin: 0in; font-family: 宋体"><span style="font-size: 16px">交换，从堆中踢出最大数</span></p>
<p style="margin: 0in; font-family: 宋体; font-size: 10.5pt"><img alt="" src="http://my.csdn.net/uploads/201205/04/1336088518_9894.png" /><br /></p>
<p style="margin: 0in; font-family: SimSun"><span style="font-size: 16px">剩余结点再建堆，再交换踢出最大数</span></p><span style="font-size: 10.5pt"><img alt="" src="http://my.csdn.net/uploads/201205/04/1336088535_8265.png" /></span><br />
<p style="margin: 0in"><span style="font-family: 宋体"></span></p>
<p style="margin: 0in; font-family: SimSun"><span style="font-size: 16px">依次类推：最后堆中剩余的最后两个结点交换，踢出一个，排序完成。</span></p>
<p style="margin: 0in; font-family: Calibri; font-size: 10.5pt"></p>
<p style="margin: 0in"><strong><span style="font-size: 16px"><span style="font-family: Calibri" lang="en-US">5</span><span style="font-family: 宋体" lang="zh-CN">、冒泡排序</span></span></strong></p>
<p style="margin: 0in"><strong><span style="font-size: 16px"><span style="font-family: 宋体" lang="zh-CN"><br /></span></span></strong></p>
<p style="margin: 0in"><span style="font-size: 16px"><span style="font-family: 宋体" lang="zh-CN">（</span><span style="font-family: Calibri" lang="en-US">1</span><span style="font-family: 宋体" lang="zh-CN">）基本思想：在要排序的一组数中，对当前还未排好序的范围内的全部数，自上而下对相邻的两个数依次进行比较和调整，让较大的数往下沉，较小的往上冒。即：每当两相邻的数比较后发现它们的排序与排序要求相反时，就将它们互换。</span></span></p>
<p style="margin: 0in"><span style="font-size: 16px"><span style="font-family: 宋体" lang="zh-CN">（</span><span style="font-family: Calibri" lang="en-US">2</span><span style="font-family: 宋体" lang="zh-CN">）实例：</span></span></p><span style="font-size: 10.5pt"><img alt="" src="http://my.csdn.net/uploads/201205/04/1336088566_6504.png" /></span><br />
<p style="margin: 0in"></p>
<p style="margin: 0in"><span style="font-family: Calibri; font-size: 18px"><br /></span></p>
<p style="margin: 0in"><span style="font-size: 16px"><strong><span style="font-family: Calibri" lang="en-US">6</span><span style="font-family: 宋体" lang="zh-CN">、快速排序</span></strong></span></p>
<p style="margin: 0in; font-family: 宋体; font-size: 10.5pt"></p>
<p style="margin: 0in; font-size: 10.5pt"><span style="font-family: 宋体" lang="zh-CN">（</span><span style="font-family: Calibri" lang="en-US">1</span><span style="font-family: 宋体" lang="zh-CN">）基本思想：选择一个基准元素</span><span style="font-family: Calibri" lang="en-US">,</span><span style="font-family: 宋体" lang="zh-CN">通常选择第一个元素或者最后一个元素</span><span style="font-family: Calibri" lang="en-US">,</span><span style="font-family: 宋体" lang="zh-CN">通过一趟扫描，将待排序列分成两部分</span><span style="font-family: Calibri" lang="en-US">,</span><span style="font-family: 宋体" lang="zh-CN">一部分比基准元素小</span><span style="font-family: Calibri" lang="en-US">,</span><span style="font-family: 宋体" lang="zh-CN">一部分大于等于基准元素</span><span style="font-family: Calibri" lang="en-US">,</span><span style="font-family: 宋体" lang="zh-CN">此时基准元素在其排好序后的正确位置</span><span style="font-family: Calibri" lang="en-US">,</span><span style="font-family: 宋体" lang="zh-CN">然后再用同样的方法递归地排序划分的两部分。</span></p>
<p style="margin: 0in; font-size: 10.5pt"><span style="font-family: 宋体" lang="zh-CN">（</span><span style="font-family: Calibri" lang="en-US">2</span><span style="font-family: 宋体" lang="zh-CN">）实例：</span></p>
<p style="margin: 0in; font-size: 10.5pt"><span style="font-family: 宋体" lang="zh-CN"><img alt="" src="http://my.csdn.net/uploads/201205/07/1336347520_8718.png" /><br /></span></p>
<p style="margin: 0in"><span style="font-family: 宋体" lang="zh-CN"></span></p>
<p style="margin: 0in; font-size: 10.5pt"><span style="font-family: 宋体" lang="zh-CN"><strong><br /></strong></span></p>
<p style="margin: 0in"><span style="font-size: 16px"><span style="font-family: 宋体" lang="zh-CN"><strong>上图中将待排序列分成两部分</strong></span><span style="font-family: Calibri" lang="en-US"><strong>,</strong></span><span style="font-family: 宋体" lang="zh-CN"><strong>一部分比基准元素小</strong></span><span style="font-family: Calibri" lang="en-US"><strong>,</strong></span><span style="font-family: 宋体" lang="zh-CN"><strong>一部分大于基准元素</strong></span><span style="font-family: Calibri" lang="en-US"><strong>,</strong></span><span style="font-family: 宋体" lang="zh-CN"><strong>然后对这两部分重复上图的求解过程。</strong></span></span></p>
<p style="margin: 0in"><span style="font-size: 16px"><span style="font-family: 宋体">（这只是快速排序的一种实现方式，个人认为比较容易理解）</span><br /></span></p>
<p style="margin: 0in"><span style="font-family: 宋体"></span></p>
<p style="margin: 0in; font-size: 10.5pt"><span style="font-family: Calibri" lang="en-US"><br /></span></p>
<p style="margin: 0in"><strong><span style="font-size: 16px"><span style="font-family: Calibri" lang="en-US">7</span><span style="font-family: 宋体" lang="zh-CN">、归并排序</span></span></strong></p>
<p style="margin: 0in; font-size: 10.5pt"><span style="font-family: 宋体" lang="zh-CN"><br /></span></p>
<p style="margin: 0in"><span style="font-size: 16px"><span style="font-family: 宋体" lang="zh-CN">（</span><span style="font-family: Calibri" lang="en-US">1</span><span style="font-family: 宋体" lang="zh-CN">）基本排序：归并（Merge）排序法是将两个（或两个以上）有序表合并成一个新的有序表，即把待排序序列分为若干个子序列，每个子序列是有序的。然后再把有序子序列合并为整体有序序列。</span></span></p>
<p style="margin: 0in"><span style="font-size: 16px"><span style="font-family: 宋体" lang="zh-CN">（</span><span style="font-family: Calibri" lang="en-US">2</span><span style="font-family: 宋体" lang="zh-CN">）实例：</span></span></p>
<p style="margin: 0in; font-size: 10.5pt"><span style="font-family: 宋体" lang="zh-CN"><img alt="" src="http://my.csdn.net/uploads/201205/07/1336347623_3567.png" /><br /></span></p>
<p style="margin: 0in"><br /></p>
<p style="margin: 0in"><span style="font-family: 宋体"></span></p>
<p style="margin: 0in"><span style="font-size: 16px"><strong><span style="font-family: Calibri" lang="en-US">8</span><span style="font-family: 宋体" lang="zh-CN">、基数排序</span></strong></span></p>
<p style="margin: 0in"><span style="font-family: 宋体" lang="zh-CN"><span style="font-size: 16px"><br /></span></span></p>
<p style="margin: 0in"><span style="font-size: 16px"><span style="font-family: 宋体" lang="zh-CN">（</span><span style="font-family: Calibri" lang="en-US">1</span><span style="font-family: 宋体" lang="zh-CN">）基本思想：将所有待比较数值（正整数）统一为同样的数位长度，数位较短的数前面补零。然后，从最低位开始，依次进行一次排序。这样从最低位排序一直到最高位排序完成以后,数列就变成一个有序序列。</span></span></p>
<p style="margin: 0in"><span style="font-size: 16px"><span style="font-family: 宋体" lang="zh-CN">（</span><span style="font-family: Calibri" lang="en-US">2</span><span style="font-family: 宋体" lang="zh-CN">）实例：</span></span></p>
<p style="margin: 0in; font-size: 10.5pt"><span style="font-family: 宋体" lang="zh-CN"><img alt="" src="http://my.csdn.net/uploads/201205/07/1336347656_4247.png" /><br /></span></p>
<p style="margin: 0in"><br /></p>
<p style="margin: 0in"></p>
<p style="margin: 0in; font-family: 宋体"><span style="font-weight: bold"><span style="font-size: 16px">稳定性说明：</span></span><span style="font-size: 16px"><span style="font-family: Calibri">排序前</span><span style="font-family: 宋体">，</span><span style="font-family: Calibri">2</span><span style="font-family: 宋体">（或者更多）</span><span style="font-family: Calibri">个相等的数在序列的前后位置顺序和排序后它们</span><span style="font-family: 宋体">在序列中的</span><span style="font-family: Calibri">前后位置顺序</span><span style="font-family: 宋体">一样。</span></span></p>
<p style="margin: 0in"></p>
<p style="margin: 0in; font-family: 宋体"><span style="font-weight: bold"><span style="font-size: 16px"><br /></span></span></p>
<p style="margin: 0in; font-family: 宋体"><span style="font-weight: bold"><span style="font-size: 16px">实例：</span></span></p>
<p style="margin: 0in; font-family: 宋体"><span style="font-size: 16px"><span style="font-family: 宋体" lang="zh-CN">待排序数列：</span><span style="font-family: Calibri" lang="en-US">5,4,</span><span style="font-family: Calibri; color: red" lang="en-US"><strong>8</strong></span><span style="font-family: Calibri" lang="en-US">,6,1,</span><span style="font-family: Calibri; color: #7030a0" lang="en-US"><strong>8</strong></span><span style="font-family: Calibri" lang="en-US">,7,9</span></span></p>
<p style="margin: 0in; font-family: 宋体"><span style="font-size: 16px"><span style="font-family: 宋体" lang="zh-CN">排序结果：</span><span style="font-family: Calibri" lang="en-US">1,4,5,6,7,8,8,9</span></span></p>
<p style="margin: 0in; font-family: 宋体"><span style="font-size: 16px"><span style="font-family: SimSun" lang="zh-CN">稳定：</span><span style="font-family: Calibri" lang="en-US">1,4,5,6,7,</span><span style="font-family: Calibri; color: red" lang="en-US"><strong>8</strong></span><span style="font-family: Calibri" lang="en-US">,</span><span style="font-family: Calibri; color: #7030a0" lang="en-US"><strong>8</strong></span><span style="font-family: Calibri" lang="en-US">,9</span></span></p>
<p style="margin: 0in; font-family: 宋体"><span style="font-size: 16px"><span style="font-family: SimSun" lang="zh-CN">不稳定：</span><span style="font-family: Calibri" lang="en-US">1,4,5,6,7,</span><span style="font-family: Calibri; color: #7030a0" lang="en-US"><strong>8</strong></span><span style="font-family: Calibri" lang="en-US">,</span><span style="font-family: Calibri; color: red" lang="en-US"><strong>8</strong></span><span style="font-family: Calibri" lang="en-US">,9</span></span></p>
<p style="margin: 0in; font-family: Calibri"><span style="font-size: 16px"><br /></span></p>
<p style="margin: 0in; font-family: Calibri"><span style="font-size: 16px">说明：对比红色的8和紫色的8，看他们排序前后的位置。排序前，红8在紫8前面，如果排序后红8仍然在紫8前面，则排序算法稳定，否则不稳定。 </span></p>
<p style="margin: 0in; font-family: Calibri"><span style="font-size: 16px"><br /></span></p>
<p style="margin: 0in; font-family: 宋体"><span style="font-size: 18px"><strong><span style="font-family: Calibri" lang="zh-CN">现在</span><span style="font-family: SimSun" lang="zh-CN">我们</span><span style="font-family: Calibri" lang="zh-CN">分析一下</span><span style="font-family: Calibri" lang="en-US">8</span><span style="font-family: SimSun" lang="zh-CN">种</span><span style="font-family: Calibri" lang="zh-CN">排序算法的稳定性。</span></strong></span></p>
<p style="margin: 0in; font-family: Calibri"><span style="font-size: 16px"></span></p>
<p style="margin: 0in; font-family: 宋体"><span style="color: #ff0000; font-size: 16px"><span style="font-weight: bold"><span style="font-family: SimSun" lang="zh-CN">（</span><span style="font-family: SimSun" lang="zh-CN">请网友结合前面的排序基本思想来理解排序的稳定性（<span style="font-family: 宋体; font-size: 16px"><span style="font-family: Calibri" lang="en-US">8</span><span style="font-family: SimSun" lang="zh-CN">种排序的基本思想已经在前面说过，这里不再赘述）</span></span>不然可能有些模糊）</span></span></span></p>
<p style="margin: 0in; font-family: Calibri"><span style="color: #ff0000; font-size: 16px"><strong></strong></span></p>
<p style="margin: 0in; font-family: Calibri"><span style="font-family: 宋体; font-size: 16px"><strong><span style="font-family: SimSun" lang="zh-CN">（</span><span style="font-family: Calibri" lang="en-US">1</span><span style="font-family: SimSun" lang="zh-CN">）直接</span><span style="font-family: Calibri" lang="zh-CN">插入排序</span></strong><span style="font-family: SimSun" lang="zh-CN"><strong>：</strong>一般插入排序，</span><span style="font-family: Calibri" lang="zh-CN">比较是从有序序列的</span><span style="font-family: SimSun" lang="zh-CN">最后一个元素</span><span style="font-family: Calibri" lang="zh-CN">开始，如果比它大则直接插入在其后面，否则一直</span><span style="font-family: SimSun" lang="zh-CN">往前比</span><span style="font-family: Calibri" lang="zh-CN">。如果</span><span style="font-family: SimSun" lang="zh-CN">找到</span><span style="font-family: Calibri" lang="zh-CN">一个和插入元素相等的，那么</span><span style="font-family: SimSun" lang="zh-CN">就</span><span style="font-family: Calibri" lang="zh-CN">插入</span><span style="font-family: SimSun" lang="zh-CN">到这个</span><span style="font-family: Calibri" lang="zh-CN">相等元素的后面。插入排序是稳定的。</span></span></p>
<p style="margin: 0in; font-family: Calibri"><span style="font-size: 16px"></span></p>
<p style="margin: 0in; font-family: 宋体"><span style="font-size: 16px"><strong><span style="font-family: SimSun" lang="zh-CN">（</span><span style="font-family: Calibri" lang="en-US">2</span><span style="font-family: SimSun" lang="zh-CN">）</span><span style="font-family: Calibri" lang="zh-CN">希尔排序</span><span style="font-family: SimSun" lang="zh-CN">：</span></strong><span style="font-family: Calibri" lang="zh-CN">希尔排序是按照不同步长对元素进行插入排序，一次插入排序是稳定的，不会改变相同元素的相对顺序，但在不同的插入排序过程中，相同的元素可能在各自的插入排序中移动，稳定性</span><span style="font-family: SimSun" lang="zh-CN">就会被破坏</span><span style="font-family: Calibri" lang="zh-CN">，所以</span><span style="font-family: SimSun" lang="zh-CN">希尔</span><span style="font-family: Calibri" lang="zh-CN">排序不稳定。</span></span></p>
<p style="margin: 0in; font-family: Calibri"><span style="font-size: 16px"></span></p>
<p style="margin: 0in; font-family: 宋体"><span style="font-size: 16px"><strong><span style="font-family: SimSun" lang="zh-CN">（</span><span style="font-family: Calibri" lang="en-US">3</span><span style="font-family: SimSun" lang="zh-CN">）简单</span><span style="font-family: Calibri" lang="zh-CN">选择排序</span></strong><span style="font-family: SimSun" lang="zh-CN">：</span><span style="font-family: Calibri" lang="zh-CN">在一趟选择，如果当前元素比一个元素小，而该小的元素又出现在一个和当前元素相等的元素后面，那么交换后稳定性就被破坏了。</span></span><span style="font-size: 16px"><span style="font-family: SimSun" lang="zh-CN">光说可能有点模糊，来看个小实例：</span><span style="font-family: Calibri" lang="en-US">8</span><span style="font-family: Calibri" lang="zh-CN"></span><span style="font-family: Calibri" lang="en-US">5</span><span style="font-family: Calibri" lang="zh-CN"></span><span style="font-family: Calibri" lang="en-US">8</span><span style="font-family: Calibri" lang="zh-CN"></span><span style="font-family: Calibri" lang="en-US">4</span><span style="font-family: Calibri" lang="zh-CN"></span><span style="font-family: Calibri" lang="en-US">10</span><span style="font-family: Calibri" lang="zh-CN">，</span><span style="font-family: SimSun" lang="zh-CN">第一遍扫描，</span><span style="font-family: Calibri" lang="zh-CN">第</span><span style="font-family: Calibri" lang="en-US">1</span><span style="font-family: Calibri" lang="zh-CN">个元素</span><span style="font-family: Calibri" lang="en-US">8</span><span style="font-family: Calibri" lang="zh-CN">会和</span><span style="font-family: Calibri" lang="en-US">4</span><span style="font-family: Calibri" lang="zh-CN">交换，那么原序列中2个</span><span style="font-family: Calibri" lang="en-US">8</span><span style="font-family: Calibri" lang="zh-CN">的相对前后顺序</span><span style="font-family: SimSun" lang="zh-CN">和原序列不一致了</span><span style="font-family: Calibri" lang="zh-CN">，所以选择排序</span><span style="font-family: SimSun" lang="zh-CN">不</span><span style="font-family: Calibri" lang="zh-CN">稳定。</span></span></p>
<p style="margin: 0in; font-family: Calibri"><span style="font-size: 16px"></span></p>
<p style="margin: 0in; font-family: 宋体"><span style="font-size: 16px"><strong><span style="font-family: SimSun" lang="zh-CN">（</span><span style="font-family: Calibri" lang="en-US">4</span><span style="font-family: SimSun" lang="zh-CN">）</span><span style="font-family: Calibri" lang="zh-CN">堆排序</span></strong><span style="font-family: SimSun" lang="zh-CN"><strong>：</strong>堆排序的过程是从第</span><span style="font-family: Calibri" lang="zh-CN">n/2</span><span style="font-family: SimSun" lang="zh-CN">开始和其子节点共</span><span style="font-family: Calibri" lang="zh-CN">3</span><span style="font-family: SimSun" lang="zh-CN">个值选择最大</span><span style="font-family: Calibri" lang="zh-CN">(</span><span style="font-family: SimSun" lang="zh-CN">大顶堆</span><span style="font-family: Calibri" lang="zh-CN">)</span><span style="font-family: SimSun" lang="zh-CN">或者最小</span><span style="font-family: Calibri" lang="zh-CN">(</span><span style="font-family: SimSun" lang="zh-CN">小顶堆</span><span style="font-family: Calibri" lang="zh-CN">),</span><span style="font-family: SimSun" lang="zh-CN">这</span><span style="font-family: Calibri" lang="zh-CN">3</span><span style="font-family: SimSun" lang="zh-CN">个元素之间的选择当然不会破坏稳定性。但当为</span><span style="font-family: Calibri" lang="zh-CN">n/2-1, n/2-2, ...</span><span style="font-family: SimSun" lang="zh-CN">这些父节点选择元素时，有可能第</span><span style="font-family: Calibri" lang="zh-CN">n/2</span><span style="font-family: SimSun" lang="zh-CN">个父节点交换把后面一个元素交换过去了，而第</span><span style="font-family: Calibri" lang="zh-CN">n/2-1</span><span style="font-family: SimSun" lang="zh-CN">个父节点把后面一个相同的元素没有交换，所以堆排序并不稳定。</span></span></p>
<p style="margin: 0in; font-family: Calibri"><span style="font-size: 16px"><strong></strong></span></p>
<p style="margin: 0in; font-family: 宋体"><span style="font-size: 16px"><strong><span style="font-family: SimSun" lang="zh-CN">（</span><span style="font-family: Calibri" lang="en-US">5</span><span style="font-family: SimSun" lang="zh-CN">）</span><span style="font-family: Calibri" lang="zh-CN">冒泡排序</span></strong><span style="font-family: SimSun" lang="zh-CN">：由前面的内容可知，冒泡排序</span><span style="font-family: Calibri" lang="zh-CN">是相邻的两个元素比较，交换也发生在这两个元素之间</span><span style="font-family: SimSun" lang="zh-CN">，如果两个元素相等，不用交换。所以冒泡排序稳定。</span></span></p>
<p style="margin: 0in; font-family: Calibri"><span style="font-size: 16px"></span></p>
<p style="margin: 0in; font-family: 宋体"><span style="font-size: 16px"><strong><span style="font-family: SimSun" lang="zh-CN">（</span><span style="font-family: Calibri" lang="en-US">6</span><span style="font-family: SimSun" lang="zh-CN">）</span><span style="font-family: Calibri" lang="zh-CN">快速排序</span><span style="font-family: SimSun" lang="zh-CN">：</span></strong><span style="font-family: Calibri" lang="zh-CN">在中枢元素和</span><span style="font-family: SimSun" lang="zh-CN">序列中一个元素</span><span style="font-family: Calibri" lang="zh-CN">交换的时候，很有可能把前面的元素的稳定性打乱</span><span style="font-family: SimSun" lang="zh-CN">。还是看一个小实例：</span><span style="font-family: Calibri" lang="en-US">6 4 4 5 4 7 8 9</span><span style="font-family: SimSun" lang="zh-CN">，第一趟排序，</span><span style="font-family: Calibri" lang="zh-CN">中枢元素</span><span style="font-family: Calibri" lang="en-US">6</span><span style="font-family: Calibri" lang="zh-CN">和</span><span style="font-family: SimSun" lang="zh-CN">第三个</span><span style="font-family: Calibri" lang="en-US">4</span><span style="font-family: Calibri" lang="zh-CN">交换就会把元素</span><span style="font-family: Calibri" lang="en-US">4</span><span style="font-family: Calibri" lang="zh-CN">的</span><span style="font-family: SimSun" lang="zh-CN">原序列破坏</span><span style="font-family: Calibri" lang="zh-CN">，所以快速排序</span><span style="font-family: SimSun" lang="zh-CN">不稳定。</span></span></p>
<p style="margin: 0in; font-family: Calibri"><span style="font-size: 16px"></span></p>
<p style="margin: 0in; font-family: 宋体"><span style="font-size: 16px"><strong><span style="font-family: SimSun" lang="zh-CN">（</span><span style="font-family: Calibri" lang="en-US">7</span></strong><span style="font-family: SimSun" lang="zh-CN"><strong>）归并排序：</strong>在分解的子列中，有</span><span style="font-family: Calibri" lang="zh-CN">1</span><span style="font-family: SimSun" lang="zh-CN">个或</span><span style="font-family: Calibri" lang="zh-CN">2</span><span style="font-family: SimSun" lang="zh-CN">个元素时，</span><span style="font-family: Calibri" lang="zh-CN">1</span><span style="font-family: SimSun" lang="zh-CN">个元素不会交换，</span><span style="font-family: Calibri" lang="zh-CN">2</span><span style="font-family: SimSun" lang="zh-CN">个元素如果大小相等也不会交换。在序列合并的过程中，如果两个当前元素相等时，我们把处在前面的序列的元素保存在结果序列的前面，所以，归并排序也是稳定的。</span><span style="font-family: Calibri" lang="zh-CN"></span></span></p>
<p style="margin: 0in; font-family: SimSun"><span style="font-size: 16px"></span></p>
<p style="margin: 0in; font-family: 宋体"><span style="font-size: 16px"><strong><span style="font-family: SimSun" lang="zh-CN">（</span><span style="font-family: Calibri" lang="en-US">8</span><span style="font-family: SimSun" lang="zh-CN">）</span><span style="font-family: Calibri" lang="zh-CN">基数排序</span><span style="font-family: SimSun" lang="zh-CN">：</span></strong><span style="font-family: Calibri" lang="zh-CN">是按照低位先排序，然后收集；再按照高位排序，然后再收集；依次类推，直到最高位。有时候有些属性是有优先级顺序的，先按低优先级排序，再按高优先级排序，最后的次序就是高优先级高的在前，高优先级相同的低优先级高的在前。基数排序基于分别排序，分别收集，所以是稳定的。</span></span></p>
<p style="margin: 0in; font-family: Calibri"><span style="font-size: 16px"></span></p>
<p style="margin: 0in; font-family: 宋体"><span style="font-weight: bold"><span style="font-size: 16px">8种排序的分类，稳定性，时间复杂度和空间复杂度总结：</span></span></p>
<p style="margin: 0in"><span style="font-family: 宋体"><img alt="" src="http://my.csdn.net/uploads/201205/07/1336347704_8123.png" /><br /></span><br /></p>
<p style="margin: 0in; font-family: 宋体; font-size: 10.5pt"><span style="font-family: 宋体"></span></p>
<p style="margin: 0in"></p>
<p style="margin: 0in"><span style="font-size: 16px"><span style="font-family: SimSun" lang="zh-CN"><strong>三种查找算法</strong></span><span style="font-family: Calibri" lang="en-US"><strong>:</strong></span><span style="font-family: SimSun" lang="zh-CN"><strong>顺序查找，二分法查找（折半查找），分块查找，散列表（以后谈）</strong></span></span></p>
<p style="margin: 0in; font-size: 10.5pt"><span style="font-family: SimSun" lang="zh-CN"><strong><br /></strong></span></p>
<p style="margin: 0in; font-family: SimSun; font-size: 10.5pt"><img alt="" src="http://my.csdn.net/uploads/201205/11/1336693103_6268.png" /><br /></p>
<p style="margin: 0in; font-family: SimSun; font-size: 10.5pt"><span style="font-weight: bold"><br /></span></p>
<p style="margin: 0in; font-family: SimSun"><span style="font-weight: bold"><span style="font-size: 16px">一、顺序查找的基本思想：</span></span></p>
<p style="margin: 0in; font-size: 10.5pt"><span style="font-family: SimSun" lang="zh-CN">从表的一端开始，顺序扫描表，依次将扫描到的结点关键字和给定值（假定为</span><span style="font-family: Calibri" lang="en-US">a</span><span style="font-family: SimSun" lang="zh-CN">）相比较，若当前结点关键字与</span><span style="font-family: Calibri" lang="en-US">a</span><span style="font-family: SimSun" lang="zh-CN">相等，则查找成功；若扫描结束后，仍未找到关键字等于</span><span style="font-family: Calibri" lang="en-US">a</span><span style="font-family: SimSun" lang="zh-CN">的结点，则查找失败。</span></p>
<p style="margin: 0in; font-family: SimSun; font-size: 10.5pt"></p>
<p style="margin: 0in; font-family: SimSun; font-size: 10.5pt">说白了就是，从头到尾，一个一个地比，找着相同的就成功，找不到就失败。很明显的缺点就是查找效率低。</p>
<p style="margin: 0in; font-family: SimSun; font-size: 10.5pt"></p>
<p style="margin: 0in; font-family: SimSun; font-size: 10.5pt">适用于线性表的顺序存储结构和链式存储结构。</p>
<p style="margin: 0in; font-family: SimSun; font-size: 10.5pt"><br /></p>
<p style="margin: 0in; font-family: SimSun; font-size: 10.5pt"><img alt="" src="http://my.csdn.net/uploads/201205/11/1336693133_8901.png" /><br /></p>
<p style="margin: 0in; font-family: SimSun; font-size: 10.5pt"><br /></p>
<p style="margin: 0in; font-family: SimSun"></p>
<p style="margin: 0in; font-family: SimSun; font-size: 10.5pt">计算平均查找长度。</p>
<p style="margin: 0in; font-size: 10.5pt"><span style="font-family: SimSun" lang="zh-CN">例如上表，查找</span><span style="font-family: Calibri" lang="en-US">1</span><span style="font-family: SimSun" lang="zh-CN">，需要</span><span style="font-family: Calibri" lang="en-US">1</span><span style="font-family: SimSun" lang="zh-CN">次，查找</span><span style="font-family: Calibri" lang="en-US">2</span><span style="font-family: SimSun" lang="zh-CN">需要</span><span style="font-family: Calibri" lang="en-US">2</span><span style="font-family: SimSun" lang="zh-CN">次，依次往下推，可知查找</span><span style="font-family: Calibri" lang="en-US">16</span><span style="font-family: SimSun" lang="zh-CN">需要</span><span style="font-family: Calibri" lang="en-US">16</span><span style="font-family: SimSun" lang="zh-CN">次，</span></p>
<p style="margin: 0in; font-size: 10.5pt"><span style="font-family: SimSun" lang="zh-CN">可以看出，我们只要将这些查找次数求和（我们初中学的，上底加下底乘以高除以</span><span style="font-family: Calibri" lang="en-US">2</span><span style="font-family: SimSun" lang="zh-CN">），然后除以结点数，即为平均查找长度。</span></p>
<p style="margin: 0in; font-size: 10.5pt"><span style="font-family: SimSun" lang="zh-CN">设</span><span style="font-family: Calibri" lang="en-US">n=</span><span style="font-family: SimSun" lang="zh-CN">节点数</span></p>
<p style="margin: 0in; font-size: 10.5pt"><span style="font-family: SimSun" lang="zh-CN">平均查找长度</span><span style="font-family: Calibri" lang="en-US">=</span><span style="font-family: SimSun" lang="zh-CN">（</span><span style="font-family: Calibri" lang="en-US">n+</span><span style="font-family: SimSun" lang="en-US">1</span><span style="font-family: SimSun" lang="zh-CN">）</span><span style="font-family: SimSun" lang="en-US">/2</span></p>
<p style="margin: 0in; font-family: SimSun; font-size: 10.5pt" lang="en-US"></p>
<p style="margin: 0in; font-family: SimSun"><span style="font-weight: bold"><span style="font-size: 16px">二、二分法查找（折半查找）的基本思想：</span></span></p>
<p style="margin: 0in; font-family: SimSun; font-size: 10.5pt"><br /></p>
<p style="margin: 0in; font-family: SimSun; font-size: 10.5pt">前提：</p>
<p style="margin: 0in; font-size: 10.5pt"><span style="font-family: SimSun" lang="zh-CN">（</span><span style="font-family: Calibri" lang="en-US">1</span><span style="font-family: SimSun" lang="zh-CN">）确定该区间的中点位置：</span><span style="font-family: SimSun" lang="en-US">mid=</span><span style="font-family: SimSun" lang="zh-CN">（</span><span style="font-family: SimSun" lang="en-US">low+high</span><span style="font-family: SimSun" lang="zh-CN">）</span><span style="font-family: SimSun" lang="en-US">/2<span> </span></span></p>
<p style="margin: 0in; font-family: SimSun; font-size: 10.5pt"><span lang="en-US">min</span><span lang="zh-CN">代表区间中间的结点的位置，</span><span lang="en-US">low</span><span lang="zh-CN">代表区间最左结点位置，</span><span lang="en-US">high</span><span lang="zh-CN">代表区间最右结点位置</span></p>
<p style="margin: 0in; font-family: SimSun; font-size: 10.5pt"><span lang="zh-CN">（</span><span lang="en-US">2</span><span lang="zh-CN">）将待查</span><span lang="en-US">a</span><span lang="zh-CN">值与结点</span><span lang="en-US">mid</span><span lang="zh-CN">的关键字（下面用</span><span lang="en-US">R[mid].key</span><span lang="zh-CN">）比较，若相等，则查找成功，否则确定新的查找区间：</span></p>
<p style="margin: 0in; font-size: 10.5pt"><span style="font-family: SimSun" lang="zh-CN">如果</span><span style="font-family: SimSun" lang="en-US">R[mid].key&gt;a</span><span style="font-family: SimSun" lang="zh-CN">，则由表的有序性可知，</span><span style="font-family: SimSun" lang="en-US">R[mid].key</span><span style="font-family: SimSun" lang="zh-CN">右侧的值都大于</span><span style="font-family: Calibri" lang="en-US">a</span><span style="font-family: SimSun" lang="zh-CN">，所以等于</span><span style="font-family: Calibri" lang="en-US">a</span><span style="font-family: SimSun" lang="zh-CN">的关键字如果存在，必然在</span><span style="font-family: SimSun" lang="en-US">R[mid].key</span><span style="font-family: SimSun" lang="zh-CN">左边的表中。这时</span><span style="font-family: SimSun" lang="en-US">high=mid-1</span></p>
<p style="margin: 0in; font-size: 10.5pt"><span style="font-family: SimSun" lang="zh-CN">如果</span><span style="font-family: SimSun" lang="en-US">R[mid].key&lt;a,</span><span style="font-family: SimSun" lang="zh-CN">则等于</span><span style="font-family: Calibri" lang="en-US">a</span><span style="font-family: SimSun" lang="zh-CN">的关键字如果存在，必然在</span><span style="font-family: SimSun" lang="en-US">R[mid].key</span><span style="font-family: SimSun" lang="zh-CN">右边的表中。这时</span><span style="font-family: SimSun" lang="en-US">low=mid</span></p>
<p style="margin: 0in; font-family: SimSun; font-size: 10.5pt"><span lang="zh-CN">如果</span><span lang="en-US">R[mid].key=a</span><span lang="zh-CN">，则查找成功。</span></p>
<p style="margin: 0in; font-size: 10.5pt"><span style="font-family: SimSun" lang="zh-CN">（</span><span style="font-family: Calibri" lang="en-US">3</span><span style="font-family: SimSun" lang="zh-CN">）下一次查找针对新的查找区间，重复步骤（</span><span style="font-family: Calibri" lang="en-US">1</span><span style="font-family: SimSun" lang="zh-CN">）和（</span><span style="font-family: Calibri" lang="en-US">2</span><span style="font-family: SimSun" lang="zh-CN">）</span></p>
<p style="margin: 0in; font-size: 10.5pt"><span style="font-family: SimSun" lang="zh-CN">（</span><span style="font-family: Calibri" lang="en-US">4</span><span style="font-family: SimSun" lang="zh-CN">）在查找过程中，</span><span style="font-family: Calibri" lang="en-US">low</span><span style="font-family: SimSun" lang="zh-CN">逐步增加，</span><span style="font-family: Calibri" lang="en-US">high</span><span style="font-family: SimSun" lang="zh-CN">逐步减少，如果</span><span style="font-family: Calibri" lang="en-US">high&lt;low</span><span style="font-family: SimSun" lang="zh-CN">，则查找失败。</span></p>
<p style="margin: 0in; font-size: 10.5pt"><span style="font-family: SimSun" lang="zh-CN"><br /></span></p>
<p style="margin: 0in"><span style="font-size: 10.5pt"><img alt="" src="http://my.csdn.net/uploads/201205/11/1336693183_8857.png" /></span><br /></p>
<p style="margin: 0in; font-family: SimSun"></p>
<p style="margin: 0in; font-size: 10.5pt"><span style="font-family: SimSun" lang="zh-CN">平均查找长度</span><span style="font-family: Calibri" lang="en-US">=Log2</span><span style="font-family: Calibri; vertical-align: super" lang="en-US">(n+1)</span><span style="font-family: Calibri" lang="en-US">-1</span></p>
<p style="margin: 0in; font-family: Calibri; font-size: 10.5pt"></p>
<p style="margin: 0in; font-family: SimSun; font-size: 10.5pt"><span style="font-weight: bold">注：虽然二分法查找的效率高，但是要将表按关键字排序。而排序本身是一种很费时的运算，所以二分法比较适用于顺序存储结构。为保持表的有序性，在顺序结构中插入和删除都必须移动大量的结点。因此，二分查找特别适用于那种一经建立就很少改动而又经常需要查找的线性表。</span></p>
<p style="margin: 0in; font-family: SimSun; font-size: 10.5pt"></p>
<p style="margin: 0in; font-family: SimSun"><span style="font-weight: bold"><span style="font-size: 16px">三、分块查找的基本思想：</span></span></p>
<p style="margin: 0in; font-family: SimSun"><span style="font-weight: bold"><span style="font-size: 16px"><br /></span></span></p>
<p style="margin: 0in; font-family: SimSun; font-size: 10.5pt">二分查找表使分块有序的线性表和索引表（抽取各块中的最大关键字及其起始位置构成索引表</p>
<p style="margin: 0in; font-family: SimSun; font-size: 10.5pt">）组成，由于表是分块有序的，所以索引表是一个递增有序表，因此采用顺序或二分查找索引表，以确定待查结点在哪一块，由于块内无序，只能用顺序查找。</p>
<p style="margin: 0in; font-family: SimSun; font-size: 10.5pt"><br /></p>
<p style="margin: 0in"><span style="font-size: 10.5pt"><img alt="" src="http://my.csdn.net/uploads/201205/11/1336693221_2992.png" /></span><br /></p>
<p style="margin: 0in; font-family: SimSun; font-size: 10.5pt"></p>
<p style="margin: 0in; font-size: 10.5pt"><span style="font-family: SimSun" lang="zh-CN"><br /></span></p>
<p style="margin: 0in; font-size: 10.5pt"><span style="font-family: SimSun" lang="zh-CN">设表共</span><span style="font-family: Calibri" lang="en-US">n</span><span style="font-family: SimSun" lang="zh-CN">个结点，分</span><span style="font-family: Calibri" lang="en-US">b</span><span style="font-family: SimSun" lang="zh-CN">块，</span><span style="font-family: Calibri" lang="en-US">s=n/b</span></p>
<p style="margin: 0in; font-size: 10.5pt"><span style="font-family: Calibri" lang="en-US">(</span><span style="font-family: SimSun" lang="zh-CN">分块查找索引表</span><span style="font-family: Calibri" lang="en-US">)</span><span style="font-family: SimSun" lang="zh-CN">平均查找长度</span><span style="font-family: Calibri" lang="en-US">=Log2</span><span style="font-family: SimSun; vertical-align: super" lang="zh-CN">（</span><span style="font-family: Calibri; vertical-align: super" lang="en-US">n/s+1</span><span style="font-family: SimSun; vertical-align: super" lang="zh-CN">）</span><span style="font-family: Calibri; vertical-align: super" lang="en-US">+s/2</span></p>
<p style="margin: 0in; font-size: 10.5pt"><span style="font-family: Calibri" lang="en-US">(</span><span style="font-family: SimSun" lang="zh-CN">顺序查找索引表</span><span style="font-family: Calibri" lang="en-US">)</span><span style="font-family: SimSun" lang="zh-CN">平均查找长度</span><span style="font-family: Calibri" lang="en-US">=(S</span><span style="font-family: Calibri; vertical-align: super" lang="en-US">2</span><span style="font-family: Calibri" lang="en-US">+2S+n)/(2S)</span></p>
<p style="margin: 0in; font-family: Calibri; font-size: 10.5pt" lang="en-US"></p>
<p style="margin: 0in; font-family: SimSun; font-size: 10.5pt"></p>
<p style="margin: 0in; font-family: SimSun; font-size: 10.5pt"><span style="font-weight: bold">注：分块查找的优点是在表中插入或删除一个记录时，只要找到该记录所属块，就在该块中进行插入或删除运算（因块内无序，所以不需要大量移动记录）。它主要代价是增加一个辅助数组的存储控件和将初始表分块排序的运算。</span></p>
<p style="margin: 0in; font-family: SimSun; font-size: 10.5pt"></p>
<p style="margin: 0in; font-family: SimSun; font-size: 10.5pt"><span style="font-weight: bold">它的性能介于顺序查找和二分查找之间。</span></p>
<p style="margin: 0in; font-family: SimSun; font-size: 10.5pt"><span style="font-family: SimSun; color: #ff0000; font-size: 14px"><strong><br /></strong></span></p>
<p style="margin: 0in; font-family: SimSun; font-size: 10.5pt"><span style="font-family: SimSun; color: #ff0000; font-size: 14px"><strong>四、最近比较忙，后续找个时间还会谈谈散列表（哈希表）技术，希望大家关注！</strong></span></p>
<p style="margin: 0in; font-family: SimSun; font-size: 10.5pt">散列表查找技术不同于顺序查找、二分查找、分块查找。它不以关键字的比较为基本操作，采用直接寻址技术。在理想情况下，无须任何比较就可以找到待查关键字，查找的期望时间为O(1)。</p><img src ="http://www.cppblog.com/xylyan/aggbug/174598.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/xylyan/" target="_blank">意吟</a> 2012-05-11 22:06 <a href="http://www.cppblog.com/xylyan/archive/2012/05/11/174598.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>MFC程序，使用GDI绘图</title><link>http://www.cppblog.com/xylyan/archive/2012/05/06/173849.html</link><dc:creator>意吟</dc:creator><author>意吟</author><pubDate>Sun, 06 May 2012 15:19:00 GMT</pubDate><guid>http://www.cppblog.com/xylyan/archive/2012/05/06/173849.html</guid><wfw:comment>http://www.cppblog.com/xylyan/comments/173849.html</wfw:comment><comments>http://www.cppblog.com/xylyan/archive/2012/05/06/173849.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/xylyan/comments/commentRss/173849.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/xylyan/services/trackbacks/173849.html</trackback:ping><description><![CDATA[<p>//矢量图和位图的区别</p>
<p><br />//介绍DC、了解DC<br /><wbr>//CBrush brush(#ff0000);<br /><wbr>//CClientDC dc(this-&gt;GetParent()-&gt;GetParent());<br /><wbr>//CWindowDC dc(this);<br /><wbr>//dc.FillRect(CRect(0,0,500,500),&amp;brush); <wbr></p>
<p>//基本图形的绘制<br /><wbr>//线段<br /><wbr><wbr>pDC-&gt;MoveTo(20,30);<br /><wbr><wbr>pDC-&gt;LineTo(300,30);<br /><wbr>//矩形<br /><wbr><wbr>pDC-&gt;Rectangle(20,50,300,200);<br /><wbr>//椭圆<br /><wbr><wbr>pDC-&gt;Ellipse(20,50,300,200);</p>
<p><wbr><br /><wbr>CPen pen, *pOldPen;<br /><wbr>CBrush brush, *pOldBrush;<br />//1.使用画笔<br /><wbr>pen.CreatePen(PS_SOLID,6,#ff0000); <wbr><wbr><br /><wbr>pOldPen=pDC-&gt;SelectObject(&amp;pen); <wbr><wbr><wbr><br /><wbr>pDC-&gt;MoveTo(20,250); <wbr><wbr><wbr><wbr><wbr><wbr><wbr><wbr><br /><wbr>pDC-&gt;LineTo(300,250); <wbr><wbr><wbr><wbr><wbr><wbr><wbr><br /><wbr>pDC-&gt;SelectObject(pOldPen); <wbr><wbr><wbr><wbr><wbr></p>
<p>//2.使用画刷(填充)<br /><wbr>//创建一个蓝色的画刷<br /><wbr>brush.CreateSolidBrush(#0000ff); <wbr><wbr><wbr><wbr><wbr><br /><wbr>pOldBrush=pDC-&gt;SelectObject(&amp;brush); <wbr><br /><wbr>pDC-&gt;Rectangle(20,300,300,400); <wbr><wbr><wbr><wbr><wbr><br /><wbr>pDC-&gt;SelectObject(pOldBrush); <wbr><wbr><wbr></p>
<p><wbr>//创建一个蓝色的网格画刷<br /><wbr>brush.DeleteObject();<br /><wbr>brush.CreateHatchBrush(HS_CROSS,#0000ff); <wbr><wbr><wbr><wbr><wbr><br /><wbr>pOldBrush=pDC-&gt;SelectObject(&amp;brush); <wbr><br /><wbr>pDC-&gt;Rectangle(20,420,300,520); <wbr><wbr><wbr><wbr><br /><wbr>pDC-&gt;SelectObject(pOldBrush); <wbr><wbr><wbr></p>
<p><wbr>//创建一个位图画刷<br /><wbr>brush.DeleteObject();<br /><wbr>CBitmap bitmap_brush;<br /><wbr>bitmap_brush.LoadBitmap(IDB_BITMAP1); <wbr><br /><wbr>brush.CreatePatternBrush(&amp;bitmap_brush); <wbr><wbr><wbr><br /><wbr>pOldBrush=pDC-&gt;SelectObject(&amp;brush); <wbr><br /><wbr>pDC-&gt;Rectangle(20,540,300,640); <wbr><wbr><wbr><wbr><wbr><br /><wbr>pDC-&gt;SelectObject(pOldBrush); <wbr><wbr></p>
<p><wbr>//空画刷<br /><wbr>brush.DeleteObject();<br /><wbr>brush.CreateStockObject(NULL_BRUSH);<br /><wbr>pDC-&gt;Rectangle(20,660,300,760); <wbr><wbr><br /><wbr>pDC-&gt;SelectObject(pOldBrush); <wbr></p>
<p>//3.使用位图<br /><wbr>//定义位图<br /><wbr>CBitmap bitmap;</p>
<p><wbr>//保存位图信息; <wbr><br /><wbr>BITMAP bmp; <wbr><wbr></p>
<p><wbr>//建立兼容设备<br /><wbr>CDC dcCompatible; <wbr><wbr><wbr><wbr><wbr><wbr><wbr><wbr><br /><wbr>dcCompatible.CreateCompatibleDC(pDC); <wbr><wbr><wbr><br /><wbr><br /><wbr>//从资源中装入位图 <wbr><br /><wbr>bitmap.LoadBitmap(IDB_BITMAP1); <wbr></p>
<p><wbr>//将位图选入设备<br /><wbr>dcCompatible.SelectObject(&amp;bitmap); <wbr><wbr></p>
<p><wbr>//获取位图信息<br /><wbr>bitmap.GetBitmap(&amp;bmp); <wbr></p>
<p><wbr>//拷贝<br /><wbr>pDC-&gt;BitBlt(600,0,bmp.bmWidth,bmp.bmHeight,&amp;dcCompatible,0,0,SRCCOPY);</p>
<p><br /><wbr>//从文件中获取位图<br /><wbr>HBITMAP hBitmap;<br /><wbr>hBitmap=(HBITMAP)LoadImage(AfxGetInstanceHandle(),<br /><wbr><wbr><wbr>"res\\ball.bmp", //实际位图文件的路径<br /><wbr><wbr><wbr>IMAGE_BITMAP,0, <wbr>0,LR_LOADFROMFILE|LR_CREATEDIBSECTION);//从文件中装入位图<br /><wbr>bitmap.Detach();<br /><wbr>bitmap.Attach(hBitmap);<br /><wbr>bitmap.GetBitmap(&amp;bmp); <wbr><br /><wbr><wbr><wbr><wbr><wbr><wbr><wbr><br /><wbr>dcCompatible.SelectObject(&amp;bitmap); <wbr><br /><wbr><wbr><wbr><br /><wbr>//绘制非透明位图（将dcCompatible上的内容拷贝到pDC中）<br /><wbr>pDC-&gt;BitBlt(600,40,bmp.bmWidth,bmp.bmHeight,&amp;dcCompatible,0,0,SRCCOPY);<br /><wbr>pDC-&gt;StretchBlt(600,100,bmp.bmWidth*2,bmp.bmHeight*2,&amp;dcCompatible,0,0,bmp.bmWidth,bmp.bmHeight,SRCCOPY);</p>
<p><wbr>//绘制透明位图（将dcCompatible上的内容拷贝到pDC中，同时去掉最后一个参数指定的颜色）<br /><wbr>pDC-&gt;TransparentBlt(600,200,bmp.bmWidth,bmp.bmHeight,&amp;dcCompatible,0,0,bmp.bmWidth,bmp.bmHeight,#ff0000);</p>
<p><br />//4.输出文字<br /><wbr>pDC-&gt;SetTextColor(#ff0000);<br /><wbr>pDC-&gt;SetBkMode(TRANSPARENT);</p>
<p><wbr>CFont <wbr>font;//当前字体<br /><wbr>font.CreateFont(32,0,0,0,FW_NORMAL,FALSE,FALSE,0,ANSI_CHARSET,OUT_DEFAULT_PRECIS,CLIP_DEFAULT_PRECIS,ANTIALIASED_QUALITY,DEFAULT_PITCH | FF_SWISS,"宋体");<br /><wbr><br /><wbr>CFont *pOldFont=pDC-&gt;SelectObject(&amp;font);</p>
<p><wbr>pDC-&gt;TextOut(50,320,"输出文字");<br /><wbr>CSize cs;<br /><wbr>cs=pDC-&gt;GetTextExtent("输出文字");<br /><wbr>pDC-&gt;TextOut(50+cs.cx,320,"abcdefg");<br /><wbr>pDC-&gt;SelectObject(pOldFont);</p>
<p>//复杂图形<br /><wbr>int step=30;<br /><wbr>int center_x=700;<br /><wbr>int center_y=500;<br /><wbr>float x,y;<br /><wbr>x=center_x-300;<br /><wbr>y=sin(x/600*6*3.14)*100;<br /><wbr>pDC-&gt;MoveTo(x,center_y+y);<br /><wbr>while (x&lt;center_x+300)<br /><wbr>{<br /><wbr><wbr>y=sin(x/600*6*3.14)*100;<br /><wbr><wbr>pDC-&gt;LineTo(x,center_y+y);<br /><wbr><wbr>x+=step;<br /><wbr>}</p><img src ="http://www.cppblog.com/xylyan/aggbug/173849.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/xylyan/" target="_blank">意吟</a> 2012-05-06 23:19 <a href="http://www.cppblog.com/xylyan/archive/2012/05/06/173849.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>[转]lua和c/c++互相调用实例分析 </title><link>http://www.cppblog.com/xylyan/archive/2012/05/03/173600.html</link><dc:creator>意吟</dc:creator><author>意吟</author><pubDate>Thu, 03 May 2012 11:29:00 GMT</pubDate><guid>http://www.cppblog.com/xylyan/archive/2012/05/03/173600.html</guid><wfw:comment>http://www.cppblog.com/xylyan/comments/173600.html</wfw:comment><comments>http://www.cppblog.com/xylyan/archive/2012/05/03/173600.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/xylyan/comments/commentRss/173600.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/xylyan/services/trackbacks/173600.html</trackback:ping><description><![CDATA[lua作为小巧精悍的脚本语言，易于嵌入c/c++中 ， 广泛应用于游戏AI ，实际上在任何经常变化的逻辑上都可以使用lua实现，配合c/c++实现的底层接口服务，能够大大降低系统的维护成本。下面对lua和c/c++的交互调用做一个实例分析：<br />lua提供了API用于在c/c++中构造lua的运行环境，相关接口如下：<br />//创建lua运行上下文<br />lua_State* luaL_newstate(void) ;<br />//加载lua脚本文件<br />int luaL_loadfile(lua_State *L, const char *filename);<br /><br />lua和c/c++的数据交互通过"栈"进行 ,操作数据时，首先将数据拷贝到"栈"上，然后获取数据，栈中的每个数据通过索引值进行定位，索引值为正时表示相对于栈底的偏移索引，索引值为负时表示相对于栈顶的偏移索引，索引值以1或-1为起始值，因此栈顶索引值永远为-1 ,栈底索引值永远为1 。 "栈"相当于数据在lua和c/c++之间的中转地。每种数据都有相应的存取接口 。<br />数据入"栈"接口：<br />void (lua_pushnil) (lua_State *L);<br />void (lua_pushnumber) (lua_State *L, lua_Number n);<br />void (lua_pushinteger) (lua_State *L, lua_Integer n);<br />void (lua_pushlstring) (lua_State *L, const char *s, size_t l);<br />void (lua_pushstring) (lua_State *L, const char *s);<br />void (lua_pushboolean) (lua_State *L, int b);<br />void (lua_pushcclosure) (lua_State *L, lua_CFunction fn, int n);<br /><br />数据获取接口：<br />lua_Number (lua_tonumber) (lua_State *L, int idx);<br />lua_Integer (lua_tointeger) (lua_State *L, int idx);<br />int (lua_toboolean) (lua_State *L, int idx);<br />const char *(lua_tolstring) (lua_State *L, int idx, size_t *len);<br />lua_CFunction (lua_tocfunction) (lua_State *L, int idx);<br /><br /><br />"栈"操作接口：<br />int (lua_gettop) (lua_State *L);<br />void (lua_settop) (lua_State *L, int idx);<br />void (lua_pushvalue) (lua_State *L, int idx);<br />void (lua_remove) (lua_State *L, int idx);<br />void (lua_insert) (lua_State *L, int idx);<br />void (lua_replace) (lua_State *L, int idx);<br />int (lua_checkstack) (lua_State *L, int sz);<br /><br />lua中定义的变量和函数存放在一个全局table中，索引值为LUA_GLOBALSINDEX ，table相关操作接口：<br />void (lua_gettable) (lua_State *L, int idx);<br />void (lua_getfield) (lua_State *L, int idx, const char *k);<br />void (lua_settable) (lua_State *L, int idx);<br />void (lua_setfield) (lua_State *L, int idx, const char *k);<br /><br />当"栈"中包含执行脚本需要的所有要素(函数名和参数)后，调用lua_pcall执行脚本：<br />int (lua_pcall) (lua_State *L, int nargs, int nresults, int errfunc);<br /><br />下面进行实例说明：<br />func.lua<br />
<div style="border-bottom: #cccccc 1px solid; border-left: #cccccc 1px solid; padding-bottom: 4px; background-color: #eeeeee; padding-left: 4px; width: 98%; padding-right: 5px; font-size: 13px; border-top: #cccccc 1px solid; border-right: #cccccc 1px solid; padding-top: 4px"><!--<br /><br />Code highlighting produced by Actipro CodeHighlighter (freeware)<br />http://www.CodeHighlighter.com/<br /><br />--><span style="color: #000000">--变量定义<br />width</span><span style="color: #000000">=</span><span style="color: #000000">1</span><span style="color: #000000"> ;<br />height</span><span style="color: #000000">=</span><span style="color: #000000">2</span><span style="color: #000000"> ;<br />--lua函数定义，实现加法<br />function sum(a,b)<br /></span><span style="color: #0000ff">&nbsp;&nbsp;&nbsp;return</span><span style="color: #000000"> a</span><span style="color: #000000">+</span><span style="color: #000000">b ;<br />end<br />--lua函数定义，实现字符串相加<br />function mystrcat(a,b)<br /></span><span style="color: #0000ff">&nbsp;&nbsp;&nbsp;return</span><span style="color: #000000"> a..b ;<br />end<br />--lua函数定义，通过调用c代码中的csum函数实现加法<br />function mysum(a,b)<br /></span><span style="color: #0000ff">&nbsp;&nbsp;&nbsp;return</span><span style="color: #000000"> csum(a,b) ;<br />end</span></div><br />test_lua.c<br />
<div style="border-bottom: #cccccc 1px solid; border-left: #cccccc 1px solid; padding-bottom: 4px; background-color: #eeeeee; padding-left: 4px; width: 98%; padding-right: 5px; font-size: 13px; border-top: #cccccc 1px solid; border-right: #cccccc 1px solid; padding-top: 4px"><!--<br /><br />Code highlighting produced by Actipro CodeHighlighter (freeware)<br />http://www.CodeHighlighter.com/<br /><br />--><span style="color: #000000">#include </span><span style="color: #000000">&lt;</span><span style="color: #000000">stdio.h</span><span style="color: #000000">&gt;</span><span style="color: #000000"><br />#include </span><span style="color: #000000">&lt;</span><span style="color: #000000">stdlib.h</span><span style="color: #000000">&gt;</span><span style="color: #000000"><br />#include </span><span style="color: #000000">&lt;</span><span style="color: #0000ff">string</span><span style="color: #000000">.h</span><span style="color: #000000">&gt;</span><span style="color: #000000"><br /></span><span style="color: #000000">#include </span><span style="color: #000000">&lt;</span><span style="color: #000000">errno.h</span><span style="color: #000000">&gt;</span><span style="color: #000000"><br /></span>//lua头文件<br /><span style="color: #000000">#include </span><span style="color: #000000">&lt;</span><span style="color: #000000">lua.h</span><span style="color: #000000">&gt;</span><span style="color: #000000"><br />#include </span><span style="color: #000000">&lt;</span><span style="color: #000000">lualib.h</span><span style="color: #000000">&gt;</span><span style="color: #000000"><br />#include </span><span style="color: #000000">&lt;</span><span style="color: #000000">lauxlib.h</span><span style="color: #000000">&gt;</span><span style="color: #000000"><br /></span><span style="color: #000000"><br /><br /></span><span style="color: #0000ff">#define</span><span style="color: #000000"> err_exit(num,fmt,args<img alt="" src="http://www.cppblog.com/Images/dot.gif" />) \</span><span style="color: #000000"><br /></span><span style="color: #0000ff">do</span><span style="color: #000000">{printf(</span><span style="color: #000000">"</span><span style="color: #000000">[%s:%d]</span><span style="color: #000000">"</span><span style="color: #000000">fmt</span><span style="color: #000000">"</span><span style="color: #000000">\n</span><span style="color: #000000">"</span><span style="color: #000000">,__FILE__,__LINE__,##args);exit(num);} </span><span style="color: #0000ff">while</span><span style="color: #000000">(</span><span style="color: #000000">0</span><span style="color: #000000">)<br /></span><span style="color: #0000ff">#define</span><span style="color: #000000"> err_return(num,fmt,args<img alt="" src="http://www.cppblog.com/Images/dot.gif" />) \</span><span style="color: #000000"><br /></span><span style="color: #0000ff">do</span><span style="color: #000000">{printf(</span><span style="color: #000000">"</span><span style="color: #000000">[%s:%d]</span><span style="color: #000000">"</span><span style="color: #000000">fmt</span><span style="color: #000000">"</span><span style="color: #000000">\n</span><span style="color: #000000">"</span><span style="color: #000000">,__FILE__,__LINE__,##args);</span><span style="color: #0000ff">return</span><span style="color: #000000">(num);} </span><span style="color: #0000ff">while</span><span style="color: #000000">(</span><span style="color: #000000">0</span><span style="color: #000000">)<br /><br />//lua中调用的c函数定义,实现加法<br /></span><span style="color: #0000ff">int</span><span style="color: #000000"> csum(lua_State</span><span style="color: #000000">*</span><span style="color: #000000"> l)<br />{<br /></span><span style="color: #0000ff">&nbsp;&nbsp;&nbsp;int</span><span style="color: #000000"> a </span><span style="color: #000000">=</span><span style="color: #000000"> lua_tointeger(l,</span><span style="color: #000000">1</span><span style="color: #000000">) ;<br /></span><span style="color: #0000ff">&nbsp;&nbsp;&nbsp;int</span><span style="color: #000000"> b </span><span style="color: #000000">=</span><span style="color: #000000"> lua_tointeger(l,</span><span style="color: #000000">2</span><span style="color: #000000">) ;<br />&nbsp;&nbsp;&nbsp;lua_pushinteger(l,a</span><span style="color: #000000">+</span><span style="color: #000000">b) ;<br /></span><span style="color: #0000ff">&nbsp;&nbsp;&nbsp;return</span><span style="color: #000000"> </span><span style="color: #000000">1</span><span style="color: #000000"> ;<br />}<br /><br /></span><span style="color: #0000ff">int</span><span style="color: #000000"> main(</span><span style="color: #0000ff">int</span><span style="color: #000000"> argc,</span><span style="color: #0000ff">char</span><span style="color: #000000">**</span><span style="color: #000000"> argv)<br />{<br />&nbsp;&nbsp;&nbsp;lua_State </span><span style="color: #000000">*</span><span style="color: #000000"> l </span><span style="color: #000000">=</span><span style="color: #000000"> luaL_newstate() ; //创建lua运行环境<br /></span><span style="color: #0000ff">&nbsp;&nbsp;&nbsp;if</span><span style="color: #000000"> ( l </span><span style="color: #000000">==</span><span style="color: #000000"> NULL ) err_return(</span><span style="color: #000000">-</span><span style="color: #000000">1</span><span style="color: #000000">,</span><span style="color: #000000">"</span><span style="color: #000000">luaL_newstat() failed</span><span style="color: #000000">"</span><span style="color: #000000">);&nbsp;<br /></span><span style="color: #0000ff">&nbsp;&nbsp;&nbsp;int</span><span style="color: #000000"> ret </span><span style="color: #000000">=</span><span style="color: #000000"> </span><span style="color: #000000">0</span><span style="color: #000000"> ;<br />&nbsp;&nbsp;&nbsp;ret </span><span style="color: #000000">=</span><span style="color: #000000"> luaL_loadfile(l,</span><span style="color: #000000">"</span><span style="color: #000000">func.lua</span><span style="color: #000000">"</span><span style="color: #000000">) ; //加载lua脚本文件<br /></span><span style="color: #0000ff">&nbsp;&nbsp;&nbsp;if</span><span style="color: #000000"> ( ret </span><span style="color: #000000">!=</span><span style="color: #000000"> </span><span style="color: #000000">0</span><span style="color: #000000"> ) err_return(</span><span style="color: #000000">-</span><span style="color: #000000">1</span><span style="color: #000000">,</span><span style="color: #000000">"</span><span style="color: #000000">luaL_loadfile failed</span><span style="color: #000000">"</span><span style="color: #000000">) ;<br />&nbsp;&nbsp;&nbsp;ret </span><span style="color: #000000">=</span><span style="color: #000000"> lua_pcall(l,</span><span style="color: #000000">0</span><span style="color: #000000">,</span><span style="color: #000000">0</span><span style="color: #000000">,</span><span style="color: #000000">0</span><span style="color: #000000">) ;<br /></span><span style="color: #0000ff">&nbsp;&nbsp;&nbsp;if</span><span style="color: #000000"> ( ret </span><span style="color: #000000">!=</span><span style="color: #000000"> </span><span style="color: #000000">0</span><span style="color: #000000"> ) err_return(</span><span style="color: #000000">-</span><span style="color: #000000">1</span><span style="color: #000000">,</span><span style="color: #000000">"</span><span style="color: #000000">lua_pcall failed:%s</span><span style="color: #000000">"</span><span style="color: #000000">,lua_tostring(l,</span><span style="color: #000000">-</span><span style="color: #000000">1</span><span style="color: #000000">)) ;<br /><br />&nbsp;&nbsp;&nbsp;lua_getglobal(l,</span><span style="color: #000000">"</span><span style="color: #000000">width</span><span style="color: #000000">"</span><span style="color: #000000">); //获取lua中定义的变量<br />&nbsp;&nbsp;&nbsp;lua_getglobal(l,</span><span style="color: #000000">"</span><span style="color: #000000">height</span><span style="color: #000000">"</span><span style="color: #000000">);<br />&nbsp;&nbsp;&nbsp;printf(</span><span style="color: #000000">"</span><span style="color: #000000">height:%ld width:%ld\n</span><span style="color: #000000">"</span><span style="color: #000000">,lua_tointeger(l,</span><span style="color: #000000">-</span><span style="color: #000000">1</span><span style="color: #000000">),lua_tointeger(l,</span><span style="color: #000000">-</span><span style="color: #000000">2</span><span style="color: #000000">)) ;<br />&nbsp;&nbsp;&nbsp;lua_pop(l,</span><span style="color: #000000">1</span><span style="color: #000000">) ; //恢复lua的栈<br /><br /></span><span style="color: #0000ff">&nbsp;&nbsp;&nbsp;int</span><span style="color: #000000"> a </span><span style="color: #000000">=</span><span style="color: #000000"> </span><span style="color: #000000">11</span><span style="color: #000000"> ;<br /></span><span style="color: #0000ff">&nbsp;&nbsp;&nbsp;int</span><span style="color: #000000"> b </span><span style="color: #000000">=</span><span style="color: #000000"> </span><span style="color: #000000">12</span><span style="color: #000000"> ;<br />&nbsp;&nbsp;&nbsp;lua_getglobal(l,</span><span style="color: #000000">"</span><span style="color: #000000">sum</span><span style="color: #000000">"</span><span style="color: #000000">); //调用lua中的函数sum<br />&nbsp;&nbsp;&nbsp;lua_pushinteger(l,a) ;<br />&nbsp;&nbsp;&nbsp;lua_pushinteger(l,b) ;<br />&nbsp;&nbsp;&nbsp;ret </span><span style="color: #000000">=</span><span style="color: #000000"> lua_pcall(l,</span><span style="color: #000000">2</span><span style="color: #000000">,</span><span style="color: #000000">1</span><span style="color: #000000">,</span><span style="color: #000000">0</span><span style="color: #000000">) ;<br /></span><span style="color: #0000ff">&nbsp;&nbsp;&nbsp;if</span><span style="color: #000000"> ( ret </span><span style="color: #000000">!=</span><span style="color: #000000"> </span><span style="color: #000000">0</span><span style="color: #000000"> ) err_return(</span><span style="color: #000000">-</span><span style="color: #000000">1</span><span style="color: #000000">,</span><span style="color: #000000">"</span><span style="color: #000000">lua_pcall failed:%s</span><span style="color: #000000">"</span><span style="color: #000000">,lua_tostring(l,</span><span style="color: #000000">-</span><span style="color: #000000">1</span><span style="color: #000000">)) ;<br />&nbsp;&nbsp;&nbsp;printf(</span><span style="color: #000000">"</span><span style="color: #000000">sum:%d + %d = %ld\n</span><span style="color: #000000">"</span><span style="color: #000000">,a,b,lua_tointeger(l,</span><span style="color: #000000">-</span><span style="color: #000000">1</span><span style="color: #000000">)) ;<br />&nbsp;&nbsp;&nbsp;lua_pop(l,</span><span style="color: #000000">1</span><span style="color: #000000">) ;<br /><br /></span><span style="color: #0000ff">&nbsp;&nbsp;&nbsp;const</span><span style="color: #000000"> </span><span style="color: #0000ff">char</span><span style="color: #000000"> str1[] </span><span style="color: #000000">=</span><span style="color: #000000"> </span><span style="color: #000000">"</span><span style="color: #000000">hello</span><span style="color: #000000">"</span><span style="color: #000000"> ;<br /></span><span style="color: #0000ff">&nbsp;&nbsp;&nbsp;const</span><span style="color: #000000"> </span><span style="color: #0000ff">char</span><span style="color: #000000"> str2[] </span><span style="color: #000000">=</span><span style="color: #000000"> </span><span style="color: #000000">"</span><span style="color: #000000">world</span><span style="color: #000000">"</span><span style="color: #000000"> ;<br />&nbsp;&nbsp;&nbsp;lua_getglobal(l,</span><span style="color: #000000">"</span><span style="color: #000000">mystrcat</span><span style="color: #000000">"</span><span style="color: #000000">); //调用lua中的函数mystrcat<br />&nbsp;&nbsp;&nbsp;lua_pushstring(l,str1) ;<br />&nbsp;&nbsp;&nbsp;lua_pushstring(l,str2) ;<br />&nbsp;&nbsp;&nbsp;ret </span><span style="color: #000000">=</span><span style="color: #000000"> lua_pcall(l,</span><span style="color: #000000">2</span><span style="color: #000000">,</span><span style="color: #000000">1</span><span style="color: #000000">,</span><span style="color: #000000">0</span><span style="color: #000000">) ;<br /></span><span style="color: #0000ff">&nbsp;&nbsp;&nbsp;if</span><span style="color: #000000"> ( ret </span><span style="color: #000000">!=</span><span style="color: #000000"> </span><span style="color: #000000">0</span><span style="color: #000000"> ) err_return(</span><span style="color: #000000">-</span><span style="color: #000000">1</span><span style="color: #000000">,</span><span style="color: #000000">"</span><span style="color: #000000">lua_pcall failed:%s</span><span style="color: #000000">"</span><span style="color: #000000">,lua_tostring(l,</span><span style="color: #000000">-</span><span style="color: #000000">1</span><span style="color: #000000">)) ;<br />&nbsp;&nbsp;&nbsp;printf(</span><span style="color: #000000">"</span><span style="color: #000000">mystrcat:%s%s = %s\n</span><span style="color: #000000">"</span><span style="color: #000000">,str1,str2,lua_tostring(l,</span><span style="color: #000000">-</span><span style="color: #000000">1</span><span style="color: #000000">)) ;<br />&nbsp;&nbsp;&nbsp;lua_pop(l,</span><span style="color: #000000">1</span><span style="color: #000000">) ;<br /><br />&nbsp;&nbsp;&nbsp;lua_pushcfunction(l,csum) ; //注册在lua中使用的c函数<br />&nbsp;&nbsp;&nbsp;lua_setglobal(l,</span><span style="color: #000000">"</span><span style="color: #000000">csum</span><span style="color: #000000">"</span><span style="color: #000000">) ; //绑定到lua中的名字csum<br /><br />&nbsp;&nbsp;&nbsp;lua_getglobal(l,</span><span style="color: #000000">"</span><span style="color: #000000">mysum</span><span style="color: #000000">"</span><span style="color: #000000">); //调用lua中的mysum函数，该函数调用本程序中定义的csum函数实现加法<br />&nbsp;&nbsp;&nbsp;lua_pushinteger(l,a) ;<br />&nbsp;&nbsp;&nbsp;lua_pushinteger(l,b) ;<br />&nbsp;&nbsp;&nbsp;ret </span><span style="color: #000000">=</span><span style="color: #000000"> lua_pcall(l,</span><span style="color: #000000">2</span><span style="color: #000000">,</span><span style="color: #000000">1</span><span style="color: #000000">,</span><span style="color: #000000">0</span><span style="color: #000000">) ;<br /></span><span style="color: #0000ff">&nbsp;&nbsp;&nbsp;if</span><span style="color: #000000"> ( ret </span><span style="color: #000000">!=</span><span style="color: #000000"> </span><span style="color: #000000">0</span><span style="color: #000000"> ) err_return(</span><span style="color: #000000">-</span><span style="color: #000000">1</span><span style="color: #000000">,</span><span style="color: #000000">"</span><span style="color: #000000">lua_pcall failed:%s</span><span style="color: #000000">"</span><span style="color: #000000">,lua_tostring(l,</span><span style="color: #000000">-</span><span style="color: #000000">1</span><span style="color: #000000">)) ;<br />&nbsp;&nbsp;&nbsp;printf(</span><span style="color: #000000">"</span><span style="color: #000000">mysum:%d + %d = %ld\n</span><span style="color: #000000">"</span><span style="color: #000000">,a,b,lua_tointeger(l,</span><span style="color: #000000">-</span><span style="color: #000000">1</span><span style="color: #000000">)) ;<br />&nbsp;&nbsp;&nbsp;lua_pop(l,</span><span style="color: #000000">1</span><span style="color: #000000">) ;<br /><br />&nbsp;&nbsp;&nbsp;lua_close(l) ; //释放lua运行环境<br /></span><span style="color: #0000ff">&nbsp;&nbsp;&nbsp;return</span><span style="color: #000000"> </span><span style="color: #000000">0</span><span style="color: #000000"> ;<br />}<br /></span></div><img src ="http://www.cppblog.com/xylyan/aggbug/173600.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/xylyan/" target="_blank">意吟</a> 2012-05-03 19:29 <a href="http://www.cppblog.com/xylyan/archive/2012/05/03/173600.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>[转]C++ socket编程 </title><link>http://www.cppblog.com/xylyan/archive/2012/05/03/173599.html</link><dc:creator>意吟</dc:creator><author>意吟</author><pubDate>Thu, 03 May 2012 11:22:00 GMT</pubDate><guid>http://www.cppblog.com/xylyan/archive/2012/05/03/173599.html</guid><wfw:comment>http://www.cppblog.com/xylyan/comments/173599.html</wfw:comment><comments>http://www.cppblog.com/xylyan/archive/2012/05/03/173599.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/xylyan/comments/commentRss/173599.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/xylyan/services/trackbacks/173599.html</trackback:ping><description><![CDATA[<p><strong>一、TCP/IP 体系结构与特点</strong></p>
<p>　　1、TCP/IP体系结构</p>
<p>　　TCP/IP协议实际上就是在物理网上的一组完整的网络协议。其中TCP是提供传输层服务，而IP则是提供网络层服务。TCP/IP包括以下协议：（结构如图1.1）</p>
<p><img border="1" hspace="3" alt="" vspace="1" align="middle" src="http://www.yesky.com/image20010518/54678.gif" width="468" height="388" /><br />(图1.1)</p>
<p>　　IP： 网间协议(Internet Protocol) 负责主机间数据的路由和网络上数据的存储。同时为ICMP，TCP，　　　UDP提供分组发送服务。用户进程通常不需要涉及这一层。<br /><br />　　ARP： 地址解析协议(Address Resolution Protocol)<br />　　　此协议将网络地址映射到硬件地址。<br /><br />　　RARP： 反向地址解析协议(Reverse Address Resolution Protocol)<br />　　　此协议将硬件地址映射到网络地址<br /><br />　　ICMP： 网间报文控制协议(Internet Control Message Protocol)<br />　　　此协议处理信关和主机的差错和传送控制。<br /><br />　　TCP： 传送控制协议(Transmission Control Protocol)<br />　　　这是一种提供给用户进程的可靠的全双工字节流面向连接的协议。它要为用户进程提供虚电路服务，并为数据可靠传输建立检查。（注：大多数网络用户程序使用TCP）<br /><br />　　UDP： 用户数据报协议(User Datagram Protocol)<br />　　　这是提供给用户进程的无连接协议，用于传送数据而不执行正确性检查。<br /><br />　　FTP： 文件传输协议(File Transfer Protocol)<br />　　　允许用户以文件操作的方式（文件的增、删、改、查、传送等）与另一主机相互通信。<br /><br />　　SMTP： 简单邮件传送协议(Simple Mail Transfer Protocol)<br />　　　SMTP协议为系统之间传送电子邮件。<br /><br />　　TELNET：终端协议(Telnet Terminal Procotol)<br />　　　允许用户以虚终端方式访问远程主机<br /><br />　　HTTP： 超文本传输协议(Hypertext Transfer Procotol)<br />　　<br />　　TFTP: 简单文件传输协议(Trivial File Transfer Protocol)</p>
<p>　　2、TCP/IP特点<br /><br />　　TCP/IP协议的核心部分是传输层协议(TCP、UDP)，网络层协议(IP)和物理接口层，这三层通常是在操作系统内核中实现。因此用户一般不涉及。编程时，编程界面有两种形式：一、是由内核心直接提供的系统调用；二、使用以库函数方式提供的各种函数。前者为核内实现，后者为核外实现。用户服务要通过核外的应用程序才能实现，所以要使用套接字(socket)来实现。<br /><br />　　图1.2是TCP/IP协议核心与应用程序关系图。<br /><br /><img border="1" hspace="3" alt="" vspace="1" align="middle" src="http://www.yesky.com/image20010518/54679.gif" width="344" height="279" /><br />(图1.2)</p>
<p>　　<strong>二、专用术语</strong><br /><br />　　1、套接字</p>
<p>　　套接字是网络的基本构件。它是可以被命名和寻址的通信端点，使用中的每一个套接字都有其类型和一个与之相连听进程。套接字存在通信区域（通信区域又称地址簇）中。套接字只与同一区域中的套接字交换数据（跨区域时，需要执行某和转换进程才能实现）。WINDOWS 中的套接字只支持一个域&#8212;&#8212;网际域。套接字具有类型。<br /><br />　　WINDOWS SOCKET 1.1 版本支持两种套接字：流套接字(SOCK_STREAM)和数据报套接字(SOCK_DGRAM) <br /><br />　　2、WINDOWS SOCKETS 实现<br /><br />　　一个WINDOWS SOCKETS 实现是指实现了WINDOWS SOCKETS规范所描述的全部功能的一套软件。一般通过DLL文件来实现</p>
<p>　　3、阻塞处理例程<br /><br />　　阻塞处理例程(blocking hook,阻塞钩子)是WINDOWS SOCKETS实现为了支持阻塞套接字函数调用而提供的一种机制。</p>
<p>　　4、多址广播（multicast，多点传送或组播）<br /><br />　　是一种一对多的传输方式，传输发起者通过一次传输就将信息传送到一组接收者，与单点传送<br />(unicast)和广播(Broadcast)相对应。<br /><br /><strong>一、客户机/服务器模式</strong><br /><br />　　在TCP/IP网络中两个进程间的相互作用的主机模式是客户机/服务器模式(Client/Server model)。该模式的建立基于以下两点：1、非对等作用；2、通信完全是异步的。客户机/服务器模式在操作过程中采取的是主动请示方式：</p>
<p>　　首先服务器方要先启动，并根据请示提供相应服务：（过程如下）<br /><br />　　1、打开一通信通道并告知本地主机，它愿意在某一个公认地址上接收客户请求。<br /><br />　　2、等待客户请求到达该端口。<br /><br />　　3、接收到重复服务请求，处理该请求并发送应答信号。<br /><br />　　4、返回第二步，等待另一客户请求<br /><br />　　5、关闭服务器。<br /><br />　　客户方：<br /><br />　　1、打开一通信通道，并连接到服务器所在主机的特定端口。<br /><br />　　2、向服务器发送服务请求报文，等待并接收应答；继续提出请求&#8230;&#8230;<br /><br />　　3、请求结束后关闭通信通道并终止。</p>
<p>　　<strong>二、基本套接字</strong><br /><br />　　为了更好说明套接字编程原理，给出几个基本的套接字，在以后的篇幅中会给出更详细的使用说明。<br /><br />　　1、创建套接字&#8212;&#8212;socket()<br /><br />　　功能：使用前创建一个新的套接字<br /><br />　　格式：SOCKET PASCAL FAR socket(int af,int type,int procotol);<br /><br />　　参数：af: 通信发生的区域<br /><br />　　type: 要建立的套接字类型<br /><br />　　procotol: 使用的特定协议</p>
<p>　　2、指定本地地址&#8212;&#8212;bind()<br /><br />　　功能：将套接字地址与所创建的套接字号联系起来。<br /><br />　　格式：int PASCAL FAR bind(SOCKET s,const struct sockaddr FAR * name,int namelen);<br /><br />　　参数：s: 是由socket()调用返回的并且未作连接的套接字描述符（套接字号）。<br /><br />　　其它：没有错误，bind()返回0，否则SOCKET_ERROR<br /><br />　　地址结构说明：<br /><br />struct sockaddr_in<br />{<br />short sin_family;//AF_INET<br />u_short sin_port;//16位端口号，网络字节顺序<br />struct in_addr sin_addr;//32位IP地址，网络字节顺序<br />char sin_zero[8];//保留<br />}</p>
<p>　　3、建立套接字连接&#8212;&#8212;connect()和accept()<br /><br />　　功能：共同完成连接工作<br /><br />　　格式：int PASCAL FAR connect(SOCKET s,const struct sockaddr FAR * name,int namelen);<br /><br />　　SOCKET PASCAL FAR accept(SOCKET s,struct sockaddr FAR * name,int FAR * addrlen);<br /><br />　　参数：同上</p>
<p>　　4、监听连接&#8212;&#8212;listen()<br /><br />　　功能：用于面向连接服务器，表明它愿意接收连接。<br /><br />　　格式：int PASCAL FAR listen(SOCKET s, int backlog);</p>
<p>　　5、数据传输&#8212;&#8212;send()与recv()<br /><br />　　功能：数据的发送与接收<br /><br />　　格式：int PASCAL FAR send(SOCKET s,const char FAR * buf,int len,int flags);<br /><br />　　int PASCAL FAR recv(SOCKET s,const char FAR * buf,int len,int flags);<br /><br />　　参数：buf:指向存有传输数据的缓冲区的指针。 <br /><br />　　6、多路复用&#8212;&#8212;select()<br /><br />　　功能：用来检测一个或多个套接字状态。<br /><br />　　格式：int PASCAL FAR select(int nfds,fd_set FAR * readfds,fd_set FAR * writefds, <br />fd_set FAR * exceptfds,const struct timeval FAR * timeout);<br /><br />　　参数：readfds:指向要做读检测的指针<br /><br />　　　　　writefds:指向要做写检测的指针<br /><br />　　　　　exceptfds:指向要检测是否出错的指针<br /><br />　　　　　timeout:最大等待时间</p>
<p>　　7、关闭套接字&#8212;&#8212;closesocket()<br /><br />　　功能：关闭套接字s<br /><br />　　格式：BOOL PASCAL FAR closesocket(SOCKET s);<br /><br /><strong>三、典型过程图</strong><br /><br />　　2.1 面向连接的套接字的系统调用时序图</p>
<p>&nbsp;</p>
<p><img border="1" hspace="3" alt="" vspace="1" align="middle" src="http://www.yesky.com/image20010518/54933.GIF" width="448" height="575" /><br /><br />　　2.2 无连接协议的套接字调用时序图<br /><br /><img border="1" hspace="3" alt="" vspace="1" align="middle" src="http://www.yesky.com/image20010518/54934.GIF" width="423" height="287" /><br /><br />　2.3 面向连接的应用程序流程图<br /><br /><img border="1" hspace="3" alt="" vspace="1" align="middle" src="http://www.yesky.com/image20010518/54935.GIF" width="423" height="349" /></p>
<p><br /><font class="f22"><strong>Windows Socket 程序设计</strong></font><br /><br /><strong>一、简介</strong><br /><br />　　Windows Sockets 是从 Berkeley Sockets 扩展而来的，其在继承 Berkeley Sockets 的基础上，又进行了新的扩充。这些扩充主要是提供了一些异步函数，并增加了符合WINDOWS消息驱动特性的网络事件异步选择机制。<br /><br />　　Windows Sockets由两部分组成：开发组件和运行组件。<br /><br />　　开发组件：Windows Sockets 实现文档、应用程序接口(API)引入库和一些头文件。<br /><br />　　运行组件：Windows Sockets 应用程序接口的动态链接库(WINSOCK.DLL)。</p>
<p>　　<strong>二、主要扩充说明</strong></p>
<p>　　1、异步选择机制：<br /><br />　　Windows Sockets 的异步选择函数提供了消息机制的网络事件选择，当使用它登记网络事件发生时，应用程序相应窗口函数将收到一个消息，消息中指示了发生的网络事件，以及与事件相关的一些信息。<br /><br />　　Windows Sockets 提供了一个异步选择函数 WSAAsyncSelect()，用它来注册应用程序感兴趣的网络事件，当这些事件发生时，应用程序相应的窗口函数将收到一个消息。<br /><br />　　函数结构如下：</p>
<p>&nbsp;</p>
<table width="100%" bgcolor="#ffffff">
<tbody>
<tr>
<td>int PASCAL FAR WSAAsyncSelect(SOCKET s,HWND hWnd,unsigned int wMsg,long lEvent);</td></tr></tbody></table>
<p>&nbsp;</p>
<p>　　参数说明：<br /><br />　　　hWnd：窗口句柄<br /><br />　　　wMsg：需要发送的消息<br /><br />　　　lEvent：事件（以下为事件的内容）</p>
<p>&nbsp;</p>
<table border="1" cellspacing="0" width="72%">
<tbody>
<tr>
<td>值：</td>
<td>含义：</td></tr>
<tr>
<td>FD_READ</td>
<td>期望在套接字上收到数据（即读准备好）时接到通知</td></tr>
<tr>
<td>FD_WRITE</td>
<td>期望在套接字上可发送数据（即写准备好）时接到通知</td></tr>
<tr>
<td>FD_OOB</td>
<td>期望在套接字上有带外数据到达时接到通知</td></tr>
<tr>
<td>FD_ACCEPT</td>
<td>期望在套接字上有外来连接时接到通知</td></tr>
<tr>
<td>FD_CONNECT</td>
<td>期望在套接字连接建立完成时接到通知</td></tr>
<tr>
<td>FD_CLOSE</td>
<td>期望在套接字关闭时接到通知</td></tr></tbody></table>
<p>&nbsp;</p>
<p>　　例如：我们要在套接字读准备好或写准备好时接到通知，语句如下：</p>
<p>&nbsp;</p>
<table width="100%" bgcolor="#ffffff">
<tbody>
<tr>
<td>rc=WSAAsyncSelect(s,hWnd,wMsg,FD_READ|FD_WRITE);</td></tr></tbody></table>
<p>&nbsp;</p>
<p>　　如果我们需要注销对套接字网络事件的消息发送，只要将 lEvent 设置为0</p>
<p>　　2、异步请求函数<br /><br />　　在 Berkeley Sockets 中请求服务是阻塞的，WINDOWS SICKETS 除了支持这一类函数外，还增加了相应的异步请求函数(WSAAsyncGetXByY();)。 <br /><br />　　3、阻塞处理方法<br /><br />　　Windows Sockets 为了实现当一个应用程序的套接字调用处于阻塞时，能够放弃CPU让其它应用程序运行，它在调用处于阻塞时便进入一个叫&#8220;HOOK&#8221;的例程，此例程负责接收和分配WINDOWS消息，使得其它应用程序仍然能够接收到自己的消息并取得控制权。<br /><br />　　WINDOWS 是非抢先的多任务环境，即若一个程序不主动放弃其控制权，别的程序就不能执行。因此在设计Windows Sockets 程序时，尽管系统支持阻塞操作，但还是反对程序员使用该操作。但由于 SUN 公司下的 Berkeley Sockets 的套接字默认操作是阻塞的，WINDOWS 作为移植的 SOCKETS 也不可避免对这个操作支持。<br /><br />　　在Windows Sockets 实现中，对于不能立即完成的阻塞操作做如下处理：DLL初始化&#8594;循环操作。在循环中，它发送任何 WINDOWS 消息，并检查这个 Windows Sockets 调用是否完成，在必要时，它可以放弃CPU让其它应用程序执行（当然使用超线程的CPU就不会有这个麻烦了^_^）。我们可以调用 WSACancelBlockingCall() 函数取消此阻塞操作。<br /><br />　　在 Windows Sockets 中，有一个默认的阻塞处理例程 BlockingHook() 简单地获取并发送 WINDOWS 消息。如果要对复杂程序进行处理，Windows Sockets 中还有 WSASetBlockingHook() 提供用户安装自己的阻塞处理例程能力；与该函数相对应的则是 SWAUnhookBlockingHook()，它用于删除先前安装的任何阻塞处理例程，并重新安装默认的处理例程。请注意，设计自己的阻塞处理例程时，除了函数 WSACancelBlockingHook() 之外，它不能使用其它的 Windows Sockets API 函数。在处理例程中调用 WSACancelBlockingHook()函数将取消处于阻塞的操作，它将结束阻塞循环。</p>
<p>　　4、出错处理<br /><br />　　Windows Sockets 为了和以后多线程环境（WINDOWS/UNIX）兼容，它提供了两个出错处理函数来获取和设置当前线程的最近错误号。（WSAGetLastEror()和WSASetLastError()）</p>
<p>　　5、启动与终止<br /><br />　　使用函数 WSAStartup() 和 WSACleanup() 启动和终止套接字。</p>
<p>&nbsp;</p>
<p>来自网络</p>
<p>实例</p>
<p>static void* listenconnect(void* param)<br />{<br />int sockfd = socket (PF_UNIX, SOCK_SEQPACKET, 0); //创建本地套接字<br />fcntl(sockfd, F_SETFL, O_NONBLOCK);<br />sockaddr_un myaddr;<br />memset (&amp;myaddr, 0, sizeof(myaddr));<br />myaddr.sun_family = PF_UNIX;<br />strcpy (myaddr.sun_path, "@/brainaire_nvr/trans_serv/socket"); //套接字的名字，任意取<br />myaddr.sun_path[0] = 0;<br />bind (sockfd, (struct sockaddr*)&amp;myaddr, sizeof(myaddr)); //将套接字与它的名字绑定<br />listen(sockfd, 50);</p>
<p>fd_set watchset, listenset, clientset;<br />FD_ZERO(&amp;clientset);<br />FD_ZERO(&amp;watchset);<br />FD_ZERO(&amp;listenset);<br />FD_SET(sockfd, &amp;listenset);<br />int max_listen = sockfd + 1;<br />int max_client = 0;<br />while (!process_exit)<br />{<br />watchset = listenset;<br />struct timeval tv;<br />tv.tv_sec = 0;<br />tv.tv_usec = 1000;<br />if (select(max_listen, &amp;watchset, NULL, NULL, &amp;tv) &gt; 0 &amp;&amp; FD_ISSET(sockfd, &amp;watchset))<br />{<br />struct sockaddr addr;<br />socklen_t len;<br />int clientfd = accept(sockfd, &amp;addr, &amp;len);<br />if (clientfd &lt; 0)<br />perror("accept");<br />else<br />{<br />if (clientfd &gt;= max_client)<br />max_client = clientfd + 1;<br />FD_SET(clientfd, &amp;clientset);<br />}<br />}<br />watchset = clientset;<br />tv.tv_sec = 0;<br />tv.tv_usec = 1000;<br />int ret = select(max_client, &amp;watchset, NULL, NULL, &amp;tv);<br />if (ret &gt; 0)<br />{<br />for (int clientfd = max_client - 1; clientfd &gt; 0; clientfd--)<br />{<br />int flags = 0;<br />char buff[BUFSIZ];<br />int len;<br />if (FD_ISSET(clientfd, &amp;watchset))<br />{<br />len = recv(clientfd, buff, sizeof(buff), flags);<br />if (len &lt;= 0)<br />{<br />FD_CLR(clientfd, &amp;clientset);<br />fprintf(stderr, "[nvradmin] client socket %d closed.\n", clientfd);<br />close(clientfd);<br />if (clientfd == max_client - 1)<br />max_client --;<br />}<br />else<br />{<br />bool monitorworking = false;<br />buff[len] = 0;<br />int monitorID = atoi(buff);<br />if (monitorID != 0)<br />{<br />MyRW_Lock mylock(&amp;monitorlock);<br />#if THREAD_NUM<br />list&lt;MonitorDaemon&gt;&amp; monitors = monitorslists[monitorID%THREAD_NUM];<br />#endif<br />for (list&lt;MonitorDaemon&gt;::iterator intr = monitors.begin(); intr<br />!= monitors.end(); intr ++)<br />{<br />MonitorDaemon m_daemon = *intr;<br />if (m_daemon.monitor == NULL)<br />break;<br />if (m_daemon.monitor-&gt;Id() == monitorID)<br />{<br />fprintf(stderr, "[nvradmin] Start Transmitting RealPlay Data to client socket %d\n", clientfd);<br />monitorworking = (0 == m_daemon.monitor-&gt;StartTransData(clientfd));<br />}<br />}<br />}<br />else<br />fprintf(stderr, "[nvradmin] Received Msgs: len %d, content: %s\n", len, buff);</p>
<p>if(!monitorworking)<br />{<br />FD_CLR(clientfd, &amp;clientset);<br />fprintf(stderr, "[nvradmin] Cannot Start Tranmitting, client Socket %d Closed.\n", clientfd);<br />close(clientfd);<br />if (clientfd == max_client - 1)<br />max_client --;<br />}<br />}<br />}<br />}<br />}<br />if(ret &lt; 0)<br />perror("Select Connected Sockets");<br />usleep(0);<br />}<br />close(sockfd);<br />return 0;<br />}</p>
<p><strong><font size="3">三、MFC CAsyncSocket</font></strong></p>
<p><font size="2"><font face="Times New Roman"></font></font><font size="3" face="Times New Roman">但由于都是直接利用动态连接库wsock32.dll进行操作，实现比较繁琐。其实，为简化套接字编程，MFC 定义了两个套接字类：CAsyncSocket、CSocket。CAsyncSocket类在低层次上对 Windows Sockets API 进行了封装，其成员函数和 Windows Sockets API 函数直接相对应 。一个CAsyncSocket对 象 就 代 表 了一 个 套 接 字。而CSocket继承于CAsyncSocket 类，是对 Windows Sockets API 的高级封装。<br /><font color="#0000ff">建立Socket的WSAStartup过程和bind过程被简化成为Create过程，</font><font color="#0000ff">IP地址类型转换、主机名和IP地址转换的过程中许多复杂的变量类型都被简化成字符串和整数操作，特别是CAsyncSocket类的异步特点，完全可以替代繁琐的线程操作。<br /></font>一、1.CAsyncSocket 类直接派生于CObject类，称为异步套接字对象。<font color="#0000ff">由于 CAsyncSocket类的构造函数不带参数</font></font><font size="3" face="Times New Roman"><font color="#0000ff">，需要调用起成员函数 Create 来创建底层的套接字句柄，</font>决定套接字对象的具体特性，并绑定它的地址。<br />BOOL Create( UINT nSocketPort=0，<br />Int nSocketType = SOCK_STREAM,<br />Long Ievent=FD_READ|FD_WRITE|FD_OOB|FD_ACCEPT|FD_CONNECT|FD_CLOSE,<br />LPCTSTR lpszSocketAddress = NULL ); </font></p>
<p><font size="3" face="Times New Roman">CAsyncSocket 类的 6 种网络事件<br />事 件 涵 义 对应处理函数<br />FD_ACCEPT 通知侦听套接字当前有连接请求可以接受 OnAccept(int nErrorCode); <br />FD_CONNECT 通知请求连接的套接字，连接要求已被处理 OnConnect(int nErrorCode); <br />FD_CLOSE 通知套接字与其连接的套接字已关闭 OnClose(int nErrorCode); <br />FD_READ 通知有数据到达 OnReceive(int nErrorCode);<br />FD_WRITE 通知可以发送数据 OnSend(int nErrorCode); <br />FD_OOB 通知将有外带数据到达 OnOutOfBandData(int ErrorCode);</font></p>
<p><font size="3" face="Times New Roman">当某个网络事件发生时，MFC 框架把消息发送给相应的套接字对象，相当于给了该对象一个通知，告诉它某个重</font><font size="3" face="Times New Roman">要的事件已经发生，<font color="#0000ff">接着<strong>自动调用</strong>该对象的事件处理函数。</font></font></p>
<p><font size="3" face="Times New Roman">2.如果从 CAsyncSocket 类派生了自己的套接字类，则必须重载某些网络事件所对应的通知函数。<br />3.<font color="#0000ff">服务器端<br />与Winsock不同，CAsyncSocket服务端不用绑定(Bind)，不用连接(Connect)。</font><br />正常情况下，服务器端必须首先创建一个 CAsyncSocket 套接字对象，并调用它的 Create成员函数创建底层套接字</font><font size="3" face="Times New Roman">句柄。这个套接字对象专门用来侦听来自客户机的连接请求，所以称它为侦听套接字对象。再调用侦听套接字对象的 </font></p>
<p><font size="3" face="Times New Roman">Listen 函数，使侦听套接字对象开始侦听来自客户端的连接请求。<br />(1) 当 Listen 函数确认并接纳了一个客户端连接请求后，触发 FD_ACCEPT 事件，侦听套接字收到通知，MFC 框</font><font size="3" face="Times New Roman">架<font color="#0000ff">自动调用</font>侦听套接字的 OnAccept 事件处理函数。一般需要重载 OnAccept 函数，再在其中调用侦听套接字对象的 </font></p>
<p><font size="3" face="Times New Roman">Accept 函数。<br />(2) 创建一个新的空套接字对象，专门用来与客户端连接并进行数据的传输，一般称为连接套接字，并作为参数传</font><font size="3" face="Times New Roman">递给下一步的 Accept 成员函数。m_sListenSocket.Accept(m_sConnectSocket);<br />4.客户端<br />客户端请求连接到服务器端，在服务器端套接字对象已经进入侦听状态之后，客户应用程序可以调用CAsyncSocket类的 Connect 成员函数，向服务器发出一个连接请求。调用结束返回时发生FD_CONNECT事件，MFC 框架会<font color="#0000ff">自动调用</font>客</font><font size="3" face="Times New Roman">户端套接字的 OnConnect 事件处理函数。<br />CSocket 类是 CAsyncSocket 的派生类。创建 CSocket 对象时，首先要调用 CSocket 类<br />的构造函数创建一个空的 CSocket 对象，再调用其 Create 成员函数，创建对象的底层套<br />接字。</font></p>
<p><font size="3" face="Times New Roman">BOOL Create(<br />UINT nSocketPort = 端口号，<br />Int nSocketPort = SOCK_STREAM | SOCK_DGRAM，<br />LPCTSTR lpszSocketAddress = 套接字所用的网络地址 )；<br />二、CSocket 类使用基类 CAsyncSocket 的同名成员函数 Connect、Listen、Accept 来建立服务器和客户机套接字之</font><font size="3" face="Times New Roman">间的连接，使用方法基本相同。在创建 CSocket 类对象后，对于流式套接字，首先在服务器和客户机之间建立连接，然后使用 Send 函数、Receive 函数来发送和接收数据。<br />需要注意的是，CSocket对象从不调用OnConnect和OnSend事件处理函数。CSocket类继承了 CAsyncSocket 类的许</font><font size="3" face="Times New Roman">多成员函数，用法基本一致。CSocket类的高级性主要表现在3个方面。<br />(1) CSocket 结合 CArchive 类来使用套接字。<br />(2) CSocket 管理了通信的许多方面，比如字节顺序问题和字符串转换问题。<br />(3) CSocket 类为 Windows 消息的后台处理提供了阻塞的工作模式。有关阻塞的概念读者可参阅相关文献资料，此处</font><font size="3" face="Times New Roman">不再赘述。<br />因此，一般将 CSocket 与 CArchive、CSocketFile 类相结合，来发送和接收数据，这将使编程更为简单。</font></p>
<p><font size="3" face="Times New Roman">===============================================================================<br />---- 一个Echo例程来介绍CAsyncSocket类的用法。 </font></p>
<p><font size="3" face="Times New Roman">---- 一． 客户端 </font></p>
<p><font size="3" face="Times New Roman">---- 1． 创建一个Dialog Based项目：CSockClient。 </font></p>
<p><font size="3" face="Times New Roman">---- 2． 设计对话框 </font></p>
<p><font size="3" face="Times New Roman">---- 去掉Ok和Cancle两个按钮，增加ID_Connect（连接）、ID_Send（发送）、ID_Exit（关闭）按钮，增加ListBox控</font><font size="3" face="Times New Roman">件IDC_LISTMSG和Edit控件IDC_EDITMSG，并按下表在ClassWizard中为CCSockClientDlg类添加变量。 </font></p>
<p><font size="3" face="Times New Roman">Control ID Type Member<br /><br />IDC_EDITMSG CEdit m_MSG<br />IDC_LISTMSG ClistBox m_MSGS</font></p>
<p><font size="3" face="Times New Roman">---- 3． CAsyncSocket类用DoCallBack函数处理MFC消息，当一个网络事件发生时，DoCallBack函数按网络事件类型：</font><font size="3" face="Times New Roman">FD_READ、FD_WRITE、FD_ACCEPT、FD_CONNECT分别调用OnReceive、OnSend、OnAccept、OnConnect函数。由于MFC把这</font><font size="3" face="Times New Roman">些事件处理函数定义为虚函数，所以要生成一个新的C++类，以重载这些函数，做法如下： </font></p>
<p><font size="3" face="Times New Roman">---- 以Public方式继承CAsyncSocket类，生成新类MySock； </font></p>
<p><font size="3" face="Times New Roman">---- 为MySock类添加虚函数OnReceive、OnConnect、OnSend </font></p>
<p><font size="3" face="Times New Roman">---- 4． 在MySock.**中添加以下代码 </font></p>
<p><font size="3" face="Times New Roman">#include "CSockClient.h"<br />#include "CSockClientDlg.h"</font></p>
<p><font size="3" face="Times New Roman">---- 5． 在MySock.h中添加以下代码 </font></p>
<p><font size="3" face="Times New Roman">public:<br />BOOL m_bConnected; //是否连接<br />UINT m_nLength; //消息长度<br />char m_szBuffer[4096]; //消息缓冲区</font></p>
<p><font size="3" face="Times New Roman">---- 6． 在MySock.**中重载各函数 </font></p>
<p><font size="3" face="Times New Roman">MySock::MySock()<br />{<br />m_nLength=0;<br />memset(m_szBuffer,0,sizeof(m_szBuffer));<br />m_bConnected=FALSE;<br />}</font></p>
<p><font size="3" face="Times New Roman">MySock::~MySock()<br />{<br />//关闭套接字<br />if(m_hSocket!=INVALID_SOCKET)<br />Close();<br />}</font></p>
<p><font size="3" face="Times New Roman">void MySock::OnReceive(int nErrorCode) <br />{<br />m_nLength=Receive(m_szBuffer,sizeof(m_szBuffer),0);<br />//下面两行代码用来获取对话框指针<br />CCSockClientApp* pApp=(CCSockClientApp*)AfxGetApp();<br />CCSockClientDlg* pDlg=(CCSockClientDlg*)pApp- &gt;m_pMainWnd;<br />pDlg- &gt;m_MSGS.InsertString(0,m_szBuffer);<br />memset(m_szBuffer,0,sizeof(m_szBuffer));<br />CAsyncSocket::OnReceive(nErrorCode);<br />}</font></p>
<p><font size="3" face="Times New Roman">void MySock::OnSend(int nErrorCode) <br />{<br />Send(m_szBuffer,m_nLength,0);<br />m_nLength=0;<br />memset(m_szBuffer,0,sizeof(m_szBuffer));<br />//继续提请一个&#8220;读&#8221;的网络事件，接收Server消息<br />AsyncSelect(FD_READ);<br />CAsyncSocket::OnSend(nErrorCode);<br />}</font></p>
<p><font size="3" face="Times New Roman">void MySock::OnConnect(int nErrorCode) <br />{<br />if (nErrorCode==0)<br />{<br />m_bConnected=TRUE;<br />CCSockClientApp* pApp=(CCSockClientApp*)AfxGetApp();<br />CCSockClientDlg* pDlg=(CCSockClientDlg*)pApp- &gt;m_pMainWnd;<br />memcpy(m_szBuffer,"Connected to ",13);<br />strncat(m_szBuffer,pDlg- &gt;m_szServerAdr,<br />sizeof(pDlg- &gt;m_szServerAdr));<br />pDlg- &gt;m_MSGS.InsertString(0,m_szBuffer);<br />AsyncSelect(FD_READ); ////提请一个&#8220;读&#8221;的网络事件，准备接收<br />}<br />CAsyncSocket::OnConnect(nErrorCode);<br />}</font></p>
<p><font size="3" face="Times New Roman">---- 7． 新建对话框IDD_Addr，用来输入IP地址和Port；生成新类CAddrDlg。增加两个Edit控件：IDC_Addr、</font><font size="3" face="Times New Roman">IDC_Port按下表在ClassWizard中为CAddrDlg类添加变量。 </font></p>
<p><font size="3" face="Times New Roman">Control ID Type Member</font></p>
<p><font size="3" face="Times New Roman">IDC_Addr CString m_Addr<br />IDC_Port Int m_Port</font></p>
<p><font size="3" face="Times New Roman">---- 8． 在CSockClientDlg.h中添加代码 </font></p>
<p><font size="3" face="Times New Roman">#include "AddrDlg.h"<br />protected:<br />int TryCount;<br />MySock m_clientSocket;<br />UINT m_szPort;<br />public:<br />char m_szServerAdr[256]; </font></p>
<p><font size="3" face="Times New Roman">---- 9． 双击IDD_CSOCKCLIENT_DIALOG对话框中的&#8220;连接&#8221;按钮，添加以下代码 </font></p>
<p><font size="3" face="Times New Roman">void CCSockClientDlg::OnConnect() <br />{<br />m_clientSocket.ShutDown(2);<br />m_clientSocket.m_hSocket=INVALID_SOCKET;<br />m_clientSocket.m_bConnected=FALSE;<br />CAddrDlg m_Dlg;<br />//默认端口1088<br />m_Dlg.m_Port=1088;<br />if (m_Dlg.DoModal()==IDOK &amp;&amp; !m_Dlg.m_Addr.IsEmpty())<br />{<br />memcpy(m_szServerAdr,m_Dlg.m_Addr,sizeof(m_szServerAdr));<br />m_szPort=m_Dlg.m_Port;<br />//建立计时器，每1秒尝试连接一次，直到连上或TryCount&gt;10<br />SetTimer(1,1000,NULL);<br />TryCount=0;<br />}<br />}</font></p>
<p><font size="3" face="Times New Roman">---- 10． 添加Windows消息WM_TIMER响应函数OnTimer </font></p>
<p><font size="3" face="Times New Roman">void CCSockClientDlg::OnTimer(UINT nIDEvent) <br />{<br />if (m_clientSocket.m_hSocket==INVALID_SOCKET)<br />{<br />BOOL bFlag=m_clientSocket.Create(0,SOCK_STREAM,FD_CONNECT);<br />if(!bFlag)<br />{<br />AfxMessageBox("Socket Error!");<br />m_clientSocket.Close();<br />PostQuitMessage(0);<br />return;<br />}<br />}<br />m_clientSocket.Connect(m_szServerAdr,m_szPort);<br />TryCount++;<br />if (TryCount &gt;=10 || m_clientSocket.m_bConnected)<br />{ <br />KillTimer(1);<br />if (TryCount &gt;=10)<br />AfxMessageBox("Connect Failed!");<br />return;<br />}<br />CDialog::OnTimer(nIDEvent);<br />}</font></p>
<p><font size="3" face="Times New Roman">---- 11． 双击IDD_CSOCKCLIENT_DIALOG对话框中的&#8220;发送&#8221;按钮，添加以下代码 </font></p>
<p><font size="3" face="Times New Roman">void CCSockClientDlg::OnSend() <br />{<br />if (m_clientSocket.m_bConnected)<br />{<br />m_clientSocket.m_nLength=m_MSG.GetWindowText<br />(m_clientSocket.m_szBuffer, sizeof(m_clientSocket.m_szBuffer));<br />m_clientSocket.AsyncSelect(FD_WRITE);<br />m_MSG.SetWindowText("");<br />}<br />}</font></p>
<p><font size="3" face="Times New Roman">---- 12． 双击IDD_CSOCKCLIENT_DIALOG对话框中的&#8220;关闭&#8221;按钮，添加以下代码 </font></p>
<p><font size="3" face="Times New Roman">void CCSockClientDlg::OnExit() <br />{<br />//关闭Socket<br />m_clientSocket.ShutDown(2);<br />//关闭对话框<br />EndDialog(0); <br />}</font></p>
<p><font size="3" face="Times New Roman">----<br />12．运行此项目，连接时输入主机名或IP均可，CAsyncSocket类会自动处理。<br />----<br />二． 服务端<br />----<br />Server端的编程与Client端的类似，下面主要介绍他的Listen及Accept函数<br />----<br />1． 建立一个CNewSocket类，重载CAsyncSocket类的OnReceive、OnSend函数，如何进行信息的显示和发送可以参考</font><font size="3" face="Times New Roman">Client程序。本例中采用将收到信息原封不动发回的方法来实现Echo功能，代码如下<br />CNewSocket：：OnReceive（int nErrorCOde）<br />{<br />m_nLength=Receive（m_szBuffer，sizeof（m_szBuffer），0）；<br />// 直接转发消息<br />AsyncSelect（FD_WRITE）；<br />}</font></p>
<p><font size="3" face="Times New Roman">CNewSocket：：OnSend（int nErrorCode）<br />{<br />Send（m_szBuffer，m_nLength，0）；<br />}</font></p>
<p><font size="3" face="Times New Roman">----<br />2． 建立一个CMyServerSocket类，重载CAsyncSocket类的OnAccept函数代码如下<br />----<br />在MyServerSocket.h中声明变量<br />public:：<br />CNewSocket* m_pSocket；</font></p>
<p><font size="3" face="Times New Roman">void CMyServerSocket：：OnAccept（int nErrorCode）<br />{<br />//侦听到连接请求，调用Accept函数<br />CNewSocket* pSocket = new CNewSocket（）；<br />if （Accept（*pSocket））<br />{<br />pSocket- &gt;AsyncSelect（FD_READ）；<br />m_pSocket=pSocket；<br />}<br />else<br />delete pSocket；<br />}</font></p>
<p><font size="3" face="Times New Roman">----<br />3． 为对话框添加一个&#8220;侦听&#8221;按钮，添加如下代码<br />----<br />在CsockServerDlg.**中声明变量<br />public：<br />CMyServerSocket m_srvrSocket;<br />void CCSockServerDlg：：OnListen（）<br />{<br />if （m_srvrSocket.m_hSocket==INVALID_SOCKET）<br />{<br />BOOL bFlag=m_srvrSocket.Create<br />(UserPort，SOCK_STREAM，FD_ACCEPT)；<br />if （！bFlag）<br />{<br />AfxMessageBox（&#8220;Socket Error！&#8221;）；<br />M_srvrSocket.Close（）；<br />PostQuitMessage（0）；<br />Return；<br />}<br />}<br />//&#8220;侦听&#8221;成功，等待连接请求<br />if （！m_srvrSocket。Listen（1））<br />{<br />int nErrorCode = m_srvrSocket.GetLastError（）；<br />if （nError！=WSAEWOULDBLOCK）<br />{<br />AfxMessageBox（&#8220;Socket Error！&#8221;）；<br />M_srvrSocket.Close（）；<br />PostQuitMessage（0）；<br />Return；<br />}<br />}<br />}</font></p>
<p><font size="3" face="Times New Roman">----<br />4． 目前程序只能实现Echo功能，将信息原封不动的转发，若能将Accept中由CNewSocket* pSocket = new </font><font size="3" face="Times New Roman">CNewSocket（）；得到的Socket指针存入一个CList或一个数组中，便像Client端那样，对所有的连接进行读写控制<font face="Verdana">。</font></font></p><img src ="http://www.cppblog.com/xylyan/aggbug/173599.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/xylyan/" target="_blank">意吟</a> 2012-05-03 19:22 <a href="http://www.cppblog.com/xylyan/archive/2012/05/03/173599.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>开篇</title><link>http://www.cppblog.com/xylyan/archive/2012/01/13/164123.html</link><dc:creator>意吟</dc:creator><author>意吟</author><pubDate>Fri, 13 Jan 2012 08:27:00 GMT</pubDate><guid>http://www.cppblog.com/xylyan/archive/2012/01/13/164123.html</guid><wfw:comment>http://www.cppblog.com/xylyan/comments/164123.html</wfw:comment><comments>http://www.cppblog.com/xylyan/archive/2012/01/13/164123.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/xylyan/comments/commentRss/164123.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/xylyan/services/trackbacks/164123.html</trackback:ping><description><![CDATA[试验！<img src ="http://www.cppblog.com/xylyan/aggbug/164123.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/xylyan/" target="_blank">意吟</a> 2012-01-13 16:27 <a href="http://www.cppblog.com/xylyan/archive/2012/01/13/164123.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>