When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Cppcheck - Wikipedia

    en.wikipedia.org/wiki/Cppcheck

    Cppcheck is a static code analysis tool for the C and C++ programming languages. It is a versatile tool that can check non-standard code. [2] The creator and lead developer is Daniel Marjamäki. Cppcheck is free software under the GNU General Public License.

  3. The Power of 10: Rules for Developing Safety-Critical Code

    en.wikipedia.org/wiki/The_Power_of_10:_Rules_for...

    All loops must have fixed bounds. This prevents runaway code. Avoid heap memory allocation. Restrict functions to a single printed page. Use a minimum of two runtime assertions per function. Restrict the scope of data to the smallest possible. Check the return value of all non-void functions, or cast to void to indicate the return value is useless.

  4. Compiler correctness - Wikipedia

    en.wikipedia.org/wiki/Compiler_correctness

    Thus, the most important objective in writing a compiler is that it is correct.” [9] Fraser & Hanson 1995 has a brief section on regression testing; source code is available. [10] Bailey & Davidson 2003 cover testing of procedure calls [11] A number of articles confirm that many released compilers have significant code-correctness bugs. [12]

  5. Double-checked locking - Wikipedia

    en.wikipedia.org/wiki/Double-checked_locking

    Check that the variable is initialized (without obtaining the lock). If it is initialized, return it immediately. Obtain the lock. Double-check whether the variable has already been initialized: if another thread acquired the lock first, it may have already done the initialization. If so, return the initialized variable.

  6. Compile-time function execution - Wikipedia

    en.wikipedia.org/wiki/Compile-time_function...

    In C++11, this technique is known as generalized constant expressions (constexpr). [2] C++14 relaxes the constraints on constexpr – allowing local declarations and use of conditionals and loops (the general restriction that all data required for the execution be available at compile-time remains).

  7. Curiously recurring template pattern - Wikipedia

    en.wikipedia.org/wiki/Curiously_recurring...

    The technique was formalized in 1989 as "F-bounded quantification."[2] The name "CRTP" was independently coined by Jim Coplien in 1995, [3] who had observed it in some of the earliest C++ template code as well as in code examples that Timothy Budd created in his multiparadigm language Leda. [4]

  8. Bounds checking - Wikipedia

    en.wikipedia.org/wiki/Bounds_checking

    In computer programming, bounds checking is any method of detecting whether a variable is within some bounds before it is used. It is usually used to ensure that a number fits into a given type (range checking), or that a variable being used as an array index is within the bounds of the array (index checking).

  9. pragma once - Wikipedia

    en.wikipedia.org/wiki/Pragma_once

    Using #pragma once allows the C preprocessor to include a header file when it is needed and to ignore an #include directive otherwise. This has the effect of altering the behavior of the C preprocessor itself, and allows programmers to express file dependencies in a simple fashion, obviating the need for manual management.