golden hour

/usr/include/c++/4.8.2/bits

File/Folder	Size	Actions
algorithmfwd.h	20.66 KB
alloc_traits.h	17.66 KB
allocator.h	6.1 KB
atomic_base.h	24.99 KB
atomic_lockfree_defines.h	2.2 KB
basic_ios.h	14.76 KB
basic_ios.tcc	5.89 KB
basic_string.h	109.49 KB
basic_string.tcc	38.43 KB
boost_concept_check.h	26.41 KB
c++0x_warning.h	1.47 KB
char_traits.h	16.95 KB
codecvt.h	16.23 KB
concept_check.h	3.26 KB
cpp_type_traits.h	9.56 KB
cxxabi_forced.h	1.77 KB
deque.tcc	31.91 KB
exception_defines.h	1.6 KB
exception_ptr.h	5.29 KB
forward_list.h	46.72 KB
forward_list.tcc	15.17 KB
fstream.tcc	28.3 KB
functexcept.h	3.04 KB
functional_hash.h	6.05 KB
gslice.h	5.39 KB
gslice_array.h	7.59 KB
hash_bytes.h	2.1 KB
hashtable.h	61.05 KB
hashtable_policy.h	52.72 KB
indirect_array.h	7.68 KB
ios_base.h	27.85 KB
istream.tcc	30.36 KB
list.tcc	12.2 KB
locale_classes.h	22.45 KB
locale_classes.tcc	8.18 KB
locale_facets.h	88.84 KB
locale_facets.tcc	38.02 KB
locale_facets_nonio.h	63.51 KB
locale_facets_nonio.tcc	40.85 KB
localefwd.h	5.1 KB
mask_array.h	7.41 KB
memoryfwd.h	2.36 KB
move.h	5.67 KB
nested_exception.h	4.58 KB
ostream.tcc	12.03 KB
ostream_insert.h	3.91 KB
postypes.h	8.02 KB
ptr_traits.h	5.17 KB
random.h	173.19 KB
random.tcc	106.59 KB
range_access.h	3.06 KB
regex.h	83.49 KB
regex_compiler.h	27.68 KB
regex_constants.h	10.81 KB
regex_cursor.h	2.7 KB
regex_error.h	4.5 KB
regex_grep_matcher.h	4.23 KB
regex_grep_matcher.tcc	5.41 KB
regex_nfa.h	10.65 KB
regex_nfa.tcc	4.85 KB
shared_ptr.h	18.97 KB
shared_ptr_base.h	40.65 KB
slice_array.h	9.12 KB
sstream.tcc	9.27 KB
stl_algo.h	212.55 KB
stl_algobase.h	41.41 KB
stl_bvector.h	28.98 KB
stl_construct.h	5.05 KB
stl_deque.h	66.41 KB
stl_function.h	22.06 KB
stl_heap.h	19.99 KB
stl_iterator.h	35.77 KB
stl_iterator_base_funcs.h	6.8 KB
stl_iterator_base_types.h	8.19 KB
stl_list.h	52.83 KB
stl_map.h	36.78 KB
stl_multimap.h	33.94 KB
stl_multiset.h	28.37 KB
stl_numeric.h	13.5 KB
stl_pair.h	9.63 KB
stl_queue.h	18.21 KB
stl_raw_storage_iter.h	3.37 KB
stl_relops.h	4.49 KB
stl_set.h	28.61 KB
stl_stack.h	9.65 KB
stl_tempbuf.h	8.15 KB
stl_tree.h	53.56 KB
stl_uninitialized.h	19.95 KB
stl_vector.h	48.64 KB
stream_iterator.h	6.44 KB
streambuf.tcc	4.81 KB
streambuf_iterator.h	12.33 KB
stringfwd.h	2.37 KB
unique_ptr.h	17.19 KB
unordered_map.h	47.76 KB
unordered_set.h	43.25 KB
uses_allocator.h	3.49 KB
valarray_after.h	22.12 KB
valarray_array.h	21.23 KB
valarray_array.tcc	7.08 KB
valarray_before.h	18.08 KB
vector.tcc	25.55 KB

Edit: 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