[ A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z ]

• Macro NAME2() for token pasting ... [39.6]
• Macros, #define
  • Evil but sometimes useful ... [32.4], [33.6], [33.7]
  • Evil! ... [9.5], [29.11], [30.3], [39.4], [39.5], [39.6]
  • Prefer const vs. #define ... [29.7]
  • See also Inline functions ... [9.1], [9.5], [28.2], [30.3], [32.4], [33.7]
  • Use them when declaring member-function pointers ... [33.6]
  • with if ... [39.4]
  • with multiple lines ... [39.5]
  • with token pasting ... [39.6]
• Macros, evilness of ... [9.5], [29.11], [30.3], [39.4], [39.5], [39.6]
• main() returns int, not void ... [5.8], [29.3]
• Makefile ... [35.14]
• Making decisions; Software development is ... [6.16], [9.3], [17.8], [19.8], [19.9], [21.8], [23.4], [25.2], [25.3], [25.5], [25.6], [29.7], [29.11], [36.2], [36.3], [36.5], [36.6]
• malloc() ... [16]
  • Allocating an array with new T[n] ... [16.11]
  • Automatically freed on program exit ... [10.16]
  • Automating a NULL test ... [16.7]
  • Breaking it into pools ... [11.14]
  • Corruption — bang, you're dead ... [16.12], [30.3], [38.7], [38.8]
  • delete and free() might use different heaps ... [16.9], [16.10]
  • delete handles NULL automatically ... [16.8]
  • delete has two steps ... [16.9]
  • delete this ... [16.15]
  • delete[] uses magic ... [16.14], [38.7], [38.8]
  • delete[] vs. delete ... [16.12]
  • delete[] vs. delete for built-in types ... [16.13], [26.11]
  • Deleting an array with delete[] ... [16.11]
  • Difference between delete and delete[] ... [13.10], [16.3], [16.11]
  • Garbage collectors ... [16.26], [16.27], [16.28]
  • Mixing malloc() and delete ... [16.3]
  • Mixing new and free() ... [16.3]
  • Multi-dimensional arrays ... [16.16], [16.17]
  • new and malloc() might use different heaps ... [16.5]
  • new has two steps ... [16.10]
  • new never returns NULL ... [16.6]
  • Placement new ... [16.10]
  • Placement new doesn't allocate ... [11.10]
  • Prohibiting local objects ... [16.21]
  • realloc() ... [16.5]
  • Reference counting ... [16.22], [16.23], [16.24], [16.25]
  • Runtime costs of ... [31.2], [31.4], [31.5]
  • std::bad_alloc ... [16.6], [16.7]
  • std::set_new_handler ... [16.7]
  • Use std::auto_ptr only when pointing into the heap ... [23.6]
  • Why new is preferred over malloc() ... [16.4]
  • Why use new rather than malloc() ... [16.4]
• malloc(): might use different heap from new ... [16.5]
• Managerial Issues ... [6]
  • Business-centricity vs. Techno-centricity ... [6.5]
  • C++ is a practical tool ... [6.1]
  • C++ is not a perfect tool ... [6.2]
  • Length of time needed to learn OO/C++ ... [6.7]
  • Size of the installed base ... [6.6]
  • Some advantages of Generic Programming ... [6.4]
  • Some advantages of OO ... [6.3]
  • Standardization of C++ ... [6.12], [6.13]
• map<Key,Value> ... [8.8], [34.2]
• Marshall Cline ... [1.1]
• Maserati ... [30.5]
• Matrix subscript operator ... [13.10], [13.11], [13.12]
• Meaningwise (Abstract) state vs. Bitwise (Concrete) state ... [18.10], [18.11]
• Member functions: inline ... [9.7], [9.8]
• Member object containment ... [39.12]
• Member objects should be self-managing (see also under Exceptions) ... [17.10]
• Member-function pointer ... [33]
  • Address of a C++ method ... [33.4]
  • Array of pointer-to-member ... [33.7]
  • Can't convert to void* ... [33.10]
  • Contrast to pointer-to-function ... [33.1]
  • Converting to pointer-to-function ... [33.2], [33.3]
  • Difference between .* and ->* ... [33.9]
  • Passing as pointer-to-function ... [33.2]
  • Pointer to const member function ... [33.8]
  • Use a #define macro to call them ... [33.6]
  • Use a typedef to declare them ... [33.5]
• Member-function pointers ... [33]
• Member-functions vs. friend-functions: choosing ... [14.5]
• Memory leaks ... [34.6]
  • Automatically avoided in some cases ... [16.10]
  • Construct-on-first-use can plug leaks ... [10.16]
  • Destructors can plug leaks ... [13.10], [16.17], [17.11], [34.1]
  • Garbage-collectors can plug leaks ... [16.26], [16.27]
  • Intentionally allowing a leak ... [10.15]
  • Placement-new needs special code to avoid leaks ... [11.14]
  • Raw arrays can cause leaks ... [34.1]
  • Raw pointers can cause leaks ... [17.11]
  • Reference-counting can plug leaks ... [16.22], [16.23], [16.24]
  • Reference-counting has limitations ... [16.25]
  • Smart-pointers can plug leaks ... [16.16], [16.26]
• Memory pools ... [11.14]
• Mentoring ... [6.7], [17.7], [28.1]
• Merge-sort ... [5.3]
• Messages, Understanding error- ... [35.17]
• Method chaining ... [8.4], [10.20]
• Metrics of "goodness": Schedule + Cost + Risk ... [6.17], [23.3]
• MFC
  • And catch-by-pointer ... [17.14]
  • FAQ ... [38.2]
  • Status bar ... [38.3]
• Microsoft C++ freely downloadable command-line compiler ... [38.1]
• Microsoft Visual C++
  • Differentiated from C++ ... [38.6]
  • FAQ ... [38.2]
• Microsoft Windows
  • Binary mode for opening streams ... [15.12]
  • Binary mode for std::cin and std::cout ... [15.13]
  • Newsgroups specializing in ... [5.9]
  • OS-specific questions/answers ... [40.5]
• Mindset, right and wrong (see also under Exceptions) ... [17.6], [17.7]
• MinGW ... [38.5]
• MinGW free C++ compiler ... [38.1]
• Minimize the ripple effect ... [8.8]
• Minimum Spanning Trees in C++ ... [5.3]
• Minsk translation of this document ... [2.3]
• Mirror sites ... [2]
• Mirror sites for this document ... [2.1]
• Missing virtual on some base class dtors, evilness of ... [20.7]
• Mixed-mode arithmetic operators (see also Operator overloading) ... [13.9]
• Mixing
  • Mixing C and C++ code ... [32]
  • Mixing malloc() and delete ... [16.3]
  • Mixing new and free() ... [16.3]
• Mixing malloc() and delete, evilness of ... [16.3]
• Mixing new and free(), evilness of ... [16.3]
• Mixing new T[n] with delete p, evilness of ... [16.12], [16.13], [26.11]
• Mixing realloc() and new, evilness of ... [16.5]
• Moniker "FAQ" ... [6.18]
• Monolithic class hierarchies ... [37.5], [37.6]
• Morality books on C++ ... [28.4], [28.5]
• More than 8-bits/byte (on some machines) ... [26.5], [26.6]
• Moving the cursor on the screen ... [15.19]
• MS-DOS
  • Binary mode for opening streams ... [15.12]
  • Binary mode for std::cin and std::cout ... [15.13]
  • Newsgroups specializing in ... [5.9]
  • OS-specific questions/answers ... [40.5]
• MSVC++
  • Differentiated from C++ ... [38.6]
  • FAQ ... [38.2]
• Multi-dimensional arrays (see also under Templates) ... [16.18], [16.19]
• Multi-dimensional arrays
  • Using pointers ... [16.16]
  • Using specific classes ... [16.17]
  • Using templates ... [16.18], [16.19]
• Multi-threading
  • Can randomly expose errors ... [16.2]
  • Performance tradeoffs ... [36.12]
  • Reader/writer conflicts ... [36.12]
  • Writer/writer conflicts ... [36.12]
• Multiple encapsulated instances ... [6.8], [7.5], [34.5]
• Multiple inheritance ... [25]
  • Alternate designs ... [25.5]
  • Constructor order ... [25.14]
  • Destructor order ... [11.12], [25.15]
  • Disciplines for using ... [25.4]
  • Is not evil! ... [25.2], [25.3]
  • Object layout in memory ... [32.9], [38.9]
  • Pointer conversions unknown to C compiler ... [32.8]
  • Sometimes unnecessary ... [24.2]
  • Strategy vs. tactics ... [25.1]
  • Tradeoff matrix ... [25.6]
  • Vehicle example ... [25.5], [25.7]
  • When introduced into C++ language ... [38.12]
• Multiply operator: operator* ... [13.1]
• Murphy's law ... [16.2]
• mutable (Const correctness) ... [18.13]
• mutable keyword ... [18.13]
• Mutator methods ... [18.10], [18.11], [18.12]
• MYOB (Acronym) ... [5.1]