Ranged types, common in Ada, allow the programmer to constrain a numerical type to a certain range. This article presents a library that brings these types to C++.

Phillip Bruce gets around some of the limitations of the pointer-to-member with a model of class associations that he calls "Associative Chains."

Operator overloading may be syntactic sugar, but there are a lot of things that don't taste very good without sugar.

Explains why the rules for initializing references make passing by reference-to-const an efficient and attractive alternative to passing by value.

Explains how the rules for initializing references differ from the rules for initializing pointers.

Presents three different techniques for making operators polymorphic.

Explains how rvalue references solve at least two problems: implementing move semantics, and perfect forwarding. (October 01, 2009)

Rvalue references allow programmers to avoid logically unnecessary copying and to provide perfect forwarding functions. They are primarily meant to aid in the design of higher performance and more robust libraries. (March 10, 2008)

Discusses how the use of generic programming in C++ can lead to conflicts with object-oriented design principles. Also demonstrates how a technique known as type erasure can often be used to resolve theseconflicts. An in-depth example is presented: any_iterator, a type-safe,heterogeneous C++ iterator. (October 15, 2007)

C++ is a statically typed language but its type system is not bulletproof. This article reveals some all-too-common type glitches and how to fix them. (Thomas Guest) (June 25, 2005)

Explains why you should never call virtual functions during construction and destruction of your objects. (Scott Meyers) (June 06, 2005)

Explains run-time C++ implementation details such as class layout techniques and the virtual function call mechanism. (March 01, 1994)