SILENT KILLERPanel

Current Path: > > usr > include > c++ > > 8 > bits


Operation   : Linux premium131.web-hosting.com 4.18.0-553.44.1.lve.el8.x86_64 #1 SMP Thu Mar 13 14:29:12 UTC 2025 x86_64
Software     : Apache
Server IP    : 162.0.232.56 | Your IP: 216.73.216.111
Domains      : 1034 Domain(s)
Permission   : [ 0755 ]

Files and Folders in: //usr/include/c++//8/bits

NameTypeSizeLast ModifiedActions
algorithmfwd.h File 21736 bytes March 31 2025 10:36:16.
alloc_traits.h File 20066 bytes March 31 2025 10:36:16.
allocated_ptr.h File 3293 bytes March 31 2025 10:36:16.
allocator.h File 7569 bytes March 31 2025 10:36:16.
atomic_base.h File 23842 bytes March 31 2025 10:36:16.
atomic_futex.h File 9576 bytes March 31 2025 10:36:16.
atomic_lockfree_defines.h File 2253 bytes March 31 2025 10:36:18.
basic_ios.h File 16074 bytes March 31 2025 10:36:16.
basic_ios.tcc File 6083 bytes March 31 2025 10:36:16.
basic_string.h File 242697 bytes March 31 2025 10:36:16.
basic_string.tcc File 53755 bytes March 31 2025 10:36:16.
boost_concept_check.h File 27161 bytes March 31 2025 10:36:16.
c++0x_warning.h File 1474 bytes March 31 2025 10:36:16.
char_traits.h File 20915 bytes March 31 2025 10:36:16.
codecvt.h File 21289 bytes March 31 2025 10:36:16.
concept_check.h File 3423 bytes March 31 2025 10:36:16.
cpp_type_traits.h File 9789 bytes March 31 2025 10:36:16.
cxxabi_forced.h File 1811 bytes March 31 2025 10:36:18.
cxxabi_init_exception.h File 2220 bytes March 31 2025 10:36:18.
deque.tcc File 34122 bytes March 31 2025 10:36:16.
enable_special_members.h File 12387 bytes March 31 2025 10:36:16.
exception.h File 2280 bytes March 31 2025 10:36:18.
exception_defines.h File 1645 bytes March 31 2025 10:36:18.
exception_ptr.h File 5981 bytes March 31 2025 10:36:18.
forward_list.h File 48919 bytes March 31 2025 10:36:16.
forward_list.tcc File 13169 bytes March 31 2025 10:36:16.
fs_dir.h File 14724 bytes March 31 2025 10:36:16.
fs_fwd.h File 10279 bytes March 31 2025 10:36:16.
fs_ops.h File 9730 bytes March 31 2025 10:36:16.
fs_path.h File 32894 bytes March 31 2025 10:36:16.
fstream.tcc File 32799 bytes March 31 2025 10:36:16.
functexcept.h File 3254 bytes March 31 2025 10:36:16.
functional_hash.h File 8238 bytes March 31 2025 10:36:16.
gslice.h File 5518 bytes March 31 2025 10:36:16.
gslice_array.h File 7769 bytes March 31 2025 10:36:16.
hash_bytes.h File 2146 bytes March 31 2025 10:36:18.
hashtable.h File 73785 bytes March 31 2025 10:36:16.
hashtable_policy.h File 67971 bytes March 31 2025 10:36:16.
indirect_array.h File 7861 bytes March 31 2025 10:36:16.
invoke.h File 3657 bytes March 31 2025 10:36:16.
ios_base.h File 31023 bytes March 31 2025 10:36:16.
istream.tcc File 31093 bytes March 31 2025 10:36:16.
list.tcc File 15976 bytes March 31 2025 10:36:16.
locale_classes.h File 24897 bytes March 31 2025 10:36:16.
locale_classes.tcc File 8375 bytes March 31 2025 10:36:16.
locale_conv.h File 16097 bytes March 31 2025 10:36:16.
locale_facets.h File 92328 bytes March 31 2025 10:36:16.
locale_facets.tcc File 39548 bytes March 31 2025 10:36:16.
locale_facets_nonio.h File 68980 bytes March 31 2025 10:36:16.
locale_facets_nonio.tcc File 45280 bytes March 31 2025 10:36:16.
localefwd.h File 5646 bytes March 31 2025 10:36:16.
mask_array.h File 7595 bytes March 31 2025 10:36:16.
memoryfwd.h File 2453 bytes March 31 2025 10:36:16.
move.h File 6529 bytes March 31 2025 10:36:16.
nested_exception.h File 4802 bytes March 31 2025 10:36:18.
node_handle.h File 8216 bytes March 31 2025 10:36:16.
ostream.tcc File 12315 bytes March 31 2025 10:36:16.
ostream_insert.h File 4002 bytes March 31 2025 10:36:16.
parse_numbers.h File 7944 bytes March 31 2025 10:36:16.
postypes.h File 8208 bytes March 31 2025 10:36:16.
predefined_ops.h File 9083 bytes March 31 2025 10:36:16.
ptr_traits.h File 6626 bytes March 31 2025 10:36:16.
quoted_string.h File 5053 bytes March 31 2025 10:36:16.
random.h File 175250 bytes March 31 2025 10:36:16.
random.tcc File 105590 bytes March 31 2025 10:36:16.
range_access.h File 10030 bytes March 31 2025 10:36:16.
refwrap.h File 11884 bytes March 31 2025 10:36:16.
regex.h File 97402 bytes March 31 2025 10:36:16.
regex.tcc File 16565 bytes March 31 2025 10:36:16.
regex_automaton.h File 10722 bytes March 31 2025 10:36:16.
regex_automaton.tcc File 7838 bytes March 31 2025 10:36:16.
regex_compiler.h File 18050 bytes March 31 2025 10:36:16.
regex_compiler.tcc File 19288 bytes March 31 2025 10:36:16.
regex_constants.h File 14708 bytes March 31 2025 10:36:16.
regex_error.h File 4904 bytes March 31 2025 10:36:16.
regex_executor.h File 7488 bytes March 31 2025 10:36:16.
regex_executor.tcc File 18841 bytes March 31 2025 10:36:16.
regex_scanner.h File 7088 bytes March 31 2025 10:36:16.
regex_scanner.tcc File 15009 bytes March 31 2025 10:36:16.
shared_ptr.h File 23433 bytes March 31 2025 10:36:16.
shared_ptr_atomic.h File 9769 bytes March 31 2025 10:36:16.
shared_ptr_base.h File 54286 bytes March 31 2025 10:36:16.
slice_array.h File 9348 bytes March 31 2025 10:36:16.
specfun.h File 47051 bytes March 31 2025 10:36:16.
sstream.tcc File 10142 bytes March 31 2025 10:36:16.
std_abs.h File 3266 bytes March 31 2025 10:36:16.
std_function.h File 23260 bytes March 31 2025 10:36:16.
std_mutex.h File 9298 bytes March 31 2025 10:36:16.
stl_algo.h File 214294 bytes March 31 2025 10:36:16.
stl_algobase.h File 50494 bytes March 31 2025 10:36:16.
stl_bvector.h File 33728 bytes March 31 2025 10:36:16.
stl_construct.h File 7397 bytes March 31 2025 10:36:16.
stl_deque.h File 78575 bytes March 31 2025 10:36:16.
stl_function.h File 41745 bytes March 31 2025 10:36:16.
stl_heap.h File 20206 bytes March 31 2025 10:36:16.
stl_iterator.h File 42291 bytes March 31 2025 10:36:16.
stl_iterator_base_funcs.h File 8178 bytes March 31 2025 10:36:16.
stl_iterator_base_types.h File 8680 bytes March 31 2025 10:36:16.
stl_list.h File 67558 bytes March 31 2025 10:36:16.
stl_map.h File 52791 bytes March 31 2025 10:36:16.
stl_multimap.h File 41557 bytes March 31 2025 10:36:16.
stl_multiset.h File 35809 bytes March 31 2025 10:36:16.
stl_numeric.h File 13832 bytes March 31 2025 10:36:16.
stl_pair.h File 18642 bytes March 31 2025 10:36:16.
stl_queue.h File 24073 bytes March 31 2025 10:36:16.
stl_raw_storage_iter.h File 3830 bytes March 31 2025 10:36:16.
stl_relops.h File 4594 bytes March 31 2025 10:36:16.
stl_set.h File 36125 bytes March 31 2025 10:36:16.
stl_stack.h File 11938 bytes March 31 2025 10:36:16.
stl_tempbuf.h File 8344 bytes March 31 2025 10:36:16.
stl_tree.h File 74904 bytes March 31 2025 10:36:16.
stl_uninitialized.h File 27709 bytes March 31 2025 10:36:16.
stl_vector.h File 60534 bytes March 31 2025 10:36:16.
stream_iterator.h File 6654 bytes March 31 2025 10:36:16.
streambuf.tcc File 4929 bytes March 31 2025 10:36:16.
streambuf_iterator.h File 13758 bytes March 31 2025 10:36:16.
string_view.tcc File 6698 bytes March 31 2025 10:36:16.
stringfwd.h File 2607 bytes March 31 2025 10:36:16.
uniform_int_dist.h File 10081 bytes March 31 2025 10:36:16.
unique_ptr.h File 25984 bytes March 31 2025 10:36:16.
unordered_map.h File 75341 bytes March 31 2025 10:36:16.
unordered_set.h File 59148 bytes March 31 2025 10:36:16.
uses_allocator.h File 6525 bytes March 31 2025 10:36:16.
valarray_after.h File 22655 bytes March 31 2025 10:36:16.
valarray_array.h File 21807 bytes March 31 2025 10:36:16.
valarray_array.tcc File 7254 bytes March 31 2025 10:36:16.
valarray_before.h File 18513 bytes March 31 2025 10:36:16.
vector.tcc File 29644 bytes March 31 2025 10:36:16.

Reading File: //usr/include/c++//8/bits/regex_automaton.h

// 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.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)
{
_GLIBCXX_BEGIN_NAMESPACE_VERSION

namespace __detail
{
  /**
   *  @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
  {
  protected:
    _Opcode      _M_opcode;           // type of outgoing transition

  public:
    _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;
      };
      // For _S_opcode_match
      __gnu_cxx::__aligned_membuf<_Matcher<char>> _M_matcher_storage;
    };

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

  public:
    bool
    _M_has_alt()
    {
      return _M_opcode == _S_opcode_alternative
	|| _M_opcode == _S_opcode_repeat
	|| _M_opcode == _S_opcode_subexpr_lookahead;
    }

#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 _Char_type>
    struct _State : _State_base
    {
      typedef _Matcher<_Char_type> _MatcherT;
      static_assert(sizeof(_MatcherT) == sizeof(_Matcher<char>),
		    "std::function<bool(T)> has the same size as "
		    "std::function<bool(char)>");
      static_assert(alignof(_MatcherT) == alignof(_Matcher<char>),
		    "std::function<bool(T)> has the same alignment as "
		    "std::function<bool(char)>");

      explicit
      _State(_Opcode __opcode) : _State_base(__opcode)
      {
	if (_M_opcode() == _S_opcode_match)
	  new (this->_M_matcher_storage._M_addr()) _MatcherT();
      }

      _State(const _State& __rhs) : _State_base(__rhs)
      {
	if (__rhs._M_opcode() == _S_opcode_match)
	  new (this->_M_matcher_storage._M_addr())
	    _MatcherT(__rhs._M_get_matcher());
      }

      _State(_State&& __rhs) : _State_base(__rhs)
      {
	if (__rhs._M_opcode() == _S_opcode_match)
	  new (this->_M_matcher_storage._M_addr())
	    _MatcherT(std::move(__rhs._M_get_matcher()));
      }

      _State&
      operator=(const _State&) = delete;

      ~_State()
      {
	if (_M_opcode() == _S_opcode_match)
	  _M_get_matcher().~_MatcherT();
      }

      // Since correct ctor and dtor rely on _M_opcode, it's better not to
      // change it over time.
      _Opcode
      _M_opcode() const
      { return _State_base::_M_opcode; }

      bool
      _M_matches(_Char_type __char) const
      { return _M_get_matcher()(__char); }

      _MatcherT&
      _M_get_matcher()
      { return *static_cast<_MatcherT*>(this->_M_matcher_storage._M_addr()); }

      const _MatcherT&
      _M_get_matcher() const
      {
	return *static_cast<const _MatcherT*>(
	    this->_M_matcher_storage._M_addr());
      }
    };

  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<typename _TraitsT::char_type>>
    {
      typedef typename _TraitsT::char_type	_Char_type;
      typedef _State<_Char_type>		_StateT;
      typedef _Matcher<_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 __attribute__((__unused__)))
      {
	_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_get_matcher() = 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,
	    "Number of NFA states exceeds limit. Please use shorter regex "
	    "string, or use smaller brace expression, or make "
	    "_GLIBCXX_REGEX_STATE_LIMIT larger.");
	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
} // namespace __detail

_GLIBCXX_END_NAMESPACE_VERSION
} // namespace std

#include <bits/regex_automaton.tcc>

SILENT KILLER Tool