C++

When I was learning c ++, most of the books I saw introduced the const Keyword: the value of the variable modified by the const keyword cannot be modified. But is that true? Today, I did a small experiment and found that the const variable can be

If the function does not return values, all the variables in the function are released after the function is executed; If the function returns a value, the temporary variable in the function is released after the value assignment statement of the

When OpenGL redbooks generate images in the memory, they often mention an example of generating a black/white board. The related code is as follows:[Cpp]# Define checkImageWidth 64# Define checkImageHeight 64GLubyte checkImage [checkImageWidth]

A class with a virtual function has a pointer called a "virtual table" (the number of virtual functions has a number of pointers), which is used to point to this class of virtual function. That is, use it to determine the function to be called.For

I. Example N years ago: When the computer first came out, the software and hardware were tied together. For example, IBM had a computer with a customized system, for example, IBM_Win, of course, this IBM_Win system cannot run on an HP computer, and

Dynamic binding and static binding are used only to support c ++ polymorphism. Understanding their differences helps to better understand polymorphism and avoid mistakes during programming. Four terms need to be understood:1. static object type: the

I. Examples We know that in multi-threaded programs, multiple users send Read and Write commands to the system. Here are some notes: 1. First of all, all the Read and Write commands call a library function. 2. the user does not need to know the

[Cpp]/*Upper Bound Function*/# Include # Include # Define Max size 100// Global variableInt n; // number of containersInt c; // capacityInt r; // remaining capacityInt w [MAXSIZE]; // container weightInt cw; // current weightInt bestw; // optimal

PrefaceMutex lock is used to ensure that only a single thread or process has mutex access to shared resources at any time. Here, the mutex in posix thread, the mutex in win32, and the critical section are used, they are collectively referred to as

[Cpp]// Representative analysis. h// Moving average methodConst int M = 4 ,//NumM [M] = {3, 5, 7, 9}; // NumM [I] annual moving average methodDouble HPMaxYearW;Void DaiBiaoFenXi (){Using namespace std;Ofstream outfile;Outfile. open

Compile make rules:When using gcc, use the-M switch. It will output a rule for every C file you give it, and use the target file as the target file, the C file and all header files that should be # include will be used as dependent files. Note that

[Cpp]# Include  Using namespace std; Class Animal{Protected:Int test;Public:Animal () {test = 0; cout Void eat () {cout }; Class Giraffe: private Animal{Public:Giraffe () {cout Void StrechNeck (double){Eat ();Cout Cout }}; Class Cat: public

Although C ++ is compatible with C, it also supports the type conversion usage of C language, that is, to enclose the type in parentheses. This conversion visibility is poor and it is difficult to track incorrect conversions. C ++ provides mandatory

There are a bunch of turtles, output a bunch of disordered turtles, and then enter a correct order, asking for a minimum step to make the first heap into the second heap, every time you move the tortoise to the first position, output this

Problem:Assuming there are two piles of stones, two players will take turns to take the stones according to the following rules:Each person can take the same number of stones from two piles of stones each time, or just take the same number of

Problem:Decimal places are expressed in the form of scores to achieve accurate calculation results. Answer 1:It is used as a small integer to divide the infinite loop decimal point 0. a1a2... an (b1b2... bm) into non-cyclic parts and cyclic parts.X =

Problem:Given an array of integers whose length is N, multiplication is allowed only, division is not allowed, and the group that calculates the maximum product of any (N-1) combination. Solution 1:The space-for-time policy is used to record the

Comprehensive questions.There are n items, and there are two cars with the weight of c1, c2. ask how many trips are required to ship the items.N is relatively small, only 10, and all items need to be run out, then think of State compression to save

Problem:Returns the length of the longest incrementing subsequence in a one-dimensional array. Solution 1:Obviously, using the dynamic planning algorithm to select the following stages (this method is extremely common) can make the relationship

How to start writing a module There are two special points: 1. You need to manually write a config file to tell nginx how to compile your module. 2. compile your module:./configure -- prefix = 'pwd'/output -- add-module = 'pwd'/mymod Overview The so-