blob: f0a276788f07cc2c9c29c354a98d0228c81ee340 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
|
/***************************************************************************
primenumber.h - class primenumber
-------------------
begin : Tue Nov 27 16:40:42 CET 2001
copyright : (C) 2001 by Sebastian Stein
email : seb.kde@hpfsc.de
***************************************************************************/
/***************************************************************************
* *
* This program is free software; you can redistribute it and/or modify *
* it under the terms of the GNU General Public License as published by *
* the Free Software Foundation; either version 2 of the License, or *
* (at your option) any later version. *
* *
***************************************************************************/
#ifndef PRIMZAHL_H
#define PRIMZAHL_H
#include <tqvaluevector.h>
typedef TQValueVector<uint> UnsignedIntArray;
/** Class to handle prime numbers.
* The prime numbers are stored in a static vector, so that different instances
* can use them. Each time a higher prime number is needed, the new found prime
* number is stored in the vector. To check if a given number is a prime number
* this vector is scanned and if needed new prime numbers are generated. This
* algorithm should reduce calculation time and speed up every program using
* this prime number class.
* \author Sebastian Stein */
class primenumber
{
public:
/** constructor */
primenumber();
/** destructor */
~primenumber();
/** returns wether the given number is a prime number */
short isPrimeNumber(uint number);
/** returns the next prime number */
unsigned int get_next();
/** returns the first prime number */
unsigned int get_first() const;
/** return the last known prime number */
unsigned int get_last() const;
/** returns the current prime number */
unsigned int get_current() const;
/** moves the internal pointer to the first prime number */
void move_first();
/** moves the internal pointer to the last prime number */
void move_last();
/** moves the internal pointer to the next prime number */
void move_forward();
/** moves the internal pointer to the previous prime number */
void move_back();
/** Displays all known prime numbers, mainly used for debugging. */
void display_all();
private:
/** a vector storing all known prime numbers, access for all objects;
* we are using the vector<T> template; so we do not have to think
* about dynamic mem manipulation */
static UnsignedIntArray prim_vector;
/** current selected prime number */
UnsignedIntArray::iterator current_pos;
/** finds next prime number and adds it to the vector */
void find_next();
};
#endif
|
