A pattern of even width length, packed into the bit word of width W, that is a square \(u u\): fixed by the rotation by half its width, within its width, the padding apart. For a width \(2^k\) these are exactly the proper powers, the patterns that are not primitive (Lothaire, Combinatorics on Words, §1.3): every proper divisor of \(2^k\) divides \(2^{k-1}\).
More...
|
|
using | Domain = BitWord<W> |
|
using | Codomain = bool |
|
|
constexpr bool | operator() (const Domain &x) const |
template<std::size_t W>
requires (W > 0)
struct dedekind::category::IsSquare< W >
A pattern of even width length, packed into the bit word of width W, that is a square \(u u\): fixed by the rotation by half its width, within its width, the padding apart. For a width \(2^k\) these are exactly the proper powers, the patterns that are not primitive (Lothaire, Combinatorics on Words, §1.3): every proper divisor of \(2^k\) divides \(2^{k-1}\).
- Template Parameters
-
The documentation for this struct was generated from the following file:
1.15.0