TiledArray
0.7.0
|
Namespaces | |
TiledArray::symmetry | |
Classes | |
class | TiledArray::Permutation |
Permutation of a sequence of objects indexed by base-0 indices. More... | |
class | TiledArray::symmetry::PermutationGroup |
Permutation group. More... | |
class | TiledArray::symmetry::SymmetricGroup |
Symmetric group. More... | |
|
inline |
Computes conjugate permutation group obtained by the action of a permutation.
Conjugate of group under the action of element is a group .
G
by action of h
that permutes elements in the domain of G
with those outside its domain, e.g. if on domain , conjugation with will produce on domain . G | input PermutationGroup |
h | input Permutation |
Definition at line 381 of file permutation_group.h.
|
inline |
Computes intersect of 2 PermutationGroups
G1 | PermutationGroup |
G2 | PermutationGroup |
Definition at line 395 of file permutation_group.h.
bool TiledArray::symmetry::is_lexicographically_smallest | ( | const MultiIndex & | idx, |
const PermutationGroup & | pg | ||
) |
determines whether a given MultiIndex is lexicographically smallest among all indices generated by the action of pg
.
MultiIndex | a sequence type that is directly addressable, i.e. has a fast operator [] |
idx | an Index object |
pg | the PermutationGroup |
false
if action of a permutation in pg
can produce an Index that is lexicographically smaller than idx
(i.e. there exists i
such that pg
[i]*idx is lexicographically less than idx
), true
otherwise Definition at line 353 of file permutation_group.h.
|
inline |
PermutationGroup inequality operator.
p1 | The left-hand permutation group to be compared |
p2 | The right-hand permutation group to be compared |
true
if any element of p1
is not equal to that of p2
, otherwise false
. Definition at line 225 of file permutation_group.h.
|
inline |
Permutation inequality operator.
p1 | The left-hand permutation to be compared |
p2 | The right-hand permutation to be compared |
true
if any element of p1
is not equal to that of p2
, otherwise false
. Definition at line 406 of file permutation.h.
|
inline |
Permutation multiplication operator.
p1 | The left-hand permutation |
p2 | The right-hand permutation |
p2
by p1
). Definition at line 450 of file permutation.h.
|
inline |
return *this ^ other
Definition at line 456 of file permutation.h.
|
inline |
Inverse permutation operator.
perm | The permutation to be inverted |
perm.inverse()
Definition at line 440 of file permutation.h.
|
inline |
PermutationGroup less-than operator.
p1 | The left-hand permutation group to be compared |
p2 | The right-hand permutation group to be compared |
true
if the elements of p1
are lexicographically less than that of p2
, otherwise false
. Definition at line 235 of file permutation_group.h.
|
inline |
Permutation less-than operator.
p1 | The left-hand permutation to be compared |
p2 | The right-hand permutation to be compared |
true
if the elements of p1
are lexicographically less than that of p2
, otherwise false
. Definition at line 416 of file permutation.h.
|
inline |
Add permutation to an output stream.
[out] | output | The output stream |
[in] | p | The permutation to be added to the output stream |
Definition at line 426 of file permutation.h.
|
inline |
Add permutation group to an output stream.
[out] | output | The output stream |
[in] | p | The permutation group to be added to the output stream |
Definition at line 245 of file permutation_group.h.
|
inline |
Permutation equality operator.
p1 | The left-hand permutation to be compared |
p2 | The right-hand permutation to be compared |
true
if all elements of p1
and p2
are equal and in the same order, otherwise false
. Definition at line 395 of file permutation.h.
|
inline |
PermutationGroup equality operator.
p1 | The left-hand permutation group to be compared |
p2 | The right-hand permutation group to be compared |
true
if all elements of p1
and p2
are equal, otherwise false
. Definition at line 214 of file permutation_group.h.
|
inline |
Raise perm
to the n-th power.
Constructs the permutation , where is the permutation perm
.
perm | The base permutation |
n | Exponent value |
Definition at line 467 of file permutation.h.
|
inline |
Computes the largest subgroup of a permutation group that leaves the given set of indices fixed.
Set | a set of indices |
G | input PermutationGroup |
f | input Set |
G
Definition at line 411 of file permutation_group.h.