锘??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>&#x4E45;&#x4E45;&#x798F;&#x5229;&#x6BDB;&#x7247;&#x2C;&#x4E9A;&#x6D32;&#x7CBE;&#x54C1;&#x6210;&#x4EBA;&#x4E45;&#x4E45;&#x4E45;&#x2C;&#x6B27;&#x7F8E;&#x5348;&#x591C;&#x7CBE;&#x54C1;&#x4E45;&#x4E45;&#x4E45;&#x4E45;&#x4E45;&#x871C;</title><link>http://www.aygfsteel.com/chaocai/category/45371.html</link><description /><language>zh-cn</language><lastBuildDate>Sun, 05 Aug 2012 21:12:00 GMT</lastBuildDate><pubDate>Sun, 05 Aug 2012 21:12:00 GMT</pubDate><ttl>60</ttl><item><title>The Clojure Program To solve N Queens Problem</title><link>http://www.aygfsteel.com/chaocai/archive/2012/08/05/384844.html</link><dc:creator>瓚呰秺宸呭嘲</dc:creator><author>瓚呰秺宸呭嘲</author><pubDate>Sun, 05 Aug 2012 15:26:00 GMT</pubDate><guid>http://www.aygfsteel.com/chaocai/archive/2012/08/05/384844.html</guid><wfw:comment>http://www.aygfsteel.com/chaocai/comments/384844.html</wfw:comment><comments>http://www.aygfsteel.com/chaocai/archive/2012/08/05/384844.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.aygfsteel.com/chaocai/comments/commentRss/384844.html</wfw:commentRss><trackback:ping>http://www.aygfsteel.com/chaocai/services/trackbacks/384844.html</trackback:ping><description><![CDATA[<div>The following program is about solving N-Queens problem (http://en.wikipedia.org/wiki/Eight_queens_puzzle) by Clojure. If you have the better solution in Clojure or Haskell, welcome to provide your solution.<br />
(ns queens)</div>
<div>(defn conflictInRow? [queens newqueen]</div>
<div>&nbsp; (some #(= newqueen %) queens)</div>
<div>)</div>
<div></div>
<div>(defn conflictInDia? [queens newqueen]</div>
<div>&nbsp; (let [dia (count queens)&nbsp;</div>
<div>&nbsp; &nbsp; &nbsp; &nbsp; n1 (fn [queen] (Math/abs (- dia (.indexOf queens queen))))</div>
<div>&nbsp; &nbsp; &nbsp; &nbsp; n2 (fn [queen] (Math/abs (- newqueen queen)))]</div>
<div>&nbsp; &nbsp; (some #(= (n1 %) (n2 %)) queens)</div>
<div>&nbsp; &nbsp;)</div>
<div>&nbsp;)</div>
<div></div>
<div>(defn conflict? [queens newqueen]</div>
<div>&nbsp; (or (conflictInRow? queens newqueen) (conflictInDia? queens newqueen))</div>
<div>&nbsp;)</div>
<div></div>
<div>(def cnt (atom 0))</div>
<div></div>
<div>(defn put-queens [queens newqueen boardSize ]</div>
<div></div>
<div>&nbsp; (if (= (count queens) boardSize) &nbsp;</div>
<div>&nbsp; &nbsp; (do</div>
<div>&nbsp; &nbsp; &nbsp; (println queens)</div>
<div>&nbsp; &nbsp; &nbsp; (reset! cnt (inc @cnt))</div>
<div>&nbsp; &nbsp; )</div>
<div>&nbsp; &nbsp; (do&nbsp;</div>
<div>&nbsp; &nbsp; &nbsp; ;(println queens)</div>
<div>&nbsp; &nbsp; &nbsp; (if (&gt; newqueen boardSize)</div>
<div>&nbsp; &nbsp; &nbsp;</div>
<div>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;(if (and (= (peek queens) boardSize) (= (count queens) 1))</div>
<div>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;(throw (Exception. (str "That's all " @cnt)))</div>
<div>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;(recur (pop queens) (inc (peek queens)) boardSize )</div>
<div>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;)</div>
<div>&nbsp; &nbsp; &nbsp;</div>
<div>&nbsp; &nbsp; &nbsp; &nbsp; (if (conflict? queens newqueen)</div>
<div>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;&nbsp;</div>
<div>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;(recur queens (inc newqueen) boardSize )</div>
<div>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;</div>
<div>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; (do</div>
<div>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;(put-queens (conj queens newqueen) 1 boardSize )</div>
<div>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;(recur queens (inc newqueen) boardSize )</div>
<div>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;)</div>
<div>&nbsp; &nbsp; &nbsp; &nbsp; )</div>
<div>&nbsp; &nbsp; &nbsp; &nbsp;)</div>
<div>&nbsp; &nbsp; &nbsp; )</div>
<div>&nbsp; &nbsp; )</div>
<div>&nbsp; &nbsp;&nbsp;</div>
<div>)</div>
<div></div>
<div></div>
<div></div>
<div>(defn queens [boardSize]&nbsp;</div>
<div>&nbsp; &nbsp; (put-queens [] 1 boardSize)</div>
<div>&nbsp;)<br /><br /><br />Chao Cai (钄¤秴錛?/div>
<div><br />Sr. Software Dev Engineer&nbsp;<br />Amazon.com<br /><br /></div>
<div>&nbsp;</div>
<div></div><img src ="http://www.aygfsteel.com/chaocai/aggbug/384844.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.aygfsteel.com/chaocai/" target="_blank">瓚呰秺宸呭嘲</a> 2012-08-05 23:26 <a href="http://www.aygfsteel.com/chaocai/archive/2012/08/05/384844.html#Feedback" target="_blank" style="text-decoration:none;">鍙戣〃璇勮</a></div>]]></description></item><item><title>TDD Tips</title><link>http://www.aygfsteel.com/chaocai/archive/2011/01/09/342623.html</link><dc:creator>瓚呰秺宸呭嘲</dc:creator><author>瓚呰秺宸呭嘲</author><pubDate>Sun, 09 Jan 2011 08:55:00 GMT</pubDate><guid>http://www.aygfsteel.com/chaocai/archive/2011/01/09/342623.html</guid><wfw:comment>http://www.aygfsteel.com/chaocai/comments/342623.html</wfw:comment><comments>http://www.aygfsteel.com/chaocai/archive/2011/01/09/342623.html#Feedback</comments><slash:comments>1</slash:comments><wfw:commentRss>http://www.aygfsteel.com/chaocai/comments/commentRss/342623.html</wfw:commentRss><trackback:ping>http://www.aygfsteel.com/chaocai/services/trackbacks/342623.html</trackback:ping><description><![CDATA[<p>How to design the testable software? You may always find some best practices about designing for scalable, extensible or maintainable. To be testable, the best way should be TDD. Followings are some tips from my real practices on TDD.</p>
<p>1 TDD is design process; it let you design for testing, naturally</p>
<p>Write the test firstly, it does not only help you find the bugs; but the most important point is to let you design for test naturally. </p>
<p>Also you should keep in mind, tests not only help you find bugs, but also protect your codes; when some changes impact on your existing codes, the tests will be broken.</p>
<p>&nbsp;</p>
<p>2 Keep the implementation simple</p>
<p>Keep your implementation simple, just let the test pass. The complex implementation may introduce the logics or codes not covered by the tests, even leads some codes not testable.</p>
<p>&nbsp;</p>
<p>3 TDD in each scope.</p>
<p>You may get to know the concept ATDD (acceptance test driven development). TDD could be used in every phase of the development and by the different granularity.</p>
<p>To ATDD, you could consider on using some existing framework such as FIT, these frameworks will be bridge between business logic and implementation logic.</p>
<p>Recently, the concept BDD (behavior driven development) is introduced to the ATDD process, so the BDD frameworks such as JBehave is also the good choice. </p>
<p>&nbsp;<img height="367" alt="" src="http://www.aygfsteel.com/images/blogjava_net/chaocai/TDD.JPG" width="523" border="0" /></p>
<p><br />
Different TDD process could be nested and should be nested don&#8217;t let your step too large.</p>
<p>&nbsp;</p>
<p>4 keep each step small enough</p>
<p>Always keep each step small to avoid introducing the untestable codes or logics and pass each test quickly.</p>
<p>&nbsp;</p>
<p>&nbsp;</p>
<p>6 Always refactor</p>
<p>This step is always overlooked in TDD process; however it is the very important step. Also, never forget refactor should involve all your tests.</p>
<p>&nbsp;</p>
<p>Why can't write test firstly?</p>
<p>&nbsp;1.not think how to meature the codes </p>
<p>2. The current step maybe too large, should separate into small ones </p>
<p>3. The codes with ugly dependencies<br />
</p>
<p><br />
<a title="http://blog.csdn.net/chaocai2004/archive/2011/01/09/6125479.aspx" >&nbsp;http://blog.csdn.net/chaocai2004/archive/2011/01/09/6125479.aspx</a><br />
</p>
<p><br />
Chao Cai (钄¤秴)</p>
<p>Sr. SDE</p>
<p>Amazon.com</p>
<p>&nbsp;</p>
<img src ="http://www.aygfsteel.com/chaocai/aggbug/342623.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.aygfsteel.com/chaocai/" target="_blank">瓚呰秺宸呭嘲</a> 2011-01-09 16:55 <a href="http://www.aygfsteel.com/chaocai/archive/2011/01/09/342623.html#Feedback" target="_blank" style="text-decoration:none;">鍙戣〃璇勮</a></div>]]></description></item><item><title>綆楁硶鐨勬椂闂村鏉傚害</title><link>http://www.aygfsteel.com/chaocai/archive/2010/06/18/323815.html</link><dc:creator>瓚呰秺宸呭嘲</dc:creator><author>瓚呰秺宸呭嘲</author><pubDate>Fri, 18 Jun 2010 07:26:00 GMT</pubDate><guid>http://www.aygfsteel.com/chaocai/archive/2010/06/18/323815.html</guid><wfw:comment>http://www.aygfsteel.com/chaocai/comments/323815.html</wfw:comment><comments>http://www.aygfsteel.com/chaocai/archive/2010/06/18/323815.html#Feedback</comments><slash:comments>1</slash:comments><wfw:commentRss>http://www.aygfsteel.com/chaocai/comments/commentRss/323815.html</wfw:commentRss><trackback:ping>http://www.aygfsteel.com/chaocai/services/trackbacks/323815.html</trackback:ping><description><![CDATA[&nbsp;
<p><span style="font-family: 瀹嬩綋">鐩鎬俊澶у瀵逛簬綆楁硶鐨勬椂闂村鏉傚害</span><span style="font-family: 瀹嬩綋">O閮戒笉浼氶檶鐢燂紝涓嶈繃浣犵煡閬撲竴涓畻娉曠殑鏃墮棿澶嶆潅搴︽槸濡備綍璁＄畻鍑烘潵鐨勫悧錛?/span></p>
<p><span style="font-family: 瀹嬩綋">浠ュ墠鍦ㄥ涔犵畻娉曞拰鏁版嵁緇撴瀯鐨勬椂鍊欙紝瀵逛簬姣忕綆楁硶鐨勫鏉傚害閮芥槸姝昏鐨勫茍娌℃湁鐪熸鐨勫幓鐮旂┒浠栦滑鏄浣曡綆楀嚭鏉ワ紝鏈�榪戠獊鐒跺綆楁硶浜х敓浜嗗叴瓚ｏ紝榪嬌鑷繁鐮旂┒浜嗕竴涓嬬畻娉曞鏉傚害鐨勮綆楁柟娉曘�?/span></p>
<p><span style="font-family: 瀹嬩綋">姒傚康</span></p>
<p><span style="font-family: 瀹嬩綋">澶?/span><span style="font-family: 瀹嬩綋">O琛ㄧず娉曡〃紺烘椂闂村鏉傛�э紝娉ㄦ剰瀹冩槸鏌愪竴涓畻娉曠殑鏃墮棿澶嶆潅鎬с�傚ぇO琛ㄧず鍙槸璇存湁涓婄晫錛岀敱瀹氫箟濡傛灉f(n)=O(n)錛岄偅鏄劇劧鎴愮珛f(n)=O(n^2)錛屽畠緇欎綘涓�涓笂鐣岋紝浣嗗茍涓嶆槸涓婄‘鐣岋紝浣嗕漢浠湪琛ㄧず鐨勬椂鍊欎竴鑸兘涔犳儻琛ㄧず鍓嶈�?/span><span style="font-family: 瀹嬩綋">銆?/span></p>
<p><span style="font-family: 瀹嬩綋">鍙﹀闄や簡榪欎釜瀹樻柟姒傚康錛屼釜浜鴻涓哄ぇ</span><span style="font-family: 瀹嬩綋">O琛ㄧず鐨勬槸闂瑙勬ān鍜岀畻娉曚腑璇彞鎵ц嬈℃暟鐨勫叧緋匯�?/span></p>
<p><span style="font-family: 瀹嬩綋">浠ヤ簩鍒嗘煡鎵句負渚嬶紝鎴戜滑姹傝В瀹冪殑鏃墮棿澶嶆潅搴?/span></p>
<p><span style="font-family: 瀹嬩綋">1 璁捐妯′負n涓厓绱犳椂錛岃鎵цT(n)嬈?/span></p>
<p><span style="font-family: 瀹嬩綋">T(n)=T(n/2)+1</span></p>
<p><span style="font-family: 瀹嬩綋">T(n)=[T(n/4)+1]+1</span></p>
<p><span style="font-family: 瀹嬩綋">&#8230;</span></p>
<p><span style="font-family: 瀹嬩綋">T(n)=T(n/2^m)+m</span></p>
<p><span style="font-family: 瀹嬩綋">褰?/span><span style="font-family: 瀹嬩綋">n=2^m</span></p>
<p><span style="font-family: 瀹嬩綋">T(n)=T(1)+log2n</span></p>
<p><span style="font-family: 瀹嬩綋">T(1)=1</span></p>
<p><span style="font-family: 瀹嬩綋">鎵�浠ュ叾綆楁硶澶嶆潅搴︿負</span><span style="font-family: 瀹嬩綋">O錛坙og2n錛?/span></p><img src ="http://www.aygfsteel.com/chaocai/aggbug/323815.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.aygfsteel.com/chaocai/" target="_blank">瓚呰秺宸呭嘲</a> 2010-06-18 15:26 <a href="http://www.aygfsteel.com/chaocai/archive/2010/06/18/323815.html#Feedback" target="_blank" style="text-decoration:none;">鍙戣〃璇勮</a></div>]]></description></item></channel></rss>            <footer>
<div class="friendship-link">
<a href="http://www.aygfsteel.com/" title="&#29408;&#29408;&#20037;&#20037;&#20122;&#27954;&#27431;&#32654;&#19987;&#21306;&#95;&#20013;&#25991;&#23383;&#24149;&#20122;&#27954;&#32508;&#21512;&#20037;&#20037;&#50;&#48;&#50;&#95;&#22269;&#20135;&#31934;&#21697;&#20122;&#27954;&#31532;&#20116;&#21306;&#22312;&#32447;&#95;&#26085;&#26412;&#20813;&#36153;&#32593;&#31449;&#35270;&#39057;">&#29408;&#29408;&#20037;&#20037;&#20122;&#27954;&#27431;&#32654;&#19987;&#21306;&#95;&#20013;&#25991;&#23383;&#24149;&#20122;&#27954;&#32508;&#21512;&#20037;&#20037;&#50;&#48;&#50;&#95;&#22269;&#20135;&#31934;&#21697;&#20122;&#27954;&#31532;&#20116;&#21306;&#22312;&#32447;&#95;&#26085;&#26412;&#20813;&#36153;&#32593;&#31449;&#35270;&#39057;</a>

</div>

</footer>


主站蜘蛛池模板：
<a href="http://" target="_blank">湖北省</a>|
<a href="http://" target="_blank">海盐县</a>|
<a href="http://" target="_blank">浑源县</a>|
<a href="http://" target="_blank">韶关市</a>|
<a href="http://" target="_blank">镇坪县</a>|
<a href="http://" target="_blank">独山县</a>|
<a href="http://" target="_blank">浏阳市</a>|
<a href="http://" target="_blank">甘泉县</a>|
<a href="http://" target="_blank">鄱阳县</a>|
<a href="http://" target="_blank">洱源县</a>|
<a href="http://" target="_blank">渭南市</a>|
<a href="http://" target="_blank">徐水县</a>|
<a href="http://" target="_blank">定陶县</a>|
<a href="http://" target="_blank">清新县</a>|
<a href="http://" target="_blank">永宁县</a>|
<a href="http://" target="_blank">乌鲁木齐县</a>|
<a href="http://" target="_blank">连江县</a>|
<a href="http://" target="_blank">宝应县</a>|
<a href="http://" target="_blank">印江</a>|
<a href="http://" target="_blank">芷江</a>|
<a href="http://" target="_blank">昂仁县</a>|
<a href="http://" target="_blank">革吉县</a>|
<a href="http://" target="_blank">广水市</a>|
<a href="http://" target="_blank">宁陵县</a>|
<a href="http://" target="_blank">二连浩特市</a>|
<a href="http://" target="_blank">靖江市</a>|
<a href="http://" target="_blank">秀山</a>|
<a href="http://" target="_blank">原阳县</a>|
<a href="http://" target="_blank">台东县</a>|
<a href="http://" target="_blank">汝州市</a>|
<a href="http://" target="_blank">英超</a>|
<a href="http://" target="_blank">洛宁县</a>|
<a href="http://" target="_blank">镇宁</a>|
<a href="http://" target="_blank">友谊县</a>|
<a href="http://" target="_blank">衡东县</a>|
<a href="http://" target="_blank">楚雄市</a>|
<a href="http://" target="_blank">昌都县</a>|
<a href="http://" target="_blank">印江</a>|
<a href="http://" target="_blank">马公市</a>|
<a href="http://" target="_blank">托里县</a>|
<a href="http://" target="_blank">乌什县</a>|
<script>
(function(){
    var bp = document.createElement('script');
    var curProtocol = window.location.protocol.split(':')[0];
    if (curProtocol === 'https') {
        bp.src = 'https://zz.bdstatic.com/linksubmit/push.js';
    }
    else {
        bp.src = 'http://push.zhanzhang.baidu.com/push.js';
    }
    var s = document.getElementsByTagName("script")[0];
    s.parentNode.insertBefore(bp, s);
})();
</script>
</body>