Effective implementation of algorithms (Master Thesis)
Effective and error-free implementation of algorithms
math::primes::PrimesSlow Class Reference

#include <primes_slow.h>

List of all members.

Static Public Member Functions

template<typename BaseType >
static bool isPrime (BaseType p)

Detailed Description

Very naive implementation of primality testing.

Warning:
: This is terribly slow! Use other methods instead, this is implementation is just for testing.

Member Function Documentation

template<typename BaseType >
static bool math::primes::PrimesSlow::isPrime ( BaseType  p) [inline, static]

Checks whether a specified number is prime

Precondition:
  • BaseType is integral typpe
Parameters:
pnumber to be tested
Returns:
true iff p is a prime number

The documentation for this class was generated from the following file:
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Defines