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) 2010-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_compiler.h
 *  This is an internal header file, included by other library headers.
 *  Do not attempt to use it directly. @headername{regex}
 */

namespace std _GLIBCXX_VISIBILITY(default)
{
_GLIBCXX_BEGIN_NAMESPACE_VERSION
_GLIBCXX_BEGIN_NAMESPACE_CXX11

template<typename>
    class regex_traits;

_GLIBCXX_END_NAMESPACE_CXX11

namespace __detail
{
  /**
   * @addtogroup regex-detail
   * @{
   */

template<typename, bool, bool>
    struct _BracketMatcher;

/**
   * @brief Builds an NFA from an input iterator range.
   *
   * The %_TraitsT type should fulfill requirements [28.3].
   */
  template<typename _TraitsT>
    class _Compiler
    {
    public:
      typedef typename _TraitsT::char_type        _CharT;
      typedef _NFA<_TraitsT>              	  _RegexT;
      typedef regex_constants::syntax_option_type _FlagT;

_Compiler(const _CharT* __b, const _CharT* __e,
		const typename _TraitsT::locale_type& __traits, _FlagT __flags);

shared_ptr<const _RegexT>
      _M_get_nfa() noexcept
      { return std::move(_M_nfa); }

private:
      typedef _Scanner<_CharT>               _ScannerT;
      typedef typename _TraitsT::string_type _StringT;
      typedef typename _ScannerT::_TokenT    _TokenT;
      typedef _StateSeq<_TraitsT>            _StateSeqT;
      typedef std::stack<_StateSeqT>         _StackT;
      typedef std::ctype<_CharT>             _CtypeT;

// accepts a specific token or returns false.
      bool
      _M_match_token(_TokenT __token);

void
      _M_disjunction();

void
      _M_alternative();

bool
      _M_term();

bool
      _M_assertion();

bool
      _M_quantifier();

bool
      _M_atom();

bool
      _M_bracket_expression();

template<bool __icase, bool __collate>
	void
	_M_insert_any_matcher_ecma();

template<bool __icase, bool __collate>
	void
	_M_insert_any_matcher_posix();

template<bool __icase, bool __collate>
	void
	_M_insert_char_matcher();

template<bool __icase, bool __collate>
	void
	_M_insert_character_class_matcher();

template<bool __icase, bool __collate>
	void
	_M_insert_bracket_matcher(bool __neg);

// Cache of the last atom seen in a bracketed range expression.
      struct _BracketState
      {
	enum class _Type : char { _None, _Char, _Class } _M_type = _Type::_None;
	_CharT _M_char = _CharT();

void
	set(_CharT __c) noexcept { _M_type = _Type::_Char; _M_char = __c; }

_GLIBCXX_NODISCARD _CharT
	get() const noexcept { return _M_char; }

void
	reset(_Type __t = _Type::_None) noexcept { _M_type = __t; }

explicit operator bool() const noexcept
	{ return _M_type != _Type::_None; }

// Previous token was a single character.
	_GLIBCXX_NODISCARD bool
	_M_is_char() const noexcept { return _M_type == _Type::_Char; }

// Previous token was a character class, equivalent class,
	// collating symbol etc.
	_GLIBCXX_NODISCARD bool
	_M_is_class() const noexcept { return _M_type == _Type::_Class; }
      };

template<bool __icase, bool __collate>
	using _BracketMatcher
	  = std::__detail::_BracketMatcher<_TraitsT, __icase, __collate>;

// Returns true if successfully parsed one term and should continue
      // compiling a bracket expression.
      // Returns false if the compiler should move on.
      template<bool __icase, bool __collate>
	bool
	_M_expression_term(_BracketState& __last_char,
			   _BracketMatcher<__icase, __collate>& __matcher);

int
      _M_cur_int_value(int __radix);

bool
      _M_try_char();

_StateSeqT
      _M_pop()
      {
	auto ret = _M_stack.top();
	_M_stack.pop();
	return ret;
      }

static _FlagT
      _S_validate(_FlagT __f)
      {
	using namespace regex_constants;
	switch (__f & (ECMAScript|basic|extended|awk|grep|egrep))
	  {
	  case ECMAScript:
	  case basic:
	  case extended:
	  case awk:
	  case grep:
	  case egrep:
	    return __f;
	  case _FlagT(0):
	    return __f | ECMAScript;
	  default:
	    std::__throw_regex_error(_S_grammar, "conflicting grammar options");
	  }
      }

_FlagT              _M_flags;
      _ScannerT           _M_scanner;
      shared_ptr<_RegexT> _M_nfa;
      _StringT            _M_value;
      _StackT             _M_stack;
      const _TraitsT&     _M_traits;
      const _CtypeT&      _M_ctype;
    };

// [28.13.14]
  template<typename _TraitsT, bool __icase, bool __collate>
    class _RegexTranslatorBase
    {
    public:
      typedef typename _TraitsT::char_type	      _CharT;
      typedef typename _TraitsT::string_type	      _StringT;
      typedef _StringT _StrTransT;

explicit
      _RegexTranslatorBase(const _TraitsT& __traits)
      : _M_traits(__traits)
      { }

_CharT
      _M_translate(_CharT __ch) const
      {
	if _GLIBCXX17_CONSTEXPR (__icase)
	  return _M_traits.translate_nocase(__ch);
	else if _GLIBCXX17_CONSTEXPR (__collate)
	  return _M_traits.translate(__ch);
	else
	  return __ch;
      }

_StrTransT
      _M_transform(_CharT __ch) const
      {
	_StrTransT __str(1, __ch);
	return _M_traits.transform(__str.begin(), __str.end());
      }

// See LWG 523. It's not efficiently implementable when _TraitsT is not
      // std::regex_traits<>, and __collate is true. See specializations for
      // implementations of other cases.
      bool
      _M_match_range(const _StrTransT& __first, const _StrTransT& __last,
		     const _StrTransT& __s) const
      { return __first <= __s && __s <= __last; }

protected:
      bool _M_in_range_icase(_CharT __first, _CharT __last, _CharT __ch) const
      {
	typedef std::ctype<_CharT> __ctype_type;
	const auto& __fctyp = use_facet<__ctype_type>(this->_M_traits.getloc());
	auto __lower = __fctyp.tolower(__ch);
	auto __upper = __fctyp.toupper(__ch);
	return (__first <= __lower && __lower <= __last)
	  || (__first <= __upper && __upper <= __last);
      }

const _TraitsT& _M_traits;
    };

template<typename _TraitsT, bool __icase, bool __collate>
    class _RegexTranslator
    : public _RegexTranslatorBase<_TraitsT, __icase, __collate>
    {
    public:
      typedef _RegexTranslatorBase<_TraitsT, __icase, __collate> _Base;
      using _Base::_Base;
    };

template<typename _TraitsT, bool __icase>
    class _RegexTranslator<_TraitsT, __icase, false>
    : public _RegexTranslatorBase<_TraitsT, __icase, false>
    {
    public:
      typedef _RegexTranslatorBase<_TraitsT, __icase, false> _Base;
      typedef typename _Base::_CharT _CharT;
      typedef _CharT _StrTransT;

using _Base::_Base;

_StrTransT
      _M_transform(_CharT __ch) const
      { return __ch; }

bool
      _M_match_range(_CharT __first, _CharT __last, _CharT __ch) const
      {
	if _GLIBCXX17_CONSTEXPR (!__icase)
	  return __first <= __ch && __ch <= __last;
	else
	  return this->_M_in_range_icase(__first, __last, __ch);
      }
    };

template<typename _CharType>
    class _RegexTranslator<std::regex_traits<_CharType>, true, true>
    : public _RegexTranslatorBase<std::regex_traits<_CharType>, true, true>
    {
    public:
      typedef _RegexTranslatorBase<std::regex_traits<_CharType>, true, true>
	_Base;
      typedef typename _Base::_CharT _CharT;
      typedef typename _Base::_StrTransT _StrTransT;

using _Base::_Base;

bool
      _M_match_range(const _StrTransT& __first, const _StrTransT& __last,
		     const _StrTransT& __str) const
      {
	__glibcxx_assert(__first.size() == 1);
	__glibcxx_assert(__last.size() == 1);
	__glibcxx_assert(__str.size() == 1);
	return this->_M_in_range_icase(__first[0], __last[0], __str[0]);
      }
    };

template<typename _TraitsT>
    class _RegexTranslator<_TraitsT, false, false>
    {
    public:
      typedef typename _TraitsT::char_type _CharT;
      typedef _CharT                       _StrTransT;

explicit
      _RegexTranslator(const _TraitsT&)
      { }

_CharT
      _M_translate(_CharT __ch) const
      { return __ch; }

_StrTransT
      _M_transform(_CharT __ch) const
      { return __ch; }

bool
      _M_match_range(_CharT __first, _CharT __last, _CharT __ch) const
      { return __first <= __ch && __ch <= __last; }
    };

template<typename _TraitsT, bool __is_ecma, bool __icase, bool __collate>
    struct _AnyMatcher;

template<typename _TraitsT, bool __icase, bool __collate>
    struct _AnyMatcher<_TraitsT, false, __icase, __collate>
    {
      typedef _RegexTranslator<_TraitsT, __icase, __collate> _TransT;
      typedef typename _TransT::_CharT                       _CharT;

explicit
      _AnyMatcher(const _TraitsT& __traits)
      : _M_translator(__traits)
      { }

bool
      operator()(_CharT __ch) const
      {
	static auto __nul = _M_translator._M_translate('\0');
	return _M_translator._M_translate(__ch) != __nul;
      }

_TransT _M_translator;
    };

template<typename _TraitsT, bool __icase, bool __collate>
    struct _AnyMatcher<_TraitsT, true, __icase, __collate>
    {
      typedef _RegexTranslator<_TraitsT, __icase, __collate> _TransT;
      typedef typename _TransT::_CharT                       _CharT;

explicit
      _AnyMatcher(const _TraitsT& __traits)
      : _M_translator(__traits)
      { }

bool
      operator()(_CharT __ch) const
      { return _M_apply(__ch, typename is_same<_CharT, char>::type()); }

bool
      _M_apply(_CharT __ch, true_type) const
      {
	auto __c = _M_translator._M_translate(__ch);
	auto __n = _M_translator._M_translate('\n');
	auto __r = _M_translator._M_translate('\r');
	return __c != __n && __c != __r;
      }

bool
      _M_apply(_CharT __ch, false_type) const
      {
	auto __c = _M_translator._M_translate(__ch);
	auto __n = _M_translator._M_translate('\n');
	auto __r = _M_translator._M_translate('\r');
	auto __u2028 = _M_translator._M_translate(u'\u2028');
	auto __u2029 = _M_translator._M_translate(u'\u2029');
	return __c != __n && __c != __r && __c != __u2028 && __c != __u2029;
      }

_TransT _M_translator;
    };

template<typename _TraitsT, bool __icase, bool __collate>
    struct _CharMatcher
    {
      typedef _RegexTranslator<_TraitsT, __icase, __collate> _TransT;
      typedef typename _TransT::_CharT                       _CharT;

_CharMatcher(_CharT __ch, const _TraitsT& __traits)
      : _M_translator(__traits), _M_ch(_M_translator._M_translate(__ch))
      { }

bool
      operator()(_CharT __ch) const
      { return _M_ch == _M_translator._M_translate(__ch); }

_TransT _M_translator;
      _CharT  _M_ch;
    };

/// Matches a character range (bracket expression)
  template<typename _TraitsT, bool __icase, bool __collate>
    struct _BracketMatcher
    {
    public:
      typedef _RegexTranslator<_TraitsT, __icase, __collate> _TransT;
      typedef typename _TransT::_CharT                       _CharT;
      typedef typename _TransT::_StrTransT                   _StrTransT;
      typedef typename _TraitsT::string_type                 _StringT;
      typedef typename _TraitsT::char_class_type             _CharClassT;

public:
      _BracketMatcher(bool __is_non_matching,
		      const _TraitsT& __traits)
      : _M_class_set(0), _M_translator(__traits), _M_traits(__traits),
      _M_is_non_matching(__is_non_matching)
      { }

bool
      operator()(_CharT __ch) const
      {
	_GLIBCXX_DEBUG_ASSERT(_M_is_ready);
	return _M_apply(__ch, _UseCache());
      }

void
      _M_add_char(_CharT __c)
      {
	_M_char_set.push_back(_M_translator._M_translate(__c));
	_GLIBCXX_DEBUG_ONLY(_M_is_ready = false);
      }

_StringT
      _M_add_collate_element(const _StringT& __s)
      {
	auto __st = _M_traits.lookup_collatename(__s.data(),
						 __s.data() + __s.size());
	if (__st.empty())
	  __throw_regex_error(regex_constants::error_collate,
			      "Invalid collate element.");
	_M_char_set.push_back(_M_translator._M_translate(__st[0]));
	_GLIBCXX_DEBUG_ONLY(_M_is_ready = false);
	return __st;
      }

void
      _M_add_equivalence_class(const _StringT& __s)
      {
	auto __st = _M_traits.lookup_collatename(__s.data(),
						 __s.data() + __s.size());
	if (__st.empty())
	  __throw_regex_error(regex_constants::error_collate,
			      "Invalid equivalence class.");
	__st = _M_traits.transform_primary(__st.data(),
					   __st.data() + __st.size());
	_M_equiv_set.push_back(__st);
	_GLIBCXX_DEBUG_ONLY(_M_is_ready = false);
      }

// __neg should be true for \D, \S and \W only.
      void
      _M_add_character_class(const _StringT& __s, bool __neg)
      {
	auto __mask = _M_traits.lookup_classname(__s.data(),
						 __s.data() + __s.size(),
						 __icase);
	if (__mask == 0)
	  __throw_regex_error(regex_constants::error_collate,
			      "Invalid character class.");
	if (!__neg)
	  _M_class_set |= __mask;
	else
	  _M_neg_class_set.push_back(__mask);
	_GLIBCXX_DEBUG_ONLY(_M_is_ready = false);
      }

void
      _M_make_range(_CharT __l, _CharT __r)
      {
	if (__l > __r)
	  __throw_regex_error(regex_constants::error_range,
			      "Invalid range in bracket expression.");
	_M_range_set.push_back(make_pair(_M_translator._M_transform(__l),
					 _M_translator._M_transform(__r)));
	_GLIBCXX_DEBUG_ONLY(_M_is_ready = false);
      }

void
      _M_ready()
      {
	std::sort(_M_char_set.begin(), _M_char_set.end());
	auto __end = std::unique(_M_char_set.begin(), _M_char_set.end());
	_M_char_set.erase(__end, _M_char_set.end());
	_M_make_cache(_UseCache());
	_GLIBCXX_DEBUG_ONLY(_M_is_ready = true);
      }

private:
      // Currently we only use the cache for char
      using _UseCache = typename std::is_same<_CharT, char>::type;

static constexpr size_t
      _S_cache_size =
	1ul << (sizeof(_CharT) * __CHAR_BIT__ * int(_UseCache::value));

struct _Dummy { };
      using _CacheT = std::__conditional_t<_UseCache::value,
					   std::bitset<_S_cache_size>,
					   _Dummy>;
      using _UnsignedCharT = typename std::make_unsigned<_CharT>::type;

bool
      _M_apply(_CharT __ch, false_type) const;

bool
      _M_apply(_CharT __ch, true_type) const
      { return _M_cache[static_cast<_UnsignedCharT>(__ch)]; }

void
      _M_make_cache(true_type)
      {
	for (unsigned __i = 0; __i < _M_cache.size(); __i++)
	  _M_cache[__i] = _M_apply(static_cast<_CharT>(__i), false_type());
      }

void
      _M_make_cache(false_type)
      { }

private:
      _GLIBCXX_STD_C::vector<_CharT>            _M_char_set;
      _GLIBCXX_STD_C::vector<_StringT>          _M_equiv_set;
      _GLIBCXX_STD_C::vector<pair<_StrTransT, _StrTransT>> _M_range_set;
      _GLIBCXX_STD_C::vector<_CharClassT>       _M_neg_class_set;
      _CharClassT                               _M_class_set;
      _TransT                                   _M_translator;
      const _TraitsT&                           _M_traits;
      bool                                      _M_is_non_matching;
      _CacheT					_M_cache;
#ifdef _GLIBCXX_DEBUG
      bool                                      _M_is_ready = false;
#endif
    };

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

#include <bits/regex_compiler.tcc>