Bipartition

class Bipartition

Defined in bipart.hpp.

A bipartition is a partition of the set \(\{0, ..., 2n - 1\}\) for some non-negative integer \(n\); see the Semigroups package for GAP documentation for more details. The Bipartition class is more complex (i.e. has more member functions) than are used in libsemigroups because they are used in the GAP package Semigroups package for GAP.

Member types

const_iterator

iterator

lookup_const_iterator

Constructors

Bipartition()

Constructs an uninitialised bipartition of degree 0.

Bipartition(Bipartition const&)

Default copy constructor.

Bipartition(Bipartition&&)

Default move constructor.

Bipartition(size_t)

Bipartition(std::initializer_list<std::vector<int32_t>> const&)

Bipartition(std::initializer_list<uint32_t> const&)

Bipartition(std::vector<uint32_t> const&)

Bipartition(std::vector<uint32_t>&&)

operator=(Bipartition const&)

Default copy assignment operator.

operator=(Bipartition&&)

Default move assignment operator.

Static member functions

identity(size_t)

make(T const&)

make(std::initializer_list<std::vector<int32_t>> const &)

make(std::initializer_list<uint32_t> const&)

Operators

operator<(Bipartition const&) const

operator==(Bipartition const&) const

product_inplace(Bipartition const&, Bipartition const&, size_t)

Accessors

at(size_t)

at(size_t) const

operator[](size_t)

operator[](size_t) const

Iterators

cbegin() const noexcept

cbegin_left_blocks() const noexcept

cbegin_lookup() noexcept

cbegin_right_blocks() const noexcept

cend() const noexcept

cend_left_blocks() const noexcept

cend_lookup() noexcept

cend_right_blocks() const noexcept

Getters

degree() const noexcept

hash_value() const

identity() const

is_transverse_block(size_t)

left_blocks()

number_of_blocks() const

number_of_left_blocks()

number_of_right_blocks()

rank()

right_blocks()

Setters

set_number_of_blocks(size_t) noexcept

set_number_of_left_blocks(size_t) noexcept

set_rank(size_t) noexcept