dedekind::category::Ranked Struct Reference

A byte's rank in an alphabet: how many of its letters lie below it, the order isomorphism of the letters, in the bytes' order, onto \([0, |\Sigma|)\); a byte outside it is a hole. A Kleisli arrow into Maybe, as where is: a text of bytes read through it is the alphabet's letters, holes where it has none. More...

Collaboration diagram for dedekind::category::Ranked:

Public Types
using	Domain = std::byte
using	Codomain = Maybe<std::size_t>

Public Member Functions
constexpr Maybe< std::size_t >	operator() (std::byte b) const
constexpr bool	operator== (const Ranked &) const =default

Public Attributes
Letters	letters

Detailed Description

A byte's rank in an alphabet: how many of its letters lie below it, the order isomorphism of the letters, in the bytes' order, onto \([0, |\Sigma|)\); a byte outside it is a hole. A Kleisli arrow into Maybe, as where is: a text of bytes read through it is the alphabet's letters, holes where it has none.

---

The documentation for this struct was generated from the following file:

• src/main/modules/dedekind/category/periodic.cppm