??xml version="1.0" encoding="utf-8" standalone="yes"?>狼狼综合久久久久综合网,国产精品99久久久久久董美香 ,国产高潮国产高潮久久久91 http://www.shnenglu.com/shootingstars/zh-cnWed, 07 May 2025 23:43:00 GMTWed, 07 May 2025 23:43:00 GMT60[导入]C++中关于类中常数静态成员初始化的问?/title><link>http://www.shnenglu.com/shootingstars/archive/2007/07/31/29071.html</link><dc:creator>shootingstars</dc:creator><author>shootingstars</author><pubDate>Tue, 31 Jul 2007 05:17:00 GMT</pubDate><guid>http://www.shnenglu.com/shootingstars/archive/2007/07/31/29071.html</guid><wfw:comment>http://www.shnenglu.com/shootingstars/comments/29071.html</wfw:comment><comments>http://www.shnenglu.com/shootingstars/archive/2007/07/31/29071.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.shnenglu.com/shootingstars/comments/commentRss/29071.html</wfw:commentRss><trackback:ping>http://www.shnenglu.com/shootingstars/services/trackbacks/29071.html</trackback:ping><description><![CDATA[class mytestclass <br>{ <br>public: <br>    const static int i = 5; <br>}; <br>int main() <br>{ <br>    std::cout<<mytestclass::i<<std::endl; <br>    return 0; <br>} <br>l果没有问题Q输Zؓ(f)5Q编译器为vc7.1Q? <p>但是在下面这个例子中Q?<br>int regi() <br>{ <br>    return 5; <br>} <br>class mytestclass <br>{ <br>public: <br>    const static int i = regi(); <br>}; <br>int main() <br>{ <br>    std::cout<<mytestclass::i<<std::endl; <br>    return 0; <br>} <br>输出却不正确Q输Zؓ(f)0Q编译链接都没有问题Q。。?<br>g代码q没有执行regi函数Q?<br><br>在C++标准中将初始化变量分?动态初始化"?静态初始化","动态初始化"为利用函数进行初始化,"静态初始化"为常量表辑ּq行初始? <br>C++标准对于cM的常量表辑ּ?动态初始化"gq未做说?所以是否支持类中常数静态变量的动态初始化也就取决与编译器的设计了. <br>但是无论如何vc7.1的编译结果都是不对的,它ƈ没有l出错误,但是l果与逻辑不向W合,q应该是vc7.1的一个bug.(在vs2005中的C++~译器已l修正了q个bug,l出了一个编译Error) <br><br>详细讨论误: <br><a >http://community.csdn.net/Expert/topic/4432/4432789.xml?temp=.3202783</a> <br><br>特别感谢qfeng_zhao ?lxpws ?iGray {几? </p> <img src="http://www.cnblogs.com/shootingstars/aggbug/321956.html" height="1" width="1"><br><br> <div align="right"><a style="text-decoration: none;" target="_blank">shootingstars</a> 2006-01-23 11:46 <a target="_blank" style="text-decoration: none;">发表评论</a></div> <br>文章来源:<a >http://www.cnblogs.com/shootingstars/archive/2006/01/23/321956.html</a> <img src ="http://www.shnenglu.com/shootingstars/aggbug/29071.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.shnenglu.com/shootingstars/" target="_blank">shootingstars</a> 2007-07-31 13:17 <a href="http://www.shnenglu.com/shootingstars/archive/2007/07/31/29071.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>boost::regex学习(fn)http://www.shnenglu.com/shootingstars/archive/2007/07/30/29029.htmlshootingstarsshootingstarsMon, 30 Jul 2007 09:30:00 GMThttp://www.shnenglu.com/shootingstars/archive/2007/07/30/29029.htmlhttp://www.shnenglu.com/shootingstars/comments/29029.htmlhttp://www.shnenglu.com/shootingstars/archive/2007/07/30/29029.html#Feedback0http://www.shnenglu.com/shootingstars/comments/commentRss/29029.htmlhttp://www.shnenglu.com/shootingstars/services/trackbacks/29029.htmlboost的正则表辑ּ需要编译(如果不需要全部Boost的功能的话,请不要build all boostQ那?x)花掉好几个时。我推荐仅仅build需要的库就好。)
原有的boost 1.33g使用vc8~译的时候有问题。下载boost 1.34.1Q?#8220;Visual Studio 2005 Command Prompt”Q进入到boost_1_34_1\libs\regex\buildQ?br>nmake vc8.mak
OKQ生成的文g在vc80下?br>
二:(x)学习(fn)正则表达?br>http://www.shnenglu.com/Files/shootingstars/deelx_zh.rar
不错的正则表辑ּ的学?fn)资料,Z推荐一下:(x)
http://www.regexlab.com/
q个站长q与我有个一信之~(我写?a title="P2P之UDPIKNAT的原理与实现Q附源代码)" href="http://www.shnenglu.com/shootingstars/archive/2007/06/12/26140.html">P2P之UDPIKNAT的原理与实现Q附源代码)Q。站长的q个正则库在CodeProject获得了不错的评h(hun)?br>
三:(x)单的例子
    std::string regstr = "a+";
    boost::regex expression(regstr);
    std::string testString = "aaa";

    // 匚w臛_一个a
    if( boost::regex_match(testString, expression) )
    {
        std::cout<< "Match" << std::endl;
    }
    else
    {
        std::cout<< "Not Match" << std::endl;
    }


shootingstars 2007-07-30 17:30 发表评论
]]>
boost::algorithm学习(fn)http://www.shnenglu.com/shootingstars/archive/2007/07/26/28813.htmlshootingstarsshootingstarsThu, 26 Jul 2007 06:12:00 GMThttp://www.shnenglu.com/shootingstars/archive/2007/07/26/28813.htmlhttp://www.shnenglu.com/shootingstars/comments/28813.htmlhttp://www.shnenglu.com/shootingstars/archive/2007/07/26/28813.html#Feedback0http://www.shnenglu.com/shootingstars/comments/commentRss/28813.htmlhttp://www.shnenglu.com/shootingstars/services/trackbacks/28813.html大小写{换;
去除无效字符Q?
谓词Q?
查找Q?
删除/替换Q?
切割Q?
q接Q?
我们用写例子的方式来了解boost::algorithm能够为我们做些什么?nbsp; 阅读全文

shootingstars 2007-07-26 14:12 发表评论
]]>
是我rp不好Q还是Microsoft的rp不好。。?/title><link>http://www.shnenglu.com/shootingstars/archive/2007/06/19/26639.html</link><dc:creator>shootingstars</dc:creator><author>shootingstars</author><pubDate>Tue, 19 Jun 2007 09:26:00 GMT</pubDate><guid>http://www.shnenglu.com/shootingstars/archive/2007/06/19/26639.html</guid><wfw:comment>http://www.shnenglu.com/shootingstars/comments/26639.html</wfw:comment><comments>http://www.shnenglu.com/shootingstars/archive/2007/06/19/26639.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.shnenglu.com/shootingstars/comments/commentRss/26639.html</wfw:commentRss><trackback:ping>http://www.shnenglu.com/shootingstars/services/trackbacks/26639.html</trackback:ping><description><![CDATA[E序原来一直跑的挺好的。。?br>But从昨天下午开始,没有修改M代码Q编译程序,然后q行。。。报错,说什么buffer overrun错误。哦Q以前遇到过cM情况Q可能是动态库和lib文g不一致导致的。没关系QReBuild整个目Q得E微q旉Q呵呵,乘着q个Z(x)Q上|溜达会(x)Q。花?5分钟QBuild完了。满怀信心的执行。。。啊Q又报错了。。。还是同L(fng)问题。嗯Q想惻IN是Vss上面有h修改东西了,我无意间获取了最新版本?有这个可能。于是上Vss看Show History。似乎这几天代码都没有变化。。。那是什么问题?我就不信邪了Q再ơReBuildQ又是一?5分钟。运行,出错。啊。。?br>于是上google搜烦(ch)出错信息Q嗯Q有那边几页Q不q看完了Q要么是没有回复Q要么跟我的情况牛头不对马嘴。嗯Q看来这U情况还挺特D,看来q得自力更生了?br>于是删除所有代码,从Vss在下载最新的Q再ơReBuild。嗯Q编译没有错Q运行。。。嗯Q也不算有错Q只不过一个第三方的库q行时报了个异常。这个。。。再ơ检查代码,没有发现问题。汗Q于是出来了。。?br><br>今天早上上班l箋倒腾Q这个Vss版本有问题,下个以前的Label的,应该不会(x)有问题了吧。于是再ơReBuildQ运行,q回不再是buffer overrunQ也不是异常了,而是报heap corruption。我晕倒中。。?br><br>在重新ReBuild了n回后Q花了n?5分钟后。我d没辙了。于是我向上帝祈P啊Q救救我吧?br><br>于是Q神听到了,发出了它的神力,在我百般无赖Q手x措的时候,我再ơ下载的最新的Vss代码版本QReBuildQ于是运行通过?br><br>嗯,唉,是我rp不好Q还是Microsoft的rp不好Q我用的VC8Q。。。我无语Q希望高人指炚w题原因?br><img src ="http://www.shnenglu.com/shootingstars/aggbug/26639.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.shnenglu.com/shootingstars/" target="_blank">shootingstars</a> 2007-06-19 17:26 <a href="http://www.shnenglu.com/shootingstars/archive/2007/06/19/26639.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>五种q代?/title><link>http://www.shnenglu.com/shootingstars/archive/2007/06/13/26264.html</link><dc:creator>shootingstars</dc:creator><author>shootingstars</author><pubDate>Wed, 13 Jun 2007 10:35:00 GMT</pubDate><guid>http://www.shnenglu.com/shootingstars/archive/2007/06/13/26264.html</guid><wfw:comment>http://www.shnenglu.com/shootingstars/comments/26264.html</wfw:comment><comments>http://www.shnenglu.com/shootingstars/archive/2007/06/13/26264.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.shnenglu.com/shootingstars/comments/commentRss/26264.html</wfw:commentRss><trackback:ping>http://www.shnenglu.com/shootingstars/services/trackbacks/26264.html</trackback:ping><description><![CDATA[1 InputIterator 可以被用来读取容器中的元素但是不保证支持向容器的写入操作<br>InputIterator 必须提供下列最支持提供其他支持的iterator 也可被用作InputIterator 只要<br>它们满q个最要求集两个iterator 的相{和不相{测试通过operator ++ 的前|和<br>后置实例向前递增iterator 指向下一个元素通过解引用操作符operator * d一个元?br>求在q个层次上提供支持的泛型法包括find() accumulate()和equal() M一个算法如?br>要求InputIterator 那么我们也可以向其传递第3 4 5 列出的iterator cd中的M?br><span style="font-weight: bold;">卻I(x)只要某个cdC面的操作既可以被认ؓ(f)是InputIterator?/span><br>2 OutputIterator 可以被认为是与InputIterator 功能相反的iterator 卛_可以被用来向?br>器写入元素但是不保证支持d容器的内容OutputIterator 一般被用作法的第三个实参<br>标记v始写入的位置例如copy()取OutputIterator 作ؓ(f)W三个实参Q何一个算法如?br>要求OutputIterator 那么我们也可以向其传递第3 4 5 列出的iterator cd中的M?br><span style="font-weight: bold;">注意Q这个P代器g仅仅实现了赋值操作即? </span><br>3 ForwardIterator 可以被用来以某一个遍历方向是的下一个类别支持双向遍历向<br>容器L写有些泛型算法至要求ForwardIterator 包括adjacent_find() swap_range()?br>replace() 当然M要求ForwardIterator 支持的算法都可以向其传递第4 ? 定义的iterator<br>cd<br><span style="font-weight: bold;">注意Q这个P代器既符合InputIterator又符合OutputIteratorQ同样下面两个也是这栗支?/span><span style="font-weight: bold;">operator++操作</span><br>4 BidirectionalIterator 从两个方向读或写一个容器有些泛型算法至要?br>BidirectionalIterator 包括inplace_merge() next_permutation()和reverse()<br><span style="font-weight: bold;">注意Q?Q?Q?的特性,q且支持</span><span style="font-weight: bold;">operator--操作</span><br>5 RandomAccessIterator 除了支持BidirectionalIterator 所有的功能之外q提供了?br>常数旉内访问容器的L位置的支持要求RandomAccessIterator 支持的泛型算法包?br>binary_search() sort_heap()和nth_element() <br><span style="font-weight: bold;">注意Q?/span><span style="font-weight: bold;">l承1Q?Q?的特性,q且</span><span style="font-weight: bold;">W合随机讉K{略Q即支持operator[]操作</span><br> <img src ="http://www.shnenglu.com/shootingstars/aggbug/26264.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.shnenglu.com/shootingstars/" target="_blank">shootingstars</a> 2007-06-13 18:35 <a href="http://www.shnenglu.com/shootingstars/archive/2007/06/13/26264.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>C++泛型法W记Q?Q?/title><link>http://www.shnenglu.com/shootingstars/archive/2007/06/13/26263.html</link><dc:creator>shootingstars</dc:creator><author>shootingstars</author><pubDate>Wed, 13 Jun 2007 10:14:00 GMT</pubDate><guid>http://www.shnenglu.com/shootingstars/archive/2007/06/13/26263.html</guid><wfw:comment>http://www.shnenglu.com/shootingstars/comments/26263.html</wfw:comment><comments>http://www.shnenglu.com/shootingstars/archive/2007/06/13/26263.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.shnenglu.com/shootingstars/comments/commentRss/26263.html</wfw:commentRss><trackback:ping>http://www.shnenglu.com/shootingstars/services/trackbacks/26263.html</trackback:ping><description><![CDATA[<span style="font-weight: bold;">find</span><br> <div style="border: 1px solid #cccccc; padding: 4px 5px 4px 4px; background-color: #eeeeee; font-size: 13px; width: 98%;"><!--<br><br>Code highlighting produced by Actipro CodeHighlighter (freeware)<br>http://www.CodeHighlighter.com/<br><br>--><span style="color: #000000;">template </span><span style="color: #000000;"><</span><span style="color: #000000;"> </span><span style="color: #0000ff;">class</span><span style="color: #000000;"> ForwardIterator, </span><span style="color: #0000ff;">class</span><span style="color: #000000;"> Type </span><span style="color: #000000;">></span><span style="color: #000000;"><br>ForwardIterator<br>find( ForwardIterator first, ForwardIterator last, Type value )</span><span style="color: #000000;"><br></span></div> findq回一个P代器Q表明是否找到元素,如果找不到返回参数的last?br>参数<br>firstQ开始搜索的W一个元?br>lastQ搜索到此元素之前,不包括此元素<br>valueQ需要搜索的?br><br><span style="font-weight: bold;">back_inserter</span><br> <div style="border: 1px solid #cccccc; padding: 4px 5px 4px 4px; background-color: #eeeeee; font-size: 13px; width: 98%;"><!--<br><br>Code highlighting produced by Actipro CodeHighlighter (freeware)<br>http://www.CodeHighlighter.com/<br><br>--><span style="color: #000000;">template</span><span style="color: #000000;"><</span><span style="color: #0000ff;">class</span><span style="color: #000000;"> _Container</span><span style="color: #000000;">></span><span style="color: #000000;"><br>back_insert_iterator</span><span style="color: #000000;"><</span><span style="color: #000000;">_Container</span><span style="color: #000000;">></span><span style="color: #000000;"><br>back_inserter(_Container</span><span style="color: #000000;">&</span><span style="color: #000000;"> _Cont)</span></div> q个函数q回一个P代器<span style="color: #000000;">back_insert_iterator</span><span style="color: #000000;"><</span><span style="color: #000000;">_Container</span><span style="color: #000000;">>Q这个P代器是从OutputIteratorl承q来的,表明q个q代器可以被写入。这个P代器重写了赋值操作,在赋值操作中使用push_back元素插入容器中?br>参数<br>_ContQ希望被插入值的容器<br><br><span style="font-weight: bold;">copy</span><br></span> <div style="border: 1px solid #cccccc; padding: 4px 5px 4px 4px; background-color: #eeeeee; font-size: 13px; width: 98%;"><!--<br><br>Code highlighting produced by Actipro CodeHighlighter (freeware)<br>http://www.CodeHighlighter.com/<br><br>--><span style="color: #000000;">template </span><span style="color: #000000;"><</span><span style="color: #000000;"> </span><span style="color: #0000ff;">class</span><span style="color: #000000;"> InputIterator, </span><span style="color: #0000ff;">class</span><span style="color: #000000;"> OutputIterator </span><span style="color: #000000;">></span><span style="color: #000000;"><br>OutputIterator<br>copy( InputIterator first1, InputIterator last,<br>OutputIterator first2 );</span></div> q个函数q回一个OutputIteratorq代?br>参数<br>firstQ开始拷贝的W一个元?br>lastQ拷贝到此元素之前,不包括此元素<br>first2Q拷贝到此P代器。我们可以用上面的back_inserter函数q回的OutputIterator <br> <img src ="http://www.shnenglu.com/shootingstars/aggbug/26263.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.shnenglu.com/shootingstars/" target="_blank">shootingstars</a> 2007-06-13 18:14 <a href="http://www.shnenglu.com/shootingstars/archive/2007/06/13/26263.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>如何删除C++容器中的?/title><link>http://www.shnenglu.com/shootingstars/archive/2007/06/12/26144.html</link><dc:creator>shootingstars</dc:creator><author>shootingstars</author><pubDate>Tue, 12 Jun 2007 09:37:00 GMT</pubDate><guid>http://www.shnenglu.com/shootingstars/archive/2007/06/12/26144.html</guid><wfw:comment>http://www.shnenglu.com/shootingstars/comments/26144.html</wfw:comment><comments>http://www.shnenglu.com/shootingstars/archive/2007/06/12/26144.html#Feedback</comments><slash:comments>1</slash:comments><wfw:commentRss>http://www.shnenglu.com/shootingstars/comments/commentRss/26144.html</wfw:commentRss><trackback:ping>http://www.shnenglu.com/shootingstars/services/trackbacks/26144.html</trackback:ping><description><![CDATA[C++的容器中一般都提供erase函数Q此函数接收的参C般有一个是一个P代器Q?br>如果删除某一个值的话,我们可能一般都用过Q?br> <div style="border: 1px solid #cccccc; padding: 4px 5px 4px 4px; background-color: #eeeeee; font-size: 13px; width: 98%;"><!--<br><br>Code highlighting produced by Actipro CodeHighlighter (freeware)<br>http://www.CodeHighlighter.com/<br><br>--><span style="color: #000000;">list</span><span style="color: #000000;"><</span><span style="color: #0000ff;">int</span><span style="color: #000000;">></span><span style="color: #000000;"> c;<br></span><span style="color: #008000;">//</span><span style="color: #008000;"> todo insert items<img style="width: 30px; height: 20px;" src="http://www.shnenglu.com/Images/dot.gif"></span><span style="color: #008000;"><br></span><span style="color: #0000ff;">for</span><span style="color: #000000;"> (list</span><span style="color: #000000;"><</span><span style="color: #0000ff;">int</span><span style="color: #000000;">></span><span style="color: #000000;">::iterator i </span><span style="color: #000000;">=</span><span style="color: #000000;"> c.begin(); i</span><span style="color: #000000;">!=</span><span style="color: #000000;"> c.end(); </span><span style="color: #000000;">++</span><span style="color: #000000;">i)<br>{<br>    </span><span style="color: #0000ff;">if</span><span style="color: #000000;"> ((</span><span style="color: #000000;">*</span><span style="color: #000000;">i)</span><span style="color: #000000;">></span><span style="color: #000000;">10</span><span style="color: #000000;">)<br>    {<br>        </span><span style="color: #008000;">//</span><span style="color: #008000;"> 如果有一个值大?0Q删除之</span><span style="color: #008000;"><br></span><span style="color: #000000;">        c.erase(i);<br>        </span><span style="color: #0000ff;">break</span><span style="color: #000000;">;<br>    }<br>}<br></span></div> 上述代码在删除一个元素的时候ƈ没有问题。。。但是我们想删除所有大?0的|于是Q?br> <div style="border: 1px solid #cccccc; padding: 4px 5px 4px 4px; background-color: #eeeeee; font-size: 13px; width: 98%;"><!--<br><br>Code highlighting produced by Actipro CodeHighlighter (freeware)<br>http://www.CodeHighlighter.com/<br><br>--><span style="color: #000000;">list</span><span style="color: #000000;"><</span><span style="color: #0000ff;">int</span><span style="color: #000000;">></span><span style="color: #000000;"> c;<br></span><span style="color: #008000;">//</span><span style="color: #008000;"> todo insert items</span><span style="color: #008000;"><br></span><span style="color: #0000ff;">for</span><span style="color: #000000;"> (list</span><span style="color: #000000;"><</span><span style="color: #0000ff;">int</span><span style="color: #000000;">></span><span style="color: #000000;">::iterator i </span><span style="color: #000000;">=</span><span style="color: #000000;"> c.begin(); i</span><span style="color: #000000;">!=</span><span style="color: #000000;"> c.end(); </span><span style="color: #000000;">++</span><span style="color: #000000;">i)<br>{<br>    </span><span style="color: #0000ff;">if</span><span style="color: #000000;"> ((</span><span style="color: #000000;">*</span><span style="color: #000000;">i)</span><span style="color: #000000;">></span><span style="color: #000000;">10</span><span style="color: #000000;">)<br>    {<br>        </span><span style="color: #008000;">//</span><span style="color: #008000;"> 删除所有大?0的?/span><span style="color: #008000;"><br></span><span style="color: #000000;">        c.erase(i);<br>    }<br>}</span></div> 满怀希望的编译,q行。。。于是异常发生。。?br>啊。。。哦。。?br>原来是删除P代器i后,i所指的元素已经失效了,然后li++Q它已经不在存在了。。。于是绞脑汁,出笼了下面的代码Q?br> <div style="border: 1px solid #cccccc; padding: 4px 5px 4px 4px; background-color: #eeeeee; font-size: 13px; width: 98%;"><!--<br><br>Code highlighting produced by Actipro CodeHighlighter (freeware)<br>http://www.CodeHighlighter.com/<br><br>--><span style="color: #000000;">list</span><span style="color: #000000;"><</span><span style="color: #0000ff;">int</span><span style="color: #000000;">></span><span style="color: #000000;"> c;<br></span><span style="color: #008000;">//</span><span style="color: #008000;"> todo insert items</span><span style="color: #008000;"><br></span><span style="color: #000000;">list</span><span style="color: #000000;"><</span><span style="color: #0000ff;">int</span><span style="color: #000000;">></span><span style="color: #000000;">::iterator nextitr </span><span style="color: #000000;">=</span><span style="color: #000000;"> c.begin();<br></span><span style="color: #0000ff;">for</span><span style="color: #000000;"> (list</span><span style="color: #000000;"><</span><span style="color: #0000ff;">int</span><span style="color: #000000;">></span><span style="color: #000000;">::iterator i </span><span style="color: #000000;">=</span><span style="color: #000000;"> c.begin();;)<br>{<br>    </span><span style="color: #0000ff;">if</span><span style="color: #000000;">(nextitr </span><span style="color: #000000;">==</span><span style="color: #000000;"> c.end())<br>        </span><span style="color: #0000ff;">break</span><span style="color: #000000;">;<br>    </span><span style="color: #000000;">++</span><span style="color: #000000;">nextitr;<br>    </span><span style="color: #0000ff;">if</span><span style="color: #000000;"> ((</span><span style="color: #000000;">*</span><span style="color: #000000;">i)</span><span style="color: #000000;">></span><span style="color: #000000;">10</span><span style="color: #000000;">)<br>    {<br>        </span><span style="color: #008000;">//</span><span style="color: #008000;"> 如果有一个值大?0Q删除之</span><span style="color: #008000;"><br></span><span style="color: #000000;">        c.erase(i);<br>    }<br>    i </span><span style="color: #000000;">=</span><span style="color: #000000;"> nextitr;<br>}<br></span></div> 上面的代码很Ҏ(gu)理解Q即在删除一个P代器之前Q把它的之后的P代器先存储,然后在下ơ@环的时候利用之前存储的q代器?br>OKQ我们看C面这D代码可以工作了Q行Z乎也q正,只是。。。代码似乎多了点。我想代码能够少点就好了Q逻辑也不要那么麻?ch)。那么我们看下面的代码(转蝲自Effective STLQ?br> <div style="border: 1px solid #cccccc; padding: 4px 5px 4px 4px; background-color: #eeeeee; font-size: 13px; width: 98%;"><!--<br><br>Code highlighting produced by Actipro CodeHighlighter (freeware)<br>http://www.CodeHighlighter.com/<br><br>--><span style="color: #000000;">list</span><span style="color: #000000;"><</span><span style="color: #0000ff;">int</span><span style="color: #000000;">></span><span style="color: #000000;"> c;<br></span><span style="color: #008000;">//</span><span style="color: #008000;"> todo insert items</span><span style="color: #008000;"></span><span style="color: #000000;"></span><span style="color: #000000;"><br></span><span style="color: #0000ff;">for</span><span style="color: #000000;"> (list</span><span style="color: #000000;"><</span><span style="color: #0000ff;">int</span><span style="color: #000000;">></span><span style="color: #000000;">::iterator i </span><span style="color: #000000;">=</span><span style="color: #000000;"> c.begin(); i</span><span style="color: #000000;">!=</span><span style="color: #000000;"> c.end();)<br>{<br>    </span><span style="color: #0000ff;">if</span><span style="color: #000000;"> ((</span><span style="color: #000000;">*</span><span style="color: #000000;">i)</span><span style="color: #000000;">></span><span style="color: #000000;">10</span><span style="color: #000000;">)<br>    {<br>        </span><span style="color: #008000;">//</span><span style="color: #008000;"> 如果有一个值大?0Q删除之</span><span style="color: #008000;"><br></span><span style="color: #000000;">        c.erase(i</span><span style="color: #000000;">++</span><span style="color: #000000;">);<br>    }<br>    </span><span style="color: #0000ff;">else</span><span style="color: #000000;"><br>        i</span><span style="color: #000000;">++</span><span style="color: #000000;">;<br>}<br></span></div> 嗯。。。高手就是高手(我以前根本没有在意过++i和i++在用的q程中能有这么大的区别)<br>好了Q最后再提供一个版本,利用list的remove_if函数?br> <div style="border: 1px solid #cccccc; padding: 4px 5px 4px 4px; background-color: #eeeeee; font-size: 13px; width: 98%;"><!--<br><br>Code highlighting produced by Actipro CodeHighlighter (freeware)<br>http://www.CodeHighlighter.com/<br><br>--><span style="color: #0000ff;">bool</span><span style="color: #000000;"> fun(</span><span style="color: #0000ff;">int</span><span style="color: #000000;"> i)<br>{<br>    </span><span style="color: #0000ff;">if</span><span style="color: #000000;">(i</span><span style="color: #000000;">></span><span style="color: #000000;">10</span><span style="color: #000000;">)<br>        </span><span style="color: #0000ff;">return</span><span style="color: #000000;"> </span><span style="color: #0000ff;">true</span><span style="color: #000000;">;<br>    </span><span style="color: #0000ff;">else</span><span style="color: #000000;"><br>        </span><span style="color: #0000ff;">return</span><span style="color: #000000;"> </span><span style="color: #0000ff;">false</span><span style="color: #000000;">;<br>}<br><br>list</span><span style="color: #000000;"><</span><span style="color: #0000ff;">int</span><span style="color: #000000;">></span><span style="color: #000000;"> c;<br></span><span style="color: #008000;">//</span><span style="color: #008000;"> todo insert items</span><span style="color: #008000;"><br></span><span style="color: #000000;">c.remove_if(fun);</span></div> 嗯,其实删除一个容器中的值的方式q是挺多的?br> <img src ="http://www.shnenglu.com/shootingstars/aggbug/26144.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.shnenglu.com/shootingstars/" target="_blank">shootingstars</a> 2007-06-12 17:37 <a href="http://www.shnenglu.com/shootingstars/archive/2007/06/12/26144.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>P2P之UDPIKNAT的原理与实现Q附源代码)http://www.shnenglu.com/shootingstars/archive/2007/06/12/26140.htmlshootingstarsshootingstarsTue, 12 Jun 2007 05:23:00 GMThttp://www.shnenglu.com/shootingstars/archive/2007/06/12/26140.htmlhttp://www.shnenglu.com/shootingstars/comments/26140.htmlhttp://www.shnenglu.com/shootingstars/archive/2007/06/12/26140.html#Feedback3http://www.shnenglu.com/shootingstars/comments/commentRss/26140.htmlhttp://www.shnenglu.com/shootingstars/services/trackbacks/26140.html作者:(x)shootingstars | 日期Q?004-05-25 | 字体Q大 ??br>
P2P ?UDPIKNAT的原理与实现Q附源代码)
原创Qshootingstars
参考:(x)http://midcom-p2p.sourceforge.net/draft-ford-midcom-p2p-01.txt

论坛上经常有对P2P原理的讨论,但是讨论归讨论,很少有实质的东西产生Q源代码Q。呵呵,在这里我q自己实现的一个源代码来说明UDPI越NAT的原理?br>
首先先介l一些基本概念:(x)
    NAT(Network Address Translators)Q网l地址转换Q网l地址转换是在IP地址日益~Z的情况下产生的,它的主要目的是Z能够地址重用。NAT分ؓ(f)两大c,基本的NAT和NAPT(Network Address/Port Translator)?br>    最开始NAT是运行在路由器上的一个功能模块?br>   
    最先提出的是基本的NATQ它的生基于如下事实:(x)一个私有网l(域)中的节点中只有很的节点需要与外网q接Q呵呵,q是在上世纪90q代中期提出的)。那么这个子|中其实只有数的节炚w要全球唯一的IP地址Q其他的节点的IP地址应该是可以重用的?br>    因此Q基本的NAT实现的功能很单,在子|内使用一个保留的IP子网D,q些IP对外是不可见的。子|内只有数一些IP地址可以对应到真正全球唯一?IP地址。如果这些节炚w要访问外部网l,那么基本NATp责将q个节点的子|内IP转化Z个全球唯一的IP然后发送出厅R?基本的NAT?x)改变I(y)P 包中的原IP地址Q但是不?x)改变I(y)P包中的端?
    关于基本的NAT可以参看RFC 1631
   
    另外一UNAT叫做NAPTQ从名称上我们也可以看得出,NAPT不但?x)改变经q这个NAT讑֤的IP数据报的IP地址Q还?x)改变I(y)P数据报的 TCP/UDP端口。基本NAT的设备可能我们见的不多(呵呵Q我没有见到q)QNAPT才是我们真正讨论的主角。看下图Q?br>                                Server S1                        
                         18.181.0.31:1235                         
                                      |
          ^  Session 1 (A-S1)  ^      |
          |  18.181.0.31:1235  |      |  
          v 155.99.25.11:62000 v      |   
                                      |
                                     NAT
                                 155.99.25.11
                                      |
          ^  Session 1 (A-S1)  ^      |
          |  18.181.0.31:1235  |      |
          v   10.0.0.1:1234    v      |
                                      |
                                   Client A
                                10.0.0.1:1234
    有一个私有网l?0.*.*.*QClient A是其中的一台计机Q这个网l的|关Q一个NAT讑֤Q的外网IP?55.99.25.11(应该q有一个内|的IP地址Q比?10.0.0.10)。如果Client A中的某个q程Q这个进E创Z一个UDP Socket,q个Socketl定1234端口Q想讉K外网L18.181.0.31?235端口Q那么当数据包通过NAT时会(x)发生什么事情呢Q?br>    首先NAT?x)改变这个数据包的原IP地址Q改?55.99.25.11。接着NAT?x)?f)q个传输创徏一个SessionQSession是一个抽象的概念Q如果是TCPQ也许Session是由一个SYN包开始,以一个FIN包结束。而UDP呢,以这个IP的这个端口的W一个UDP开始,l束呢,呵呵Q也许是几分钟,也许是几时Q这要看具体的实CQƈ且给q个Session分配一个端口,比如62000Q然后改变这个数据包的源端口?2000。所以本来是Q?0.0.0.1:1234->18.181.0.31:1235Q的数据包到了互联网上变ZQ?55.99.25.11:62000 ->18.181.0.31:1235Q?br>    一旦NAT创徏了一个Session后,NAT?x)记?2000端口对应的是10.0.0.1?234端口Q以后从18.181.0.31发送到 62000端口的数据会(x)被NAT自动的{发到10.0.0.1上。(注意Q这里是?8.181.0.31发送到62000端口的数据会(x)被{发,其他?IP发送到q个端口的数据将被NAT抛弃Q这样Client A׃Server S1建立以了一个连接?br>
    呵呵Q上面的基础知识可能很多人都知道了,那么下面是关键的部分了?br>    看看下面的情况:(x)
    Server S1                                     Server S2
 18.181.0.31:1235                              138.76.29.7:1235
        |                                             |
        |                                             |
        +----------------------+----------------------+
                               |
   ^  Session 1 (A-S1)  ^      |      ^  Session 2 (A-S2)  ^
   |  18.181.0.31:1235  |      |      |  138.76.29.7:1235  |
   v 155.99.25.11:62000 v      |      v 155.99.25.11:62000 v
                               |
                            Cone NAT
                          155.99.25.11
                               |
   ^  Session 1 (A-S1)  ^      |      ^  Session 2 (A-S2)  ^
   |  18.181.0.31:1235  |      |      |  138.76.29.7:1235  |
   v   10.0.0.1:1234    v      |      v   10.0.0.1:1234    v
                               |
                            Client A
                         10.0.0.1:1234
    接上面的例子Q如果Client A的原来那个Socket(l定?234端口的那个UDP Socket)又接着向另外一个Server S2发送了一个UDP包,那么q个UDP包在通过NAT时会(x)怎么样呢Q?br>    q时可能?x)有两种情况发生Q一U是NAT再次创徏一个SessionQƈ且再ơؓ(f)q个Session分配一个端口号Q比如:(x)62001Q。另外一U是 NAT再次创徏一个SessionQ但是不?x)新分配一个端口号Q而是用原来分配的端口?2000。前一UNAT叫做Symmetric NATQ后一U叫做Cone NAT。我们期望我们的NAT是第二种Q呵呵,如果你的NAT刚好是第一U,那么很可能会(x)有很多P2P软gq。(可以庆幸的是Q现在绝大多数的NAT属于后者,即Cone NATQ?br> 
    好了Q我们看刎ͼ通过NAT,子网内的计算机向外连l是很容易的QNAT相当于透明的,子网内的和外|的计算Z用知道NAT的情况)?br>    但是如果外部的计机惌问子|内的计机比较困难了Q而这正是P2P所需要的Q?br>    那么我们如果想从外部发送一个数据报l内|的计算机有什么办法呢Q首先,我们必须在内|的NAT上打上一?#8220;z?#8221;Q也是前面我们说的在NAT上徏立一?SessionQ,q个z不能由外部来打Q只能由内网内的L来打。而且q个z是有方向的Q比如从内部某台LQ比如:(x)192.168.0.10Q向外部的某个IP(比如Q?19.237.60.1)发送一个UDP包,那么在q个内网的NAT讑֤上打了一个方向ؓ(f)219.237.60.1?#8220;z?#8221;Q(q就是称为UDP Hole Punching的技术)以后219.237.60.1可以通过q个z与内网?92.168.0.10联系了。(但是其他的IP不能利用q个z)?br>
呵呵Q现在该轮到我们的正题P2P了。有了上面的理论Q实C个内|的L通讯差最后一步了Q那是鸡生蛋还是蛋生鸡的问题了Q两辚w无法d发出q接hQ谁也不知道谁的公网地址Q那我们如何来打q个z呢Q我们需要一个中间h来联p这两个内网L?br>    现在我们来看看一个P2P软g的流E,以下图ؓ(f)例:(x)

                       Server S Q?19.237.60.1Q?br>                          |
                          |
   +----------------------+----------------------+
   |                                             |
 NAT A (外网IP:202.187.45.3)                 NAT B (外网IP:187.34.1.56)
   |   (内网IP:192.168.0.1)                      | (内网IP:192.168.0.1)
   |                                             |
Client A  (192.168.0.20:4000)             Client B (192.168.0.10:40000)

    首先QClient Ad服务器,NAT Aơ的Session分配了一个端?0000Q那么Server S收到的Client A的地址?02.187.45.3:60000Q这是Client A的外|地址了。同PClient BdServer SQNAT Bl此ơSession分配的端口是40000Q那么Server S收到的B的地址?87.34.1.56:40000?br>    此时QClient A与Client B都可以与Server S通信了。如果Client A此时想直接发送信息给C(j)lient BQ那么他可以从Server S那儿获得B的公|地址187.34.1.56:40000Q是不是Client A向这个地址发送信息Client Bp收到了呢Q答案是不行Q因为如果这样发送信息,NAT B?x)将q个信息丢弃Q因L(fng)信息是不误来的Qؓ(f)了安全,大多数NAT都会(x)执行丢弃动作Q。现在我们需要的是在NAT B上打一个方向ؓ(f)202.187.45.3Q即Client A的外|地址Q的z,那么Client A发送到187.34.1.56:40000的信?Client Bp收到了。这个打z命令由谁来发呢Q呵呵,当然是Server S?br>    ȝ一下这个过E:(x)如果Client A惛_Client B发送信息,那么Client A发送命令给Server SQ请求Server S命o(h)Client B向Client A方向打洞。呵呵,是不是很l口Q不q没关系Q想一惛_很清楚了Q何况还有源代码呢(侯老师说过Q在源代码面前没有秘?8Q)Q然后Client A可以通过Client B的外|地址与Client B通信了?br>   
    注意Q以上过E只适合于Cone NAT的情况,如果是Symmetric NATQ那么当Client B向Client A打洞的端口已l重新分配了QClient B无法知道这个端口(如果Symmetric NAT的端口是序分配的,那么我们或许可以猜测q个端口P可是׃可能Dp|的因素太多,我们不推荐这U猜端口的Ҏ(gu)Q?br>   
    下面是一个模拟P2P聊天的过E的源代码,q程很简单,P2PServerq行在一个拥有公|IP的计机上,P2PClientq行在两个不同的NAT 后(注意Q如果两个客L(fng)q行在一个NAT后,本程序很可能不能q行正常Q这取决于你的NAT是否支持loopback translationQ详见http://midcom-p2p.sourceforge.net/draft-ford-midcom-p2p-01.txtQ当?dng)此问题可以通过双方先尝试连接对方的内网IP来解冻I但是q个代码只是Z验证原理Qƈ没有处理q些问题Q,后登录的计算机可以获得先d计算机的用户名,后登录的计算机通过send username message的格式来发送消息。如果发送成功,说明你已取得了直接与Ҏ(gu)q接的成功?br>    E序现在支持三个命o(h)Qsend , getu , exit
   
    send格式Qsend username message
    功能Q发送信息给username
   
    getu格式Qgetu
    功能Q获得当前服务器用户列表
   
    exit格式Qexit
    功能Q注销与服务器的连接(服务器不?x)自动监客h否吊U)
       
    代码很短Q相信很Ҏ(gu)懂,如果有什么问题,可以l我发邮件zhouhuis22@sina.com  或者在CSDN上发送短消息。同ӞƢ迎转发此文Q但希望保留作者版?-Q?br>   
    最后感谢CSDN|友 PiggyXP ?Seilfer的测试帮?br>
P2PServer.c

/* P2P E序服务?br> *
 * 文g名:(x)P2PServer.c
 *
 * 日期Q?004-5-21
 *
 * 作者:(x)shootingstars(zhouhuis22@sina.com)
 *
 */
#pragma comment(lib, "ws2_32.lib")

#include "windows.h"
#include "..\proto.h"
#include "..\Exception.h"

UserList ClientList;

void InitWinSock()
{
 WSADATA wsaData;

 if (WSAStartup(MAKEWORD(2, 2), &wsaData) != 0)
 {
  printf("Windows sockets 2.2 startup");
  throw Exception("");
 }
 else{
  printf("Using %s (Status: %s)\n",
   wsaData.szDescription, wsaData.szSystemStatus);
  printf("with API versions %d.%d to %d.%d\n\n",
   LOBYTE(wsaData.wVersion), HIBYTE(wsaData.wVersion),
   LOBYTE(wsaData.wHighVersion), HIBYTE(wsaData.wHighVersion));
 
 }
}

SOCKET mksock(int type)
{
 SOCKET sock = socket(AF_INET, type, 0);
 if (sock < 0)
 {
        printf("create socket error");
  throw Exception("");
 }
 return sock;
}

stUserListNode GetUser(char *username)
{
 for(UserList::iterator UserIterator=ClientList.begin();
      UserIterator!=ClientList.end();
       ++UserIterator)
 {
  if( strcmp( ((*UserIterator)->userName), username) == 0 )
   return *(*UserIterator);
 }
 throw Exception("not find this user");
}

int main(int argc, char* argv[])
{
 try{
  InitWinSock();
 
  SOCKET PrimaryUDP;
  PrimaryUDP = mksock(SOCK_DGRAM);

  sockaddr_in local;
  local.sin_family=AF_INET;
  local.sin_port= htons(SERVER_PORT);
  local.sin_addr.s_addr = htonl(INADDR_ANY);
  int nResult=bind(PrimaryUDP,(sockaddr*)&local,sizeof(sockaddr));
  if(nResult==SOCKET_ERROR)
   throw Exception("bind error");

  sockaddr_in sender;
  stMessage recvbuf;
  memset(&recvbuf,0,sizeof(stMessage));

  // 开始主循环.
  // d@环负责下面几件事?
  // 一:d客户端登陆和d消息,记录客户列表
  // ?转发客户p2ph
  for(;;)
  {
   int dwSender = sizeof(sender);
   int ret = recvfrom(PrimaryUDP, (char *)&recvbuf, sizeof(stMessage), 0, (sockaddr *)&sender, &dwSender);
   if(ret <= 0)
   {
    printf("recv error");
    continue;
   }
   else
   {
    int messageType = recvbuf.iMessageType;
    switch(messageType){
    case LOGIN:
     {
      //  这个用L(fng)信息记录到用户列表中
      printf("has a user login : %s\n", recvbuf.message.loginmember.userName);
      stUserListNode *currentuser = new stUserListNode();
      strcpy(currentuser->userName, recvbuf.message.loginmember.userName);
      currentuser->ip = ntohl(sender.sin_addr.S_un.S_addr);
      currentuser->port = ntohs(sender.sin_port);
      
      ClientList.push_back(currentuser);

      // 发送已l登陆的客户信息
      int nodecount = (int)ClientList.size();
      sendto(PrimaryUDP, (const char*)&nodecount, sizeof(int), 0, (const sockaddr*)&sender, sizeof(sender));
      for(UserList::iterator UserIterator=ClientList.begin();
        UserIterator!=ClientList.end();
        ++UserIterator)
      {
       sendto(PrimaryUDP, (const char*)(*UserIterator), sizeof(stUserListNode), 0, (const sockaddr*)&sender, sizeof(sender));
      }

      break;
     }
    case LOGOUT:
     {
      // 此客户信息删除
      printf("has a user logout : %s\n", recvbuf.message.logoutmember.userName);
      UserList::iterator removeiterator = NULL;
      for(UserList::iterator UserIterator=ClientList.begin();
       UserIterator!=ClientList.end();
       ++UserIterator)
      {
       if( strcmp( ((*UserIterator)->userName), recvbuf.message.logoutmember.userName) == 0 )
       {
        removeiterator = UserIterator;
        break;
       }
      }
      if(removeiterator != NULL)
       ClientList.remove(*removeiterator);
      break;
     }
    case P2PTRANS:
     {
      // 某个客户希望服务端向另外一个客户发送一个打z消?br>      printf("%s wants to p2p %s\n",inet_ntoa(sender.sin_addr),recvbuf.message.translatemessage.userName);
      stUserListNode node = GetUser(recvbuf.message.translatemessage.userName);
      sockaddr_in remote;
      remote.sin_family=AF_INET;
      remote.sin_port= htons(node.port);
      remote.sin_addr.s_addr = htonl(node.ip);

      in_addr tmp;
      tmp.S_un.S_addr = htonl(node.ip);
      printf("the address is %s,and port is %d\n",inet_ntoa(tmp), node.port);

      stP2PMessage transMessage;
      transMessage.iMessageType = P2PSOMEONEWANTTOCALLYOU;
      transMessage.iStringLen = ntohl(sender.sin_addr.S_un.S_addr);
      transMessage.Port = ntohs(sender.sin_port);
                       
      sendto(PrimaryUDP,(const char*)&transMessage, sizeof(transMessage), 0, (const sockaddr *)&remote, sizeof(remote));

      break;
     }
    
    case GETALLUSER:
     {
      int command = GETALLUSER;
      sendto(PrimaryUDP, (const char*)&command, sizeof(int), 0, (const sockaddr*)&sender, sizeof(sender));

      int nodecount = (int)ClientList.size();
      sendto(PrimaryUDP, (const char*)&nodecount, sizeof(int), 0, (const sockaddr*)&sender, sizeof(sender));

      for(UserList::iterator UserIterator=ClientList.begin();
        UserIterator!=ClientList.end();
        ++UserIterator)
      {
       sendto(PrimaryUDP, (const char*)(*UserIterator), sizeof(stUserListNode), 0, (const sockaddr*)&sender, sizeof(sender));
      }
      break;
     }
    }
   }
  }

 }
 catch(Exception &e)
 {
  printf(e.GetMessage());
  return 1;
 }

 return 0;
}

/* P2P E序客户?br> *
 * 文g名:(x)P2PClient.c
 *
 * 日期Q?004-5-21
 *
 * 作者:(x)shootingstars(zhouhuis22@sina.com)
 *
 */

#pragma comment(lib,"ws2_32.lib")

#include "windows.h"
#include "..\proto.h"
#include "..\Exception.h"
#include <iostream>
using namespace std;

UserList ClientList;

 

#define COMMANDMAXC 256
#define MAXRETRY    5

SOCKET PrimaryUDP;
char UserName[10];
char ServerIP[20];

bool RecvedACK;

void InitWinSock()
{
 WSADATA wsaData;

 if (WSAStartup(MAKEWORD(2, 2), &wsaData) != 0)
 {
  printf("Windows sockets 2.2 startup");
  throw Exception("");
 }
 else{
  printf("Using %s (Status: %s)\n",
   wsaData.szDescription, wsaData.szSystemStatus);
  printf("with API versions %d.%d to %d.%d\n\n",
   LOBYTE(wsaData.wVersion), HIBYTE(wsaData.wVersion),
   LOBYTE(wsaData.wHighVersion), HIBYTE(wsaData.wHighVersion));
 }
}

SOCKET mksock(int type)
{
 SOCKET sock = socket(AF_INET, type, 0);
 if (sock < 0)
 {
        printf("create socket error");
  throw Exception("");
 }
 return sock;
}

stUserListNode GetUser(char *username)
{
 for(UserList::iterator UserIterator=ClientList.begin();
      UserIterator!=ClientList.end();
       ++UserIterator)
 {
  if( strcmp( ((*UserIterator)->userName), username) == 0 )
   return *(*UserIterator);
 }
 throw Exception("not find this user");
}

void BindSock(SOCKET sock)
{
 sockaddr_in sin;
 sin.sin_addr.S_un.S_addr = INADDR_ANY;
 sin.sin_family = AF_INET;
 sin.sin_port = 0;
 
 if (bind(sock, (struct sockaddr*)&sin, sizeof(sin)) < 0)
  throw Exception("bind error");
}

void ConnectToServer(SOCKET sock,char *username, char *serverip)
{
 sockaddr_in remote;
 remote.sin_addr.S_un.S_addr = inet_addr(serverip);
 remote.sin_family = AF_INET;
 remote.sin_port = htons(SERVER_PORT);
 
 stMessage sendbuf;
 sendbuf.iMessageType = LOGIN;
 strncpy(sendbuf.message.loginmember.userName, username, 10);

 sendto(sock, (const char*)&sendbuf, sizeof(sendbuf), 0, (const sockaddr*)&remote,sizeof(remote));

 int usercount;
 int fromlen = sizeof(remote);
 int iread = recvfrom(sock, (char *)&usercount, sizeof(int), 0, (sockaddr *)&remote, &fromlen);
 if(iread<=0)
 {
  throw Exception("Login error\n");
 }

 // d到服务端后,接收服务端发来的已经d的用L(fng)信息
 cout<<"Have "<<usercount<<" users logined server:"<<endl;
 for(int i = 0;i<usercount;i++)
 {
  stUserListNode *node = new stUserListNode;
  recvfrom(sock, (char*)node, sizeof(stUserListNode), 0, (sockaddr *)&remote, &fromlen);
  ClientList.push_back(node);
  cout<<"Username:"<<node->userName<<endl;
  in_addr tmp;
  tmp.S_un.S_addr = htonl(node->ip);
  cout<<"UserIP:"<<inet_ntoa(tmp)<<endl;
  cout<<"UserPort:"<<node->port<<endl;
  cout<<""<<endl;
 }
}

void OutputUsage()
{
 cout<<"You can input you command:\n"
  <<"Command Type:\"send\",\"exit\",\"getu\"\n"
  <<"Example : send Username Message\n"
  <<"          exit\n"
  <<"          getu\n"
  <<endl;
}

/* q是主要的函敎ͼ(x)发送一个消息给某个用户(C)
 *程Q直接向某个用户的外|IP发送消息,如果此前没有联系q?br> *      那么此消息将无法发送,发送端{待时?br> *      时后,发送端发送一个请求信息到服务端,
 *      要求服务端发送给客户C一个请求,hCl本机发送打z消?br> *      以上程重复MAXRETRY?br> */
bool SendMessageTo(char *UserName, char *Message)
{
 char realmessage[256];
 unsigned int UserIP;
 unsigned short UserPort;
 bool FindUser = false;
 for(UserList::iterator UserIterator=ClientList.begin();
      UserIterator!=ClientList.end();
      ++UserIterator)
 {
  if( strcmp( ((*UserIterator)->userName), UserName) == 0 )
  {
   UserIP = (*UserIterator)->ip;
   UserPort = (*UserIterator)->port;
   FindUser = true;
  }
 }

 if(!FindUser)
  return false;

 strcpy(realmessage, Message);
 for(int i=0;i<MAXRETRY;i++)
 {
  RecvedACK = false;

  sockaddr_in remote;
  remote.sin_addr.S_un.S_addr = htonl(UserIP);
  remote.sin_family = AF_INET;
  remote.sin_port = htons(UserPort);
  stP2PMessage MessageHead;
  MessageHead.iMessageType = P2PMESSAGE;
  MessageHead.iStringLen = (int)strlen(realmessage)+1;
  int isend = sendto(PrimaryUDP, (const char *)&MessageHead, sizeof(MessageHead), 0, (const sockaddr*)&remote, sizeof(remote));
  isend = sendto(PrimaryUDP, (const char *)&realmessage, MessageHead.iStringLen, 0, (const sockaddr*)&remote, sizeof(remote));
 
  // {待接收U程此标记修改
  for(int j=0;j<10;j++)
  {
   if(RecvedACK)
    return true;
   else
    Sleep(300);
  }

  // 没有接收到目标主机的回应Q认为目标主机的端口映射没有
  // 打开Q那么发送请求信息给服务器,要服务器告诉目标L
  // 打开映射端口QUDP打洞Q?br>  sockaddr_in server;
  server.sin_addr.S_un.S_addr = inet_addr(ServerIP);
  server.sin_family = AF_INET;
  server.sin_port = htons(SERVER_PORT);
 
  stMessage transMessage;
  transMessage.iMessageType = P2PTRANS;
  strcpy(transMessage.message.translatemessage.userName, UserName);

  sendto(PrimaryUDP, (const char*)&transMessage, sizeof(transMessage), 0, (const sockaddr*)&server, sizeof(server));
  Sleep(100);// {待Ҏ(gu)先发送信息?br> }
 return false;
}

// 解析命o(h)Q暂时只有exit和send命o(h)
// 新增getu命o(h)Q获取当前服务器的所有用?br>void ParseCommand(char * CommandLine)
{
 if(strlen(CommandLine)<4)
  return;
 char Command[10];
 strncpy(Command, CommandLine, 4);
 Command[4]='\0';

 if(strcmp(Command,"exit")==0)
 {
  stMessage sendbuf;
  sendbuf.iMessageType = LOGOUT;
  strncpy(sendbuf.message.logoutmember.userName, UserName, 10);
  sockaddr_in server;
  server.sin_addr.S_un.S_addr = inet_addr(ServerIP);
  server.sin_family = AF_INET;
  server.sin_port = htons(SERVER_PORT);

  sendto(PrimaryUDP,(const char*)&sendbuf, sizeof(sendbuf), 0, (const sockaddr *)&server, sizeof(server));
  shutdown(PrimaryUDP, 2);
  closesocket(PrimaryUDP);
  exit(0);
 }
 else if(strcmp(Command,"send")==0)
 {
  char sendname[20];
  char message[COMMANDMAXC];
  int i;
  for(i=5;;i++)
  {
   if(CommandLine[i]!=' ')
    sendname[i-5]=CommandLine[i];
   else
   {
    sendname[i-5]='\0';
    break;
   }
  }
  strcpy(message, &(CommandLine[i+1]));
  if(SendMessageTo(sendname, message))
   printf("Send OK!\n");
  else
   printf("Send Failure!\n");
 }
 else if(strcmp(Command,"getu")==0)
 {
  int command = GETALLUSER;
  sockaddr_in server;
  server.sin_addr.S_un.S_addr = inet_addr(ServerIP);
  server.sin_family = AF_INET;
  server.sin_port = htons(SERVER_PORT);

  sendto(PrimaryUDP,(const char*)&command, sizeof(command), 0, (const sockaddr *)&server, sizeof(server));
 }
}

// 接受消息U程
DWORD WINAPI RecvThreadProc(LPVOID lpParameter)
{
 sockaddr_in remote;
 int sinlen = sizeof(remote);
 stP2PMessage recvbuf;
 for(;;)
 {
  int iread = recvfrom(PrimaryUDP, (char *)&recvbuf, sizeof(recvbuf), 0, (sockaddr *)&remote, &sinlen);
  if(iread<=0)
  {
   printf("recv error\n");
   continue;
  }
  switch(recvbuf.iMessageType)
  {
  case P2PMESSAGE:
   {
    // 接收到P2P的消?br>    char *comemessage= new char[recvbuf.iStringLen];
    int iread1 = recvfrom(PrimaryUDP, comemessage, 256, 0, (sockaddr *)&remote, &sinlen);
    comemessage[iread1-1] = '\0';
    if(iread1<=0)
     throw Exception("Recv Message Error\n");
    else
    {
     printf("Recv a Message:%s\n",comemessage);
     
     stP2PMessage sendbuf;
     sendbuf.iMessageType = P2PMESSAGEACK;
     sendto(PrimaryUDP, (const char*)&sendbuf, sizeof(sendbuf), 0, (const sockaddr*)&remote, sizeof(remote));
    }

    delete []comemessage;
    break;

   }
  case P2PSOMEONEWANTTOCALLYOU:
   {
    // 接收到打z命令,向指定的IP地址打洞
    printf("Recv p2someonewanttocallyou data\n");
    sockaddr_in remote;
    remote.sin_addr.S_un.S_addr = htonl(recvbuf.iStringLen);
    remote.sin_family = AF_INET;
    remote.sin_port = htons(recvbuf.Port);

    // UDP hole punching
    stP2PMessage message;
    message.iMessageType = P2PTRASH;
    sendto(PrimaryUDP, (const char *)&message, sizeof(message), 0, (const sockaddr*)&remote, sizeof(remote));
               
    break;
   }
  case P2PMESSAGEACK:
   {
    // 发送消息的应答
    RecvedACK = true;
    break;
   }
  case P2PTRASH:
   {
    // Ҏ(gu)发送的打洞消息Q忽略掉?br>    //do nothing ...
    printf("Recv p2ptrash data\n");
    break;
   }
  case GETALLUSER:
   {
    int usercount;
    int fromlen = sizeof(remote);
    int iread = recvfrom(PrimaryUDP, (char *)&usercount, sizeof(int), 0, (sockaddr *)&remote, &fromlen);
    if(iread<=0)
    {
     throw Exception("Login error\n");
    }
    
    ClientList.clear();

    cout<<"Have "<<usercount<<" users logined server:"<<endl;
    for(int i = 0;i<usercount;i++)
    {
     stUserListNode *node = new stUserListNode;
     recvfrom(PrimaryUDP, (char*)node, sizeof(stUserListNode), 0, (sockaddr *)&remote, &fromlen);
     ClientList.push_back(node);
     cout<<"Username:"<<node->userName<<endl;
     in_addr tmp;
     tmp.S_un.S_addr = htonl(node->ip);
     cout<<"UserIP:"<<inet_ntoa(tmp)<<endl;
     cout<<"UserPort:"<<node->port<<endl;
     cout<<""<<endl;
    }
    break;
   }
  }
 }
}


int main(int argc, char* argv[])
{
 try
 {
  InitWinSock();
 
  PrimaryUDP = mksock(SOCK_DGRAM);
  BindSock(PrimaryUDP);

  cout<<"Please input server ip:";
  cin>>ServerIP;

  cout<<"Please input your name:";
  cin>>UserName;

  ConnectToServer(PrimaryUDP, UserName, ServerIP);

  HANDLE threadhandle = CreateThread(NULL, 0, RecvThreadProc, NULL, NULL, NULL);
  CloseHandle(threadhandle);
  OutputUsage();

  for(;;)
  {
   char Command[COMMANDMAXC];
   gets(Command);
   ParseCommand(Command);
  }
 }
 catch(Exception &e)
 {
  printf(e.GetMessage());
  return 1;
 }
 return 0;
}

/* 异常c?br> *
 * 文g名:(x)Exception.h
 *
 * 日期Q?004.5.5
 *
 * 作者:(x)shootingstars(zhouhuis22@sina.com)
 */

#ifndef __HZH_Exception__
#define __HZH_Exception__

#define EXCEPTION_MESSAGE_MAXLEN 256
#include "string.h"

class Exception
{
private:
 char m_ExceptionMessage[EXCEPTION_MESSAGE_MAXLEN];
public:
 Exception(char *msg)
 {
  strncpy(m_ExceptionMessage, msg, EXCEPTION_MESSAGE_MAXLEN);
 }

 char *GetMessage()
 {
  return m_ExceptionMessage;
 }
};

#endif

/* P2P E序传输协议
 *
 * 日期Q?004-5-21
 *
 * 作者:(x)shootingstars(zhouhuis22@sina.com)
 *
 */

#pragma once
#include <list>

// 定义iMessageType的?br>#define LOGIN 1
#define LOGOUT 2
#define P2PTRANS 3
#define GETALLUSER  4

// 服务器端?br>#define SERVER_PORT 2280

// Clientd时向服务器发送的消息
struct stLoginMessage
{
 char userName[10];
 char password[10];
};

// Client注销时发送的消息
struct stLogoutMessage
{
 char userName[10];
};

// Client向服务器h另外一个Client(userName)向自己方向发送UDP打洞消息
struct stP2PTranslate
{
 char userName[10];
};

// Client向服务器发送的消息格式
struct stMessage
{
 int iMessageType;
 union _message
 {
  stLoginMessage loginmember;
  stLogoutMessage logoutmember;
  stP2PTranslate translatemessage;
 }message;
};

// 客户节点信息
struct stUserListNode
{
 char userName[10];
 unsigned int ip;
 unsigned short port;
};

// Server向Client发送的消息
struct stServerToClient
{
 int iMessageType;
 union _message
 {
  stUserListNode user;
 }message;

};

//======================================
// 下面的协议用于客L(fng)之间的通信
//======================================
#define P2PMESSAGE 100               // 发送消?br>#define P2PMESSAGEACK 101            // 收到消息的应{?br>#define P2PSOMEONEWANTTOCALLYOU 102  // 服务器向客户端发送的消息
                                     // 希望此客L(fng)发送一个UDP打洞?br>#define P2PTRASH        103          // 客户端发送的打洞包,接收端应该忽略此消息

// 客户端之间发送消息格?br>struct stP2PMessage
{
 int iMessageType;
 int iStringLen;         // or IP address
 unsigned short Port;
};

using namespace std;
typedef list<stUserListNode *> UserList;

工程下蝲地址:http://www.ppcn.net/upload/2004_05/04052509317298.rar

shootingstars 2007-06-12 13:23 发表评论
]]>
在Windows下编译OpenSSLQVS2005Q?http://www.shnenglu.com/shootingstars/archive/2006/02/17/3302.htmlshootingstarsshootingstarsFri, 17 Feb 2006 01:46:00 GMThttp://www.shnenglu.com/shootingstars/archive/2006/02/17/3302.htmlhttp://www.shnenglu.com/shootingstars/comments/3302.htmlhttp://www.shnenglu.com/shootingstars/archive/2006/02/17/3302.html#Feedback0http://www.shnenglu.com/shootingstars/comments/commentRss/3302.htmlhttp://www.shnenglu.com/shootingstars/services/trackbacks/3302.html详情L(fng)Q?A >http://shootingstars.cnblogs.com/archive/2006/02/17/332276.html

shootingstars 2006-02-17 09:46 发表评论
]]>
91Ʒþþþþ91 | ޹þþþþþ| þþþó˾ƷĻ| ޾þһ | ԭۺϾþô˵| þѹƷһ| þúݺݸ߳޾Ʒ| þۺ㽶AV| ޾Ʒþ| AVĻþר| þ×Ʒþþþþ| þþƷAV͵| 뾫Ʒþþþþ| ľþþƷ| þþþø߳ëƬȫ| 鶹Ʒþһ| Ʒ91þþþþþ| 91Ըߺþþþ| þþþƷþþþþ | ձþĻ| һɫۺϾþ| þþþþaëƬ| 91ƷɫۺϾþ| պƷþþþþ| þþþһƷ| þþþþþþ˳| þۺϹapp| 97þþƷһ| Ʒþþþ| ƷþþþþþþӰԺ | þ޹Ʒһ| Ʒþþþþ99| һþ㽶| Ʒþøһ| 칫ҾþþƷ| þþƷަvDz | ƷþþþӰԺɫ| þþƷƷ | 97þþþ| vaþþþ| 91þþƷһ|