Gecko [ paroquia-rio-de-mouro.pt ]

Name	Size	Permission	Date
algorithmfwd.h	21.14 KB	-rw-r--r--	2019-10-04 20:36
alloc_traits.h	20.05 KB	-rw-r--r--	2019-10-04 20:36
allocated_ptr.h	3.38 KB	-rw-r--r--	2019-10-04 20:36
allocator.h	6.32 KB	-rw-r--r--	2019-10-04 20:36
atomic_base.h	23.41 KB	-rw-r--r--	2019-10-04 20:36
atomic_futex.h	9.35 KB	-rw-r--r--	2019-10-04 20:36
atomic_lockfree_defines.h	2.2 KB	-rw-r--r--	2019-10-04 20:36
basic_ios.h	15.7 KB	-rw-r--r--	2019-10-04 20:36
basic_ios.tcc	5.89 KB	-rw-r--r--	2019-10-04 20:36
basic_string.h	198.81 KB	-rw-r--r--	2019-10-04 20:36
basic_string.tcc	50.73 KB	-rw-r--r--	2019-10-04 20:36
boost_concept_check.h	26.41 KB	-rw-r--r--	2019-10-04 20:36
c++0x_warning.h	1.44 KB	-rw-r--r--	2019-10-04 20:36
c++14_warning.h	1.48 KB	-rw-r--r--	2019-10-04 20:36
char_traits.h	17.56 KB	-rw-r--r--	2019-10-04 20:36
codecvt.h	20.8 KB	-rw-r--r--	2019-10-04 20:36
concept_check.h	3.26 KB	-rw-r--r--	2019-10-04 20:36
cpp_type_traits.h	10.04 KB	-rw-r--r--	2019-10-04 20:36
cxxabi_forced.h	1.77 KB	-rw-r--r--	2019-10-04 20:36
deque.tcc	32.89 KB	-rw-r--r--	2019-10-04 20:36
enable_special_members.h	10.87 KB	-rw-r--r--	2019-10-04 20:36
exception_defines.h	1.61 KB	-rw-r--r--	2019-10-04 20:36
exception_ptr.h	5.5 KB	-rw-r--r--	2019-10-04 20:36
forward_list.h	47.01 KB	-rw-r--r--	2019-10-04 20:36
forward_list.tcc	15.17 KB	-rw-r--r--	2019-10-04 20:36
fstream.tcc	32.1 KB	-rw-r--r--	2019-10-04 20:36
functexcept.h	3.18 KB	-rw-r--r--	2019-10-04 20:36
functional_hash.h	6.05 KB	-rw-r--r--	2019-10-04 20:36
gslice.h	5.39 KB	-rw-r--r--	2019-10-04 20:36
gslice_array.h	7.59 KB	-rw-r--r--	2019-10-04 20:36
hash_bytes.h	2.1 KB	-rw-r--r--	2019-10-04 20:36
hashtable.h	67.95 KB	-rw-r--r--	2019-10-04 20:36
hashtable_policy.h	62.61 KB	-rw-r--r--	2019-10-04 20:36
indirect_array.h	7.68 KB	-rw-r--r--	2019-10-04 20:36
ios_base.h	30.21 KB	-rw-r--r--	2019-10-04 20:36
istream.tcc	30.21 KB	-rw-r--r--	2019-10-04 20:36
list.tcc	13.5 KB	-rw-r--r--	2019-10-04 20:36
locale_classes.h	24.14 KB	-rw-r--r--	2019-10-04 20:36
locale_classes.tcc	8.18 KB	-rw-r--r--	2019-10-04 20:36
locale_conv.h	15.64 KB	-rw-r--r--	2019-10-04 20:36
locale_facets.h	89.93 KB	-rw-r--r--	2019-10-04 20:36
locale_facets.tcc	38.63 KB	-rw-r--r--	2019-10-04 20:36
locale_facets_nonio.h	67.33 KB	-rw-r--r--	2019-10-04 20:36
locale_facets_nonio.tcc	44.04 KB	-rw-r--r--	2019-10-04 20:36
localefwd.h	5.51 KB	-rw-r--r--	2019-10-04 20:36
mask_array.h	7.41 KB	-rw-r--r--	2019-10-04 20:36
memoryfwd.h	2.36 KB	-rw-r--r--	2019-10-04 20:36
move.h	5.93 KB	-rw-r--r--	2019-10-04 20:36
nested_exception.h	4.5 KB	-rw-r--r--	2019-10-04 20:36
ostream.tcc	12.03 KB	-rw-r--r--	2019-10-04 20:36
ostream_insert.h	3.91 KB	-rw-r--r--	2019-10-04 20:36
parse_numbers.h	7.58 KB	-rw-r--r--	2019-10-04 20:36
postypes.h	8.02 KB	-rw-r--r--	2019-10-04 20:36
predefined_ops.h	7.75 KB	-rw-r--r--	2019-10-04 20:36
ptr_traits.h	5.02 KB	-rw-r--r--	2019-10-04 20:36
quoted_string.h	4.47 KB	-rw-r--r--	2019-10-04 20:36
random.h	169.22 KB	-rw-r--r--	2019-10-04 20:36
random.tcc	102.74 KB	-rw-r--r--	2019-10-04 20:36
range_access.h	7.11 KB	-rw-r--r--	2019-10-04 20:36
regex.h	94.4 KB	-rw-r--r--	2019-10-04 20:36
regex.tcc	16.72 KB	-rw-r--r--	2019-10-04 20:36
regex_automaton.h	8.52 KB	-rw-r--r--	2019-10-04 20:36
regex_automaton.tcc	7.71 KB	-rw-r--r--	2019-10-04 20:36
regex_compiler.h	14.35 KB	-rw-r--r--	2019-10-04 20:36
regex_compiler.tcc	17.4 KB	-rw-r--r--	2019-10-04 20:36
regex_constants.h	13.57 KB	-rw-r--r--	2019-10-04 20:36
regex_error.h	4.48 KB	-rw-r--r--	2019-10-04 20:36
regex_executor.h	6.62 KB	-rw-r--r--	2019-10-04 20:36
regex_executor.tcc	13.99 KB	-rw-r--r--	2019-10-04 20:36
regex_scanner.h	6.88 KB	-rw-r--r--	2019-10-04 20:36
regex_scanner.tcc	13.8 KB	-rw-r--r--	2019-10-04 20:36
shared_ptr.h	19.8 KB	-rw-r--r--	2019-10-04 20:36
shared_ptr_atomic.h	9.54 KB	-rw-r--r--	2019-10-04 20:36
shared_ptr_base.h	44.48 KB	-rw-r--r--	2019-10-04 20:36
slice_array.h	9.12 KB	-rw-r--r--	2019-10-04 20:36
sstream.tcc	9.27 KB	-rw-r--r--	2019-10-04 20:36
stl_algo.h	198.04 KB	-rw-r--r--	2019-10-04 20:36
stl_algobase.h	49.72 KB	-rw-r--r--	2019-10-04 20:36
stl_bvector.h	32.76 KB	-rw-r--r--	2019-10-04 20:36
stl_construct.h	5.05 KB	-rw-r--r--	2019-10-04 20:36
stl_deque.h	75.97 KB	-rw-r--r--	2019-10-04 20:36
stl_function.h	32.55 KB	-rw-r--r--	2019-10-04 20:36
stl_heap.h	18.19 KB	-rw-r--r--	2019-10-04 20:36
stl_iterator.h	36.98 KB	-rw-r--r--	2019-10-04 20:36
stl_iterator_base_funcs.h	6.8 KB	-rw-r--r--	2019-10-04 20:36
stl_iterator_base_types.h	8.42 KB	-rw-r--r--	2019-10-04 20:36
stl_list.h	60.65 KB	-rw-r--r--	2019-10-04 20:36
stl_map.h	39.54 KB	-rw-r--r--	2019-10-04 20:36
stl_multimap.h	36.77 KB	-rw-r--r--	2019-10-04 20:36
stl_multiset.h	30.93 KB	-rw-r--r--	2019-10-04 20:36
stl_numeric.h	13.5 KB	-rw-r--r--	2019-10-04 20:36
stl_pair.h	9.63 KB	-rw-r--r--	2019-10-04 20:36
stl_queue.h	18.28 KB	-rw-r--r--	2019-10-04 20:36
stl_raw_storage_iter.h	3.37 KB	-rw-r--r--	2019-10-04 20:36
stl_relops.h	4.49 KB	-rw-r--r--	2019-10-04 20:36
stl_set.h	31.18 KB	-rw-r--r--	2019-10-04 20:36
stl_stack.h	9.71 KB	-rw-r--r--	2019-10-04 20:36
stl_tempbuf.h	8.15 KB	-rw-r--r--	2019-10-04 20:36
stl_tree.h	67.54 KB	-rw-r--r--	2019-10-04 20:36
stl_uninitialized.h	21.37 KB	-rw-r--r--	2019-10-04 20:36
stl_vector.h	52.41 KB	-rw-r--r--	2019-10-04 20:36
stream_iterator.h	6.44 KB	-rw-r--r--	2019-10-04 20:36
streambuf.tcc	4.81 KB	-rw-r--r--	2019-10-04 20:36
streambuf_iterator.h	12.33 KB	-rw-r--r--	2019-10-04 20:36
stringfwd.h	2.55 KB	-rw-r--r--	2019-10-04 20:36
uniform_int_dist.h	9.72 KB	-rw-r--r--	2019-10-04 20:36
unique_ptr.h	23.29 KB	-rw-r--r--	2019-10-04 20:36
unordered_map.h	52.15 KB	-rw-r--r--	2019-10-04 20:36
unordered_set.h	47.51 KB	-rw-r--r--	2019-10-04 20:36
uses_allocator.h	3.19 KB	-rw-r--r--	2019-10-04 20:36
valarray_after.h	22.12 KB	-rw-r--r--	2019-10-04 20:36
valarray_array.h	21.23 KB	-rw-r--r--	2019-10-04 20:36
valarray_array.tcc	7.08 KB	-rw-r--r--	2019-10-04 20:36
valarray_before.h	18.08 KB	-rw-r--r--	2019-10-04 20:36
vector.tcc	26.42 KB	-rw-r--r--	2019-10-04 20:36

Rename

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

// Copyright (C) 2013-2015 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.h
 *  This is an internal header file, included by other library headers.
 *  Do not attempt to use it directly. @headername{regex}
 */

// This macro defines the maximal state number a NFA can have.
#ifndef _GLIBCXX_REGEX_STATE_LIMIT
#define _GLIBCXX_REGEX_STATE_LIMIT 100000
#endif

namespace std _GLIBCXX_VISIBILITY(default)
{
namespace __detail
{
_GLIBCXX_BEGIN_NAMESPACE_VERSION

/**
   *  @defgroup regex-detail Base and Implementation Classes
   *  @ingroup regex
   *  @{
   */

typedef long _StateIdT;
  static const _StateIdT _S_invalid_state_id  = -1;

template<typename _CharT>
    using _Matcher = std::function<bool (_CharT)>;

/// Operation codes that define the type of transitions within the base NFA
  /// that represents the regular expression.
  enum _Opcode : int
  {
      _S_opcode_unknown,
      _S_opcode_alternative,
      _S_opcode_repeat,
      _S_opcode_backref,
      _S_opcode_line_begin_assertion,
      _S_opcode_line_end_assertion,
      _S_opcode_word_boundary,
      _S_opcode_subexpr_lookahead,
      _S_opcode_subexpr_begin,
      _S_opcode_subexpr_end,
      _S_opcode_dummy,
      _S_opcode_match,
      _S_opcode_accept,
  };

struct _State_base
  {
    _Opcode      _M_opcode;           // type of outgoing transition
    _StateIdT    _M_next;             // outgoing transition
    union // Since they are mutually exclusive.
    {
      size_t _M_subexpr;        // for _S_opcode_subexpr_*
      size_t _M_backref_index;  // for _S_opcode_backref
      struct
      {
	// for _S_opcode_alternative, _S_opcode_repeat and
	// _S_opcode_subexpr_lookahead
	_StateIdT  _M_alt;
	// for _S_opcode_word_boundary or _S_opcode_subexpr_lookahead or
	// quantifiers (ungreedy if set true)
	bool       _M_neg;
      };
    };

explicit _State_base(_Opcode __opcode)
    : _M_opcode(__opcode), _M_next(_S_invalid_state_id)
    { }

protected:
    ~_State_base() = default;

public:
#ifdef _GLIBCXX_DEBUG
    std::ostream&
    _M_print(std::ostream& ostr) const;

// Prints graphviz dot commands for state.
    std::ostream&
    _M_dot(std::ostream& __ostr, _StateIdT __id) const;
#endif
  };

template<typename _TraitsT>
    struct _State : _State_base
    {
      typedef _Matcher<typename _TraitsT::char_type> _MatcherT;

_MatcherT      _M_matches;        // for _S_opcode_match

explicit _State(_Opcode __opcode) : _State_base(__opcode) { }
    };

struct _NFA_base
  {
    typedef size_t                              _SizeT;
    typedef regex_constants::syntax_option_type _FlagT;

explicit
    _NFA_base(_FlagT __f)
    : _M_flags(__f), _M_start_state(0), _M_subexpr_count(0),
    _M_has_backref(false)
    { }

_NFA_base(_NFA_base&&) = default;

protected:
    ~_NFA_base() = default;

public:
    _FlagT
    _M_options() const
    { return _M_flags; }

_StateIdT
    _M_start() const
    { return _M_start_state; }

_SizeT
    _M_sub_count() const
    { return _M_subexpr_count; }

std::vector<size_t>       _M_paren_stack;
    _FlagT                    _M_flags;
    _StateIdT                 _M_start_state;
    _SizeT                    _M_subexpr_count;
    bool                      _M_has_backref;
  };

template<typename _TraitsT>
    struct _NFA
    : _NFA_base, std::vector<_State<_TraitsT>>
    {
      typedef _State<_TraitsT>				_StateT;
      typedef _Matcher<typename _TraitsT::char_type>	_MatcherT;

_NFA(const typename _TraitsT::locale_type& __loc, _FlagT __flags)
      : _NFA_base(__flags)
      { _M_traits.imbue(__loc); }

// for performance reasons _NFA objects should only be moved not copied
      _NFA(const _NFA&) = delete;
      _NFA(_NFA&&) = default;

_StateIdT
      _M_insert_accept()
      {
	auto __ret = _M_insert_state(_StateT(_S_opcode_accept));
	return __ret;
      }

_StateIdT
      _M_insert_alt(_StateIdT __next, _StateIdT __alt, bool __neg)
      {
	_StateT __tmp(_S_opcode_alternative);
	// It labels every quantifier to make greedy comparison easier in BFS
	// approach.
	__tmp._M_next = __next;
	__tmp._M_alt = __alt;
	return _M_insert_state(std::move(__tmp));
      }

_StateIdT
      _M_insert_repeat(_StateIdT __next, _StateIdT __alt, bool __neg)
      {
	_StateT __tmp(_S_opcode_repeat);
	// It labels every quantifier to make greedy comparison easier in BFS
	// approach.
	__tmp._M_next = __next;
	__tmp._M_alt = __alt;
	__tmp._M_neg = __neg;
	return _M_insert_state(std::move(__tmp));
      }

_StateIdT
      _M_insert_matcher(_MatcherT __m)
      {
	_StateT __tmp(_S_opcode_match);
	__tmp._M_matches = std::move(__m);
	return _M_insert_state(std::move(__tmp));
      }

_StateIdT
      _M_insert_subexpr_begin()
      {
	auto __id = this->_M_subexpr_count++;
	this->_M_paren_stack.push_back(__id);
	_StateT __tmp(_S_opcode_subexpr_begin);
	__tmp._M_subexpr = __id;
	return _M_insert_state(std::move(__tmp));
      }

_StateIdT
      _M_insert_subexpr_end()
      {
	_StateT __tmp(_S_opcode_subexpr_end);
	__tmp._M_subexpr = this->_M_paren_stack.back();
	this->_M_paren_stack.pop_back();
	return _M_insert_state(std::move(__tmp));
      }

_StateIdT
      _M_insert_backref(size_t __index);

_StateIdT
      _M_insert_line_begin()
      { return _M_insert_state(_StateT(_S_opcode_line_begin_assertion)); }

_StateIdT
      _M_insert_line_end()
      { return _M_insert_state(_StateT(_S_opcode_line_end_assertion)); }

_StateIdT
      _M_insert_word_bound(bool __neg)
      {
	_StateT __tmp(_S_opcode_word_boundary);
	__tmp._M_neg = __neg;
	return _M_insert_state(std::move(__tmp));
      }

_StateIdT
      _M_insert_lookahead(_StateIdT __alt, bool __neg)
      {
	_StateT __tmp(_S_opcode_subexpr_lookahead);
	__tmp._M_alt = __alt;
	__tmp._M_neg = __neg;
	return _M_insert_state(std::move(__tmp));
      }

_StateIdT
      _M_insert_dummy()
      { return _M_insert_state(_StateT(_S_opcode_dummy)); }

_StateIdT
      _M_insert_state(_StateT __s)
      {
	this->push_back(std::move(__s));
	if (this->size() > _GLIBCXX_REGEX_STATE_LIMIT)
	  __throw_regex_error(regex_constants::error_space);
	return this->size()-1;
      }

// Eliminate dummy node in this NFA to make it compact.
      void
      _M_eliminate_dummy();

#ifdef _GLIBCXX_DEBUG
      std::ostream&
      _M_dot(std::ostream& __ostr) const;
#endif
    public:
      _TraitsT                  _M_traits;
    };

/// Describes a sequence of one or more %_State, its current start
  /// and end(s).  This structure contains fragments of an NFA during
  /// construction.
  template<typename _TraitsT>
    class _StateSeq
    {
    public:
      typedef _NFA<_TraitsT> _RegexT;

public:
      _StateSeq(_RegexT& __nfa, _StateIdT __s)
      : _M_nfa(__nfa), _M_start(__s), _M_end(__s)
      { }

_StateSeq(_RegexT& __nfa, _StateIdT __s, _StateIdT __end)
      : _M_nfa(__nfa), _M_start(__s), _M_end(__end)
      { }

// Append a state on *this and change *this to the new sequence.
      void
      _M_append(_StateIdT __id)
      {
	_M_nfa[_M_end]._M_next = __id;
	_M_end = __id;
      }

// Append a sequence on *this and change *this to the new sequence.
      void
      _M_append(const _StateSeq& __s)
      {
	_M_nfa[_M_end]._M_next = __s._M_start;
	_M_end = __s._M_end;
      }

// Clones an entire sequence.
      _StateSeq
      _M_clone();

public:
      _RegexT&  _M_nfa;
      _StateIdT _M_start;
      _StateIdT _M_end;
    };

//@} regex-detail
_GLIBCXX_END_NAMESPACE_VERSION
} // namespace __detail
} // namespace std

#include <bits/regex_automaton.tcc>