forked from libsemigroups/libsemigroups
-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Knuth bendix hpp (libsemigroups#623)
* Refactor x 2 * Split NormalFormRange into sep. file * Refactor x3 * Add file to Makefile.am * Refactor x4 * Refactor x5 * Refactor x6 * Formatting * Refactor x7 * Add TODO * Fixes from python * Linting + formatting * Fix wrong arg order for non_trivial_classes * Use V3 test macro for ToddCoxeter * Format * Add missing full stops
- Loading branch information
1 parent
182529f
commit e258212
Showing
17 changed files
with
1,896 additions
and
1,582 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,82 @@ | ||
| // | ||
| // libsemigroups - C++ library for semigroups and monoids | ||
| // Copyright (C) 2024 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/>. | ||
| // | ||
|
|
||
| // This file contains an implementation of a range object for producing normal | ||
| // forms for a KnuthBendix object. | ||
|
|
||
| #ifndef LIBSEMIGROUPS_DETAIL_KNUTH_BENDIX_NF_HPP_ | ||
| #define LIBSEMIGROUPS_DETAIL_KNUTH_BENDIX_NF_HPP_ | ||
|
|
||
| namespace detail { | ||
|
|
||
| template <typename Word, typename Rewriter, typename ReductionOrder> | ||
| class KnuthBendixNormalFormRange : public Paths<uint32_t> { | ||
| using Paths_ = Paths<uint32_t>; | ||
|
|
||
| mutable Word _current; | ||
| KnuthBendix<Rewriter, ReductionOrder>* _kb; | ||
|
|
||
| public: | ||
| using size_type = typename Paths_::size_type; | ||
| using output_type = Word const&; | ||
|
|
||
| explicit KnuthBendixNormalFormRange( | ||
| KnuthBendix<Rewriter, ReductionOrder>& kb) | ||
| : Paths(kb.gilman_graph()), _current(), _kb(&kb) { | ||
| // It's possible that the gilman graph is empty, so the call to | ||
| // source_no_checks(0) is technically invalid, but nothing goes wrong, | ||
| // so we just go with it. This is slightly smelly. | ||
| Paths_::source_no_checks(0); | ||
| if (!kb.presentation().contains_empty_word()) { | ||
| Paths_::next(); | ||
| } | ||
| } | ||
|
|
||
| output_type get() const { | ||
| word_type const& w = Paths_::get(); | ||
| _current.clear(); | ||
| for (auto c : w) { | ||
| _current.push_back(_kb->presentation().letter_no_checks(c)); | ||
| } | ||
| return _current; | ||
| } | ||
|
|
||
| KnuthBendixNormalFormRange& min(size_type val) noexcept { | ||
| // TODO(0) should not allow 0 unless contains_empty_word | ||
| Paths_::min(val); | ||
| return *this; | ||
| } | ||
|
|
||
| KnuthBendixNormalFormRange& max(size_type val) noexcept { | ||
| Paths_::max(val); | ||
| return *this; | ||
| } | ||
|
|
||
| using Paths_::at_end; | ||
| using Paths_::count; | ||
| using Paths_::max; | ||
| using Paths_::min; | ||
| using Paths_::next; | ||
| using Paths_::size_hint; | ||
|
|
||
| static constexpr bool is_finite = true; // this isn't always true! | ||
| static constexpr bool is_idempotent = true; | ||
| }; // class KnuthBendixNormalFormRange | ||
|
|
||
| } // namespace detail | ||
| #endif // LIBSEMIGROUPS_DETAIL_KNUTH_BENDIX_NF_HPP_ |
Oops, something went wrong.