[ 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 ]

• Land vehicle (example) ... [25.5], [25.7]
• Language wars ... [6.5]
• LAPACK, Linear Algebra Subroutine Library ... [29.17], [37.7]
• Large executables ... [37.8], [38.10]
• Last rites (see also Destructors) ... [11.1]
• LaTeX
  • C++2LaTeX pretty printer ... [40.3]
  • Macros for "C++" ... [40.2]
• Law of Inversion ... [20.6]
• Law of the Big Three ... [16.17], [22.5], [27.10]
• Law, Murphy's ... [16.2]
• Layer of indirection ... [31.5]
• Layout of object in memory ... [32.9], [38.9]
• Leaf classes ... [23.11]
• Leaf methods ... [23.12]
• Leaks, memory ... [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]
• Learning OO/C++ ... [28]
  • Getting started ... [29.2]
  • How long does it take ... [6.7]
  • No need to learn C first ... [28.2]
  • No need to learn Smalltalk first ... [28.3]
• Least bad; Sometimes "evil" things are ... [6.16]
• Left operand: friend-functions allow promotion of ... [14.5]
• Legal mumbo jumbo
  • Author ... [1.1]
  • Copying permissions ... [1.3]
  • Copyright notice ... [1.2]
  • No Warranty ... [1.4]
  • Trademarks ... [1.5]
• Legality books on C++ ... [28.4], [28.6]
• Length of time needed to learn OO/C++ ... [6.7]
• Less-than operator: operator< ... [13.9]
• Less-than-or-equal-to operator: operator<= ... [13.9]
• lgrind (see Pretty printing) ... [40.3]
• Lgrind ... [40.3]
• Libraries ... [37]
  • Dynamically typed C++ libraries ... [37.5], [37.6]
  • LAPACK ... [29.17], [37.7]
  • Large executables ... [37.8], [38.10]
  • NETLIB ... [29.17], [37.7]
  • Numerical Recipes ... [37.7]
  • Standard Library ... [29.9]
  • STL ... [37.1], [37.2], [37.4]
• Libraries FAQ ... [37.9]
• Lifetime of objects
  • Controlling lifetime of locals ... [11.6], [11.7], [11.8]
  • In heterogeneous containers ... [34.4]
  • Order of destruction for array elements ... [11.3]
  • Order of destruction for locals ... [11.2]
  • Register liveness ... [31.5]
  • Rule for for loop variables ... [39.8]
  • Using friend classes to achieve separate lifetimes ... [14.2]
• Line-breaks: whitespace standards ... [29.10]
• Linker errors ... [10.12], [10.13], [23.10], [32.7], [35.13], [35.14], [35.15], [35.16], [40.6]
• Lists, initialization
  • Coding standard ... [10.6], [26.8], [27.10]
  • Using this within ... [10.7]
• Literals: naming numeric literals ... [29.11]
• Literals: numeric literal suffixes ... [29.12]
• LLVM C++ compiler ... [38.13]
• Local objects, don't call dtor explicitly ... [11.5], [11.6]
• Log base 2 ... [26.12]
• Log of a negative number ... [29.15]
• Logical Interface different from Physical Layout ... [13.11], [13.12]
• long: choosing between integer sizes ... [29.5]