/
usr
/
include
/
c++
/
8
/
bits
/
/usr/include/c++/8/bits
mkdir
upload
Name
Size
Mode
Actions
algorithmfwd.h
21736
0644
edit
dl
rm
allocated_ptr.h
3293
0644
edit
dl
rm
allocator.h
7569
0644
edit
dl
rm
alloc_traits.h
20066
0644
edit
dl
rm
atomic_base.h
23842
0644
edit
dl
rm
atomic_futex.h
9576
0644
edit
dl
rm
atomic_lockfree_defines.h
2253
0644
edit
dl
rm
basic_ios.h
16074
0644
edit
dl
rm
basic_ios.tcc
6083
0644
edit
dl
rm
basic_string.h
242697
0644
edit
dl
rm
basic_string.tcc
53755
0644
edit
dl
rm
boost_concept_check.h
27161
0644
edit
dl
rm
c++0x_warning.h
1474
0644
edit
dl
rm
char_traits.h
20915
0644
edit
dl
rm
codecvt.h
21289
0644
edit
dl
rm
concept_check.h
3423
0644
edit
dl
rm
cpp_type_traits.h
9789
0644
edit
dl
rm
cxxabi_forced.h
1811
0644
edit
dl
rm
cxxabi_init_exception.h
2220
0644
edit
dl
rm
deque.tcc
34122
0644
edit
dl
rm
enable_special_members.h
12387
0644
edit
dl
rm
exception.h
2280
0644
edit
dl
rm
exception_defines.h
1645
0644
edit
dl
rm
exception_ptr.h
5981
0644
edit
dl
rm
forward_list.h
48919
0644
edit
dl
rm
forward_list.tcc
13169
0644
edit
dl
rm
fstream.tcc
32799
0644
edit
dl
rm
fs_dir.h
14724
0644
edit
dl
rm
fs_fwd.h
10279
0644
edit
dl
rm
fs_ops.h
9730
0644
edit
dl
rm
fs_path.h
32894
0644
edit
dl
rm
functexcept.h
3254
0644
edit
dl
rm
functional_hash.h
8238
0644
edit
dl
rm
gslice.h
5518
0644
edit
dl
rm
gslice_array.h
7769
0644
edit
dl
rm
hashtable.h
73785
0644
edit
dl
rm
hashtable_policy.h
67971
0644
edit
dl
rm
hash_bytes.h
2146
0644
edit
dl
rm
indirect_array.h
7861
0644
edit
dl
rm
invoke.h
3657
0644
edit
dl
rm
ios_base.h
31023
0644
edit
dl
rm
istream.tcc
31093
0644
edit
dl
rm
list.tcc
15976
0644
edit
dl
rm
localefwd.h
5646
0644
edit
dl
rm
locale_classes.h
24897
0644
edit
dl
rm
locale_classes.tcc
8375
0644
edit
dl
rm
locale_conv.h
16097
0644
edit
dl
rm
locale_facets.h
92328
0644
edit
dl
rm
locale_facets.tcc
39548
0644
edit
dl
rm
locale_facets_nonio.h
68980
0644
edit
dl
rm
locale_facets_nonio.tcc
45280
0644
edit
dl
rm
mask_array.h
7595
0644
edit
dl
rm
memoryfwd.h
2453
0644
edit
dl
rm
move.h
6529
0644
edit
dl
rm
nested_exception.h
4802
0644
edit
dl
rm
node_handle.h
8216
0644
edit
dl
rm
ostream.tcc
12315
0644
edit
dl
rm
ostream_insert.h
4002
0644
edit
dl
rm
parse_numbers.h
7944
0644
edit
dl
rm
postypes.h
8208
0644
edit
dl
rm
predefined_ops.h
9083
0644
edit
dl
rm
ptr_traits.h
6626
0644
edit
dl
rm
quoted_string.h
5053
0644
edit
dl
rm
random.h
175250
0644
edit
dl
rm
random.tcc
105590
0644
edit
dl
rm
range_access.h
10030
0644
edit
dl
rm
refwrap.h
11884
0644
edit
dl
rm
regex.h
97402
0644
edit
dl
rm
regex.tcc
16565
0644
edit
dl
rm
regex_automaton.h
10722
0644
edit
dl
rm
regex_automaton.tcc
7838
0644
edit
dl
rm
regex_compiler.h
18050
0644
edit
dl
rm
regex_compiler.tcc
19288
0644
edit
dl
rm
regex_constants.h
14708
0644
edit
dl
rm
regex_error.h
4904
0644
edit
dl
rm
regex_executor.h
7488
0644
edit
dl
rm
regex_executor.tcc
18841
0644
edit
dl
rm
regex_scanner.h
7088
0644
edit
dl
rm
regex_scanner.tcc
15009
0644
edit
dl
rm
shared_ptr.h
23433
0644
edit
dl
rm
shared_ptr_atomic.h
9769
0644
edit
dl
rm
shared_ptr_base.h
54286
0644
edit
dl
rm
slice_array.h
9348
0644
edit
dl
rm
specfun.h
47051
0644
edit
dl
rm
sstream.tcc
10142
0644
edit
dl
rm
std_abs.h
3266
0644
edit
dl
rm
std_function.h
23260
0644
edit
dl
rm
std_mutex.h
9298
0644
edit
dl
rm
stl_algo.h
214294
0644
edit
dl
rm
stl_algobase.h
50494
0644
edit
dl
rm
stl_bvector.h
33728
0644
edit
dl
rm
stl_construct.h
7397
0644
edit
dl
rm
stl_deque.h
78575
0644
edit
dl
rm
stl_function.h
41745
0644
edit
dl
rm
stl_heap.h
20206
0644
edit
dl
rm
stl_iterator.h
42291
0644
edit
dl
rm
stl_iterator_base_funcs.h
8178
0644
edit
dl
rm
stl_iterator_base_types.h
8680
0644
edit
dl
rm
stl_list.h
67558
0644
edit
dl
rm
stl_map.h
52791
0644
edit
dl
rm
stl_multimap.h
41557
0644
edit
dl
rm
stl_multiset.h
35809
0644
edit
dl
rm
stl_numeric.h
13832
0644
edit
dl
rm
stl_pair.h
18642
0644
edit
dl
rm
stl_queue.h
24073
0644
edit
dl
rm
stl_raw_storage_iter.h
3830
0644
edit
dl
rm
stl_relops.h
4594
0644
edit
dl
rm
stl_set.h
36125
0644
edit
dl
rm
stl_stack.h
11938
0644
edit
dl
rm
stl_tempbuf.h
8344
0644
edit
dl
rm
stl_tree.h
74904
0644
edit
dl
rm
stl_uninitialized.h
27709
0644
edit
dl
rm
stl_vector.h
60534
0644
edit
dl
rm
streambuf.tcc
4929
0644
edit
dl
rm
streambuf_iterator.h
13758
0644
edit
dl
rm
stream_iterator.h
6654
0644
edit
dl
rm
stringfwd.h
2607
0644
edit
dl
rm
string_view.tcc
6698
0644
edit
dl
rm
uniform_int_dist.h
10081
0644
edit
dl
rm
unique_ptr.h
25984
0644
edit
dl
rm
unordered_map.h
75341
0644
edit
dl
rm
unordered_set.h
59148
0644
edit
dl
rm
uses_allocator.h
6525
0644
edit
dl
rm
valarray_after.h
22655
0644
edit
dl
rm
valarray_array.h
21807
0644
edit
dl
rm
valarray_array.tcc
7254
0644
edit
dl
rm
valarray_before.h
18513
0644
edit
dl
rm
vector.tcc
29644
0644
edit
dl
rm
Edit:
/usr/include/c++/8/bits/regex_automaton.tcc
(7838B)
// class template regex -*- C++ -*- // Copyright (C) 2013-2018 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) { __glibcxx_assert(__m.count(__ref._M_next) > 0); __ref._M_next = __m[__ref._M_next]; } if (__ref._M_has_alt()) if (__ref._M_alt != _S_invalid_state_id) { __glibcxx_assert(__m.count(__ref._M_alt) > 0); __ref._M_alt = __m[__ref._M_alt]; } } return _StateSeq(_M_nfa, __m[_M_start], __m[_M_end]); } } // namespace __detail _GLIBCXX_END_NAMESPACE_VERSION } // namespace
Save
cmd:
run