L
Team LiB
Previous Section Next Section

Index


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

Lafferty, Debbie
Lambda library [See Boost, Boost;Lambda library]
Last Word
     not this book
Latin
     gratuitous use of 2nd
LaunchSatellite
Law of Second Chances
leak
     memory
leaks
Leary-Coutu, Chanda
Leddy, Charles
length
     of lines
less
     example use of
lifetime [See object lifetime]
line length
link time
     and errors
linkage
     and headers
     external
Lippman, Stan
Liskov Substitution Principle [See substitutability]
Lisp
list [See also containers]
     vs. vector
literals
    and magic numbers [See magic numbers]
livelock
locality of reference
localized_string
locking
     external
     in increasing address order
     internal
     lock-free designs
     not needed for immutable objects
     using callback functions instead of
logic_error
     example of
     prefer assertions instead of
lookup
     two-phase
loops
     fewer explicit loops in STL-using programs
     vs. algorithms
lower_bound

Team LiB
Previous Section Next Section