﻿<?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++博客-hitme</title><link>http://www.cppblog.com/hitme/</link><description /><language>zh-cn</language><lastBuildDate>Wed, 15 Apr 2026 00:27:17 GMT</lastBuildDate><pubDate>Wed, 15 Apr 2026 00:27:17 GMT</pubDate><ttl>60</ttl><item><title>求助。关于如何将文件映射成STL容器内存空间的方法。</title><link>http://www.cppblog.com/hitme/archive/2010/12/10/136067.html</link><dc:creator>HIT@ME</dc:creator><author>HIT@ME</author><pubDate>Fri, 10 Dec 2010 08:18:00 GMT</pubDate><guid>http://www.cppblog.com/hitme/archive/2010/12/10/136067.html</guid><wfw:comment>http://www.cppblog.com/hitme/comments/136067.html</wfw:comment><comments>http://www.cppblog.com/hitme/archive/2010/12/10/136067.html#Feedback</comments><slash:comments>6</slash:comments><wfw:commentRss>http://www.cppblog.com/hitme/comments/commentRss/136067.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/hitme/services/trackbacks/136067.html</trackback:ping><description><![CDATA[&nbsp;&nbsp; &nbsp;我想写一个爬虫程序。现在需要存放访问过的URL。如果用数据库存放则太慢，若放在默认的SET容器中，当到达一定数量时会使程序崩溃。<div>现在我想把文件直接映射成set&lt;string&gt;容器的空间。也就是set申请的内存全部在我所指定的文件中。</div><div>另外程序可用4G空间中有2G是系统保留的。如果进行文件映射后，是不是也只能访问2G的空间？</div><div>最后，我想问问，如果我进行了文件映射，同时又从实际内存中申请了一快内存，如何保证映射的地址和从内存中申请的地址不重复呢？</div><div>请大家帮帮忙，最后有源码或网站参考。</div><img src ="http://www.cppblog.com/hitme/aggbug/136067.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/hitme/" target="_blank">HIT@ME</a> 2010-12-10 16:18 <a href="http://www.cppblog.com/hitme/archive/2010/12/10/136067.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>有没有更快的办法来统计一篇文章中的词组数量并排序输出（挑战速度）！</title><link>http://www.cppblog.com/hitme/archive/2009/09/03/95217.html</link><dc:creator>HIT@ME</dc:creator><author>HIT@ME</author><pubDate>Thu, 03 Sep 2009 08:05:00 GMT</pubDate><guid>http://www.cppblog.com/hitme/archive/2009/09/03/95217.html</guid><wfw:comment>http://www.cppblog.com/hitme/comments/95217.html</wfw:comment><comments>http://www.cppblog.com/hitme/archive/2009/09/03/95217.html#Feedback</comments><slash:comments>16</slash:comments><wfw:commentRss>http://www.cppblog.com/hitme/comments/commentRss/95217.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/hitme/services/trackbacks/95217.html</trackback:ping><description><![CDATA[<p>我现在需要统计一篇文章中的单词数量，并排序输出。<br>格式<br><br>单词1 500<br>单词2 499<br>单词3 300<br>.....<br>...<br>..<br>.<br><br>现在的思路是<br>第一步：先将单词读入到map&lt;string,size_t&gt; ssmap；当中；这样每次扫描到一个新单词后都可以++ssmap[str]；来统计单词数；<br>第二步：将map中的内容拷贝到vector&lt;pair&lt;string*,size_t&gt; &gt; vec；当中，之后对vec用sort进行排序。（之所以要用string*是因为不希望发生string的拷贝构造，以免浪费时间）。<br>第三步：将vec输出。<br><br>试验了一下上述方法可以正确执行。<br>但我想应该有更快的方法，请各位赐教一下！<br><br><br>呵呵，谢谢大家这么积极。<br><br>字符串长度没有限制，这个从一个分词程序对文章进行分词处理以后的结果。单词可能是&#8220;的，了&#8221;这种单个字，也可能是&#8220;中华人民共和国&#8221;这种字符串。还有可能遇到像&#8220;\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\...(n个)&#8221;这种比较变态的符号。</p>
<img src ="http://www.cppblog.com/hitme/aggbug/95217.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/hitme/" target="_blank">HIT@ME</a> 2009-09-03 16:05 <a href="http://www.cppblog.com/hitme/archive/2009/09/03/95217.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>成功在自己的类中加入random_access_iterator。</title><link>http://www.cppblog.com/hitme/archive/2009/08/20/93884.html</link><dc:creator>HIT@ME</dc:creator><author>HIT@ME</author><pubDate>Thu, 20 Aug 2009 02:06:00 GMT</pubDate><guid>http://www.cppblog.com/hitme/archive/2009/08/20/93884.html</guid><wfw:comment>http://www.cppblog.com/hitme/comments/93884.html</wfw:comment><comments>http://www.cppblog.com/hitme/archive/2009/08/20/93884.html#Feedback</comments><slash:comments>4</slash:comments><wfw:commentRss>http://www.cppblog.com/hitme/comments/commentRss/93884.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/hitme/services/trackbacks/93884.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 最近在百度知道上回答了一道问题，并为他封装了一个类来解决。大意是不开辟新的数组同时排序两个数组。<br>http://zhidao.baidu.com/question/112777967.html<br><br>之后想要给这个类添加iterator好直接使用sort之类的函数，经过1个多小时的忙碌（能力有限，可以鄙视一下），终于实现了random_access_iterator.<br>&nbsp;&nbsp;<a href='http://www.cppblog.com/hitme/archive/2009/08/20/93884.html'>阅读全文</a><img src ="http://www.cppblog.com/hitme/aggbug/93884.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/hitme/" target="_blank">HIT@ME</a> 2009-08-20 10:06 <a href="http://www.cppblog.com/hitme/archive/2009/08/20/93884.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>虚拟文件加密系统</title><link>http://www.cppblog.com/hitme/archive/2009/08/18/93697.html</link><dc:creator>HIT@ME</dc:creator><author>HIT@ME</author><pubDate>Tue, 18 Aug 2009 05:32:00 GMT</pubDate><guid>http://www.cppblog.com/hitme/archive/2009/08/18/93697.html</guid><wfw:comment>http://www.cppblog.com/hitme/comments/93697.html</wfw:comment><comments>http://www.cppblog.com/hitme/archive/2009/08/18/93697.html#Feedback</comments><slash:comments>4</slash:comments><wfw:commentRss>http://www.cppblog.com/hitme/comments/commentRss/93697.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/hitme/services/trackbacks/93697.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 闲来无事，给一个虚拟文件磁盘的驱动加上了一个GUI。有兴趣的可以看看。（技术含量不高）&nbsp;&nbsp;<a href='http://www.cppblog.com/hitme/archive/2009/08/18/93697.html'>阅读全文</a><img src ="http://www.cppblog.com/hitme/aggbug/93697.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/hitme/" target="_blank">HIT@ME</a> 2009-08-18 13:32 <a href="http://www.cppblog.com/hitme/archive/2009/08/18/93697.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>关于boost库中shared_ptr执行速度的简单测试</title><link>http://www.cppblog.com/hitme/archive/2009/06/30/88935.html</link><dc:creator>HIT@ME</dc:creator><author>HIT@ME</author><pubDate>Tue, 30 Jun 2009 13:09:00 GMT</pubDate><guid>http://www.cppblog.com/hitme/archive/2009/06/30/88935.html</guid><wfw:comment>http://www.cppblog.com/hitme/comments/88935.html</wfw:comment><comments>http://www.cppblog.com/hitme/archive/2009/06/30/88935.html#Feedback</comments><slash:comments>14</slash:comments><wfw:commentRss>http://www.cppblog.com/hitme/comments/commentRss/88935.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/hitme/services/trackbacks/88935.html</trackback:ping><description><![CDATA[<p>记得以前在一本书上看过boost::shared_ptr的回带来一定的效率损失,但是并不大.今天闲来无事,编译了一个BOOST并简单测试了一下,看看到底有多少性能损失.测试代码和结果如下:<br><br>比较函数<br>template &lt;class T&gt; <br>class compareP<br>{<br>public:<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; bool operator() (const T lh,const T rh) const<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; {<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; return *lh&lt;*rh;<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; }<br><br>};<br><br><br>boost:<br>int _tmain(int argc, _TCHAR* argv[])<br>{<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; DWORD oldtime = GetTickCount();<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; typedef map&lt;boost::shared_ptr&lt;string&gt;,size_t,compareP&lt;boost::shared_ptr&lt;string&gt; &gt; &gt; container_type;<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; typedef container_type::iterator iterator;<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; container_type container;<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; for (size_t i(0) ; i&lt;500000 ; ++i)<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; {<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; boost::shared_ptr&lt;string&gt; pstr(new string);<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; char buffer[32];<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; *pstr = itoa(i,buffer,10);<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; container[pstr]=0;<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; }<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; cout&lt;&lt;GetTickCount() - oldtime &lt;&lt;endl;<br>return EXIT_SUCCESS;<br>}<br><br>boost结果:<br>2000<br>2015<br>2015<br>2016<br>2017<br><br><br>指针:<br>int _tmain(int argc, _TCHAR* argv[])<br>{<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; DWORD oldtime = GetTickCount();<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; typedef map&lt;string*,size_t,compareP&lt;string*&gt; &gt; container_type;<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; typedef container_type::iterator iterator;<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; container_type container;<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; for (size_t i(0) ; i&lt;500000 ; ++i)<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; {<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; string *pstr = new string;<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; char buffer[32];<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; *pstr = itoa(i,buffer,10);<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; container[pstr]=0;<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; }<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; cout&lt;&lt;GetTickCount() - oldtime &lt;&lt;endl;<br>return EXIT_SUCCESS;<br>}<br><br>指针结果:<br>937<br>938<br>954<br>953<br>953<br><br>执行速度已经相差一倍了.自动内存管理的代价啊!~~~~<br>环境:Q8200 2.33GHZ 4G内存<br><br>以上只是简单的测试,仅拱参考</p>
<p><br></p>
<p><span style="COLOR: red; FONT-SIZE: 36pt">补充说明：</span></p>
<p>很多朋友流言说在MAP中存放string*没有意义。可是我上一个项目就需要这么做。</p>
<p>试想我现在有10篇文档，现在需要统计每篇文档当中每个字出现的次数，还需要统计全部文章中全部字出现的次数。为了保证效率，应当保证每个字在内存当中只留一份拷贝（因为以后有可能统计每个词，甚至每句话出现的次数）。要实现这个功能，是否还有更好的算法？</p>
<p><br></p>
<p>还有朋友流言说指针版没有销毁string指针。可是在这个程序中执行cout&lt;&lt;GetTickCount() - oldtime &lt;&lt;endl;之前shared_ptr也没有释放资源。所以资源的释放不会造成误差。</p>
<p>luck朋友的方法最为有效，把比较函数变成：</p>
<p>bool operator() (const T &amp;lh,const T &amp;rh) const</p>
<p>&nbsp;&nbsp; &nbsp; &nbsp; &nbsp;{</p>
<p>&nbsp;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;return *lh&lt;*rh;</p>
<p>&nbsp;&nbsp; &nbsp; &nbsp; &nbsp;}</p>
<p>下面是shared_ptr执行5次的时间：</p>
<p>968</p>
<p>969</p>
<p>985</p>
<p>969</p>
<p>969</p>
<p><br></p>
<p>下面是string*执行5次的时间：</p>
<p>859</p>
<p>875</p>
<p>860</p>
<p>859</p>
<p>860</p>
<p><br></p>
<p>看来即使是小对象也不能放松！当很多小对象发生构造和析构时所耗费的时间还是不容小视的！~</p>
<img src ="http://www.cppblog.com/hitme/aggbug/88935.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/hitme/" target="_blank">HIT@ME</a> 2009-06-30 21:09 <a href="http://www.cppblog.com/hitme/archive/2009/06/30/88935.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>非法信息识别系统</title><link>http://www.cppblog.com/hitme/archive/2009/06/12/87529.html</link><dc:creator>HIT@ME</dc:creator><author>HIT@ME</author><pubDate>Fri, 12 Jun 2009 13:38:00 GMT</pubDate><guid>http://www.cppblog.com/hitme/archive/2009/06/12/87529.html</guid><wfw:comment>http://www.cppblog.com/hitme/comments/87529.html</wfw:comment><comments>http://www.cppblog.com/hitme/archive/2009/06/12/87529.html#Feedback</comments><slash:comments>2</slash:comments><wfw:commentRss>http://www.cppblog.com/hitme/comments/commentRss/87529.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/hitme/services/trackbacks/87529.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 大学毕业了！！上来感叹一下！并拿出自己的毕业设计分享一下。<br>这个小东西是用了一个星期完成的。BUG肯定不少，大家凑合着看一下吧。感觉有趣的就拿去玩玩。<br>说说基本思路。<br>1.对文件进行分词处理<br>2.通过统计训练文档当中的词频方差，构造评判矩阵<br>3.之后在构造待分类文档的评判向量<br>4.用评判向量和构造矩阵相乘，选出最接近的分类。<br>程序文件：<br>&nbsp;&nbsp;<a href='http://www.cppblog.com/hitme/archive/2009/06/12/87529.html'>阅读全文</a><img src ="http://www.cppblog.com/hitme/aggbug/87529.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/hitme/" target="_blank">HIT@ME</a> 2009-06-12 21:38 <a href="http://www.cppblog.com/hitme/archive/2009/06/12/87529.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>中国象棋程序开发笔记   --遇到困难，大家帮忙！！</title><link>http://www.cppblog.com/hitme/archive/2008/12/29/70596.html</link><dc:creator>HIT@ME</dc:creator><author>HIT@ME</author><pubDate>Sun, 28 Dec 2008 16:30:00 GMT</pubDate><guid>http://www.cppblog.com/hitme/archive/2008/12/29/70596.html</guid><wfw:comment>http://www.cppblog.com/hitme/comments/70596.html</wfw:comment><comments>http://www.cppblog.com/hitme/archive/2008/12/29/70596.html#Feedback</comments><slash:comments>18</slash:comments><wfw:commentRss>http://www.cppblog.com/hitme/comments/commentRss/70596.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/hitme/services/trackbacks/70596.html</trackback:ping><description><![CDATA[<span style="FONT-SIZE: 12pt">2008.12.29<br>&nbsp;&nbsp; 昨天晚上终于把象棋的棋盘画出来了！<br>&nbsp;&nbsp; 今天则需要把棋子初始化，之后放到象棋开局的位置上。（这个工作也顺利完成了）<br>&nbsp;&nbsp; 现在的工作是如何在CplayDlg类上面移动棋子。现在的思路是在棋盘类当中加入一个二维数组，将屏幕坐标和棋盘的逻辑坐标一一对应，以方便查找。然后将选定棋子move到新的位置，再调用OnPaint();<br>&nbsp;&nbsp;&nbsp;顺便说一下现在程序当中的类<br>&nbsp;&nbsp; CplayDlg----MFC生成的主要类<br>&nbsp;&nbsp; CCheckerman----自己写的棋子类。主要方法就是MOVE。<br>&nbsp;&nbsp; CChessboard----自己写的棋盘类。负责画出棋盘，并且建立屏幕坐标和棋盘逻辑坐标的对应关系~！<br>目前界面做到这个程度了。30号先回学校考试。之后听完今年的维也纳音乐会再来继续做吧~！<img height=495 alt="" src="http://www.cppblog.com/images/cppblog_com/hitme/xiangqi.jpg" width=444 border=0><br><br>顺便说一下。这个棋盘是我自己一笔一笔用VC画出来的。真费劲啊！还有那些棋子的素材也来之不易。我把一个象棋游戏当中的资源给拔下来了！又需要素材或者源程序的朋友请邮件联系！~<br><br><br>ps:这个游戏的四大目标<br>&nbsp;&nbsp; 1、实现双人同机对战<br>&nbsp;&nbsp; 2、实现双人网络对战<br>&nbsp;&nbsp; 3、实现人机对战<br>&nbsp;&nbsp; 4、加入后台数据库实现用户注册和积分等功能。注册部分希望可以独立的使用Ruby on Rails写出来！<br><br>小弟初学乍练。不到之处多多包涵！</span> <br><br><br><span style="FONT-SIZE: 12pt">2008.12.31<br>&nbsp;&nbsp; 在2008年最后一天的下午，我又想写一写这个想起程序了。<br>&nbsp; 目前遇到的问题是由于使用DrawIconEx等函数实现棋子的移动效果的时候屏幕会出现闪烁！请问各位如何防止这种情况的出现呢？换句话说就是在调用OnPaint函数的时候，只刷新当前棋子位置的屏幕，而其他部分则不刷新！<br>&nbsp; 第二个问题是我想用GDI+来显示ICO图像。可是却失败了，源码如下&#8230;&#8230;<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Image image(L"C:\\Users\\Administrator\\Desktop\\ico128.ico");<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; CRect rect;<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; GetWindowRect(&amp;rect);<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Graphics graphics(hdc);<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; graphics.DrawImage(&amp;image, 0, 0,rect.Width(),rect.Height());<br>&nbsp;但是当把imang参数变为L"C:\\Users\\Administrator\\Desktop\\i200831313448532_2.jpg就能显示出来。不知道是不是GDI+不支持ICO格式呢？（我又检查了一遍，路径没有问题！）;<br>&nbsp; 请各位老大赐教一下吧！~<br><br></span>
<img src ="http://www.cppblog.com/hitme/aggbug/70596.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/hitme/" target="_blank">HIT@ME</a> 2008-12-29 00:30 <a href="http://www.cppblog.com/hitme/archive/2008/12/29/70596.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>