Code Complete: A Practical Handbook of Software Construction, Second Edition

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]

languages, programming

Law of Demeter

layout

    array references [See coding, style; conventions, coding, formatting; programming conventions, formatting rules; readability, formatting for; style issues, formatting]

     assignment statement continuations

     begin-end pairs

     blank lines 2nd

     block style     brace styles 2nd

     C++ side effects     checklist     classes

     closely related statement elements

     comments

     complicated expressions     consistency requirement

     continuing statements     control statement continuations     control structure styles     declarations

     discourse rules

     documentation in code

     double indented begin-end pairs

     emulating pure blocks     endline layout 2nd     ends of continuations     files, within

     Fundamental Theorem of Formatting     gotos     incomplete statements

     indentation

     interfaces

     key points

     language-specific guidelines     logical expressions

     logical structure, reflecting 2nd

     mediocre example     misleading indentation example

     misleading precedence

     modifications guideline     multiple statements per line

     negative examples     objectives of

     parentheses for

     pointers, C++

     pure blocks style

     readability goal

     religious aspects of

     resources on

     routine arguments

     routine call continuations

     routine guidelines

     self-documenting code

     single-statement blocks

     statement continuation

     statement length     structures, importance of

     styles overview     unindented begin-end pairs     violations of, commenting

     Visual Basic blocking style

     white space 2nd 3rd

laziness lazy evaluation

leanness design goal legal notices length of variable names, optimumlevels of design

     business logic subsystem

     classes, divisions into

     database access subsystem

     overview of     packages     routines     software system

     subsystems     system dependencies subsystem     user interface subsystem

libraries, code

     purpose of

     using functionality from

life-cycle models     development standard

     good practices table for

linked lists     deleting pointers

     node insertion

     pointers, isolating operations of linkers

lint tool Liskov Substitution Principle (LSP)

literal data 2nd

literate programs

live time of variables 2nd

load time, binding during

localization

     architecture prerequisites

     string data types

locking global data

logarithms

logging

     defensive programming guideline

     tools for testing

logic coverage testing logical cohesion

logical expressions     code tuning     comparing performance of

     eliminating testing redundancy

     frequency, testing in order of

     identities     layout of

     lazy evaluation     lookup tables, substituting     short-circuit evaluationloops

    abnormal [See conditional statements, looping, conditional; control structures, loops]

     arrays with

     bodies of, processing 2nd

     brackets recommended     break statements 2nd 3rd     checklist     code tuning

     commenting     completion tests, location of     compound, simplifying

     continuation lines in

     continue statements 2nd 3rd

     continuously evaluated loops [See also while loops]

     counted loops [See also for loops]     cross talk

     defined

     designing, process for     do loops

     empty, avoiding

     endless loops 2nd     endpoint considerations

     entering, guidelines for 2nd     enumerated types for

     exit guidelines 2nd 3rd

     for loops 2nd 3rd 4th

     foreach loops 2nd

     fusion of

     goto with

     housekeeping statements

     index alterations

     index checklist

     index final values

     index scope

     index variable names

     infinite loops 2nd

     initialization code for 2nd     iterative data structures with

     iterator loops 2nd     jamming     key points

     kinds of, generalized

     labeled break statements

     language-specific, table of     length of

     minimizing work inside     multiple break statements     naming variables     nested 2nd 3rd

     null statements, rewriting

     off-by-one errors

     one-function guideline

     order of nesting     performance considerations     pointers inside     problems with, overview of

     pseudocode method     refactoring 2nd     repeat until clauses

     routines in

     safety counters with

     scope of indexes

     sentinel tests for     size as refactoring indicator

     strength reduction

     switching     termination, making obvious

     testing redundancy, eliminating

     unrolling     unswitching

     variable guidelines     variable initializations

     variables checklist

     verifying termination

     while loops

loose coupling

     design goal, as

     strategies for

low-to-medium fan-out design goal

LSP (Liskov Substitution Principle)