OXIESEC PANEL
- Current Dir:
/
/
usr
/
include
/
c++
/
7
/
bits
Server IP: 139.59.38.164
Upload:
Create Dir:
Name
Size
Modified
Perms
📁
..
-
01/31/2023 12:38:15 PM
rwxr-xr-x
📄
algorithmfwd.h
21.23 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
alloc_traits.h
19.13 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
allocated_ptr.h
3.43 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
allocator.h
6.73 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
atomic_base.h
23.28 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
atomic_futex.h
9.35 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
atomic_lockfree_defines.h
2.2 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
basic_ios.h
15.7 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
basic_ios.tcc
5.94 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
basic_string.h
235.15 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
basic_string.tcc
52.5 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
boost_concept_check.h
26.41 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
c++0x_warning.h
1.44 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
char_traits.h
20.26 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
codecvt.h
20.8 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
concept_check.h
3.34 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
cpp_type_traits.h
9.37 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
cxxabi_forced.h
1.77 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
cxxabi_init_exception.h
2.17 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
deque.tcc
33.26 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
enable_special_members.h
12.1 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
exception.h
2.23 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
exception_defines.h
1.61 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
exception_ptr.h
6.31 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
forward_list.h
47.5 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
forward_list.tcc
14.68 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
fstream.tcc
32.14 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
functexcept.h
3.18 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
functional_hash.h
8 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
gslice.h
5.39 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
gslice_array.h
7.59 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
hash_bytes.h
2.1 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
hashtable.h
71.56 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
hashtable_policy.h
65.47 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
indirect_array.h
7.68 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
invoke.h
3.57 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
ios_base.h
30.22 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
istream.tcc
30.36 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
list.tcc
15.54 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
locale_classes.h
24.31 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
locale_classes.tcc
8.18 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
locale_conv.h
15.7 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
locale_facets.h
89.98 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
locale_facets.tcc
38.64 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
locale_facets_nonio.h
67.33 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
locale_facets_nonio.tcc
44.46 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
localefwd.h
5.51 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
mask_array.h
7.42 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
memoryfwd.h
2.36 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
move.h
6.5 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
nested_exception.h
4.66 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
node_handle.h
7.97 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
ostream.tcc
12.03 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
ostream_insert.h
3.91 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
parse_numbers.h
7.84 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
postypes.h
8.02 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
predefined_ops.h
8.87 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
ptr_traits.h
4.75 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
quoted_string.h
4.47 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
random.h
171.19 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
random.tcc
103.08 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
range_access.h
9.75 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
refwrap.h
13.48 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
regex.h
95.9 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
regex.tcc
16.1 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
regex_automaton.h
10.47 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
regex_automaton.tcc
7.65 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
regex_compiler.h
16.79 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
regex_compiler.tcc
18.46 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
regex_constants.h
14.36 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
regex_error.h
4.85 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
regex_executor.h
7.31 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
regex_executor.tcc
16.91 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
regex_scanner.h
6.92 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
regex_scanner.tcc
14.66 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
shared_ptr.h
22.37 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
shared_ptr_atomic.h
9.54 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
shared_ptr_base.h
52.54 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
slice_array.h
9.13 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
specfun.h
44.03 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
sstream.tcc
9.88 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
std_abs.h
3.21 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
std_function.h
23.41 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
std_mutex.h
9.08 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
stl_algo.h
208.85 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
stl_algobase.h
49.22 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
stl_bvector.h
33.03 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
stl_construct.h
7.22 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
stl_deque.h
75.95 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
stl_function.h
32.5 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
stl_heap.h
19.73 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
stl_iterator.h
40.77 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
stl_iterator_base_funcs.h
7.88 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
stl_iterator_base_types.h
8.48 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
stl_list.h
63.65 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
stl_map.h
50.02 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
stl_multimap.h
39 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
stl_multiset.h
33.26 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
stl_numeric.h
13.51 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
stl_pair.h
18.21 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
stl_queue.h
21.61 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
stl_raw_storage_iter.h
3.74 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
stl_relops.h
4.49 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
stl_set.h
33.63 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
stl_stack.h
11.18 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
stl_tempbuf.h
8.15 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
stl_tree.h
73.07 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
stl_uninitialized.h
27 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
stl_vector.h
54.33 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
stream_iterator.h
6.5 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
streambuf.tcc
4.81 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
streambuf_iterator.h
12.33 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
string_view.tcc
6.48 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
stringfwd.h
2.55 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
uniform_int_dist.h
9.91 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
unique_ptr.h
24.88 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
unordered_map.h
67.04 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
unordered_set.h
52.56 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
uses_allocator.h
6.23 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
valarray_after.h
22.12 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
valarray_array.h
21.3 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
valarray_array.tcc
7.08 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
valarray_before.h
18.08 KB
12/04/2019 02:25:41 PM
rw-r--r--
📄
vector.tcc
26.95 KB
12/04/2019 02:25:41 PM
rw-r--r--
Editing: regex_automaton.tcc
Close
// class template regex -*- C++ -*- // Copyright (C) 2013-2017 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) { namespace __detail { _GLIBCXX_BEGIN_NAMESPACE_VERSION #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]); } _GLIBCXX_END_NAMESPACE_VERSION } // namespace __detail } // namespace