C++

Seqential stack is a stack stored in sequential storage mode. The class definitions of the ordered stack below are stored in arrays. Use stacka [maxsize] for storage. maxsize is the maximum number of elements that can be stored. The top variable

In C/C ++, the following are commonly used:1. Expat is the XML Parser of the C interface's sax, but someone encapsulates Dom on it.2. XML Parser for libxml and C interfaces. It supports Dom and is widely used on non-win platforms.3. xerces: Needless

Comparison between C ++ reference and pointer References are a concept in C ++. Beginners can easily confuse references with pointers.In the following program, n is a reference of M, and M is a referent ).Int m;Int & n = m;N is equivalent to M

Summary of generic algorithms 1. The implementation of each generic algorithm is independent of a separate container and does not depend on the element type stored in the container. 2. generic algorithms never directly add or delete elements. 3. It

Virtual functions in C ++ I. Definition Definition: declare virtual in a base classAnd the member functions that are redefined in one or more Derived classes. Syntax: VirtualFunction return type function name (parameter table) {function

The following is a data structure that I implemented using the C ++ class template-circular queue. I hope to help people and give them valuable comments! // Cyclic queue # Ifndef _ queue_h_included# DEFINE _ queue_h_included Template Class _

In a function, the compiler will help place the destructor in the corresponding position. For local objects in a function, the Destructor is inserted intoEvery exit point.For example: 1: void Function(int a) { 2: Object obj; 3: swithch(a) {

The following is a data structure, stack, implemented using a C ++ template. I hope to help others and give some comments! After all, I rarely use templates. # Ifndef _ stack_h_included# DEFINE _ stack_h_included Template Class _ Stack{Public:_

Today, when I write a program, I want to use smart pointers and vector containers to solve the member management problem of pointer arrays. I have used multiple pointer containers in my program, which leads to a problem. The clearing of these

Recently, when using COM strings, I think the automatic type conversion of _ bstr_t is very interesting. Below are some usage of _ bstr_t: Assign the char */wchar * value to _ bstr_t M_rst-> getfields ()-> getitem (ncol)-> value = (_ bstr_t) svalue;

  We know that the virtual functions supported by C ++ are implemented by providing a virtual function for each class. What is its memory status? First, we implement two classes with virtual functions: classa and classb. classb is a derived class of

Why avoid single-parameter constructor? The following code defines two classes A and B, which are supported by B Class{Public:String type () const {return "";}};Class B{Public:B () {cout B (A) {cout String type () const {return "B ";}};Ostream &

Several common methods to optimize C code In terms of performance optimization, we always pay attention to the 80-20 principle, that is, 20% of the program consumes 80% of the running time. Therefore, to improve the efficiency, we mainly consider

# Include Using namespace STD; Void fun_1 (int n){If (n {Cout }If (n> = 2){Fun_1 (n/2 );Cout }} Void fun_3 (int n){Switch (N){Case 10: cout Case 11: cout Case 12: cout Case 13: cout Case 14: cout Case 15: cout Default: break;}} Void fun_4 (int n){

Conversion between char * \ wchar_t * \ string \ wstring in C ++: # Ifndef use_h _# Define use_h _# Include # Include # Include Using namespace STD;Class cuser{Public:Cuser ();Virtual ~ Cuser ();Char * wchartochar (const wchar_t * WP );Char *

[My C language interview series] 003 Summary of the infinite loop format? Summary of the infinite loop format Below are several "Famous" Endless loops: (1) endless operating system loops; (2) Win32 program endless loop; (3) endless loop of

[C language library function source code] [This program is compiled in Dev C ++ 4.9.9.2] /* Appends at most count characters of the string back onto the end of front, And always terminates with a null character. If count is greater than Length of

[C language library function source code] [This program is compiled in Dev C ++ 4.9.9.2] Double my_atan (Double X) { Register double ret; _ ASM __( "Fld1/n/t" "Fpatan" : "= T" (RET) : "0" (X) ); Return ret; } // Returns the arc tangent

[C language library function source code] [This program is compiled in Dev C ++ 4.9.9.2] /* Load floating point number, V is the ending number, and E is the index. For example, x = ldexp (1.0, 6) indicates that the floating point number to be

[C language library function source code] [This program is compiled in Dev C ++ 4.9.9.2] /* Strcmp compares two strings and returns an integer To indicate whether the first is less than the second, The two are equal, or whether the first is