random-prime.h File Reference

Generates random positive prime Integers. More...

#include <givaro/givinteger.h>
#include <givaro/givintprime.h>
#include "linbox/util/timer.h"
#include "linbox/util/debug.h"
#include "linbox/field/field-traits.h"

Data Structures
struct	DeterministicTag
	Iterator following a deterministic sequence of primes (from the largest one, in decreasing order. More...
struct	UniformTag
	Iterator sampling uniformly from all primes of given bitsize. More...
struct	HeuristicTag
	Iterator sampling randomly (no distribution guaranteed whatsoever) from all primes of given bitsize. More...
struct	UniqueSamplingTrait< IteratorTrait >
	Whether a prime generator generates a sequence with non repeating numbers. More...
struct	UniqueSamplingTrait< IteratorCategories::DeterministicTag >
class	PrimeIterator< Trait >
	Prime Iterator. More...
class	PrimeSequence< IteratorT, UniqueTrait >
	Adaptor class to make a fixed-length sequence behave like a PrimeIterator. More...
class	MaskedPrimeIterator< Trait >
	Masked Prime Iterator. More...
class	FixedPrimeIterator
	Adaptor class to make a single prime number behave like a PrimeIterator. More...

Namespaces
namespace	LinBox
	Namespace in which all linbox code resides.
namespace	LinBox::IteratorCategories
	Information about the type of Prime Iterator.

Functions
uint32_t	MultiplyDeBruijnHighestBit (uint32_t v)
template<typename Container>
PrimeSequence< typename Container::const_iterator >	create_prime_sequence (const Container &cont)
	convenience factory to create a PrimeSequence from an STL-like container.

Detailed Description

Generates random positive prime Integers.