template<typename Mat>
class libsemigroups::RankState< Mat >
Defined in bmat-adapters.hpp
.
Specialization of the RankState adapter for BMat.
- Warning
- The template type
Mat
must be a BMat type (IsBMat<Mat> must be true). If not, template substitution will fail.
- See also
- RankState.
|
| RankState () noexcept=default |
| Default constructor; does nothing.
|
|
| RankState ()=delete |
| Deleted.
|
|
| RankState (RankState &&)=delete |
| Deleted.
|
|
| RankState (RankState &&)=delete |
| Deleted.
|
|
| RankState (RankState const &)=default |
| Deleted.
|
|
| RankState (RankState const &)=default |
| Deleted.
|
|
template<typename T> |
| RankState (T first, T last) |
| Construct a RankState instance using iterators.
|
|
| RankState (T, T) noexcept |
| Iterator constructor; does nothing.
|
|
type const & | get () const |
| Returns the row orbit.
|
|
RankState & | operator= (RankState &&)=delete |
| Deleted.
|
|
RankState & | operator= (RankState &&)=delete |
| Deleted.
|
|
RankState & | operator= (RankState const &)=delete |
| Deleted.
|
|
RankState & | operator= (RankState const &)=delete |
| Deleted.
|
|
◆ MaxBitSet
template<typename Mat>
using MaxBitSet = BitSet<BitSet<1>::max_size()> |
The maximum size of BitSet.
◆ type
By default no additional state is required to calculate Rank<Element>; this is represented by type
being void
.
◆ RankState()
template<typename Mat>
template<typename T>
Construct a RankState
instance using an iterator of generators.
- Template Parameters
-
T | the iterator type of the parameters. |
- Parameters
-
first | iterator pointing to the first generator. |
last | iterator pointing one beyond the last generator. |
- Exceptions
-
◆ get()
template<typename Mat>
type const & get |
( |
| ) |
const |
|
inline |
The documentation for this class was generated from the following file:
- /home/joseph/Dev/Comp_Maths/testing/libsemigroups/include/libsemigroups/bmat-adapters.hpp