Permutation of a bipartite set.
Definition at line 610 of file permutation.h.
◆ index_type
◆ vector
◆ BipartitePermutation() [1/8]
TiledArray::BipartitePermutation::BipartitePermutation |
( |
| ) |
|
|
default |
◆ BipartitePermutation() [2/8]
◆ BipartitePermutation() [3/8]
◆ ~BipartitePermutation()
TiledArray::BipartitePermutation::~BipartitePermutation |
( |
| ) |
|
|
default |
◆ BipartitePermutation() [4/8]
TiledArray::BipartitePermutation::BipartitePermutation |
( |
const Permutation & |
p, |
|
|
index_type |
second_partition_size = 0 |
|
) |
| |
|
inline |
◆ BipartitePermutation() [5/8]
TiledArray::BipartitePermutation::BipartitePermutation |
( |
const Permutation & |
first, |
|
|
const Permutation & |
second |
|
) |
| |
|
inline |
◆ BipartitePermutation() [6/8]
template<typename InIter , typename std::enable_if< detail::is_input_iterator< InIter >::value >::type * = nullptr>
TiledArray::BipartitePermutation::BipartitePermutation |
( |
InIter |
first, |
|
|
InIter |
last, |
|
|
index_type |
second_partition_size = 0 |
|
) |
| |
|
inline |
Construct permutation from a range [first,last)
- Template Parameters
-
InIter | An input iterator type |
- Parameters
-
first | The beginning of the iterator range |
last | The end of the iterator range |
second_partition_size | the size of the second partition; the size of the first is then std::distance(first,last)-second_partition_size |
- Exceptions
-
TiledArray::Exception | If the permutation contains any element that is greater than the size of the permutation or if there are any duplicate elements. |
Definition at line 708 of file permutation.h.
◆ BipartitePermutation() [7/8]
template<typename Index , typename = std::enable_if_t<detail::is_integral_range_v<Index>>>
TiledArray::BipartitePermutation::BipartitePermutation |
( |
const Index & |
a, |
|
|
index_type |
second_partition_size = 0 |
|
) |
| |
|
inlineexplicit |
Array constructor.
Construct permutation from an Array
- Parameters
-
a | The permutation array to be moved |
second_partition_size | the size of the second partition; the size of the first is then std::distance(first,last)-second_partition_size |
Definition at line 723 of file permutation.h.
◆ BipartitePermutation() [8/8]
std::vector move constructor
Move the content of the vector into this permutation
- Parameters
-
a | The permutation array to be moved |
second_partition_size | the size of the second partition; the size of the first is then std::distance(first,last)-second_partition_size |
Definition at line 735 of file permutation.h.
◆ begin()
auto TiledArray::BipartitePermutation::begin |
( |
| ) |
const |
|
inline |
Begin element iterator factory function.
- Returns
- An iterator that points to the beginning of the element range
Definition at line 643 of file permutation.h.
◆ cbegin()
auto TiledArray::BipartitePermutation::cbegin |
( |
| ) |
const |
|
inline |
Begin element iterator factory function.
- Returns
- An iterator that points to the beginning of the element range
Definition at line 648 of file permutation.h.
◆ cend()
auto TiledArray::BipartitePermutation::cend |
( |
| ) |
const |
|
inline |
End element iterator factory function.
- Returns
- An iterator that points to the end of the element range
Definition at line 658 of file permutation.h.
◆ dim()
auto TiledArray::BipartitePermutation::dim |
( |
| ) |
const |
|
inline |
Domain size accessor.
- Returns
- The domain size
Definition at line 636 of file permutation.h.
◆ end()
auto TiledArray::BipartitePermutation::end |
( |
| ) |
const |
|
inline |
End element iterator factory function.
- Returns
- An iterator that points to the end of the element range
Definition at line 653 of file permutation.h.
◆ first()
const Permutation& TiledArray::BipartitePermutation::first |
( |
| ) |
const |
|
inline |
- Returns
- reference to the first partition
Definition at line 742 of file permutation.h.
◆ first_size()
index_type TiledArray::BipartitePermutation::first_size |
( |
| ) |
const |
|
inline |
- Returns
- the size of the first partition
Definition at line 747 of file permutation.h.
◆ operator bool()
TiledArray::BipartitePermutation::operator bool |
( |
| ) |
const |
|
inlineexplicit |
Bool conversion.
- Returns
true
if the permutation is not empty, otherwise false
.
Definition at line 626 of file permutation.h.
◆ operator const Permutation &()
TiledArray::BipartitePermutation::operator const Permutation & |
( |
| ) |
const & |
|
inline |
◆ operator Permutation &()
TiledArray::BipartitePermutation::operator Permutation & |
( |
| ) |
& |
|
inline |
◆ operator Permutation &&()
TiledArray::BipartitePermutation::operator Permutation && |
( |
| ) |
&& |
|
inline |
◆ operator=() [1/2]
◆ operator=() [2/2]
◆ second()
const Permutation& TiledArray::BipartitePermutation::second |
( |
| ) |
const |
|
inline |
- Returns
- reference to the second partition
Definition at line 744 of file permutation.h.
◆ second_size()
index_type TiledArray::BipartitePermutation::second_size |
( |
| ) |
const |
|
inline |
- Returns
- the size of the second partition
Definition at line 750 of file permutation.h.
◆ serialize()
template<typename Archive >
void TiledArray::BipartitePermutation::serialize |
( |
Archive & |
ar | ) |
|
|
inline |
Serialize permutation.
MADNESS compatible serialization function
- Template Parameters
-
Archive | The serialization archive type |
- Parameters
-
[in,out] | ar | The serialization archive |
Definition at line 758 of file permutation.h.
◆ size()
auto TiledArray::BipartitePermutation::size |
( |
| ) |
const |
|
inline |
Domain size accessor.
- Returns
- The domain size
Definition at line 631 of file permutation.h.
◆ operator==
Permutation equality operator.
- Parameters
-
p1 | The left-hand permutation to be compared |
p2 | The right-hand permutation to be compared |
- Returns
true
if all elements of p1
and p2
are equal and the partition sizes match, otherwise false
.
Definition at line 795 of file permutation.h.
The documentation for this class was generated from the following file: