<?xml version="1.0" encoding="utf-8"?><feed xmlns="http://www.w3.org/2005/Atom"><title type="text">博客园_DUST</title><subtitle type="text">Do the things I want to do</subtitle><id>http://feed.cnblogs.com/blog/u/36174/rss</id><updated>2008-09-23T07:51:27Z</updated><author><name>should</name><uri>http://www.cnblogs.com/dust/</uri></author><generator>CNBlogs BlogServer</generator><link rel="alternate" type="text/html" href="http://www.cnblogs.com/dust/"/><link rel="self" type="application/atom+xml" href="http://feed.cnblogs.com/blog/u/36174/rss"/><entry><id>http://www.cnblogs.com/dust/archive/2008/09/23/1297080.html</id><title type="text">WinDBG设置debug msg 输出信息级别</title><summary type="text">在Vista之后，debug信息可以用DbgPrintEx或KdPrintEx有条件地输出。(之前的2003 server或xp等，则是无条件输出，需要自己封装，设定debug信息级别)DbgPrintEx在WinDBG中的信息级别按照如下方式定义：If Level is equal to a number between 0 and 31, inclusive, it isinterpreted...</summary><published>2008-09-23T07:51:00Z</published><updated>2008-09-23T07:51:00Z</updated><author><name>should</name><uri>http://www.cnblogs.com/dust/</uri></author><link rel="alternate" href="http://www.cnblogs.com/dust/archive/2008/09/23/1297080.html"/><link rel="alternate" type="text/html" href="http://www.cnblogs.com/dust/archive/2008/09/23/1297080.html"/></entry><entry><id>http://www.cnblogs.com/dust/archive/2008/09/08/1286824.html</id><title type="text">Python 笔记(3) -- More on Data Structures</title><summary type="text">1. More on List a) Functional Programming Tools： filter(function, sequence): returns a sequence consisting of those items from the sequence for which function(item) is true.如果sequence是string或tuple，则fi...</summary><published>2008-09-08T08:32:00Z</published><updated>2008-09-08T08:32:00Z</updated><author><name>should</name><uri>http://www.cnblogs.com/dust/</uri></author><link rel="alternate" href="http://www.cnblogs.com/dust/archive/2008/09/08/1286824.html"/><link rel="alternate" type="text/html" href="http://www.cnblogs.com/dust/archive/2008/09/08/1286824.html"/></entry><entry><id>http://www.cnblogs.com/dust/archive/2008/09/03/1282900.html</id><title type="text">Python 笔记(2) -- Control Flow</title><summary type="text">[Src: Python 2.5 Document]1. if-statement与C/C++不同的是，Python中 if 或 elif 要以 : 结尾[代码]2. for-statement iterates over the items of any sequence(a list or a string)[代码]若要修改序列中的内容，就只能在序列的副本上遍历。这里只能修改list的内容[代...</summary><published>2008-09-03T11:00:00Z</published><updated>2008-09-03T11:00:00Z</updated><author><name>should</name><uri>http://www.cnblogs.com/dust/</uri></author><link rel="alternate" href="http://www.cnblogs.com/dust/archive/2008/09/03/1282900.html"/><link rel="alternate" type="text/html" href="http://www.cnblogs.com/dust/archive/2008/09/03/1282900.html"/></entry><entry><id>http://www.cnblogs.com/dust/archive/2008/09/02/1282160.html</id><title type="text">Python 笔记(1)</title><summary type="text">字符串以双引号"或单引号'为边界，期间可用\。以"""引起来的字符串以其自有的格式保存，无需加\n之类的转义字符。字符串不可以通过下标来修改这里是中字符串的索引方式：[代码]List的简单应用：[代码]List可以嵌套：[代码]multiple assignment：[代码]在赋值前，会先按照从左到右的顺序检查右边表达式。</summary><published>2008-09-02T09:01:00Z</published><updated>2008-09-02T09:01:00Z</updated><author><name>should</name><uri>http://www.cnblogs.com/dust/</uri></author><link rel="alternate" href="http://www.cnblogs.com/dust/archive/2008/09/02/1282160.html"/><link rel="alternate" type="text/html" href="http://www.cnblogs.com/dust/archive/2008/09/02/1282160.html"/></entry><entry><id>http://www.cnblogs.com/dust/archive/2008/06/01/1211592.html</id><title type="text">Lucky Sequence[SRM403DIVI500]</title><summary type="text">1. 将所有Lucky Number按照(4,4)，(4,7)，（7,4)，(7,7)分类，分别计算不重复的数的个数存于矩阵中：--------------- | (4,4) | (4,7) | --------------- ====&amp;gt; A | (7,4) | (7,7) | ---------------2. 求长度为length的Lucky Sequence的个数。这里应用矩阵乘法即可...</summary><published>2008-06-01T05:46:00Z</published><updated>2008-06-01T05:46:00Z</updated><author><name>should</name><uri>http://www.cnblogs.com/dust/</uri></author><link rel="alternate" href="http://www.cnblogs.com/dust/archive/2008/06/01/1211592.html"/><link rel="alternate" type="text/html" href="http://www.cnblogs.com/dust/archive/2008/06/01/1211592.html"/></entry><entry><id>http://www.cnblogs.com/dust/archive/2008/05/31/1211222.html</id><title type="text">Lucky number[SRM403DIVI250]</title><summary type="text">1.最简单的办法就是用递归来实现。以生成由4，7，9三个数组成，且不超过MAX_NUMBER、不小于MIN_NUMBER的数的个数：intnumber(longx){if(x&amp;gt;MAX_NUMBER)return0;if(x&amp;gt;MIN_NUMBER)cout&amp;lt;&amp;lt;x&amp;lt;&amp;lt;endl;returnnumber(x*10+4)+number(x*10+7)+number(x*...</summary><published>2008-05-31T06:41:00Z</published><updated>2008-05-31T06:41:00Z</updated><author><name>should</name><uri>http://www.cnblogs.com/dust/</uri></author><link rel="alternate" href="http://www.cnblogs.com/dust/archive/2008/05/31/1211222.html"/><link rel="alternate" type="text/html" href="http://www.cnblogs.com/dust/archive/2008/05/31/1211222.html"/></entry><entry><id>http://www.cnblogs.com/dust/archive/2008/05/11/1192639.html</id><title type="text">答复：“判断一个整数的二进制位中有多少个1”的提问</title><summary type="text">朋友发来了一个链接，看来原来是很久之前写的一篇关于&amp;#8220;判断一个整数的二进制位中有多少个1&amp;#8221;的Blog，yjdlut问了关于第三种判断方法的原理。这里先把原文中的第三种方法列出来： 循环： x = x &amp;amp; ( x - 1 ); count++; 直到x为0为止。该方法的时间复杂度是O(m)在此，不妨把x的二进制位表示为 x=an-1an-2...a0。按从低位到高位的顺...</summary><published>2008-05-11T13:24:00Z</published><updated>2008-05-11T13:24:00Z</updated><author><name>should</name><uri>http://www.cnblogs.com/dust/</uri></author><link rel="alternate" href="http://www.cnblogs.com/dust/archive/2008/05/11/1192639.html"/><link rel="alternate" type="text/html" href="http://www.cnblogs.com/dust/archive/2008/05/11/1192639.html"/></entry><entry><id>http://www.cnblogs.com/dust/archive/2008/05/09/1190641.html</id><title type="text">Calling Convention</title><summary type="text">Calling Convention是指程序在函数调用时传递参数和获取返回值所采用的方法：通过寄存器、或通过栈、或者是两者的混合。在Visual C++中，用于指定Calling Convention的修饰符主要有：__cdecl, __stdcall, __fastcall等。它们各自的特征如下：C Calling Convention __cdecl： 1&amp;gt; 参数按从右到左的顺序传递，放...</summary><published>2008-05-09T13:44:00Z</published><updated>2008-05-09T13:44:00Z</updated><author><name>should</name><uri>http://www.cnblogs.com/dust/</uri></author><link rel="alternate" href="http://www.cnblogs.com/dust/archive/2008/05/09/1190641.html"/><link rel="alternate" type="text/html" href="http://www.cnblogs.com/dust/archive/2008/05/09/1190641.html"/></entry><entry><id>http://www.cnblogs.com/dust/archive/2008/04/24/1169498.html</id><title type="text">#define中的#、## &amp;&amp; #@</title><summary type="text">前些一段时间在看WinCE的Code时发现在宏定义中有用到##，如下所示#defineGPEBLT_FUNCNAME(basename)(SCODE(GPE::*)(structGPEBltParms*))&amp;amp;GPE::##basename在#define中，标准只定义了#和##两种操作。#用来把参数转换成字符串，##则用来连接两个前后两个参数，把它们变成一个字符串。1#defineToSt...</summary><published>2008-04-24T07:55:00Z</published><updated>2008-04-24T07:55:00Z</updated><author><name>should</name><uri>http://www.cnblogs.com/dust/</uri></author><link rel="alternate" href="http://www.cnblogs.com/dust/archive/2008/04/24/1169498.html"/><link rel="alternate" type="text/html" href="http://www.cnblogs.com/dust/archive/2008/04/24/1169498.html"/></entry><entry><id>http://www.cnblogs.com/dust/archive/2008/04/23/1168189.html</id><title type="text">WinDBG中设置条件断点</title><summary type="text">条件断点：断点指令 + &amp;#8220;j(Excecute If-Else) 和 gc (Go from Conditional Breakpoint)&amp;#8221;形如：bp Address "j (Condition) 'OptionalCommands'; 'gc' "这里仅简单说明该如何写后面的条件语句1. 非结构体变量： Code highlighting produced by Act...</summary><published>2008-04-23T13:26:00Z</published><updated>2008-04-23T13:26:00Z</updated><author><name>should</name><uri>http://www.cnblogs.com/dust/</uri></author><link rel="alternate" href="http://www.cnblogs.com/dust/archive/2008/04/23/1168189.html"/><link rel="alternate" type="text/html" href="http://www.cnblogs.com/dust/archive/2008/04/23/1168189.html"/></entry></feed>
