Gecko [ c.stage.kornherr.net ]

Name	Size	Permission	Date
algorithmfwd.h	24.17 KB	-rw-r--r--	2025-12-18 20:59
align.h	3.62 KB	-rw-r--r--	2025-12-18 20:59
alloc_traits.h	29.53 KB	-rw-r--r--	2025-12-18 20:59
allocated_ptr.h	3.25 KB	-rw-r--r--	2025-12-18 20:59
allocator.h	8.66 KB	-rw-r--r--	2025-12-18 20:59
atomic_base.h	58.7 KB	-rw-r--r--	2025-12-18 20:59
atomic_futex.h	12.08 KB	-rw-r--r--	2025-12-18 20:59
atomic_lockfree_defines.h	2.3 KB	-rw-r--r--	2025-12-18 20:59
atomic_timed_wait.h	13.18 KB	-rw-r--r--	2025-12-18 20:59
atomic_wait.h	12.41 KB	-rw-r--r--	2025-12-18 20:59
basic_ios.h	15.75 KB	-rw-r--r--	2025-12-18 20:59
basic_ios.tcc	5.67 KB	-rw-r--r--	2025-12-18 20:59
basic_string.h	156.46 KB	-rw-r--r--	2025-12-18 20:59
basic_string.tcc	30.3 KB	-rw-r--r--	2025-12-18 20:59
boost_concept_check.h	29.13 KB	-rw-r--r--	2025-12-18 20:59
c++0x_warning.h	1.44 KB	-rw-r--r--	2025-12-18 20:59
char_traits.h	29.05 KB	-rw-r--r--	2025-12-18 20:59
charconv.h	3.58 KB	-rw-r--r--	2025-12-18 20:59
chrono.h	47.06 KB	-rw-r--r--	2025-12-18 20:59
chrono_io.h	76.97 KB	-rw-r--r--	2025-12-18 20:59
codecvt.h	24.9 KB	-rw-r--r--	2025-12-18 20:59
concept_check.h	3.32 KB	-rw-r--r--	2025-12-18 20:59
cow_string.h	130.97 KB	-rw-r--r--	2025-12-18 20:59
cpp_type_traits.h	14.51 KB	-rw-r--r--	2025-12-18 20:59
cxxabi_forced.h	1.77 KB	-rw-r--r--	2025-12-18 20:59
cxxabi_init_exception.h	2.17 KB	-rw-r--r--	2025-12-18 20:59
deque.tcc	41.38 KB	-rw-r--r--	2025-12-18 20:59
enable_special_members.h	12.16 KB	-rw-r--r--	2025-12-18 20:59
erase_if.h	2.09 KB	-rw-r--r--	2025-12-18 20:59
exception.h	2.41 KB	-rw-r--r--	2025-12-18 20:59
exception_defines.h	1.61 KB	-rw-r--r--	2025-12-18 20:59
exception_ptr.h	8.05 KB	-rw-r--r--	2025-12-18 20:59
forward_list.h	49.92 KB	-rw-r--r--	2025-12-18 20:59
forward_list.tcc	13.71 KB	-rw-r--r--	2025-12-18 20:59
fs_dir.h	17.26 KB	-rw-r--r--	2025-12-18 20:59
fs_fwd.h	10.66 KB	-rw-r--r--	2025-12-18 20:59
fs_ops.h	10.49 KB	-rw-r--r--	2025-12-18 20:59
fs_path.h	41.47 KB	-rw-r--r--	2025-12-18 20:59
fstream.tcc	32.64 KB	-rw-r--r--	2025-12-18 20:59
functexcept.h	4.02 KB	-rw-r--r--	2025-12-18 20:59
functional_hash.h	8.79 KB	-rw-r--r--	2025-12-18 20:59
gslice.h	5.39 KB	-rw-r--r--	2025-12-18 20:59
gslice_array.h	7.71 KB	-rw-r--r--	2025-12-18 20:59
hash_bytes.h	2.1 KB	-rw-r--r--	2025-12-18 20:59
hashtable.h	88.71 KB	-rw-r--r--	2025-12-18 20:59
hashtable_policy.h	63.92 KB	-rw-r--r--	2025-12-18 20:59
indirect_array.h	7.72 KB	-rw-r--r--	2025-12-18 20:59
invoke.h	6.08 KB	-rw-r--r--	2025-12-18 20:59
ios_base.h	31.51 KB	-rw-r--r--	2025-12-18 20:59
istream.tcc	31.79 KB	-rw-r--r--	2025-12-18 20:59
iterator_concepts.h	33.72 KB	-rw-r--r--	2025-12-18 20:59
list.tcc	17.63 KB	-rw-r--r--	2025-12-18 20:59
locale_classes.h	24.79 KB	-rw-r--r--	2025-12-18 20:59
locale_classes.tcc	10.61 KB	-rw-r--r--	2025-12-18 20:59
locale_conv.h	18.74 KB	-rw-r--r--	2025-12-18 20:59
locale_facets.h	91.72 KB	-rw-r--r--	2025-12-18 20:59
locale_facets.tcc	40.42 KB	-rw-r--r--	2025-12-18 20:59
locale_facets_nonio.h	69.1 KB	-rw-r--r--	2025-12-18 20:59
locale_facets_nonio.tcc	55.69 KB	-rw-r--r--	2025-12-18 20:59
localefwd.h	5.8 KB	-rw-r--r--	2025-12-18 20:59
mask_array.h	7.77 KB	-rw-r--r--	2025-12-18 20:59
max_size_type.h	22 KB	-rw-r--r--	2025-12-18 20:59
memory_resource.h	15.73 KB	-rw-r--r--	2025-12-18 20:59
memoryfwd.h	2.47 KB	-rw-r--r--	2025-12-18 20:59
mofunc_impl.h	7.45 KB	-rw-r--r--	2025-12-18 20:59
move.h	6.51 KB	-rw-r--r--	2025-12-18 20:59
move_only_function.h	6.12 KB	-rw-r--r--	2025-12-18 20:59
nested_exception.h	7.51 KB	-rw-r--r--	2025-12-18 20:59
new_allocator.h	7.27 KB	-rw-r--r--	2025-12-18 20:59
node_handle.h	11.08 KB	-rw-r--r--	2025-12-18 20:59
ostream.tcc	11.83 KB	-rw-r--r--	2025-12-18 20:59
ostream_insert.h	3.98 KB	-rw-r--r--	2025-12-18 20:59
parse_numbers.h	7.8 KB	-rw-r--r--	2025-12-18 20:59
postypes.h	7.33 KB	-rw-r--r--	2025-12-18 20:59
predefined_ops.h	9.94 KB	-rw-r--r--	2025-12-18 20:59
ptr_traits.h	8.29 KB	-rw-r--r--	2025-12-18 20:59
quoted_string.h	5.01 KB	-rw-r--r--	2025-12-18 20:59
random.h	178.84 KB	-rw-r--r--	2025-12-18 20:59
random.tcc	103.48 KB	-rw-r--r--	2025-12-18 20:59
range_access.h	11.67 KB	-rw-r--r--	2025-12-18 20:59
ranges_algo.h	128.65 KB	-rw-r--r--	2025-12-18 20:59
ranges_algobase.h	18.37 KB	-rw-r--r--	2025-12-18 20:59
ranges_base.h	28.82 KB	-rw-r--r--	2025-12-18 20:59
ranges_cmp.h	5.9 KB	-rw-r--r--	2025-12-18 20:59
ranges_uninitialized.h	17.71 KB	-rw-r--r--	2025-12-18 20:59
ranges_util.h	24.96 KB	-rw-r--r--	2025-12-18 20:59
refwrap.h	13.27 KB	-rw-r--r--	2025-12-18 20:59
regex.h	104.32 KB	-rw-r--r--	2025-12-18 20:59
regex.tcc	16.1 KB	-rw-r--r--	2025-12-18 20:59
regex_automaton.h	10.55 KB	-rw-r--r--	2025-12-18 20:59
regex_automaton.tcc	7.6 KB	-rw-r--r--	2025-12-18 20:59
regex_compiler.h	15.92 KB	-rw-r--r--	2025-12-18 20:59
regex_compiler.tcc	18.48 KB	-rw-r--r--	2025-12-18 20:59
regex_constants.h	14.54 KB	-rw-r--r--	2025-12-18 20:59
regex_error.h	5.35 KB	-rw-r--r--	2025-12-18 20:59
regex_executor.h	8.81 KB	-rw-r--r--	2025-12-18 20:59
regex_executor.tcc	18.49 KB	-rw-r--r--	2025-12-18 20:59
regex_scanner.h	6.88 KB	-rw-r--r--	2025-12-18 20:59
regex_scanner.tcc	14.59 KB	-rw-r--r--	2025-12-18 20:59
requires_hosted.h	1.36 KB	-rw-r--r--	2025-12-18 20:59
semaphore_base.h	7.7 KB	-rw-r--r--	2025-12-18 20:59
shared_ptr.h	38.14 KB	-rw-r--r--	2025-12-18 20:59
shared_ptr_atomic.h	22.79 KB	-rw-r--r--	2025-12-18 20:59
shared_ptr_base.h	65.18 KB	-rw-r--r--	2025-12-18 20:59
slice_array.h	9.39 KB	-rw-r--r--	2025-12-18 20:59
specfun.h	46.07 KB	-rw-r--r--	2025-12-18 20:59
sstream.tcc	9.91 KB	-rw-r--r--	2025-12-18 20:59
std_abs.h	4.63 KB	-rw-r--r--	2025-12-18 20:59
std_function.h	23.12 KB	-rw-r--r--	2025-12-18 20:59
std_mutex.h	6.69 KB	-rw-r--r--	2025-12-18 20:59
std_thread.h	9.84 KB	-rw-r--r--	2025-12-18 20:59
stl_algo.h	212.39 KB	-rw-r--r--	2025-12-18 20:59
stl_algobase.h	74.97 KB	-rw-r--r--	2025-12-18 20:59
stl_bvector.h	41.58 KB	-rw-r--r--	2025-12-18 20:59
stl_construct.h	8.47 KB	-rw-r--r--	2025-12-18 20:59
stl_deque.h	76.34 KB	-rw-r--r--	2025-12-18 20:59
stl_function.h	43.97 KB	-rw-r--r--	2025-12-18 20:59
stl_heap.h	20.31 KB	-rw-r--r--	2025-12-18 20:59
stl_iterator.h	92.81 KB	-rw-r--r--	2025-12-18 20:59
stl_iterator_base_funcs.h	8.75 KB	-rw-r--r--	2025-12-18 20:59
stl_iterator_base_types.h	9.48 KB	-rw-r--r--	2025-12-18 20:59
stl_list.h	70.62 KB	-rw-r--r--	2025-12-18 20:59
stl_map.h	54.86 KB	-rw-r--r--	2025-12-18 20:59
stl_multimap.h	42.71 KB	-rw-r--r--	2025-12-18 20:59
stl_multiset.h	36.87 KB	-rw-r--r--	2025-12-18 20:59
stl_numeric.h	14.25 KB	-rw-r--r--	2025-12-18 20:59
stl_pair.h	36.43 KB	-rw-r--r--	2025-12-18 20:59
stl_queue.h	28.06 KB	-rw-r--r--	2025-12-18 20:59
stl_raw_storage_iter.h	3.91 KB	-rw-r--r--	2025-12-18 20:59
stl_relops.h	4.47 KB	-rw-r--r--	2025-12-18 20:59
stl_set.h	37.13 KB	-rw-r--r--	2025-12-18 20:59
stl_stack.h	13.71 KB	-rw-r--r--	2025-12-18 20:59
stl_tempbuf.h	8.67 KB	-rw-r--r--	2025-12-18 20:59
stl_tree.h	72.06 KB	-rw-r--r--	2025-12-18 20:59
stl_uninitialized.h	35.63 KB	-rw-r--r--	2025-12-18 20:59
stl_vector.h	68.88 KB	-rw-r--r--	2025-12-18 20:59
stream_iterator.h	8.2 KB	-rw-r--r--	2025-12-18 20:59
streambuf.tcc	4.58 KB	-rw-r--r--	2025-12-18 20:59
streambuf_iterator.h	15.57 KB	-rw-r--r--	2025-12-18 20:59
string_view.tcc	7 KB	-rw-r--r--	2025-12-18 20:59
stringfwd.h	2.56 KB	-rw-r--r--	2025-12-18 20:59
this_thread_sleep.h	3.21 KB	-rw-r--r--	2025-12-18 20:59
uniform_int_dist.h	13 KB	-rw-r--r--	2025-12-18 20:59
unique_lock.h	6.16 KB	-rw-r--r--	2025-12-18 20:59
unique_ptr.h	35.62 KB	-rw-r--r--	2025-12-18 20:59
unordered_map.h	75.11 KB	-rw-r--r--	2025-12-18 20:59
unordered_set.h	61.7 KB	-rw-r--r--	2025-12-18 20:59
uses_allocator.h	6.91 KB	-rw-r--r--	2025-12-18 20:59
uses_allocator_args.h	8.53 KB	-rw-r--r--	2025-12-18 20:59
utility.h	8.12 KB	-rw-r--r--	2025-12-18 20:59
valarray_after.h	22.74 KB	-rw-r--r--	2025-12-18 20:59
valarray_array.h	20.8 KB	-rw-r--r--	2025-12-18 20:59
valarray_array.tcc	7.08 KB	-rw-r--r--	2025-12-18 20:59
valarray_before.h	18.69 KB	-rw-r--r--	2025-12-18 20:59
vector.tcc	31.5 KB	-rw-r--r--	2025-12-18 20:59

Rename

// class template regex -*- C++ -*-

// Copyright (C) 2013-2023 Free Software Foundation, Inc.
//
// This file is part of the GNU ISO C++ Library.  This library 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, or (at your option)
// any later version.

// This library 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.

// Under Section 7 of GPL version 3, you are granted additional
// permissions described in the GCC Runtime Library Exception, version
// 3.1, as published by the Free Software Foundation.

// You should have received a copy of the GNU General Public License and
// a copy of the GCC Runtime Library Exception along with this program;
// see the files COPYING3 and COPYING.RUNTIME respectively.  If not, see
// <http://www.gnu.org/licenses/>.

/**
 *  @file bits/regex_automaton.h
 *  This is an internal header file, included by other library headers.
 *  Do not attempt to use it directly. @headername{regex}
 */

// This macro defines the maximal state number a NFA can have.
#ifndef _GLIBCXX_REGEX_STATE_LIMIT
#define _GLIBCXX_REGEX_STATE_LIMIT 100000
#endif

namespace std _GLIBCXX_VISIBILITY(default)
{
_GLIBCXX_BEGIN_NAMESPACE_VERSION

namespace __detail
{
  /**
   *  @defgroup regex-detail Base and Implementation Classes
   *  @ingroup regex
   *  @{
   */

typedef long _StateIdT;
  _GLIBCXX17_INLINE constexpr _StateIdT _S_invalid_state_id  = -1;

template<typename _CharT>
    using _Matcher = std::function<bool (_CharT)>;

/// Operation codes that define the type of transitions within the base NFA
  /// that represents the regular expression.
  enum _Opcode : int
  {
      _S_opcode_unknown,
      _S_opcode_alternative,
      _S_opcode_repeat,
      _S_opcode_backref,
      _S_opcode_line_begin_assertion,
      _S_opcode_line_end_assertion,
      _S_opcode_word_boundary,
      _S_opcode_subexpr_lookahead,
      _S_opcode_subexpr_begin,
      _S_opcode_subexpr_end,
      _S_opcode_dummy,
      _S_opcode_match,
      _S_opcode_accept,
  };

struct _State_base
  {
  protected:
    _Opcode      _M_opcode;           // type of outgoing transition

public:
    _StateIdT    _M_next;             // outgoing transition
    union // Since they are mutually exclusive.
    {
      size_t _M_subexpr;        // for _S_opcode_subexpr_*
      size_t _M_backref_index;  // for _S_opcode_backref
      struct
      {
	// for _S_opcode_alternative, _S_opcode_repeat and
	// _S_opcode_subexpr_lookahead
	_StateIdT  _M_alt;
	// for _S_opcode_word_boundary or _S_opcode_subexpr_lookahead or
	// quantifiers (ungreedy if set true)
	bool       _M_neg;
      };
      // For _S_opcode_match
      __gnu_cxx::__aligned_membuf<_Matcher<char>> _M_matcher_storage;
    };

protected:
    explicit _State_base(_Opcode __opcode) noexcept
    : _M_opcode(__opcode), _M_next(_S_invalid_state_id)
    { }

public:
    bool
    _M_has_alt() const noexcept
    {
      return _M_opcode == _S_opcode_alternative
	|| _M_opcode == _S_opcode_repeat
	|| _M_opcode == _S_opcode_subexpr_lookahead;
    }

#ifdef _GLIBCXX_DEBUG
    std::ostream&
    _M_print(std::ostream& __ostr) const;

// Prints graphviz dot commands for state.
    std::ostream&
    _M_dot(std::ostream& __ostr, _StateIdT __id) const;
#endif
  };

template<typename _Char_type>
    struct _State : _State_base
    {
      typedef _Matcher<_Char_type> _MatcherT;
      static_assert(sizeof(_MatcherT) == sizeof(_Matcher<char>),
		    "std::function<bool(T)> has the same size as "
		    "std::function<bool(char)>");
      static_assert(alignof(_MatcherT) == alignof(_Matcher<char>),
		    "std::function<bool(T)> has the same alignment as "
		    "std::function<bool(char)>");

explicit
      _State(_Opcode __opcode) noexcept : _State_base(__opcode)
      {
	if (_M_opcode() == _S_opcode_match)
	  new (this->_M_matcher_storage._M_addr()) _MatcherT();
      }

_State(const _State& __rhs) : _State_base(__rhs)
      {
	if (__rhs._M_opcode() == _S_opcode_match)
	  new (this->_M_matcher_storage._M_addr())
	    _MatcherT(__rhs._M_get_matcher());
      }

_State(_State&& __rhs) noexcept : _State_base(__rhs)
      {
	if (__rhs._M_opcode() == _S_opcode_match)
	  new (this->_M_matcher_storage._M_addr())
	    _MatcherT(std::move(__rhs._M_get_matcher()));
      }

_State&
      operator=(const _State&) = delete;

~_State()
      {
	if (_M_opcode() == _S_opcode_match)
	  _M_get_matcher().~_MatcherT();
      }

// Since correct ctor and dtor rely on _M_opcode, it's better not to
      // change it over time.
      _Opcode
      _M_opcode() const noexcept
      { return _State_base::_M_opcode; }

bool
      _M_matches(_Char_type __char) const
      { return _M_get_matcher()(__char); }

_MatcherT&
      _M_get_matcher() noexcept
      { return *static_cast<_MatcherT*>(this->_M_matcher_storage._M_addr()); }

const _MatcherT&
      _M_get_matcher() const noexcept
      {
	return *static_cast<const _MatcherT*>(
	    this->_M_matcher_storage._M_addr());
      }
    };

struct _NFA_base
  {
    typedef regex_constants::syntax_option_type _FlagT;

explicit
    _NFA_base(_FlagT __f) noexcept
    : _M_flags(__f), _M_start_state(0), _M_subexpr_count(0),
    _M_has_backref(false)
    { }

_NFA_base(_NFA_base&&) = default;

protected:
    ~_NFA_base() = default;

public:
    _FlagT
    _M_options() const noexcept
    { return _M_flags; }

_StateIdT
    _M_start() const noexcept
    { return _M_start_state; }

size_t
    _M_sub_count() const noexcept
    { return _M_subexpr_count; }

_GLIBCXX_STD_C::vector<size_t> _M_paren_stack;
    _FlagT                    _M_flags;
    _StateIdT                 _M_start_state;
    size_t                    _M_subexpr_count;
    bool                      _M_has_backref;
  };

template<typename _TraitsT>
    struct _NFA
    : _NFA_base, _GLIBCXX_STD_C::vector<_State<typename _TraitsT::char_type>>
    {
      typedef typename _TraitsT::char_type	_Char_type;
      typedef _State<_Char_type>		_StateT;
      typedef _Matcher<_Char_type>		_MatcherT;

_NFA(const typename _TraitsT::locale_type& __loc, _FlagT __flags)
      : _NFA_base(__flags)
      { _M_traits.imbue(__loc); }

// for performance reasons _NFA objects should only be moved not copied
      _NFA(const _NFA&) = delete;
      _NFA(_NFA&&) = default;

_StateIdT
      _M_insert_accept()
      {
	auto __ret = _M_insert_state(_StateT(_S_opcode_accept));
	return __ret;
      }

_StateIdT
      _M_insert_alt(_StateIdT __next, _StateIdT __alt,
		    bool __neg __attribute__((__unused__)))
      {
	_StateT __tmp(_S_opcode_alternative);
	// It labels every quantifier to make greedy comparison easier in BFS
	// approach.
	__tmp._M_next = __next;
	__tmp._M_alt = __alt;
	return _M_insert_state(std::move(__tmp));
      }

_StateIdT
      _M_insert_repeat(_StateIdT __next, _StateIdT __alt, bool __neg)
      {
	_StateT __tmp(_S_opcode_repeat);
	// It labels every quantifier to make greedy comparison easier in BFS
	// approach.
	__tmp._M_next = __next;
	__tmp._M_alt = __alt;
	__tmp._M_neg = __neg;
	return _M_insert_state(std::move(__tmp));
      }

_StateIdT
      _M_insert_matcher(_MatcherT __m)
      {
	_StateT __tmp(_S_opcode_match);
	__tmp._M_get_matcher() = std::move(__m);
	return _M_insert_state(std::move(__tmp));
      }

_StateIdT
      _M_insert_subexpr_begin()
      {
	auto __id = this->_M_subexpr_count++;
	this->_M_paren_stack.push_back(__id);
	_StateT __tmp(_S_opcode_subexpr_begin);
	__tmp._M_subexpr = __id;
	return _M_insert_state(std::move(__tmp));
      }

_StateIdT
      _M_insert_subexpr_end()
      {
	_StateT __tmp(_S_opcode_subexpr_end);
	__tmp._M_subexpr = this->_M_paren_stack.back();
	this->_M_paren_stack.pop_back();
	return _M_insert_state(std::move(__tmp));
      }

_StateIdT
      _M_insert_backref(size_t __index);

_StateIdT
      _M_insert_line_begin()
      { return _M_insert_state(_StateT(_S_opcode_line_begin_assertion)); }

_StateIdT
      _M_insert_line_end()
      { return _M_insert_state(_StateT(_S_opcode_line_end_assertion)); }

_StateIdT
      _M_insert_word_bound(bool __neg)
      {
	_StateT __tmp(_S_opcode_word_boundary);
	__tmp._M_neg = __neg;
	return _M_insert_state(std::move(__tmp));
      }

_StateIdT
      _M_insert_lookahead(_StateIdT __alt, bool __neg)
      {
	_StateT __tmp(_S_opcode_subexpr_lookahead);
	__tmp._M_alt = __alt;
	__tmp._M_neg = __neg;
	return _M_insert_state(std::move(__tmp));
      }

_StateIdT
      _M_insert_dummy()
      { return _M_insert_state(_StateT(_S_opcode_dummy)); }

_StateIdT
      _M_insert_state(_StateT __s)
      {
	this->push_back(std::move(__s));
	if (this->size() > _GLIBCXX_REGEX_STATE_LIMIT)
	  __throw_regex_error(
	    regex_constants::error_space,
	    "Number of NFA states exceeds limit. Please use shorter regex "
	    "string, or use smaller brace expression, or make "
	    "_GLIBCXX_REGEX_STATE_LIMIT larger.");
	return this->size() - 1;
      }

// Eliminate dummy node in this NFA to make it compact.
      void
      _M_eliminate_dummy();

#ifdef _GLIBCXX_DEBUG
      std::ostream&
      _M_dot(std::ostream& __ostr) const;
#endif
    public:
      _TraitsT                  _M_traits;
    };

/// Describes a sequence of one or more %_State, its current start
  /// and end(s).  This structure contains fragments of an NFA during
  /// construction.
  template<typename _TraitsT>
    class _StateSeq
    {
    public:
      typedef _NFA<_TraitsT> _RegexT;

public:
      _StateSeq(_RegexT& __nfa, _StateIdT __s)
      : _M_nfa(__nfa), _M_start(__s), _M_end(__s)
      { }

_StateSeq(_RegexT& __nfa, _StateIdT __s, _StateIdT __end)
      : _M_nfa(__nfa), _M_start(__s), _M_end(__end)
      { }

// Append a state on *this and change *this to the new sequence.
      void
      _M_append(_StateIdT __id)
      {
	_M_nfa[_M_end]._M_next = __id;
	_M_end = __id;
      }

// Append a sequence on *this and change *this to the new sequence.
      void
      _M_append(const _StateSeq& __s)
      {
	_M_nfa[_M_end]._M_next = __s._M_start;
	_M_end = __s._M_end;
      }

// Clones an entire sequence.
      _StateSeq
      _M_clone();

public:
      _RegexT&  _M_nfa;
      _StateIdT _M_start;
      _StateIdT _M_end;
    };

///@} regex-detail
} // namespace __detail

_GLIBCXX_END_NAMESPACE_VERSION
} // namespace std

#include <bits/regex_automaton.tcc>