• <ins id="pjuwb"></ins>
    <blockquote id="pjuwb"><pre id="pjuwb"></pre></blockquote>
    <noscript id="pjuwb"></noscript>
          <sup id="pjuwb"><pre id="pjuwb"></pre></sup>
            <dd id="pjuwb"></dd>
            <abbr id="pjuwb"></abbr>

            linux&c++ R&D

            programing is a pleasure!

            2008年3月25日 #

            a shortcut for linux( from linux journal )

                 摘要:   閱讀全文

            posted @ 2008-03-25 19:21 丑石 閱讀(618) | 評論 (0)編輯 收藏

            2008年3月21日 #

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

                 摘要:   閱讀全文

            posted @ 2008-03-21 12:41 丑石 閱讀(454) | 評論 (0)編輯 收藏

            2008年3月20日 #

            the tips of Yum

            (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

            posted @ 2008-03-20 14:22 丑石 閱讀(217) | 評論 (0)編輯 收藏

            2008年3月16日 #

            Thinking recursively

            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!

            posted @ 2008-03-16 18:54 丑石 閱讀(299) | 評論 (0)編輯 收藏

            2007年5月30日 #

            Teach Yourself Programming in Ten Years

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

            posted @ 2007-05-30 21:46 丑石 閱讀(343) | 評論 (0)編輯 收藏

            separate-array-of-pointers technique

                 摘要:   閱讀全文

            posted @ 2007-05-30 18:45 丑石 閱讀(334) | 評論 (0)編輯 收藏

            2007年5月15日 #

            One size does not fit all

            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.

            posted @ 2007-05-15 13:57 丑石 閱讀(263) | 評論 (0)編輯 收藏

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

                 摘要:   閱讀全文

            posted @ 2007-05-15 13:48 丑石 閱讀(596) | 評論 (0)編輯 收藏

            2007年5月11日 #

            Understand decorator design pattern

                 摘要: Understand decorator design pattern  閱讀全文

            posted @ 2007-05-11 21:38 丑石 閱讀(479) | 評論 (0)編輯 收藏

            2007年4月30日 #

            How to limit instantialization?

                 摘要: How to limit instantialization?
              閱讀全文

            posted @ 2007-04-30 16:44 丑石 閱讀(399) | 評論 (0)編輯 收藏

            僅列出標(biāo)題  下一頁

            My Links

            Blog Stats

            News

            常用鏈接

            留言簿(1)

            隨筆分類(13)

            隨筆檔案(17)

            文章檔案(1)

            相冊

            收藏夾(1)

            Friends' blog

            useful sites

            搜索

            積分與排名

            最新評論

            閱讀排行榜

            評論排行榜

            久久久精品人妻无码专区不卡 | 久久99热国产这有精品| 激情伊人五月天久久综合| 婷婷综合久久中文字幕| 国内精品欧美久久精品| 国产成人久久AV免费| 91久久精品视频| 婷婷久久五月天| 一级做a爰片久久毛片16| 日本欧美国产精品第一页久久| 久久精品夜夜夜夜夜久久| 亚洲精品成人网久久久久久| 国产精品久久久久久吹潮| 国产—久久香蕉国产线看观看| 日韩精品无码久久久久久| 日本精品久久久久久久久免费| 人妻精品久久久久中文字幕一冢本| 精品国产91久久久久久久| 亚洲精品无码专区久久同性男| 国产精品一久久香蕉产线看| 午夜精品久久久久久久久| 无码8090精品久久一区| 久久亚洲欧美日本精品| 情人伊人久久综合亚洲| 久久久久亚洲精品天堂| 久久综合亚洲鲁鲁五月天| 久久久久久伊人高潮影院| 久久伊人五月天论坛| 欧美精品丝袜久久久中文字幕 | 精品一区二区久久| 久久香蕉超碰97国产精品 | 亚洲人成无码久久电影网站| 大香网伊人久久综合网2020| 国产午夜精品久久久久免费视| 国产成人久久精品一区二区三区| 亚洲欧美日韩精品久久亚洲区| 亚洲国产精品人久久| 国产高潮久久免费观看| 久久久精品人妻无码专区不卡| 亚洲综合久久综合激情久久| 91精品国产91久久久久久蜜臀|