Gecko [ v99win.today ]

Name	Size	Permission
algorithmfwd.h	23.97 KB	-rw-r--r--
align.h	3.62 KB	-rw-r--r--
alloc_traits.h	26.98 KB	-rw-r--r--
allocated_ptr.h	3.25 KB	-rw-r--r--
allocator.h	9.51 KB	-rw-r--r--
atomic_base.h	56.07 KB	-rw-r--r--
atomic_futex.h	12.1 KB	-rw-r--r--
atomic_lockfree_defines.h	2.3 KB	-rw-r--r--
atomic_timed_wait.h	13.21 KB	-rw-r--r--
atomic_wait.h	12.26 KB	-rw-r--r--
basic_ios.h	15.7 KB	-rw-r--r--
basic_ios.tcc	5.94 KB	-rw-r--r--
basic_string.h	246.04 KB	-rw-r--r--
basic_string.tcc	52.92 KB	-rw-r--r--
boost_concept_check.h	26.54 KB	-rw-r--r--
c++0x_warning.h	1.44 KB	-rw-r--r--
char_traits.h	28.66 KB	-rw-r--r--
charconv.h	3.35 KB	-rw-r--r--
codecvt.h	24.9 KB	-rw-r--r--
concept_check.h	3.34 KB	-rw-r--r--
cpp_type_traits.h	13.67 KB	-rw-r--r--
cxxabi_forced.h	1.77 KB	-rw-r--r--
cxxabi_init_exception.h	2.17 KB	-rw-r--r--
deque.tcc	41.37 KB	-rw-r--r--
enable_special_members.h	12.16 KB	-rw-r--r--
erase_if.h	2.02 KB	-rw-r--r--
exception.h	2.45 KB	-rw-r--r--
exception_defines.h	1.61 KB	-rw-r--r--
exception_ptr.h	7.46 KB	-rw-r--r--
forward_list.h	49.21 KB	-rw-r--r--
forward_list.tcc	13.71 KB	-rw-r--r--
fs_dir.h	16.02 KB	-rw-r--r--
fs_fwd.h	10.52 KB	-rw-r--r--
fs_ops.h	10.49 KB	-rw-r--r--
fs_path.h	38.81 KB	-rw-r--r--
fstream.tcc	32.88 KB	-rw-r--r--
functexcept.h	3.43 KB	-rw-r--r--
functional_hash.h	8.39 KB	-rw-r--r--
gslice.h	5.39 KB	-rw-r--r--
gslice_array.h	7.71 KB	-rw-r--r--
hash_bytes.h	2.1 KB	-rw-r--r--
hashtable.h	82.96 KB	-rw-r--r--
hashtable_policy.h	60.7 KB	-rw-r--r--
indirect_array.h	7.72 KB	-rw-r--r--
invoke.h	5.92 KB	-rw-r--r--
ios_base.h	31.19 KB	-rw-r--r--
istream.tcc	30.85 KB	-rw-r--r--
iterator_concepts.h	32.55 KB	-rw-r--r--
list.tcc	16.8 KB	-rw-r--r--
locale_classes.h	24.46 KB	-rw-r--r--
locale_classes.tcc	8.18 KB	-rw-r--r--
locale_conv.h	18.38 KB	-rw-r--r--
locale_facets.h	91.46 KB	-rw-r--r--
locale_facets.tcc	39.51 KB	-rw-r--r--
locale_facets_nonio.h	68.07 KB	-rw-r--r--
locale_facets_nonio.tcc	46.42 KB	-rw-r--r--
localefwd.h	5.8 KB	-rw-r--r--
mask_array.h	7.54 KB	-rw-r--r--
max_size_type.h	22.18 KB	-rw-r--r--
memoryfwd.h	2.45 KB	-rw-r--r--
move.h	6.64 KB	-rw-r--r--
nested_exception.h	4.77 KB	-rw-r--r--
node_handle.h	10.66 KB	-rw-r--r--
ostream.tcc	12.03 KB	-rw-r--r--
ostream_insert.h	3.94 KB	-rw-r--r--
parse_numbers.h	7.79 KB	-rw-r--r--
postypes.h	8.27 KB	-rw-r--r--
predefined_ops.h	9.94 KB	-rw-r--r--
ptr_traits.h	6.55 KB	-rw-r--r--
quoted_string.h	4.93 KB	-rw-r--r--
random.h	174.18 KB	-rw-r--r--
random.tcc	103.21 KB	-rw-r--r--
range_access.h	10.46 KB	-rw-r--r--
ranges_algo.h	114.09 KB	-rw-r--r--
ranges_algobase.h	18.43 KB	-rw-r--r--
ranges_base.h	23.82 KB	-rw-r--r--
ranges_cmp.h	5.88 KB	-rw-r--r--
ranges_uninitialized.h	17.71 KB	-rw-r--r--
ranges_util.h	20.11 KB	-rw-r--r--
refwrap.h	12.9 KB	-rw-r--r--
regex.h	101.53 KB	-rw-r--r--
regex.tcc	16.11 KB	-rw-r--r--
regex_automaton.h	10.54 KB	-rw-r--r--
regex_automaton.tcc	7.54 KB	-rw-r--r--
regex_compiler.h	15.84 KB	-rw-r--r--
regex_compiler.tcc	18.71 KB	-rw-r--r--
regex_constants.h	15.18 KB	-rw-r--r--
regex_error.h	4.9 KB	-rw-r--r--
regex_executor.h	8.64 KB	-rw-r--r--
regex_executor.tcc	18.4 KB	-rw-r--r--
regex_scanner.h	6.88 KB	-rw-r--r--
regex_scanner.tcc	14.89 KB	-rw-r--r--
semaphore_base.h	7.75 KB	-rw-r--r--
shared_ptr.h	30.25 KB	-rw-r--r--
shared_ptr_atomic.h	9.64 KB	-rw-r--r--
shared_ptr_base.h	53.62 KB	-rw-r--r--
slice_array.h	9.39 KB	-rw-r--r--
specfun.h	46.13 KB	-rw-r--r--
sstream.tcc	9.91 KB	-rw-r--r--
std_abs.h	3.3 KB	-rw-r--r--
std_function.h	22.33 KB	-rw-r--r--
std_mutex.h	6.29 KB	-rw-r--r--
std_thread.h	8.39 KB	-rw-r--r--
stl_algo.h	209.67 KB	-rw-r--r--
stl_algobase.h	74.47 KB	-rw-r--r--
stl_bvector.h	34.74 KB	-rw-r--r--
stl_construct.h	8.59 KB	-rw-r--r--
stl_deque.h	75.17 KB	-rw-r--r--
stl_function.h	42.87 KB	-rw-r--r--
stl_heap.h	20.27 KB	-rw-r--r--
stl_iterator.h	77 KB	-rw-r--r--
stl_iterator_base_funcs.h	7.99 KB	-rw-r--r--
stl_iterator_base_types.h	9.44 KB	-rw-r--r--
stl_list.h	68.14 KB	-rw-r--r--
stl_map.h	53.41 KB	-rw-r--r--
stl_multimap.h	42.51 KB	-rw-r--r--
stl_multiset.h	36.79 KB	-rw-r--r--
stl_numeric.h	14.26 KB	-rw-r--r--
stl_pair.h	19.66 KB	-rw-r--r--
stl_queue.h	24.45 KB	-rw-r--r--
stl_raw_storage_iter.h	3.74 KB	-rw-r--r--
stl_relops.h	4.49 KB	-rw-r--r--
stl_set.h	37.05 KB	-rw-r--r--
stl_stack.h	12.39 KB	-rw-r--r--
stl_tempbuf.h	8.45 KB	-rw-r--r--
stl_tree.h	72.19 KB	-rw-r--r--
stl_uninitialized.h	33.22 KB	-rw-r--r--
stl_vector.h	64.37 KB	-rw-r--r--
stream_iterator.h	7.52 KB	-rw-r--r--
streambuf.tcc	4.81 KB	-rw-r--r--
streambuf_iterator.h	15.17 KB	-rw-r--r--
string_view.tcc	7 KB	-rw-r--r--
stringfwd.h	2.63 KB	-rw-r--r--
this_thread_sleep.h	3.23 KB	-rw-r--r--
uniform_int_dist.h	12.75 KB	-rw-r--r--
unique_lock.h	6 KB	-rw-r--r--
unique_ptr.h	31.77 KB	-rw-r--r--
unordered_map.h	74.87 KB	-rw-r--r--
unordered_set.h	61.46 KB	-rw-r--r--
uses_allocator.h	6.74 KB	-rw-r--r--
uses_allocator_args.h	7.38 KB	-rw-r--r--
valarray_after.h	22.74 KB	-rw-r--r--
valarray_array.h	20.8 KB	-rw-r--r--
valarray_array.tcc	7.08 KB	-rw-r--r--
valarray_before.h	18.69 KB	-rw-r--r--
vector.tcc	30.26 KB	-rw-r--r--

Code Editor : regex_executor.h

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

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

// FIXME convert comments to doxygen format.

namespace std _GLIBCXX_VISIBILITY(default)
{
_GLIBCXX_BEGIN_NAMESPACE_VERSION

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

/**
   * @brief Takes a regex and an input string and does the matching.
   *
   * The %_Executor class has two modes: DFS mode and BFS mode, controlled
   * by the template parameter %__dfs_mode.
   */
  template<typename _BiIter, typename _Alloc, typename _TraitsT,
	   bool __dfs_mode>
    class _Executor
    {
      using __search_mode = integral_constant<bool, __dfs_mode>;
      using __dfs = true_type;
      using __bfs = false_type;

enum class _Match_mode : unsigned char { _Exact, _Prefix };

public:
      typedef typename iterator_traits<_BiIter>::value_type _CharT;
      typedef basic_regex<_CharT, _TraitsT>                 _RegexT;
      typedef std::vector<sub_match<_BiIter>, _Alloc>       _ResultsVec;
      typedef regex_constants::match_flag_type              _FlagT;
      typedef typename _TraitsT::char_class_type            _ClassT;
      typedef _NFA<_TraitsT>                                _NFAT;

public:
      _Executor(_BiIter         __begin,
		_BiIter         __end,
		_ResultsVec&    __results,
		const _RegexT&  __re,
		_FlagT          __flags)
      : _M_begin(__begin),
      _M_end(__end),
      _M_re(__re),
      _M_nfa(*__re._M_automaton),
      _M_results(__results),
      _M_rep_count(_M_nfa.size()),
      _M_states(_M_nfa._M_start(), _M_nfa.size()),
      _M_flags(__flags)
      {
	using namespace regex_constants;
	if (__flags & match_prev_avail) // ignore not_bol and not_bow
	  _M_flags &= ~(match_not_bol | match_not_bow);
      }

// Set matched when string exactly matches the pattern.
      bool
      _M_match()
      {
	_M_current = _M_begin;
	return _M_main(_Match_mode::_Exact);
      }

// Set matched when some prefix of the string matches the pattern.
      bool
      _M_search_from_first()
      {
	_M_current = _M_begin;
	return _M_main(_Match_mode::_Prefix);
      }

bool
      _M_search();

private:
      void
      _M_rep_once_more(_Match_mode __match_mode, _StateIdT);

void
      _M_handle_repeat(_Match_mode, _StateIdT);

void
      _M_handle_subexpr_begin(_Match_mode, _StateIdT);

void
      _M_handle_subexpr_end(_Match_mode, _StateIdT);

void
      _M_handle_line_begin_assertion(_Match_mode, _StateIdT);

void
      _M_handle_line_end_assertion(_Match_mode, _StateIdT);

void
      _M_handle_word_boundary(_Match_mode, _StateIdT);

void
      _M_handle_subexpr_lookahead(_Match_mode, _StateIdT);

void
      _M_handle_match(_Match_mode, _StateIdT);

void
      _M_handle_backref(_Match_mode, _StateIdT);

void
      _M_handle_accept(_Match_mode, _StateIdT);

void
      _M_handle_alternative(_Match_mode, _StateIdT);

void
      _M_dfs(_Match_mode __match_mode, _StateIdT __start);

bool
      _M_main(_Match_mode __match_mode)
      { return _M_main_dispatch(__match_mode, __search_mode{}); }

bool
      _M_main_dispatch(_Match_mode __match_mode, __dfs);

bool
      _M_main_dispatch(_Match_mode __match_mode, __bfs);

bool
      _M_is_word(_CharT __ch) const
      {
	static const _CharT __s[2] = { 'w' };
	return _M_re._M_automaton->_M_traits.isctype
	  (__ch, _M_re._M_automaton->_M_traits.lookup_classname(__s, __s+1));
      }

bool
      _M_at_begin() const
      {
	if (_M_current == _M_begin)
	  {
	    // match_not_bol means ^ does not match [_M_begin,_M_begin)
	    if (_M_flags & regex_constants::match_not_bol)
	      return false;
	    // match_prev_avail means _M_begin is not the start of the input.
	    if (_M_flags & regex_constants::match_prev_avail)
	      {
		// For ECMAScript multiline matches, check if the previous
		// character is a line terminator.
		if (_M_match_multiline())
		  return _M_is_line_terminator(*std::prev(_M_current));
		else
		  return false;
	      }
	    else // ^ matches at _M_begin
	      return true;
	  }
	else if (_M_match_multiline())
	  return _M_is_line_terminator(*std::prev(_M_current));
	else
	  return false;
      }

bool
      _M_at_end() const
      {
	if (_M_current == _M_end)
	  return !(_M_flags & regex_constants::match_not_eol);
	else if (_M_match_multiline())
	  return _M_is_line_terminator(*_M_current);
	else
	  return false;
      }

bool
      _M_word_boundary() const;

bool
      _M_lookahead(_StateIdT __next);

bool
      _M_is_line_terminator(_CharT __c) const
      {
	const auto& __traits = _M_re._M_automaton->_M_traits;
	const auto& __ct = use_facet<ctype<_CharT>>(__traits.getloc());
	const char __n{ __ct.narrow(__c, ' ') };
	if (__n == '\n')
	  return true;
	if (_M_re._M_automaton->_M_options() & regex_constants::ECMAScript)
	  {
	    if (__n == '\r')
	      return true;
	    // FIXME: U+2028 (line separator) and U+2029 (paragraph separator)
	  }
	return false;
      }

bool
      _M_match_multiline() const noexcept
      {
	constexpr auto __m
	  = regex_constants::ECMAScript | regex_constants::__multiline;
	return (_M_re._M_automaton->_M_options() & __m) == __m;
      }

// Holds additional information used in BFS-mode.
      template<typename _SearchMode, typename _ResultsVec>
	struct _State_info;

template<typename _ResultsVec>
	struct _State_info<__bfs, _ResultsVec>
	{
	  explicit
	  _State_info(_StateIdT __start, size_t __n)
	  : _M_visited_states(new bool[__n]()), _M_start(__start)
	  { }

bool _M_visited(_StateIdT __i)
	  {
	    if (_M_visited_states[__i])
	      return true;
	    _M_visited_states[__i] = true;
	    return false;
	  }

void _M_queue(_StateIdT __i, const _ResultsVec& __res)
	  { _M_match_queue.emplace_back(__i, __res); }

// Dummy implementations for BFS mode.
	  _BiIter* _M_get_sol_pos() { return nullptr; }

// Saves states that need to be considered for the next character.
	  vector<pair<_StateIdT, _ResultsVec>>	_M_match_queue;
	  // Indicates which states are already visited.
	  unique_ptr<bool[]>			_M_visited_states;
	  // To record current solution.
	  _StateIdT _M_start;
	};

template<typename _ResultsVec>
	struct _State_info<__dfs, _ResultsVec>
	{
	  explicit
	  _State_info(_StateIdT __start, size_t) : _M_start(__start)
	  { }

// Dummy implementations for DFS mode.
	  bool _M_visited(_StateIdT) const { return false; }
	  void _M_queue(_StateIdT, const _ResultsVec&) { }

_BiIter* _M_get_sol_pos() { return &_M_sol_pos; }

// To record current solution.
	  _StateIdT _M_start;
	  _BiIter   _M_sol_pos;
	};

public:
      _ResultsVec                                           _M_cur_results;
      _BiIter                                               _M_current;
      _BiIter                                               _M_begin;
      const _BiIter                                         _M_end;
      const _RegexT&                                        _M_re;
      const _NFAT&                                          _M_nfa;
      _ResultsVec&                                          _M_results;
      vector<pair<_BiIter, int>>                            _M_rep_count;
      _State_info<__search_mode, _ResultsVec>		    _M_states;
      _FlagT                                                _M_flags;
      // Do we have a solution so far?
      bool                                                  _M_has_sol;
    };

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

#include <bits/regex_executor.tcc>

${this.title}

Code Editor : regex_executor.h