types.hpp

//
// libsemigroups - C++ library for semigroups and monoids
// Copyright (C) 2019-2025 James D. Mitchell
//
// This program is free software: you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation, either version 3 of the License, or
// (at your option) any later version.
//
// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
// GNU General Public License for more details.
//
// You should have received a copy of the GNU General Public License
// along with this program.  If not, see <http://www.gnu.org/licenses/>.
//
 
#ifndef LIBSEMIGROUPS_TYPES_HPP_
#define LIBSEMIGROUPS_TYPES_HPP_
 
#include <cstddef>      // for size_t
#include <cstdint>      // for uint8_t, uint16_t, uint32_t, uint64_t
#include <string_view>  // for string_view
#include <type_traits>  // for conditional
#include <utility>      // for pair
#include <vector>       // for vector
 
#include "detail/fmt.hpp"
#include <magic_enum/magic_enum.hpp>
 
namespace libsemigroups {

  template <typename Given, typename Expected>
  using enable_if_is_same
      = std::enable_if_t<std::is_same_v<Given, Expected>, Expected>;

  //! or not currently knowable.
  enum class tril {
    FALSE = 0,
    TRUE = 1,
    unknown = 2
  };

  //! be 2-sided, left, or right.
  enum class congruence_kind {
    onesided = 1,
    twosided = 2
  };

  template <size_t N>
  struct SmallestInteger {
    using type = std::conditional_t<
        N >= 0x100000000,
        uint64_t,
        std::conditional_t<N >= 0x10000,
                           uint32_t,
                           std::conditional_t<N >= 0x100, uint16_t, uint8_t>>>;
  };

  using letter_type = size_t;

  using word_type = std::vector<letter_type>;

  using relation_type = std::pair<word_type, word_type>;

}  // namespace libsemigroups
 
#endif  // LIBSEMIGROUPS_TYPES_HPP_