• <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)論排行榜

            亚洲成av人片不卡无码久久| 99精品久久精品一区二区| 91精品久久久久久无码| 久久久99精品一区二区| 午夜精品久久久久9999高清| 麻豆亚洲AV永久无码精品久久| 久久久久综合网久久| 一级a性色生活片久久无少妇一级婬片免费放 | 国内精品久久久久影院免费| 国产精品美女久久久网AV| 久久久久久久久波多野高潮| 青草影院天堂男人久久| 久久成人小视频| 久久不见久久见免费影院www日本| 99精品国产免费久久久久久下载| 精品国产乱码久久久久久1区2区| 一级女性全黄久久生活片免费| 欧美日韩中文字幕久久伊人| 久久九九兔免费精品6| 久久精品亚洲精品国产欧美| 久久发布国产伦子伦精品| 久久亚洲精品成人无码网站| 青青热久久国产久精品| 久久综合丁香激情久久| 国产亚洲综合久久系列| 97精品国产97久久久久久免费 | 国产农村妇女毛片精品久久| 久久国产色AV免费看| 无码国内精品久久人妻蜜桃| 久久毛片一区二区| 亚洲а∨天堂久久精品| 久久乐国产精品亚洲综合| 国产精品VIDEOSSEX久久发布| 色综合色天天久久婷婷基地| 国产69精品久久久久9999| 超级碰久久免费公开视频| 色综合久久综合网观看| 狠狠人妻久久久久久综合蜜桃| 99久久婷婷国产综合精品草原| 91超碰碰碰碰久久久久久综合| 久久夜色精品国产亚洲|