• <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!

            #

            a shortcut for linux( from linux journal )

                 摘要:   閱讀全文

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

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

                 摘要:   閱讀全文

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

            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) | 評(píng)論 (0)編輯 收藏

            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) | 評(píng)論 (0)編輯 收藏

            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 丑石 閱讀(344) | 評(píng)論 (0)編輯 收藏

            separate-array-of-pointers technique

                 摘要:   閱讀全文

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

            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 丑石 閱讀(264) | 評(píng)論 (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) | 評(píng)論 (0)編輯 收藏

            Understand decorator design pattern

                 摘要: Understand decorator design pattern  閱讀全文

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

            How to limit instantialization?

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

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

            僅列出標(biāo)題
            共2頁: 1 2 

            My Links

            Blog Stats

            News

            常用鏈接

            留言簿(1)

            隨筆分類(13)

            隨筆檔案(17)

            文章檔案(1)

            相冊(cè)

            收藏夾(1)

            Friends' blog

            useful sites

            搜索

            積分與排名

            最新評(píng)論

            閱讀排行榜

            評(píng)論排行榜

            久久五月精品中文字幕| 成人综合伊人五月婷久久| 久久美女网站免费| 欧美精品一本久久男人的天堂| 国产高潮国产高潮久久久91| 香港aa三级久久三级老师2021国产三级精品三级在 | 国产精品一久久香蕉产线看 | 久久国产色AV免费观看| 国产—久久香蕉国产线看观看| 欧美久久久久久精选9999| 亚洲综合精品香蕉久久网| 韩国无遮挡三级久久| 2021国产精品午夜久久| 91精品国产高清久久久久久91| 欧美日韩久久中文字幕| 久久精品国产只有精品66 | 伊人久久大香线蕉影院95| 区久久AAA片69亚洲| 久久久久亚洲爆乳少妇无 | jizzjizz国产精品久久| 久久综合亚洲色HEZYO社区| 久久精品亚洲男人的天堂| 国产精品18久久久久久vr| 亚洲综合伊人久久大杳蕉| 久久久精品国产亚洲成人满18免费网站| 久久影院综合精品| 中文字幕乱码人妻无码久久| 精品久久人人爽天天玩人人妻| www.久久99| 精品999久久久久久中文字幕| 蜜臀av性久久久久蜜臀aⅴ麻豆 | 久久久久综合国产欧美一区二区| 97精品伊人久久大香线蕉app| 久久久久久夜精品精品免费啦| 99精品国产免费久久久久久下载| 亚洲伊人久久综合影院| 免费无码国产欧美久久18| 亚洲综合日韩久久成人AV| 久久不见久久见免费视频7| 久久99精品久久久久婷婷| 国产午夜精品理论片久久影视|