43template <
class SymbolType >
49 visitor.
visit ( *
this );
56 visitor.
visit ( *
this );
161 if (
ext::type_index (
typeid ( *
this ) ) ==
ext::type_index (
typeid ( other ) ) )
return * this <=>
static_cast < decltype ( ( * this ) )
> ( other );
179 if (
ext::type_index (
typeid ( *
this ) ) ==
ext::type_index (
typeid ( other ) ) )
return *
this ==
static_cast < decltype ( ( * this ) )
> ( other );
206template <
class SymbolType >
210template <
class SymbolType >
214template <
class SymbolType >
216 return this->getLeft ( );
219template <
class SymbolType >
221 return this->getRight ( );
224template <
class SymbolType >
226 return this->getLeft ( );
229template <
class SymbolType >
231 return this->getRight ( );
234template <
class SymbolType >
239template <
class SymbolType >
241 this->setLeft ( std::move ( element ) );
244template <
class SymbolType >
249template <
class SymbolType >
251 this->setRight ( std::move ( element ) );
254template <
class SymbolType >
259template <
class SymbolType >
261 return new FormalRTEAlternation ( std::move ( *
this ) );
264template <
class SymbolType >
266 return std::tie ( getLeftElement ( ), getRightElement ( ) ) <=>
std::tie ( other.getLeftElement ( ), other.getRightElement ( ) );
269template <
class SymbolType >
271 return std::tie ( getLeftElement ( ), getRightElement ( ) ) ==
std::tie ( other.getLeftElement ( ), other.getRightElement ( ) );
274template <
class SymbolType >
276 out <<
"(FormalRTEAlternation";
277 out <<
" " << getLeftElement ( );
278 out <<
" " << getRightElement ( );
282template <
class SymbolType >
284 if ( getLeftElement ( ).testSymbol ( symbol ) )
return true;
286 if ( getRightElement ( ).testSymbol ( symbol ) )
return true;
291template <
class SymbolType >
294 getRightElement ( ).computeMinimalAlphabet ( alphabetF, alphabetK );
297template <
class SymbolType >
299 return getLeftElement ( ).
checkAlphabet ( alphabetF, alphabetK ) && getRightElement ( ).checkAlphabet ( alphabetF, alphabetK );
Definition: ranked_symbol.hpp:20
Binary node is specialisation of Anyary node to two children.
Definition: tree_base.hpp:459
Managed pointer simulating value like behavior.
Definition: memory.hpp:233
Definition: typeindex.h:37
typename T::SymbolType SymbolType
Definition: ReachableStates.h:176
Definition: Permutation.hpp:18
Definition: sigHandler.cpp:20
constexpr tuple< Elements &... > tie(Elements &... args) noexcept
Helper of extended tuple of references construction. The tuple is constructed to reffer to values in ...
Definition: tuple.hpp:218
auto move_copy(const T ¶m)
Allow moving of copied instance of the source.
Definition: utility.hpp:45
Definition: ToFTAGlushkov.h:22
Definition: FordFulkerson.hpp:16