同样是患上肛周脓肿为何症.pptVIP

* * * * * * * * * Some sample rules No function shall have more than 200 lines (30 would be even better) that is, 200 non-comment source lines Each new statement starts on a new line E.g., int a = 7; x = a+7; f(x,9); // violation! No macros shall be used except for source control using #ifdef and #ifndef Identifiers should be given descriptive names May contain common abbreviations and acronyms When used conventionally, x, y, i, j, etc., are descriptive Use the number_of_elements style rather than the numberOfElements style Type names and constants start with a capital letter E.g., Device_driver and Buffer_pool Identifiers shall not differ only by case E.g., Head and head // violation! * Stroustrup/Programming Nov13 Some more sample rules Identifiers in an inner scope should not be identical to identifiers in an outer scope E.g., int var = 9; { int var = 7; ++var; } // violation: var hides var Declarations shall be declared in the smallest possible scope Variables shall be initialized E.g., int var; // violation: var is not initialized Casts should be used only when essential Code should not depend on precedence rules below the level of arithmetic expressions E.g., x = a*b+c; // ok if( ab || c=d) // violation: parenthesize (ab) and (c=d) Increment and decrement operations shall not be used as subexpressions E.g., int x = v[++i]; // violation (that increment might be overlooked) * Stroustrup/Programming Nov13 An example of bit manipulation The Tiny Encryption Algorithm (TEA) Originally by David Wheeler 35:8080/tea.htm Don’t look too hard at the code (unless you happen to need a good simple encryption algorithm for an application); it’s simply to give you the flavor of some bit manipulation code It takes one word (4 bytes at a time) E.g., 4 characters from a string or an image file It assumes 4-byte long integers Explanation is at the link (and in the book) Without the explanation this is just an example of how bit manipulation code can look. This code is not meant