|
LatNet Builder Manual 2.1.3-6
Software Package for Constructing Highly Uniform Point Sets
|
Indexed sequence of integers that extend on an smaller integer by adding higher-order digits. More...
#include <Extend.h>
Inherits LatBuilder::Traversal::Policy< Extend< LR, Traversal::Forward >, Traversal::Forward >.
Classes | |
| struct | RebindTraversal |
| Rebinds the traversal type. More... | |
Public Types | |
| typedef LatticeTraits< LR >::Modulus | value_type |
| Value type. | |
| typedef size_t | size_type |
| Size type. | |
| typedef TRAV | Traversal |
| Traversal type. | |
Public Member Functions | |
| Extend (value_type modulus=value_type(1), value_type grain=value_type(1), value_type low=value_type(0), Traversal trav=Traversal()) | |
| Constructor. | |
| template<class TRAV2> | |
| Extend (const Extend< LR, 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. | |
| value_type | operator[] (size_type i) const |
Returns the element at index i. | |
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< LR, TRAV >::Extend | ( | value_type | modulus = value_type(1), |
| value_type | grain = value_type(1), | ||
| value_type | low = value_type(0), | ||
| Traversal | trav = Traversal() ) |
|
inline |
Returns the size of the sequence.
The size is the value of Euler's totient function.