﻿<?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++博客-5D空间-最新评论</title><link>http://www.cppblog.com/zhaoyao91/CommentsRSS.aspx</link><description>学习总结与经验交流</description><language>zh-cn</language><pubDate>Tue, 31 May 2011 03:37:35 GMT</pubDate><lastBuildDate>Tue, 31 May 2011 03:37:35 GMT</lastBuildDate><generator>cnblogs</generator><item><title>re: probability(概率发生器)</title><link>http://www.cppblog.com/zhaoyao91/archive/2011/05/05/143359.html#145751</link><dc:creator>egmkang</dc:creator><author>egmkang</author><pubDate>Thu, 05 May 2011 07:38:00 GMT</pubDate><guid>http://www.cppblog.com/zhaoyao91/archive/2011/05/05/143359.html#145751</guid><description><![CDATA[逗号 表达式<br>从左到右计算,然后只取最后一个值....<img src ="http://www.cppblog.com/zhaoyao91/aggbug/145751.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/zhaoyao91/" target="_blank">egmkang</a> 2011-05-05 15:38 <a href="http://www.cppblog.com/zhaoyao91/archive/2011/05/05/143359.html#145751#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: PointerPool(指针池)</title><link>http://www.cppblog.com/zhaoyao91/archive/2011/04/12/143952.html#143994</link><dc:creator>千暮(zblc)</dc:creator><author>千暮(zblc)</author><pubDate>Mon, 11 Apr 2011 16:46:00 GMT</pubDate><guid>http://www.cppblog.com/zhaoyao91/archive/2011/04/12/143952.html#143994</guid><description><![CDATA[@今晚打老虎<br>其实不用考虑得太复杂 就是计算时间（在代码中插入时钟计算间隔）、空间消耗（重载分配堆内存的内置函数）和运行效率的稳定性（代码运行的边界情况进行分析）。至于系统测试，也只是把情况划分得更加细致而已。<img src ="http://www.cppblog.com/zhaoyao91/aggbug/143994.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/zhaoyao91/" target="_blank">千暮(zblc)</a> 2011-04-12 00:46 <a href="http://www.cppblog.com/zhaoyao91/archive/2011/04/12/143952.html#143994#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: findAnWithDegreeOfTwo(计算度数为2的齐次递归数列的第n项)</title><link>http://www.cppblog.com/zhaoyao91/archive/2011/04/12/143358.html#143992</link><dc:creator>今晚打老虎</dc:creator><author>今晚打老虎</author><pubDate>Mon, 11 Apr 2011 16:24:00 GMT</pubDate><guid>http://www.cppblog.com/zhaoyao91/archive/2011/04/12/143358.html#143992</guid><description><![CDATA[@Singa<br>感谢指点！<img src ="http://www.cppblog.com/zhaoyao91/aggbug/143992.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/zhaoyao91/" target="_blank">今晚打老虎</a> 2011-04-12 00:24 <a href="http://www.cppblog.com/zhaoyao91/archive/2011/04/12/143358.html#143992#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: PointerPool(指针池)</title><link>http://www.cppblog.com/zhaoyao91/archive/2011/04/12/143952.html#143991</link><dc:creator>今晚打老虎</dc:creator><author>今晚打老虎</author><pubDate>Mon, 11 Apr 2011 16:19:00 GMT</pubDate><guid>http://www.cppblog.com/zhaoyao91/archive/2011/04/12/143952.html#143991</guid><description><![CDATA[@千暮(zblc)<br>感谢测试。其实我还在c++的摸爬滚打中，对性能测试的概念还比较模糊，也没有学习和体验过系统的测试。希望能得到有关方面的指教，比如，测试工具需要什么么？参考指标有哪些？<img src ="http://www.cppblog.com/zhaoyao91/aggbug/143991.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/zhaoyao91/" target="_blank">今晚打老虎</a> 2011-04-12 00:19 <a href="http://www.cppblog.com/zhaoyao91/archive/2011/04/12/143952.html#143991#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: PointerPool(指针池)</title><link>http://www.cppblog.com/zhaoyao91/archive/2011/04/11/143952.html#143969</link><dc:creator>千暮(zblc)</dc:creator><author>千暮(zblc)</author><pubDate>Mon, 11 Apr 2011 12:42:00 GMT</pubDate><guid>http://www.cppblog.com/zhaoyao91/archive/2011/04/11/143952.html#143969</guid><description><![CDATA[测试了下,如果把链表长度改为1w,kDefaultChunkSize长度改为100,注释掉所有输出,cases改为2w  比不用你的指针池而直接new快4-5倍.<br><br><img src ="http://www.cppblog.com/zhaoyao91/aggbug/143969.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/zhaoyao91/" target="_blank">千暮(zblc)</a> 2011-04-11 20:42 <a href="http://www.cppblog.com/zhaoyao91/archive/2011/04/11/143952.html#143969#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: PointerPool(指针池)</title><link>http://www.cppblog.com/zhaoyao91/archive/2011/04/11/143952.html#143962</link><dc:creator>bennycen</dc:creator><author>bennycen</author><pubDate>Mon, 11 Apr 2011 10:49:00 GMT</pubDate><guid>http://www.cppblog.com/zhaoyao91/archive/2011/04/11/143952.html#143962</guid><description><![CDATA[。。。。。。。。。<img src ="http://www.cppblog.com/zhaoyao91/aggbug/143962.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/zhaoyao91/" target="_blank">bennycen</a> 2011-04-11 18:49 <a href="http://www.cppblog.com/zhaoyao91/archive/2011/04/11/143952.html#143962#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: PointerPool(指针池)</title><link>http://www.cppblog.com/zhaoyao91/archive/2011/04/11/143952.html#143959</link><dc:creator>ooseven</dc:creator><author>ooseven</author><pubDate>Mon, 11 Apr 2011 10:26:00 GMT</pubDate><guid>http://www.cppblog.com/zhaoyao91/archive/2011/04/11/143952.html#143959</guid><description><![CDATA[本质上就是一个ptrvector吧？<img src ="http://www.cppblog.com/zhaoyao91/aggbug/143959.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/zhaoyao91/" target="_blank">ooseven</a> 2011-04-11 18:26 <a href="http://www.cppblog.com/zhaoyao91/archive/2011/04/11/143952.html#143959#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: findAnWithDegreeOfTwo(计算度数为2的齐次递归数列的第n项)</title><link>http://www.cppblog.com/zhaoyao91/archive/2011/04/11/143358.html#143957</link><dc:creator>Singa</dc:creator><author>Singa</author><pubDate>Mon, 11 Apr 2011 09:47:00 GMT</pubDate><guid>http://www.cppblog.com/zhaoyao91/archive/2011/04/11/143358.html#143957</guid><description><![CDATA[@今晚打老虎<br>就这个问题的话<br>a[n]     a[n-1]         r1      1           a[n+1]     a[n]<br>a[n-1]  a[n-2]         r2      0           a[n]         a[n-1]<br>上面分别是三个2*2的矩阵，前两个相乘得到第三个<br>这样子就得到一个类似等比数列的递推式了<br>r1   1<br>r2   0   类似于公比<br><br>a[2]    a[1]<br>a[1]    a[0]   类似于数列首项<br>然后算公比的n次方的时候用下快速幂取模，就实现O(logn)的复杂度了<img src ="http://www.cppblog.com/zhaoyao91/aggbug/143957.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/zhaoyao91/" target="_blank">Singa</a> 2011-04-11 17:47 <a href="http://www.cppblog.com/zhaoyao91/archive/2011/04/11/143358.html#143957#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 模板的声明与实现的分离方法</title><link>http://www.cppblog.com/zhaoyao91/archive/2011/04/11/143423.html#143937</link><dc:creator>EvilGhost</dc:creator><author>EvilGhost</author><pubDate>Mon, 11 Apr 2011 04:32:00 GMT</pubDate><guid>http://www.cppblog.com/zhaoyao91/archive/2011/04/11/143423.html#143937</guid><description><![CDATA[很遗憾，这种方法仅仅便于代码管理，还是不能绕开实现依赖，编译效率仍然没有提高。<img src ="http://www.cppblog.com/zhaoyao91/aggbug/143937.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/zhaoyao91/" target="_blank">EvilGhost</a> 2011-04-11 12:32 <a href="http://www.cppblog.com/zhaoyao91/archive/2011/04/11/143423.html#143937#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: findAnWithDegreeOfTwo(计算度数为2的齐次递归数列的第n项)</title><link>http://www.cppblog.com/zhaoyao91/archive/2011/04/08/143358.html#143669</link><dc:creator>今晚打老虎</dc:creator><author>今晚打老虎</author><pubDate>Fri, 08 Apr 2011 02:00:00 GMT</pubDate><guid>http://www.cppblog.com/zhaoyao91/archive/2011/04/08/143358.html#143669</guid><description><![CDATA[@Singa<br>矩阵乘法么，没学过耶，能指点一下么<img src ="http://www.cppblog.com/zhaoyao91/aggbug/143669.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/zhaoyao91/" target="_blank">今晚打老虎</a> 2011-04-08 10:00 <a href="http://www.cppblog.com/zhaoyao91/archive/2011/04/08/143358.html#143669#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: probability(概率发生器)</title><link>http://www.cppblog.com/zhaoyao91/archive/2011/04/07/143359.html#143571</link><dc:creator>hook</dc:creator><author>hook</author><pubDate>Wed, 06 Apr 2011 16:57:00 GMT</pubDate><guid>http://www.cppblog.com/zhaoyao91/archive/2011/04/07/143359.html#143571</guid><description><![CDATA[@今晚打老虎<br>他的意思是说在局部static变量初始化的时候就可以调用srand（使用逗号表达式），不用if/else去判断。不过确实很难看也难懂，没有必要这么做。<img src ="http://www.cppblog.com/zhaoyao91/aggbug/143571.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/zhaoyao91/" target="_blank">hook</a> 2011-04-07 00:57 <a href="http://www.cppblog.com/zhaoyao91/archive/2011/04/07/143359.html#143571#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 模板的声明与实现的分离方法</title><link>http://www.cppblog.com/zhaoyao91/archive/2011/04/06/143423.html#143552</link><dc:creator>right</dc:creator><author>right</author><pubDate>Wed, 06 Apr 2011 12:00:00 GMT</pubDate><guid>http://www.cppblog.com/zhaoyao91/archive/2011/04/06/143423.html#143552</guid><description><![CDATA[.hpp<br>.inl<br>.cpp<br><img src ="http://www.cppblog.com/zhaoyao91/aggbug/143552.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/zhaoyao91/" target="_blank">right</a> 2011-04-06 20:00 <a href="http://www.cppblog.com/zhaoyao91/archive/2011/04/06/143423.html#143552#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 模板的声明与实现的分离方法</title><link>http://www.cppblog.com/zhaoyao91/archive/2011/04/06/143423.html#143538</link><dc:creator>陈梓瀚(vczh)</dc:creator><author>陈梓瀚(vczh)</author><pubDate>Wed, 06 Apr 2011 08:43:00 GMT</pubDate><guid>http://www.cppblog.com/zhaoyao91/archive/2011/04/06/143423.html#143538</guid><description><![CDATA[@空明流转<br>直接写一起不就好了<img src ="http://www.cppblog.com/zhaoyao91/aggbug/143538.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/zhaoyao91/" target="_blank">陈梓瀚(vczh)</a> 2011-04-06 16:43 <a href="http://www.cppblog.com/zhaoyao91/archive/2011/04/06/143423.html#143538#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 模板的声明与实现的分离方法</title><link>http://www.cppblog.com/zhaoyao91/archive/2011/04/05/143423.html#143451</link><dc:creator>今晚打老虎</dc:creator><author>今晚打老虎</author><pubDate>Tue, 05 Apr 2011 09:13:00 GMT</pubDate><guid>http://www.cppblog.com/zhaoyao91/archive/2011/04/05/143423.html#143451</guid><description><![CDATA[@空明流转<br>请教更多细节。<img src ="http://www.cppblog.com/zhaoyao91/aggbug/143451.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/zhaoyao91/" target="_blank">今晚打老虎</a> 2011-04-05 17:13 <a href="http://www.cppblog.com/zhaoyao91/archive/2011/04/05/143423.html#143451#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: findAnWithDegreeOfTwo(计算度数为2的齐次递归数列的第n项)</title><link>http://www.cppblog.com/zhaoyao91/archive/2011/04/05/143358.html#143445</link><dc:creator>Singa</dc:creator><author>Singa</author><pubDate>Tue, 05 Apr 2011 07:24:00 GMT</pubDate><guid>http://www.cppblog.com/zhaoyao91/archive/2011/04/05/143358.html#143445</guid><description><![CDATA[这样做的时间复杂度是O(n)，可以利用矩阵乘法来做，把时间复杂度降低到O(logn)。<img src ="http://www.cppblog.com/zhaoyao91/aggbug/143445.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/zhaoyao91/" target="_blank">Singa</a> 2011-04-05 15:24 <a href="http://www.cppblog.com/zhaoyao91/archive/2011/04/05/143358.html#143445#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>