SM0 She11

Path: / / usr / include / c++ / 4.8.2 / bits

Full Path (server): /usr/include/c++/4.8.2/bits

Create Fil3

Upl04d Fil3

• 📄 algorithmfwd.h [E] [D]
  [R]
• 📄 alloc_traits.h [E] [D]
  [R]
• 📄 allocator.h [E] [D]
  [R]
• 📄 atomic_base.h [E] [D]
  [R]
• 📄 atomic_lockfree_defines.h [E] [D]
  [R]
• 📄 basic_ios.h [E] [D]
  [R]
• 📄 basic_ios.tcc [E] [D]
  [R]
• 📄 basic_string.h [E] [D]
  [R]
• 📄 basic_string.tcc [E] [D]
  [R]
• 📄 boost_concept_check.h [E] [D]
  [R]
• 📄 c++0x_warning.h [E] [D]
  [R]
• 📄 char_traits.h [E] [D]
  [R]
• 📄 codecvt.h [E] [D]
  [R]
• 📄 concept_check.h [E] [D]
  [R]
• 📄 cpp_type_traits.h [E] [D]
  [R]
• 📄 cxxabi_forced.h [E] [D]
  [R]
• 📄 deque.tcc [E] [D]
  [R]
• 📄 exception_defines.h [E] [D]
  [R]
• 📄 exception_ptr.h [E] [D]
  [R]
• 📄 forward_list.h [E] [D]
  [R]
• 📄 forward_list.tcc [E] [D]
  [R]
• 📄 fstream.tcc [E] [D]
  [R]
• 📄 functexcept.h [E] [D]
  [R]
• 📄 functional_hash.h [E] [D]
  [R]
• 📄 gslice.h [E] [D]
  [R]
• 📄 gslice_array.h [E] [D]
  [R]
• 📄 hash_bytes.h [E] [D]
  [R]
• 📄 hashtable.h [E] [D]
  [R]
• 📄 hashtable_policy.h [E] [D]
  [R]
• 📄 indirect_array.h [E] [D]
  [R]
• 📄 ios_base.h [E] [D]
  [R]
• 📄 istream.tcc [E] [D]
  [R]
• 📄 list.tcc [E] [D]
  [R]
• 📄 locale_classes.h [E] [D]
  [R]
• 📄 locale_classes.tcc [E] [D]
  [R]
• 📄 locale_facets.h [E] [D]
  [R]
• 📄 locale_facets.tcc [E] [D]
  [R]
• 📄 locale_facets_nonio.h [E] [D]
  [R]
• 📄 locale_facets_nonio.tcc [E] [D]
  [R]
• 📄 localefwd.h [E] [D]
  [R]
• 📄 mask_array.h [E] [D]
  [R]
• 📄 memoryfwd.h [E] [D]
  [R]
• 📄 move.h [E] [D]
  [R]
• 📄 nested_exception.h [E] [D]
  [R]
• 📄 ostream.tcc [E] [D]
  [R]
• 📄 ostream_insert.h [E] [D]
  [R]
• 📄 postypes.h [E] [D]
  [R]
• 📄 ptr_traits.h [E] [D]
  [R]
• 📄 random.h [E] [D]
  [R]
• 📄 random.tcc [E] [D]
  [R]
• 📄 range_access.h [E] [D]
  [R]
• 📄 regex.h [E] [D]
  [R]
• 📄 regex_compiler.h [E] [D]
  [R]
• 📄 regex_constants.h [E] [D]
  [R]
• 📄 regex_cursor.h [E] [D]
  [R]
• 📄 regex_error.h [E] [D]
  [R]
• 📄 regex_grep_matcher.h [E] [D]
  [R]
• 📄 regex_grep_matcher.tcc [E] [D]
  [R]
• 📄 regex_nfa.h [E] [D]
  [R]
• 📄 regex_nfa.tcc [E] [D]
  [R]
• 📄 shared_ptr.h [E] [D]
  [R]
• 📄 shared_ptr_base.h [E] [D]
  [R]
• 📄 slice_array.h [E] [D]
  [R]
• 📄 sstream.tcc [E] [D]
  [R]
• 📄 stl_algo.h [E] [D]
  [R]
• 📄 stl_algobase.h [E] [D]
  [R]
• 📄 stl_bvector.h [E] [D]
  [R]
• 📄 stl_construct.h [E] [D]
  [R]
• 📄 stl_deque.h [E] [D]
  [R]
• 📄 stl_function.h [E] [D]
  [R]
• 📄 stl_heap.h [E] [D]
  [R]
• 📄 stl_iterator.h [E] [D]
  [R]
• 📄 stl_iterator_base_funcs.h [E] [D]
  [R]
• 📄 stl_iterator_base_types.h [E] [D]
  [R]
• 📄 stl_list.h [E] [D]
  [R]
• 📄 stl_map.h [E] [D]
  [R]
• 📄 stl_multimap.h [E] [D]
  [R]
• 📄 stl_multiset.h [E] [D]
  [R]
• 📄 stl_numeric.h [E] [D]
  [R]
• 📄 stl_pair.h [E] [D]
  [R]
• 📄 stl_queue.h [E] [D]
  [R]
• 📄 stl_raw_storage_iter.h [E] [D]
  [R]
• 📄 stl_relops.h [E] [D]
  [R]
• 📄 stl_set.h [E] [D]
  [R]
• 📄 stl_stack.h [E] [D]
  [R]
• 📄 stl_tempbuf.h [E] [D]
  [R]
• 📄 stl_tree.h [E] [D]
  [R]
• 📄 stl_uninitialized.h [E] [D]
  [R]
• 📄 stl_vector.h [E] [D]
  [R]
• 📄 stream_iterator.h [E] [D]
  [R]
• 📄 streambuf.tcc [E] [D]
  [R]
• 📄 streambuf_iterator.h [E] [D]
  [R]
• 📄 stringfwd.h [E] [D]
  [R]
• 📄 unique_ptr.h [E] [D]
  [R]
• 📄 unordered_map.h [E] [D]
  [R]
• 📄 unordered_set.h [E] [D]
  [R]
• 📄 uses_allocator.h [E] [D]
  [R]
• 📄 valarray_after.h [E] [D]
  [R]
• 📄 valarray_array.h [E] [D]
  [R]
• 📄 valarray_array.tcc [E] [D]
  [R]
• 📄 valarray_before.h [E] [D]
  [R]
• 📄 vector.tcc [E] [D]
  [R]

Editing: regex_nfa.tcc

// class template regex -*- C++ -*- // Copyright (C) 2010-2013 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_nfa.tcc * This is an internal header file, included by other library headers. * Do not attempt to use it directly. @headername{regex} */ #include <regex> namespace std _GLIBCXX_VISIBILITY(default) { namespace __detail { _GLIBCXX_BEGIN_NAMESPACE_VERSION #ifdef _GLIBCXX_DEBUG inline std::ostream& _State:: _M_print(std::ostream& ostr) const { switch (_M_opcode) { case _S_opcode_alternative: 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_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:: _M_dot(std::ostream& __ostr, _StateIdT __id) const { switch (_M_opcode) { case _S_opcode_alternative: __ostr << __id << " [label=\"" << __id << "\\nALT\"];\n" << __id << " -> " << _M_next << " [label=\"epsilon\", tailport=\"s\"];\n" << __id << " -> " << _M_alt << " [label=\"epsilon\", 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_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: __ostr << __id << " [label=\"" << __id << "\\nUNK\"];\n" << __id << " -> " << _M_next << " [label=\"?\"];\n"; break; } return __ostr; } inline std::ostream& _Nfa:: _M_dot(std::ostream& __ostr) const { __ostr << "digraph _Nfa {\n" << " rankdir=LR;\n"; for (unsigned int __i = 0; __i < this->size(); ++__i) { this->at(__i)._M_dot(__ostr, __i); } __ostr << "}\n"; return __ostr; } #endif inline _StateSeq& _StateSeq:: operator=(const _StateSeq& __rhs) { _M_start = __rhs._M_start; _M_end1 = __rhs._M_end1; _M_end2 = __rhs._M_end2; return *this; } inline void _StateSeq:: _M_push_back(_StateIdT __id) { if (_M_end1 != _S_invalid_state_id) _M_nfa[_M_end1]._M_next = __id; _M_end1 = __id; } inline void _StateSeq:: _M_append(_StateIdT __id) { if (_M_end2 != _S_invalid_state_id) { if (_M_end2 == _M_end1) _M_nfa[_M_end2]._M_alt = __id; else _M_nfa[_M_end2]._M_next = __id; _M_end2 = _S_invalid_state_id; } if (_M_end1 != _S_invalid_state_id) _M_nfa[_M_end1]._M_next = __id; _M_end1 = __id; } inline void _StateSeq:: _M_append(_StateSeq& __rhs) { if (_M_end2 != _S_invalid_state_id) { if (_M_end2 == _M_end1) _M_nfa[_M_end2]._M_alt = __rhs._M_start; else _M_nfa[_M_end2]._M_next = __rhs._M_start; _M_end2 = _S_invalid_state_id; } if (__rhs._M_end2 != _S_invalid_state_id) _M_end2 = __rhs._M_end2; if (_M_end1 != _S_invalid_state_id) _M_nfa[_M_end1]._M_next = __rhs._M_start; _M_end1 = __rhs._M_end1; } // @todo implement this function. inline _StateIdT _StateSeq:: _M_clone() { return 0; } _GLIBCXX_END_NAMESPACE_VERSION } // namespace __detail } // namespace
Save