|
Lattice Builder Manual
Software Package for Constructing Rank-1 Lattices
|
Indexed sequence of integers that extend on an smaller integer by adding higher-order digits. More...
#include <Extend.h>
Inherits LatBuilder::Traversal::Policy< Extend< TRAV >, TRAV >.
Classes | |
| struct | RebindTraversal |
| Rebinds the traversal type. More... | |
Public Types | |
| typedef Modulus | value_type |
| Value type. | |
| typedef size_t | size_type |
| Size type. | |
| typedef TRAV | Traversal |
| Traversal type. | |
Public Member Functions | |
| Extend (value_type modulus=1, value_type grain=1, value_type low=0, Traversal trav=Traversal()) | |
| Constructor. More... | |
| template<class TRAV2 > | |
| Extend (const Extend< TRAV2 > &other, Traversal trav=Traversal()) | |
| Cross-traversal copy-constructor. | |
| template<class TRAV2 > | |
| RebindTraversal< TRAV2 >::Type | rebind (TRAV2 trav) const |
| Returns a copy of this object, but using a different traversal policy. | |
| value_type | modulus () const |
| Returns the modulus. | |
| size_type | size () const |
| Returns the size of the sequence. More... | |
| value_type | operator[] (size_type i) const |
Returns the element at index i. | |
Friends | |
| template<typename > | |
| class | Extend |
Indexed sequence of integers that extend on an smaller integer by adding higher-order digits.
Given a small integer \(x\) smaller than the grain \(n_0\), the \(i\)-th integer this sequence is given by \(i n_0 + x\).
| LatBuilder::GenSeq::Extend< TRAV >::Extend | ( | value_type | modulus = 1, |
| value_type | grain = 1, |
||
| value_type | low = 0, |
||
| Traversal | trav = Traversal() |
||
| ) |
Constructor.
| modulus | All integers in the sequence are smaller than modulus. |
| grain | Difference between successive integers in the sequence. |
| low | j Integer smaller than grain that specifies the lower digits of every integer in the sequence. |
| trav | Traversal instance. |
|
inline |
Returns the size of the sequence.
The size is the value of Euler's totient function.