|
AlVin
1.0
A C++ implementation of the Vinberg's algorithm for Q, Q( sqrt(d) ) and Q( cos(2 pi / 7) )
|
This class represents a set of possible fractions x_0^2 / (e,e) We generate series of the type: (x0 + y)^2 / (e_max, e_max), ..., x0^2 / 1. More...
#include <alvinfractions.h>


Public Member Functions | |
| AlVinFractions (vector< AlgebraicInteger * > aiPossibleNorms2) | |
| Normal constructor. More... | |
| vector< AlVinFraction * > | getNextAlVinFraction () |
| Return the next fractions. More... | |
| vector< AlgebraicInteger * > | get_aiPossibleNorm2 () const |
| const vector< AlgebraicInteger * > * | get_ptraiPossibleNorm2 () const |
Protected Attributes | |
| vector< AlgebraicInteger * > | aiPossibleNorms2 |
| Possible values for (e,e) | |
| AlgebraicInteger * | aiPossibleNorms2_max |
| vector< AlVinFraction * > | alvinfractions |
| vector< AlVinFraction * >::const_iterator | alvinfractions_it |
| Iterator to the next element to be returned. | |
| unsigned int | iLastMaximum |
| unsigned int | iBatchSize |
This class represents a set of possible fractions x_0^2 / (e,e) We generate series of the type: (x0 + y)^2 / (e_max, e_max), ..., x0^2 / 1.
| AlVinFractions::AlVinFractions | ( | vector< AlgebraicInteger * > | aiPossibleNorms2 | ) |
Normal constructor.
| iPossibleNorm2_max( | const unsigned int& ): Biggest value for (e,e) |
| AlVinFractions::getNextAlVinFraction | ( | ) |
Return the next fractions.
1.8.11