< Free Open Study > |
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] I/O (input/output) architecture prerequisites change, identifying areas of performance considerations IDEs (Integrated Development Environments) IEEE (Institute for Electric and Electrical Engineers) if statements boolean function calls with [See conditional statements, if statements; control structures, if statements] break blocks, simplification with case statements, compared to 2nd case statements, converting to 2nd chains of checklist common cases first guideline continuation lines in covering all cases else clauses 2nd equality, branching on error processing examples factoring to routines flipped frequency, testing in order of gotos rewritten with 2nd if-then-else statements, converting to key points lookup tables, substituting multiple returns nested in negatives in, making positive normal case first guideline normal path first guideline null if clauses plain if-then statements refactoring simplification single-statement layout tables, replacing with types of implicit declarations implicit instancing in keyword, creating incomplete preparation, causes of incremental development metaphor incremental integration benefits of [See integration, incremental] bottom-up strategy classes 2nd customer relations benefit defined disadvantages of top-down strategy errors, locating feature-oriented integration interface specification 2nd progress monitoring benefit resources on results, early risk-oriented integration sandwich strategy scheduling benefits slices approach steps in strategies for, overview stubs 2nd summary of approaches T-shaped integration test drivers top-down strategy for vertical-slice approach indentation 2nd indexed access tables 2nd indexes, loop alterations checklist enumerated types for final values scope of variable names indexes, supplementing data types with infinite loops 2nd informal reviews 2nd information hiding access routines for [See object-oriented programming, hiding information] ADTs for barriers to categories of secrets circular dependencies problem class data mistaken for global data class design considerations class implementation details example excessive distribution problem importance of interfaces, class performance issues privacy rights of classes resources for secrets concept type creation for inheritance access privileges from [See object-oriented programming, inheritance] case statements checklist containment compared to decisions involved in deep trees defined design rule for functions, private, overriding guidelines, list of heuristic design with identifying as a design step is a relationships key points for Liskov Substitution Principle main goal of mixins multiple overridable vs. non-overridable routines parallel modifications refactoring indicator placement of common items in tree private vs. protected data private, avoiding recommended bias against routines overridden to do nothing similar sub and super classes single-instance classes initializing variables accumulators at declaration guideline C++ example checklist for class members compiler settings consequences of failing to const recommended constants counters declare and define near first use rule final recommended first use guideline fixing defects global variables importance of Java example key point loops, variables used in parameter validity pointer problems 2nd 3rd Principle of Proximity reinitialization strings system perturbers, testing with Visual Basic examples initializing working memory inline routines input parameters input/output inspections installation tools instancing objects ADTs factory method singleton 2nd integer data types checklist [See data types, integers] costs of operations division considerations overflows ranges of Integrated Development Environments (IDEs) integration benefits of 2nd big-bang bottom-up strategy broken builds checklist classes 2nd 3rd continuous customer relations daily build and smoke test defined disadvantages of top-down strategy errors, locating feature-oriented strategy importance of approach methods interface specification 2nd key points monitoring phased resources on risk-oriented strategy sandwich strategy scheduling slices approach smoke tests strategies for, overview stubs 2nd summary of approaches T-shaped integration testing 2nd top-down strategy for unsurfaced work vertical-slice approach integrity intellectual honesty intellectual toolbox approach intelligence, role in character interfaces, class abstraction aspect of 2nd 3rd calls to classes, refactoring cohesion consistent level of abstraction delegation vs. inheritance, refactoring documenting 2nd erosion under modification problem evaluating abstraction of extension classes, refactoring with foreign routines, refactoring with formalizing as contracts good abstraction example guidelines for creating inconsistency with members problem inconsistent abstraction, example of information hiding role integration, specification during 2nd key points for layout of mixins objects, designing for opposites, pairs of poor abstraction example private details in programmatic preferred to semantic public routines in interfaces concern read-time convenience rule refactoring 2nd routines, moving to refactor routines, unused semantic violations of encapsulation unrelated information, handling interfaces, graphic interfaces, routine commenting foreign routines, refactoring with pseudocode for public member variables routines, hiding routines, moving to refactor internationalization interoperability interpreted languages, performance of invalid input iteration in development choosing, reasons for [See approaches to development, iterative approach] code tuning design practice Extreme Programming importance of prerequisites 2nd pseudocode component of sequential approach compared iteration, code foreach loops 2nd iterative data iterator loops, defined Iterator pattern structured programming concept of |
< Free Open Study > |