C++博客-linux&c++ R&D

a shortcut for linux( from linux journal )

丑石 — Tue, 25 Mar 2008 11:21:00 GMT

摘要: 阅读全文

丑石 2008-03-25 19:21 发表评论

10 things you should do to protect yourself on a public computer (from TechRepublic )

丑石 — Fri, 21 Mar 2008 04:41:00 GMT

摘要: 阅读全文

丑石 2008-03-21 12:41 发表评论

the tips of Yum

丑石 — Thu, 20 Mar 2008 06:22:00 GMT

(1) when installing or updating the software by Yum, you maybe come across the unexpected exit from the Yum tools and then report some errors which indicate some incorrect Yum sources! It maybe result from some obsolete Yum sources,so you'd better delete these problematic sources from /etc/yum.conf or /etc/yum.repos.d/ .
(2)pub－key,some Yum sources need to authorize and you should find pub－key which belongs to the source and import the pub-key: rpm －－import pub－key

丑石 2008-03-20 14:22 发表评论

Thinking recursively

丑石 — Sun, 16 Mar 2008 10:54:00 GMT

First,Let's know the principle:
Recursive leap of faith-
When you try to understand a recursive program,you must be able to put the underlying details aside and focus instead on a single level of the operation. At that level,you are allowed to assume that any recursive call automatically gets the right answer as long as the arguments to that call are simpler than the original arguments in some respect.The psychological strategy-assuming that any simpler recursive call will work correctly-is called the recursive leap of faith!
The idea may be difficult to newers! Take an example for it:
We all know the Fibonacci function:
F(n)=F(n-1)+F(n-2)
Recursive implementation of the Fibonacci funtion:

int Fib(int n){
if (n<=1)
return n;
else
return Fib(n-1)+Fib(n-2);
}

if n is 5,Fib(5) is computed by the sum of Fib(4) and Fib(3).
Applying the faith,you can assume that the program correctly computes each of these values,without going through all the steps that Fib(4) and Fib(3) is computed!

丑石 2008-03-16 18:54 发表评论

Teach Yourself Programming in Ten Years

丑石 — Wed, 30 May 2007 13:46:00 GMT

The article is worth reading,please refer to
http://www.norvig.com/21-days.html

丑石 2007-05-30 21:46 发表评论

separate-array-of-pointers technique

丑石 — Wed, 30 May 2007 10:45:00 GMT

摘要: 阅读全文

丑石 2007-05-30 18:45 发表评论

One size does not fit all

丑石 — Tue, 15 May 2007 05:57:00 GMT

People who spout off one-size-fits-all rules presume to make your design decisions without knowing your requirements. They don't know where you're going but know how you should get there.
Don't trust an answer from someone who doesn't know the question.

丑石 2007-05-15 13:57 发表评论

How do you define a copy constructor or assignment operator for a class that contains a pointer to a (abstract) base class?

丑石 — Tue, 15 May 2007 05:48:00 GMT

摘要: 阅读全文

丑石 2007-05-15 13:48 发表评论

Understand decorator design pattern

丑石 — Fri, 11 May 2007 13:38:00 GMT

摘要: Understand decorator design pattern 阅读全文

丑石 2007-05-11 21:38 发表评论

How to limit instantialization?

丑石 — Mon, 30 Apr 2007 08:44:00 GMT

摘要: How to limit instantialization?
阅读全文

丑石 2007-04-30 16:44 发表评论