Object-oriented Software ConstructionThis text is concerned with object-oriented software construction. |
From inside the book
Results 1-3 of 49
Page 140
... loops and in the special check instruction . 7.8.1 Loop invariant and variants The Eiffel syntax for loops also emphasizes correctness constructs . A loop may ( and often should ) include a loop invariant and a loop variant . These ...
... loops and in the special check instruction . 7.8.1 Loop invariant and variants The Eiffel syntax for loops also emphasizes correctness constructs . A loop may ( and often should ) include a loop invariant and a loop variant . These ...
Page 141
... loop , in which the loop body is executed zero or more times , not to a " repeat ... until " loop in which the body is always executed at least once . In the Eiffel form , however , the test is an exit condition , not a continuation ...
... loop , in which the loop body is executed zero or more times , not to a " repeat ... until " loop in which the body is always executed at least once . In the Eiffel form , however , the test is an exit condition , not a continuation ...
Page 142
... loop correct : one must also make sure that the loop terminates . This is obtained by exhibiting a proper loop variant . A variant is an integer expression whose value is non - negative after loop initialization , and is decreased by at ...
... loop correct : one must also make sure that the loop terminates . This is obtained by exhibiting a proper loop variant . A variant is an integer expression whose value is non - negative after loop initialization , and is decreased by at ...
Contents
Aspects of software quality | 3 |
Modularity | 11 |
The road to objectorientedness | 41 |
Copyright | |
25 other sections not shown
Other editions - View all
Common terms and phrases
abstract data type Algol 60 algorithm application approach arguments array assertions associated attribute BOOLEAN chapter class invariant class types client command compiler components computation constants coroutine correct corresponding Create cursor position data structures declared deferred class defined delete descendant described dynamic binding Eiffel element empty end class ensure entity error example execution export expression feature Figure first_element garbage collection implementation information hiding initial input instance instruction INTEGER interface introduced LINKABLE linked lists LINKED_LIST loop mechanism Modula-2 modular module multiple inheritance nb_elements notation notion object object-oriented design offleft offright once function operations package parameters Pascal POLYGON possible postcondition precondition problem procedure programming languages push RECTANGLE redefined redefinition reference renaming representation require rescue clause result reusability routine run-time semantics side-effects Simula Simula 67 Smalltalk solution specification stack STRING syntactical techniques top-down TREE variant Void