Gecko [ www.jdcpatala.org ]

Name	Size	Permission
algorithmfwd.h	21.23 KB	-rw-r--r--
alloc_traits.h	20.98 KB	-rw-r--r--
allocated_ptr.h	3.22 KB	-rw-r--r--
allocator.h	7.76 KB	-rw-r--r--
atomic_base.h	24.41 KB	-rw-r--r--
atomic_futex.h	9.28 KB	-rw-r--r--
atomic_lockfree_defines.h	2.3 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	241.28 KB	-rw-r--r--
basic_string.tcc	52.63 KB	-rw-r--r--
boost_concept_check.h	26.52 KB	-rw-r--r--
c++0x_warning.h	1.44 KB	-rw-r--r--
char_traits.h	24.25 KB	-rw-r--r--
codecvt.h	24.83 KB	-rw-r--r--
concept_check.h	3.34 KB	-rw-r--r--
cpp_type_traits.h	9.71 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	33.6 KB	-rw-r--r--
enable_special_members.h	12.1 KB	-rw-r--r--
erase_if.h	1.99 KB	-rw-r--r--
exception.h	2.43 KB	-rw-r--r--
exception_defines.h	1.61 KB	-rw-r--r--
exception_ptr.h	5.84 KB	-rw-r--r--
forward_list.h	48.25 KB	-rw-r--r--
forward_list.tcc	13.55 KB	-rw-r--r--
fs_dir.h	14.81 KB	-rw-r--r--
fs_fwd.h	11.41 KB	-rw-r--r--
fs_ops.h	9.5 KB	-rw-r--r--
fs_path.h	36.09 KB	-rw-r--r--
fstream.tcc	32.87 KB	-rw-r--r--
functexcept.h	3.35 KB	-rw-r--r--
functional_hash.h	8.37 KB	-rw-r--r--
gslice.h	5.39 KB	-rw-r--r--
gslice_array.h	7.67 KB	-rw-r--r--
hash_bytes.h	2.1 KB	-rw-r--r--
hashtable.h	73.06 KB	-rw-r--r--
hashtable_policy.h	66.51 KB	-rw-r--r--
indirect_array.h	7.68 KB	-rw-r--r--
invoke.h	3.57 KB	-rw-r--r--
ios_base.h	30.7 KB	-rw-r--r--
istream.tcc	30.36 KB	-rw-r--r--
list.tcc	16.57 KB	-rw-r--r--
locale_classes.h	24.32 KB	-rw-r--r--
locale_classes.tcc	8.18 KB	-rw-r--r--
locale_conv.h	18.36 KB	-rw-r--r--
locale_facets.h	90.17 KB	-rw-r--r--
locale_facets.tcc	38.62 KB	-rw-r--r--
locale_facets_nonio.h	67.38 KB	-rw-r--r--
locale_facets_nonio.tcc	44.22 KB	-rw-r--r--
localefwd.h	5.8 KB	-rw-r--r--
mask_array.h	7.5 KB	-rw-r--r--
memoryfwd.h	2.4 KB	-rw-r--r--
move.h	6.38 KB	-rw-r--r--
nested_exception.h	4.69 KB	-rw-r--r--
node_handle.h	8.02 KB	-rw-r--r--
ostream.tcc	12.03 KB	-rw-r--r--
ostream_insert.h	3.91 KB	-rw-r--r--
parse_numbers.h	7.76 KB	-rw-r--r--
postypes.h	8.27 KB	-rw-r--r--
predefined_ops.h	8.87 KB	-rw-r--r--
ptr_traits.h	6.57 KB	-rw-r--r--
quoted_string.h	4.93 KB	-rw-r--r--
random.h	173.87 KB	-rw-r--r--
random.tcc	103.14 KB	-rw-r--r--
range_access.h	9.85 KB	-rw-r--r--
refwrap.h	12.62 KB	-rw-r--r--
regex.h	96.39 KB	-rw-r--r--
regex.tcc	16.19 KB	-rw-r--r--
regex_automaton.h	10.49 KB	-rw-r--r--
regex_automaton.tcc	7.54 KB	-rw-r--r--
regex_compiler.h	16.1 KB	-rw-r--r--
regex_compiler.tcc	18.49 KB	-rw-r--r--
regex_constants.h	14.36 KB	-rw-r--r--
regex_error.h	4.79 KB	-rw-r--r--
regex_executor.h	7.31 KB	-rw-r--r--
regex_executor.tcc	18.4 KB	-rw-r--r--
regex_scanner.h	6.92 KB	-rw-r--r--
regex_scanner.tcc	14.66 KB	-rw-r--r--
shared_ptr.h	23.65 KB	-rw-r--r--
shared_ptr_atomic.h	9.55 KB	-rw-r--r--
shared_ptr_base.h	52.51 KB	-rw-r--r--
slice_array.h	9.21 KB	-rw-r--r--
specfun.h	45.95 KB	-rw-r--r--
sstream.tcc	9.9 KB	-rw-r--r--
std_abs.h	3.3 KB	-rw-r--r--
std_function.h	23.01 KB	-rw-r--r--
std_mutex.h	4.66 KB	-rw-r--r--
stl_algo.h	210.37 KB	-rw-r--r--
stl_algobase.h	50.21 KB	-rw-r--r--
stl_bvector.h	33.09 KB	-rw-r--r--
stl_construct.h	7.22 KB	-rw-r--r--
stl_deque.h	78.24 KB	-rw-r--r--
stl_function.h	41.3 KB	-rw-r--r--
stl_heap.h	19.73 KB	-rw-r--r--
stl_iterator.h	41.75 KB	-rw-r--r--
stl_iterator_base_funcs.h	7.99 KB	-rw-r--r--
stl_iterator_base_types.h	8.48 KB	-rw-r--r--
stl_list.h	66.22 KB	-rw-r--r--
stl_map.h	52.24 KB	-rw-r--r--
stl_multimap.h	41.25 KB	-rw-r--r--
stl_multiset.h	35.63 KB	-rw-r--r--
stl_numeric.h	14.04 KB	-rw-r--r--
stl_pair.h	18.21 KB	-rw-r--r--
stl_queue.h	24 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	35.93 KB	-rw-r--r--
stl_stack.h	11.94 KB	-rw-r--r--
stl_tempbuf.h	8.09 KB	-rw-r--r--
stl_tree.h	73.26 KB	-rw-r--r--
stl_uninitialized.h	30.72 KB	-rw-r--r--
stl_vector.h	63.45 KB	-rw-r--r--
stream_iterator.h	6.71 KB	-rw-r--r--
streambuf.tcc	4.81 KB	-rw-r--r--
streambuf_iterator.h	13.56 KB	-rw-r--r--
string_view.tcc	6.54 KB	-rw-r--r--
stringfwd.h	2.63 KB	-rw-r--r--
uniform_int_dist.h	10.01 KB	-rw-r--r--
unique_lock.h	5.96 KB	-rw-r--r--
unique_ptr.h	26.92 KB	-rw-r--r--
unordered_map.h	75.08 KB	-rw-r--r--
unordered_set.h	59.25 KB	-rw-r--r--
uses_allocator.h	6.66 KB	-rw-r--r--
valarray_after.h	22.3 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.15 KB	-rw-r--r--

Code Editor : regex_automaton.tcc

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

// Copyright (C) 2013-2019 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.tcc
 *  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

namespace __detail
{
#ifdef _GLIBCXX_DEBUG
  inline std::ostream&
  _State_base::_M_print(std::ostream& ostr) const
  {
    switch (_M_opcode)
    {
      case _S_opcode_alternative:
      case _S_opcode_repeat:
	ostr << "alt next=" << _M_next << " alt=" << _M_alt;
	break;
      case _S_opcode_subexpr_begin:
	ostr << "subexpr begin next=" << _M_next << " index=" << _M_subexpr;
	break;
      case _S_opcode_subexpr_end:
	ostr << "subexpr end next=" << _M_next << " index=" << _M_subexpr;
	break;
      case _S_opcode_backref:
	ostr << "backref next=" << _M_next << " index=" << _M_backref_index;
	break;
      case _S_opcode_match:
	ostr << "match next=" << _M_next;
	break;
      case _S_opcode_accept:
	ostr << "accept next=" << _M_next;
	break;
      default:
	ostr << "unknown next=" << _M_next;
	break;
    }
    return ostr;
  }

// Prints graphviz dot commands for state.
  inline std::ostream&
  _State_base::_M_dot(std::ostream& __ostr, _StateIdT __id) const
  {
    switch (_M_opcode)
    {
      case _S_opcode_alternative:
      case _S_opcode_repeat:
	__ostr << __id << " [label=\"" << __id << "\\nALT\"];\n"
	       << __id << " -> " << _M_next
	       << " [label=\"next\", tailport=\"s\"];\n"
	       << __id << " -> " << _M_alt
	       << " [label=\"alt\", tailport=\"n\"];\n";
	break;
      case _S_opcode_backref:
	__ostr << __id << " [label=\"" << __id << "\\nBACKREF "
	       << _M_subexpr << "\"];\n"
	       << __id << " -> " << _M_next << " [label=\"<match>\"];\n";
	break;
      case _S_opcode_line_begin_assertion:
	__ostr << __id << " [label=\"" << __id << "\\nLINE_BEGIN \"];\n"
	       << __id << " -> " << _M_next << " [label=\"epsilon\"];\n";
	break;
      case _S_opcode_line_end_assertion:
	__ostr << __id << " [label=\"" << __id << "\\nLINE_END \"];\n"
	       << __id << " -> " << _M_next << " [label=\"epsilon\"];\n";
	break;
      case _S_opcode_word_boundary:
	__ostr << __id << " [label=\"" << __id << "\\nWORD_BOUNDRY "
	       << _M_neg << "\"];\n"
	       << __id << " -> " << _M_next << " [label=\"epsilon\"];\n";
	break;
      case _S_opcode_subexpr_lookahead:
	__ostr << __id << " [label=\"" << __id << "\\nLOOK_AHEAD\"];\n"
	       << __id << " -> " << _M_next
	       << " [label=\"epsilon\", tailport=\"s\"];\n"
	       << __id << " -> " << _M_alt
	       << " [label=\"<assert>\", tailport=\"n\"];\n";
	break;
      case _S_opcode_subexpr_begin:
	__ostr << __id << " [label=\"" << __id << "\\nSBEGIN "
	       << _M_subexpr << "\"];\n"
	       << __id << " -> " << _M_next << " [label=\"epsilon\"];\n";
	break;
      case _S_opcode_subexpr_end:
	__ostr << __id << " [label=\"" << __id << "\\nSEND "
	       << _M_subexpr << "\"];\n"
	       << __id << " -> " << _M_next << " [label=\"epsilon\"];\n";
	break;
      case _S_opcode_dummy:
	break;
      case _S_opcode_match:
	__ostr << __id << " [label=\"" << __id << "\\nMATCH\"];\n"
	       << __id << " -> " << _M_next << " [label=\"<match>\"];\n";
	break;
      case _S_opcode_accept:
	__ostr << __id << " [label=\"" << __id << "\\nACC\"];\n" ;
	break;
      default:
	_GLIBCXX_DEBUG_ASSERT(false);
	break;
    }
    return __ostr;
  }

template<typename _TraitsT>
    std::ostream&
    _NFA<_TraitsT>::_M_dot(std::ostream& __ostr) const
    {
      __ostr << "digraph _Nfa {\n"
		"  rankdir=LR;\n";
      for (size_t __i = 0; __i < this->size(); ++__i)
	(*this)[__i]._M_dot(__ostr, __i);
      __ostr << "}\n";
      return __ostr;
    }
#endif

template<typename _TraitsT>
    _StateIdT
    _NFA<_TraitsT>::_M_insert_backref(size_t __index)
    {
      if (this->_M_flags & regex_constants::__polynomial)
	__throw_regex_error(regex_constants::error_complexity,
			    "Unexpected back-reference in polynomial mode.");
      // To figure out whether a backref is valid, a stack is used to store
      // unfinished sub-expressions. For example, when parsing
      // "(a(b)(c\\1(d)))" at '\\1', _M_subexpr_count is 3, indicating that 3
      // sub expressions are parsed or partially parsed(in the stack), aka,
      // "(a..", "(b)" and "(c..").
      // _M_paren_stack is {1, 3}, for incomplete "(a.." and "(c..". At this
      // time, "\\2" is valid, but "\\1" and "\\3" are not.
      if (__index >= _M_subexpr_count)
	__throw_regex_error(
	  regex_constants::error_backref,
	  "Back-reference index exceeds current sub-expression count.");
      for (auto __it : this->_M_paren_stack)
	if (__index == __it)
	  __throw_regex_error(
	    regex_constants::error_backref,
	    "Back-reference referred to an opened sub-expression.");
      this->_M_has_backref = true;
      _StateT __tmp(_S_opcode_backref);
      __tmp._M_backref_index = __index;
      return _M_insert_state(std::move(__tmp));
    }

template<typename _TraitsT>
    void
    _NFA<_TraitsT>::_M_eliminate_dummy()
    {
      for (auto& __it : *this)
	{
	  while (__it._M_next >= 0 && (*this)[__it._M_next]._M_opcode()
		 == _S_opcode_dummy)
	    __it._M_next = (*this)[__it._M_next]._M_next;
	  if (__it._M_has_alt())
	    while (__it._M_alt >= 0 && (*this)[__it._M_alt]._M_opcode()
		   == _S_opcode_dummy)
	      __it._M_alt = (*this)[__it._M_alt]._M_next;
	}
    }

// Just apply DFS on the sequence and re-link their links.
  template<typename _TraitsT>
    _StateSeq<_TraitsT>
    _StateSeq<_TraitsT>::_M_clone()
    {
      std::map<_StateIdT, _StateIdT> __m;
      std::stack<_StateIdT> __stack;
      __stack.push(_M_start);
      while (!__stack.empty())
	{
	  auto __u = __stack.top();
	  __stack.pop();
	  auto __dup = _M_nfa[__u];
	  // _M_insert_state() never return -1
	  auto __id = _M_nfa._M_insert_state(std::move(__dup));
	  __m[__u] = __id;
	  if (__dup._M_has_alt())
	    if (__dup._M_alt != _S_invalid_state_id
		&& __m.count(__dup._M_alt) == 0)
	      __stack.push(__dup._M_alt);
	  if (__u == _M_end)
	    continue;
	  if (__dup._M_next != _S_invalid_state_id
	      && __m.count(__dup._M_next) == 0)
	    __stack.push(__dup._M_next);
	}
      for (auto __it : __m)
	{
	  auto __v = __it.second;
	  auto& __ref = _M_nfa[__v];
	  if (__ref._M_next != _S_invalid_state_id)
	    __ref._M_next = __m.find(__ref._M_next)->second;
	  if (__ref._M_has_alt() && __ref._M_alt != _S_invalid_state_id)
	    __ref._M_alt = __m.find(__ref._M_alt)->second;
	}
      return _StateSeq(_M_nfa, __m[_M_start], __m[_M_end]);
    }
} // namespace __detail

_GLIBCXX_END_NAMESPACE_VERSION
} // namespace

${this.title}

Code Editor : regex_automaton.tcc