realy cool photo effect
Before going forward, check out this first:
Very cool, isn't it?
This is created by this website:
http://www.photofunia.com/
Before going forward, check out this first:
Very cool, isn't it?
This is created by this website:
http://www.photofunia.com/
Having my work changed a lot during the last year, from a Lunix developer to a half developer half support and now are purely support, I do not have many chance to use Emacs that often anymore, but I keep to use to it as much as possible. After all it's my first editor in my programmer career. One thing I like is its shell buffers. Unfortunately, It only support one shell as I thought before. Because if you type M-x shell to open a new shell buffer, if you already have one open that will just switch to the existing one.
I am excited to tell you that I have built a simple MFC applcation using COM objects, which used to be somehow mysterious to me. The COM objects are created by ATL. Before reading this article, I assume that you have the basic knowledge of COM and be experienced programming in C++. One thing I should pointed out is that I am a newbie of COM and there may be some errors in this article. Still, The reason I write this article is to record my growth of my technical career and share it with you.
I thought I would stick on my Linux path and finally to be a Unix/Linux expert when I took the current job. But just like Groom said, “Life is like a box of chocolate, you never know what you’re going to get". I realize that there are some more interesting technologies there waiting for my exploring. I must confess that The Microsoft® COM (Component Object Model) has made a great effort on platform-independent and object-oriented software development. This technology is so popular that many large companies are using it to build complicated applications and also so many software job positions require knowledge of COM explicitly.
What is Regular Expression? A regular expression is a special text string for describing a certain amount of text. Generally, A regular expression contains a few special characters and ordinary characters. If you have used Linux/Windows systems, you will probably familiar with wildcard notations such as *.txt to find all text files in a folder. That's a simple regular expression example (Thanks for netcasper's correcting . The regex equivalent to ".txt" is .*\.txt). Nowadays, Most of the text editors support regular expression such as vi, emacs and Ultra Editor(not a free software). Today, I would like introduce some basic knowledge about regular expression and use it in Emacs to improve the efficiency of your coding work.
This interesting tool valgrind is a debug tool and can been used to find memory bug, include memory leak. There is a rpm in Fedora Core 3 CD. You can get it from CD or download the source code from their website. Moreover, this tool is a Free Software, and is freely available under the GNU General Public License. You can use it to debug Linux programs and it's very easy to use.
When I was a college student and took the course Data Structure and Algorithm, the B-Tree section was not included in the exam requirement. At that time the teacher just said little about it and therefore I knew little about it. It is ridiculous that I totally understand B-Tree until last month. So what is the B-Tree? B-Trees are balanced search trees designed to work well on magnetic disks or other direct-access secondary storage devices. B-Trees are similar to red-black trees. but they are better at minimizing disk I/O operations. Many database systems use B-Trees, or variants of B-Trees, to store information.
For years I’ve stick on my IE (Microsoft’s Internet Explorer) since I had my own personal computer. But my love for the past faded when I met Firefox. Thanks to my mentor Daniel who introduced Emacs and also Mozilla Firefox to me. But, I guess most of my friends and many people in China are still using IE or other IE core browsers such as Maxthon. But today I want to tell you that it’s time to say goodbye to IE because a much better browser is ready for you.
There are two books i have read when i begin my programming carrer.
One is <Advanced Programming in the UNIX Environment> written by W. Richard Stevens. The other is <Linux Device Drivers, 2nd Edition> written by Alessandro Rubini and Jonathan Corbet
m_visit to construct the tree and visit the nodes of the tree. Most operations are implemented below.
The ith order statistic of a set of n elements is the ith smallest element. For example, the minimum of a set of elements is the first order statistic (i = 1), and the maximum is the nth order statistic (i = n). The asymptotic running time of the simple problem of finding a minimum or maximum is Θ(n). Yet select the ith smallest element appears more difficult but it also only need Θ(n) time.
A binary tree is made of nodes, where each node contains a "left" pointer, a "right" pointer, and a data element. The "root" pointer points to the topmost node in the tree. The left and right pointers recursively point to smaller "subtrees" on either side. A null pointer represents a binary tree with no elements -- the empty tree. The formal recursive definition is: a binary tree is either empty (represented by a null pointer), or is made of a single node, where the left and right pointers (recursive definition ahead) each point to a binary tree.
It is not difficult to devise an algorithm that can find both the minimum and the maximum of n elements using Θ(n) comparisons. Simply find the minimum and maximum independently, using n - 1 comparisons for each, for a total of 2n - 2 comparisons.In fact, at most 3(n/2) comparisons are sufficient to find both the minimum and the maximum in the array of size n.We compare pairs of elements from the input first with each other, and then we compare the smaller to the current minimum and the larger to the current maximum, at a cost of 3 comparisons for every 2 elements.
Recently I am reading the book CLRS Introduction to Algorithms, Second Edition. I find that I really hook on it! It's a great book about the Algorithm and I think I will wirte some notes about reading the book and write some C/C++ code for the pseudo code on this book.
Quicksort is a sorting algorithm whose worst-case running time is Θ(n^2) on an input array of n numbers. In spite of this slow worst-case running time, quicksort is often the best practical choice for sorting because it is remarkably efficient on the average: its expected running time is Θ(n lg n). Quicksort, like merge sort, is based on the divide-and-conquer method.
This entry is continued from C++ Tips from Thinking in C++(3)
This entry is continued from C++ Tips from Thinking in C++(2)
As I posted the previous entry C++ Tips from Thinking in C++(1), I should keep on my working. Thinking in C++ is a great book. It attracts me to continue to explore the miracle C++ world.
Because of the diversity of the Unix system, the famous 'configure' script should be runned before compiling the source code on the system. The script check your system environment such as where your library locate and help you decide which part of the source code should be complied. This small simple qucik refrence is made by myself when I started to work as Software Engineer.
This is an alphabetical list of each Autoconf macro used in this book, along with a description of what each does.
The documents is not made by me. I just extract it from the e-book written by Gary V. Vaughan.