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

Abelson, Harold
Abrahams, Dave
abstraction
     and dependency management
     and get/set 2nd 3rd
     and interfaces
abstractions
     build higher-level from lower-level
     depending upon instead of details
     vs. details
Acyclic Visitor
ADL 2nd 3rd 4th 5th
     and template customization
     disabling unwanted
aggregates
Albaugh, Tyrrell
algorithmic complexity
     and STL
     exponential
     linear-looking that is really quadratic 2nd
algorithms
     and design patterns
     are loops
     binary_search
     count
     count_if
     equal_range
     find
     find_if
     lower_bound
     nth_element
     partial_sort
     partial_sort_copy
     partition
     searching
     sort
     sorting
     stable_partition
     stable_sort
     upper_bound
     vs. loops 2nd
alignment
Allison, Chuck
allocation
     never allocate more than once per statement
allocator
     example use of
ambiguities
     avoiding declaration
amortized constant time
append
arithmetic operators [See operators, operators;arithmetic]
arrays
     fixed-size
     inferior to containers
assert 2nd 3rd
     example of 2nd 3rd
     macro needed for
     only for internal programming errors 2nd
     prefer instead of logic_error
assertions [See assert]
assignment
    copy [See copy assignment]
     self 2nd
assignment operators [See operators, assignment]
asymptotic complexity [See algorithmic complexity]
at
     vs. []
atomic operations
auto_ptr 2nd

Team LiB
Previous Section Next Section