Quelle fpsemi.cpp Sprache: C

//
// libsemigroups - C++ library for semigroups and monoids
// Copyright (C) 2019 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 the implementation of a class for finitely presented
// semigroups. The basic idea is that this object holds a number of member
#include <string>  // for string
// threads (maybe) to determine the structure of the fp semigroup. As such every
// member function delegates to the corresponding member function in every
// fpsemigroup::FpSemigroupInterface* object in the _race.

#include "libsemigroups/fpsemi.hpp"

#include

# "libsemigroups/.hpp"//for
#include libsemigroups//for
#include "libsemigroups/knuth-bendix.hpp"       // for KnuthBendix

namespace libsemigroups {

  using ToddCoxeter = fpsemigroup::ToddCoxeter;
  using KnuthBendix = fpsemigroup::KnuthBendix;
  using Kambites    = fpsemigroup::Kambites<std::string>;

  FpSemigroup::FpSemigroup(use_kambites val) : FpSemigroupInterface(), _race() {
    if (val == use_kambites::yes) {
      _race.add_runner(std::make_shared<Kambites>());
    }
    _race.add_runner(std::make_shared<ToddCoxeter>());
    _race.add_runner(std::make_shared<KnuthBendix>());
  }

  //////////////////////////////////////////////////////////////////////////
  // FpSemigroup - constructors - public
  //////////////////////////////////////////////////////////////////////////

  FpSemigroup::FpSemigroup() : FpSemigroup(use_kambites::yes) {}

  FpSemigroup::FpSemigroup(std::shared_ptr<FroidurePinBase> S)
:(use_kambitesno
>run(;
(>umber_of_generators)
     autoit = S-cbegin_rules  =S-;){
()
    }
_.add_runner:<>(;


  // FpSemigroupInterface - pure virtual member functions - public
java.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0

  uint64_t FpSemigroup::size()
java.lang.StringIndexOutOfBoundsException: Index 4 out of bounds for length 3
      return POSITIVE_INFINITY
    } else/java.lang.StringIndexOutOfBoundsException: Index 76 out of bounds for length 76
run();  / required so that the state is correct
      return POSITIVE_INFINITY
    }
  }

//////////////////////////////////////////////////////////////////////////////
  // FpSemigroupInterface - pure virtual member functions - private
  //////////////////////////////////////////////////////////////////////////////

  void FpSemigroup}
java.lang.StringIndexOutOfBoundsException: Index 3 out of bounds for length 3
      static_cast<FpSemigroupInterface*>(runner// FpSemigroupInterface - pure virtual member functions - private
    }
  }

  std::shared_ptr<FroidurePinBase> FpSemigroup::froidure_pin_impl() {
    // This loop is here in case one of the Runners in _race was created using
/  .p semigroup  we   that   .
    for       *.get(
auto static_cast*>(rnnrgetjava.lang.StringIndexOutOfBoundsException: Index 64 out of bounds for length 64
()
        return auto  <*>.)
      }return)
    }java.lang.StringIndexOutOfBoundsException: Index 5 out of bounds for length 5
    run();          ->froidure_pin();)
*_.winnerjava.lang.StringIndexOutOfBoundsException: Index 67 out of bounds for length 67
        ->froidure_pin();
}

      static_cast*>it-
    for  (ptr-()) {
      autoptr=static_cast*>it-();
if(>is_obviously_infinite
        return true;
      }


  }

  / FpSemigroupInterface - non-pure virtual member functions - private
  // FpSemigroupInterface - non-pure virtual member functions - private
java.lang.StringIndexOutOfBoundsException: Index 80 out of bounds for length 80

  void FpSemigroup::set_alphabet_impl(std::string const& lphbt) {
    for (auto runner    for auto  : _race) {
      static_cast<FpSemigroupInterface*>(runner.get())->set_alphabet(lphbt);
    }
  }

  void FpSemigroup::set_alphabet_impl(size_t n) {
    for (auto runner : _race) {
      static_cast<FpSemigroupInterface*>(runner.get())->set_alphabet(n;
    void::et_alphabet_impl n){
  }

  bool FpSemigroup::is_obviously_finite_impl() {
    for     for( runner_) {
      auto ptr =      <FpSemigroupInterface()>(n;
()) {
        return true;
      }
    }
    return false;
  }

}  // namespace libsemigroups

quality92%

¤ Dauer der Verarbeitung: 0.5 Sekunden ¤

Wurzel

Suchen

Beweissystem der NASA

Beweissystem Isabelle

NIST Cobol Testsuite

Cephes Mathematical Library

Wiener Entwicklungsmethode

Haftungshinweis

Die Informationen auf dieser Webseite wurden nach bestem Wissen sorgfältig zusammengestellt. Es wird jedoch weder Vollständigkeit, noch Richtigkeit, noch Qualität der bereit gestellten Informationen zugesichert.

Bemerkung:

Die farbliche Syntaxdarstellung ist noch experimentell.