﻿<?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++博客-金庆的专栏-随笔分类-5. 其它</title><link>http://www.cppblog.com/jinq0123/category/5141.html</link><description /><language>zh-cn</language><lastBuildDate>Tue, 04 Dec 2007 20:32:00 GMT</lastBuildDate><pubDate>Tue, 04 Dec 2007 20:32:00 GMT</pubDate><ttl>60</ttl><item><title>TLMDTrackBar造成程序启动时崩溃</title><link>http://www.cppblog.com/jinq0123/archive/2007/12/04/TLMDTrackBarCrash.html</link><dc:creator>金庆</dc:creator><author>金庆</author><pubDate>Tue, 04 Dec 2007 07:08:00 GMT</pubDate><guid>http://www.cppblog.com/jinq0123/archive/2007/12/04/TLMDTrackBarCrash.html</guid><wfw:comment>http://www.cppblog.com/jinq0123/comments/37790.html</wfw:comment><comments>http://www.cppblog.com/jinq0123/archive/2007/12/04/TLMDTrackBarCrash.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/jinq0123/comments/commentRss/37790.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/jinq0123/services/trackbacks/37790.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: TLMDTrackBar造成程序启动时崩溃。原因是创建窗体时，触发了TLMDTrackBar的OnChange事件。而此时窗体中的控件还没有全部创建完成，在事件中引用其它尚未创建的控件就会造成程序崩溃。但是标准的TTrackBar就不会在创建时触发OnChange事件。 &nbsp;&nbsp;<a href='http://www.cppblog.com/jinq0123/archive/2007/12/04/TLMDTrackBarCrash.html'>阅读全文</a><img src ="http://www.cppblog.com/jinq0123/aggbug/37790.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/jinq0123/" target="_blank">金庆</a> 2007-12-04 15:08 <a href="http://www.cppblog.com/jinq0123/archive/2007/12/04/TLMDTrackBarCrash.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>混音算法的学习与研究</title><link>http://www.cppblog.com/jinq0123/archive/2007/10/31/AudioMixingStudy.html</link><dc:creator>金庆</dc:creator><author>金庆</author><pubDate>Wed, 31 Oct 2007 09:27:00 GMT</pubDate><guid>http://www.cppblog.com/jinq0123/archive/2007/10/31/AudioMixingStudy.html</guid><wfw:comment>http://www.cppblog.com/jinq0123/comments/35615.html</wfw:comment><comments>http://www.cppblog.com/jinq0123/archive/2007/10/31/AudioMixingStudy.html#Feedback</comments><slash:comments>4</slash:comments><wfw:commentRss>http://www.cppblog.com/jinq0123/comments/commentRss/35615.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/jinq0123/services/trackbacks/35615.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 曾经看到这样一篇混音新算法的转载文章[3]，一直想应用一下。再次翻到那篇文章，算法很简单，表达也很清晰，就是不知道原理。如果对多路混音该如何扩展算法呢？看来不能盲目照搬没有根据的算法。作者自己说，该算法对于5个通道以上就不太好，算法的好处是不会溢出。但有人反映声音有饱和的趋向。&nbsp;&nbsp;<a href='http://www.cppblog.com/jinq0123/archive/2007/10/31/AudioMixingStudy.html'>阅读全文</a><img src ="http://www.cppblog.com/jinq0123/aggbug/35615.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/jinq0123/" target="_blank">金庆</a> 2007-10-31 17:27 <a href="http://www.cppblog.com/jinq0123/archive/2007/10/31/AudioMixingStudy.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>有难度的算法笔试题：芯片测试</title><link>http://www.cppblog.com/jinq0123/archive/2007/09/24/GoodBadChipTest.html</link><dc:creator>金庆</dc:creator><author>金庆</author><pubDate>Mon, 24 Sep 2007 07:01:00 GMT</pubDate><guid>http://www.cppblog.com/jinq0123/archive/2007/09/24/GoodBadChipTest.html</guid><wfw:comment>http://www.cppblog.com/jinq0123/comments/32787.html</wfw:comment><comments>http://www.cppblog.com/jinq0123/archive/2007/09/24/GoodBadChipTest.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/jinq0123/comments/commentRss/32787.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/jinq0123/services/trackbacks/32787.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 摘要：3）芯片测试：有2k块芯片，已知好芯片比坏芯片多。请设计算法从其中找出一片好芯片，说明你所用的比较次数上限。好芯片和其它芯片比较时，能正确给出另一块芯片是好还是坏。坏芯片和其它芯片比较时，会随机的给出好或是坏。xlfddlfd 的算法很好,学习一下. 这个算法比我之前的算法要快得多. &nbsp;&nbsp;<a href='http://www.cppblog.com/jinq0123/archive/2007/09/24/GoodBadChipTest.html'>阅读全文</a><img src ="http://www.cppblog.com/jinq0123/aggbug/32787.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/jinq0123/" target="_blank">金庆</a> 2007-09-24 15:01 <a href="http://www.cppblog.com/jinq0123/archive/2007/09/24/GoodBadChipTest.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>Unix编程哲学</title><link>http://www.cppblog.com/jinq0123/archive/2007/08/29/UnixPhilosophy.html</link><dc:creator>金庆</dc:creator><author>金庆</author><pubDate>Wed, 29 Aug 2007 07:32:00 GMT</pubDate><guid>http://www.cppblog.com/jinq0123/archive/2007/08/29/UnixPhilosophy.html</guid><wfw:comment>http://www.cppblog.com/jinq0123/comments/31159.html</wfw:comment><comments>http://www.cppblog.com/jinq0123/archive/2007/08/29/UnixPhilosophy.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/jinq0123/comments/commentRss/31159.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/jinq0123/services/trackbacks/31159.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: Unix编程哲学。参考其它另外三个不同版本的翻译。模块化准则，清晰性准则，组合准则，分离准则，简单性准则，吝啬准则，透明性准则，健壮性准则，表示准则，最小惊奇准则，沉默准则，修复准则，经济性准则，生成准则，优化准则，多样性准则，扩展性准则。<br>&nbsp;&nbsp;<a href='http://www.cppblog.com/jinq0123/archive/2007/08/29/UnixPhilosophy.html'>阅读全文</a><img src ="http://www.cppblog.com/jinq0123/aggbug/31159.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/jinq0123/" target="_blank">金庆</a> 2007-08-29 15:32 <a href="http://www.cppblog.com/jinq0123/archive/2007/08/29/UnixPhilosophy.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>太可怕了!近视手术原来是医学界的一个阴谋!</title><link>http://www.cppblog.com/jinq0123/archive/2007/08/24/LASIKnotSafe.html</link><dc:creator>金庆</dc:creator><author>金庆</author><pubDate>Fri, 24 Aug 2007 03:31:00 GMT</pubDate><guid>http://www.cppblog.com/jinq0123/archive/2007/08/24/LASIKnotSafe.html</guid><wfw:comment>http://www.cppblog.com/jinq0123/comments/30752.html</wfw:comment><comments>http://www.cppblog.com/jinq0123/archive/2007/08/24/LASIKnotSafe.html#Feedback</comments><slash:comments>4</slash:comments><wfw:commentRss>http://www.cppblog.com/jinq0123/comments/commentRss/30752.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/jinq0123/services/trackbacks/30752.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: LASIK激光手术作为最近风靡一时的治疗近视眼的方法，从1997年开展第一例LASIK手术以来，至今为止，全中国约有几百万例病人实施 了这一手术。那么，LASIK致命的缺点是什么呢？&nbsp;&nbsp;<a href='http://www.cppblog.com/jinq0123/archive/2007/08/24/LASIKnotSafe.html'>阅读全文</a><img src ="http://www.cppblog.com/jinq0123/aggbug/30752.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/jinq0123/" target="_blank">金庆</a> 2007-08-24 11:31 <a href="http://www.cppblog.com/jinq0123/archive/2007/08/24/LASIKnotSafe.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>秘笈的最后半页, 成为软件开发高手</title><link>http://www.cppblog.com/jinq0123/archive/2007/08/17/ToBeAGuru.html</link><dc:creator>金庆</dc:creator><author>金庆</author><pubDate>Fri, 17 Aug 2007 07:47:00 GMT</pubDate><guid>http://www.cppblog.com/jinq0123/archive/2007/08/17/ToBeAGuru.html</guid><wfw:comment>http://www.cppblog.com/jinq0123/comments/30251.html</wfw:comment><comments>http://www.cppblog.com/jinq0123/archive/2007/08/17/ToBeAGuru.html#Feedback</comments><slash:comments>6</slash:comments><wfw:commentRss>http://www.cppblog.com/jinq0123/comments/commentRss/30251.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/jinq0123/services/trackbacks/30251.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 软件开发高手秘笈的最后半页的内容，最具威力最难练的绝招。阅读“软件开发高手：十年磨一剑”一文，心有同感。想像一下，两个程序员，一人仅得到这最后的半页残书，一人所得秘笈缺少最后半页，各自苦练，终成高手……&nbsp;&nbsp;<a href='http://www.cppblog.com/jinq0123/archive/2007/08/17/ToBeAGuru.html'>阅读全文</a><img src ="http://www.cppblog.com/jinq0123/aggbug/30251.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/jinq0123/" target="_blank">金庆</a> 2007-08-17 15:47 <a href="http://www.cppblog.com/jinq0123/archive/2007/08/17/ToBeAGuru.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>自定义Firefox的配置保存路径</title><link>http://www.cppblog.com/jinq0123/archive/2007/07/12/firefoxprofile.html</link><dc:creator>金庆</dc:creator><author>金庆</author><pubDate>Thu, 12 Jul 2007 02:20:00 GMT</pubDate><guid>http://www.cppblog.com/jinq0123/archive/2007/07/12/firefoxprofile.html</guid><wfw:comment>http://www.cppblog.com/jinq0123/comments/27888.html</wfw:comment><comments>http://www.cppblog.com/jinq0123/archive/2007/07/12/firefoxprofile.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/jinq0123/comments/commentRss/27888.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/jinq0123/services/trackbacks/27888.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: Firefox的默认配置保存路径为：<br>C:\Documents and Settings\jinq\Application Data\Mozilla\Firefox\Profiles<br>不同用户有自己的配置。<br><br>可是我希望我自己的一个管理员用户与普通用户帐号使用相同的配置，如书签保持一致，插件配置保持一致。&nbsp;&nbsp;<a href='http://www.cppblog.com/jinq0123/archive/2007/07/12/firefoxprofile.html'>阅读全文</a><img src ="http://www.cppblog.com/jinq0123/aggbug/27888.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/jinq0123/" target="_blank">金庆</a> 2007-07-12 10:20 <a href="http://www.cppblog.com/jinq0123/archive/2007/07/12/firefoxprofile.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>