FixedPrimeIterator Class Reference

Adaptor class to make a single prime number behave like a PrimeIterator. More...

#include <random-prime.h>

Public Types
using	Prime_Type = Givaro::Integer
using	UniqueSamplingTag = std::false_type
using	IteratorTag = IteratorCategories::DeterministicTag

Public Member Functions
	FixedPrimeIterator (const Givaro::Integer &i)
FixedPrimeIterator &	operator++ ()
const Prime_Type &	operator* () const
const Prime_Type &	randomPrime () const
void	setBits (uint64_t bits)
template<class _ModField>
void	setBitsField ()

Detailed Description

Adaptor class to make a single prime number behave like a PrimeIterator.

Examples

examples/dixonsolve.C.

Member Typedef Documentation

Prime_Type

using Prime_Type = Givaro::Integer

UniqueSamplingTag

using UniqueSamplingTag = std::false_type

IteratorTag

using IteratorTag = IteratorCategories::DeterministicTag

Constructor & Destructor Documentation

FixedPrimeIterator()

FixedPrimeIterator ( const Givaro::Integer & i )

inline

Member Function Documentation

operator++()

FixedPrimeIterator & operator++ ( )

inline

operator*()

const Prime_Type & operator* ( ) const

inline

randomPrime()

const Prime_Type & randomPrime ( ) const

inline

setBits()

void setBits ( uint64_t bits )

inline

setBitsField()

template<class _ModField>

void setBitsField ( )

inline

---

The documentation for this class was generated from the following file:

• random-prime.h