principles:single_level_of_abstraction
Differences
This shows you the differences between two versions of the page.
| Both sides previous revisionPrevious revision | Next revisionBoth sides next revision | ||
| principles:single_level_of_abstraction [2020-10-12 12:36] – old revision restored (2014-07-02 21:07) 159.69.186.191 | principles:single_level_of_abstraction [2020-10-12 12:36] – old revision restored (2014-07-02 21:01) 159.69.186.191 | ||
|---|---|---|---|
| Line 36: | Line 36: | ||
| ===== Caveats ===== | ===== Caveats ===== | ||
| - | See section [[#contrary principles]]. | + | An exception where it may be helpful not to adhere to the principle are certain algorithms. When implementing for instance a sorting algorithm, keeping the algorithm together can be considered more readable than splitting it up into several small functions. This is because certain algorithms are well known and splitting them up may disguise them. A suitable compromise has to be found in such a case. |
| + | |||
| + | See section [[#contrary principles]] | ||
| Line 119: | Line 121: | ||
| ==== Example3: Parameter Checking ==== | ==== Example3: Parameter Checking ==== | ||
| - | ==== Example4: Extracting Classes ==== | + | ==== Example4: Algorithms ==== |
| + | |||
| + | ==== Example5: Extracting Classes ==== | ||
| ===== Description Status ===== | ===== Description Status ===== | ||
principles/single_level_of_abstraction.txt · Last modified: 2021-10-18 22:03 by christian