#include <SimSeqs.h>
Inheritance diagram for LDSqAtanassov:


Public Methods | |
| LDSqAtanassov (long *b=NULL, long dm=NULL, long iterations=0, long genau=BGENAU, double genau1=GENAU, char *ex="ata",char *nm="Atanassov", long *prts=NULL, long *mdfs=NULL) | |
Protected Methods | |
| virtual long | CalculateNextElement (long nr, double *buffer, long bufflen) |
| virtual long | InitData (long genau=0, double genau1=0) |
| virtual long | ExitData () |
| virtual long* | InitGenericBases (long dm) |
Protected Attributes | |
| long* | factors |
| long* | proots |
| long* | modifiers |
|
|
|
|
|
writes the next element(s) of the sequence in a buffer.
Reimplemented from LDSqBase. |
|
|
Do class-specific freeing of memory etc. Called by the destructor Reimplemented from LDSqBase. |
|
|
initialize the method specific data.
Reimplemented from LDSqBase. |
|
|
If no array of bases was given in the constructor, but the sequence needs them, this creates generic bases, e.g. most of the time these are the dm lowest prime numbers, but you can override this by reimplementing InitGenericBases in your subclass Reimplemented from LDSqBase. |
|
|
stores the factors of Atanassov's definition.
|
|
|
stores the modifiers needed in Atanassov's definition.
|
|
|
stores the primitive roots needed to create the sequence.
|
1.2.7 written by Dimitri van Heesch,
© 1997-2001