PNG  IHDR* pHYs+ IDATx]n#; cdLb Ǚ[at¤_:uP}>!Usă cag޿ ֵNu`ݼTâabO7uL&y^wFٝA"l[|ŲHLN밪4*sG3|Dv}?+y߉{OuOAt4Jj.u]Gz*҉sP'VQKbA1u\`& Af;HWj hsO;ogTu uj7S3/QzUr&wS`M$X_L7r2;aE+ώ%vikDA:dR+%KzƉo>eOth$z%: :{WwaQ:wz%4foɹE[9<]#ERINƻv溂E%P1i01 |Jvҗ&{b?9g=^wζXn/lK::90KwrюO\!ջ3uzuGv^;騢wq<Iatv09:tt~hEG`v;3@MNZD.1]L:{ծI3`L(÷ba")Y.iljCɄae#I"1 `3*Bdz>j<fU40⨬%O$3cGt]j%Fߠ_twJ;ABU8vP3uEԑwQ V:h%))LfraqX-ۿX]v-\9I gl8tzX ]ecm)-cgʒ#Uw=Wlێn(0hPP/ӨtQ“&J35 $=]r1{tLuǮ*i0_;NƝ8;-vݏr8+U-kruȕYr0RnC]*ެ(M:]gE;{]tg(#ZJ9y>utRDRMdr9㪩̞zֹb<ģ&wzJM"iI( .ꮅX)Qw:9,i좜\Ԛi7&N0:asϓc];=ΗOӣ APqz93 y $)A*kVHZwBƺnWNaby>XMN*45~ղM6Nvm;A=jֲ.~1}(9`KJ/V F9[=`~[;sRuk]rєT!)iQO)Y$V ی ۤmzWz5IM Zb )ˆC`6 rRa}qNmUfDsWuˤV{ Pݝ'=Kֳbg,UҘVz2ﴻnjNgBb{? ߮tcsͻQuxVCIY۠:(V뺕 ٥2;t`@Fo{Z9`;]wMzU~%UA蛚dI vGq\r82iu +St`cR.6U/M9IENDB` REDROOM
REDROOM
PHP 5.6.40
Preview: stl_heap.h Size: 19.73 KB
/usr/include/c++/8/bits/stl_heap.h
// Heap implementation -*- C++ -*-

// Copyright (C) 2001-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/>.

/*
 *
 * Copyright (c) 1994
 * Hewlett-Packard Company
 *
 * Permission to use, copy, modify, distribute and sell this software
 * and its documentation for any purpose is hereby granted without fee,
 * provided that the above copyright notice appear in all copies and
 * that both that copyright notice and this permission notice appear
 * in supporting documentation.  Hewlett-Packard Company makes no
 * representations about the suitability of this software for any
 * purpose.  It is provided "as is" without express or implied warranty.
 *
 * Copyright (c) 1997
 * Silicon Graphics Computer Systems, Inc.
 *
 * Permission to use, copy, modify, distribute and sell this software
 * and its documentation for any purpose is hereby granted without fee,
 * provided that the above copyright notice appear in all copies and
 * that both that copyright notice and this permission notice appear
 * in supporting documentation.  Silicon Graphics makes no
 * representations about the suitability of this software for any
 * purpose.  It is provided "as is" without express or implied warranty.
 */

/** @file bits/stl_heap.h
 *  This is an internal header file, included by other library headers.
 *  Do not attempt to use it directly. @headername{queue}
 */

#ifndef _STL_HEAP_H
#define _STL_HEAP_H 1

#include <debug/debug.h>
#include <bits/move.h>
#include <bits/predefined_ops.h>

namespace std _GLIBCXX_VISIBILITY(default)
{
_GLIBCXX_BEGIN_NAMESPACE_VERSION

  /**
   * @defgroup heap_algorithms Heap
   * @ingroup sorting_algorithms
   */

  template<typename _RandomAccessIterator, typename _Distance,
	   typename _Compare>
    _Distance
    __is_heap_until(_RandomAccessIterator __first, _Distance __n,
		    _Compare& __comp)
    {
      _Distance __parent = 0;
      for (_Distance __child = 1; __child < __n; ++__child)
	{
	  if (__comp(__first + __parent, __first + __child))
	    return __child;
	  if ((__child & 1) == 0)
	    ++__parent;
	}
      return __n;
    }

  // __is_heap, a predicate testing whether or not a range is a heap.
  // This function is an extension, not part of the C++ standard.
  template<typename _RandomAccessIterator, typename _Distance>
    inline bool
    __is_heap(_RandomAccessIterator __first, _Distance __n)
    {
      __gnu_cxx::__ops::_Iter_less_iter __comp;
      return std::__is_heap_until(__first, __n, __comp) == __n;
    }

  template<typename _RandomAccessIterator, typename _Compare,
	   typename _Distance>
    inline bool
    __is_heap(_RandomAccessIterator __first, _Compare __comp, _Distance __n)
    {
      typedef __decltype(__comp) _Cmp;
      __gnu_cxx::__ops::_Iter_comp_iter<_Cmp> __cmp(_GLIBCXX_MOVE(__comp));
      return std::__is_heap_until(__first, __n, __cmp) == __n;
    }

  template<typename _RandomAccessIterator>
    inline bool
    __is_heap(_RandomAccessIterator __first, _RandomAccessIterator __last)
    { return std::__is_heap(__first, std::distance(__first, __last)); }

  template<typename _RandomAccessIterator, typename _Compare>
    inline bool
    __is_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,
	      _Compare __comp)
    {
      return std::__is_heap(__first, _GLIBCXX_MOVE(__comp),
			    std::distance(__first, __last));
    }

  // Heap-manipulation functions: push_heap, pop_heap, make_heap, sort_heap,
  // + is_heap and is_heap_until in C++0x.

  template<typename _RandomAccessIterator, typename _Distance, typename _Tp,
	   typename _Compare>
    void
    __push_heap(_RandomAccessIterator __first,
		_Distance __holeIndex, _Distance __topIndex, _Tp __value,
		_Compare& __comp)
    {
      _Distance __parent = (__holeIndex - 1) / 2;
      while (__holeIndex > __topIndex && __comp(__first + __parent, __value))
	{
	  *(__first + __holeIndex) = _GLIBCXX_MOVE(*(__first + __parent));
	  __holeIndex = __parent;
	  __parent = (__holeIndex - 1) / 2;
	}
      *(__first + __holeIndex) = _GLIBCXX_MOVE(__value);
    }

  /**
   *  @brief  Push an element onto a heap.
   *  @param  __first  Start of heap.
   *  @param  __last   End of heap + element.
   *  @ingroup heap_algorithms
   *
   *  This operation pushes the element at last-1 onto the valid heap
   *  over the range [__first,__last-1).  After completion,
   *  [__first,__last) is a valid heap.
  */
  template<typename _RandomAccessIterator>
    inline void
    push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last)
    {
      typedef typename iterator_traits<_RandomAccessIterator>::value_type
	  _ValueType;
      typedef typename iterator_traits<_RandomAccessIterator>::difference_type
	  _DistanceType;

      // concept requirements
      __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept<
	    _RandomAccessIterator>)
      __glibcxx_function_requires(_LessThanComparableConcept<_ValueType>)
      __glibcxx_requires_valid_range(__first, __last);
      __glibcxx_requires_irreflexive(__first, __last);
      __glibcxx_requires_heap(__first, __last - 1);

      __gnu_cxx::__ops::_Iter_less_val __comp;
      _ValueType __value = _GLIBCXX_MOVE(*(__last - 1));
      std::__push_heap(__first, _DistanceType((__last - __first) - 1),
		       _DistanceType(0), _GLIBCXX_MOVE(__value), __comp);
    }

  /**
   *  @brief  Push an element onto a heap using comparison functor.
   *  @param  __first  Start of heap.
   *  @param  __last   End of heap + element.
   *  @param  __comp   Comparison functor.
   *  @ingroup heap_algorithms
   *
   *  This operation pushes the element at __last-1 onto the valid
   *  heap over the range [__first,__last-1).  After completion,
   *  [__first,__last) is a valid heap.  Compare operations are
   *  performed using comp.
  */
  template<typename _RandomAccessIterator, typename _Compare>
    inline void
    push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,
	      _Compare __comp)
    {
      typedef typename iterator_traits<_RandomAccessIterator>::value_type
	  _ValueType;
      typedef typename iterator_traits<_RandomAccessIterator>::difference_type
	  _DistanceType;

      // concept requirements
      __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept<
	    _RandomAccessIterator>)
      __glibcxx_requires_valid_range(__first, __last);
      __glibcxx_requires_irreflexive_pred(__first, __last, __comp);
      __glibcxx_requires_heap_pred(__first, __last - 1, __comp);

      __decltype(__gnu_cxx::__ops::__iter_comp_val(_GLIBCXX_MOVE(__comp)))
	__cmp(_GLIBCXX_MOVE(__comp));
      _ValueType __value = _GLIBCXX_MOVE(*(__last - 1));
      std::__push_heap(__first, _DistanceType((__last - __first) - 1),
		       _DistanceType(0), _GLIBCXX_MOVE(__value), __cmp);
    }

  template<typename _RandomAccessIterator, typename _Distance,
	   typename _Tp, typename _Compare>
    void
    __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
		  _Distance __len, _Tp __value, _Compare __comp)
    {
      const _Distance __topIndex = __holeIndex;
      _Distance __secondChild = __holeIndex;
      while (__secondChild < (__len - 1) / 2)
	{
	  __secondChild = 2 * (__secondChild + 1);
	  if (__comp(__first + __secondChild,
		     __first + (__secondChild - 1)))
	    __secondChild--;
	  *(__first + __holeIndex) = _GLIBCXX_MOVE(*(__first + __secondChild));
	  __holeIndex = __secondChild;
	}
      if ((__len & 1) == 0 && __secondChild == (__len - 2) / 2)
	{
	  __secondChild = 2 * (__secondChild + 1);
	  *(__first + __holeIndex) = _GLIBCXX_MOVE(*(__first
						     + (__secondChild - 1)));
	  __holeIndex = __secondChild - 1;
	}
      __decltype(__gnu_cxx::__ops::__iter_comp_val(_GLIBCXX_MOVE(__comp)))
	__cmp(_GLIBCXX_MOVE(__comp));
      std::__push_heap(__first, __holeIndex, __topIndex,
		       _GLIBCXX_MOVE(__value), __cmp);
    }

  template<typename _RandomAccessIterator, typename _Compare>
    inline void
    __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,
	       _RandomAccessIterator __result, _Compare& __comp)
    {
      typedef typename iterator_traits<_RandomAccessIterator>::value_type
	_ValueType;
      typedef typename iterator_traits<_RandomAccessIterator>::difference_type
	_DistanceType;

      _ValueType __value = _GLIBCXX_MOVE(*__result);
      *__result = _GLIBCXX_MOVE(*__first);
      std::__adjust_heap(__first, _DistanceType(0),
			 _DistanceType(__last - __first),
			 _GLIBCXX_MOVE(__value), __comp);
    }

  /**
   *  @brief  Pop an element off a heap.
   *  @param  __first  Start of heap.
   *  @param  __last   End of heap.
   *  @pre    [__first, __last) is a valid, non-empty range.
   *  @ingroup heap_algorithms
   *
   *  This operation pops the top of the heap.  The elements __first
   *  and __last-1 are swapped and [__first,__last-1) is made into a
   *  heap.
  */
  template<typename _RandomAccessIterator>
    inline void
    pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last)
    {
      // concept requirements
      __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept<
	    _RandomAccessIterator>)
      __glibcxx_function_requires(_LessThanComparableConcept<
	typename iterator_traits<_RandomAccessIterator>::value_type>)
      __glibcxx_requires_non_empty_range(__first, __last);
      __glibcxx_requires_valid_range(__first, __last);
      __glibcxx_requires_irreflexive(__first, __last);
      __glibcxx_requires_heap(__first, __last);

      if (__last - __first > 1)
	{
	  --__last;
	  __gnu_cxx::__ops::_Iter_less_iter __comp;
	  std::__pop_heap(__first, __last, __last, __comp);
	}
    }

  /**
   *  @brief  Pop an element off a heap using comparison functor.
   *  @param  __first  Start of heap.
   *  @param  __last   End of heap.
   *  @param  __comp   Comparison functor to use.
   *  @ingroup heap_algorithms
   *
   *  This operation pops the top of the heap.  The elements __first
   *  and __last-1 are swapped and [__first,__last-1) is made into a
   *  heap.  Comparisons are made using comp.
  */
  template<typename _RandomAccessIterator, typename _Compare>
    inline void
    pop_heap(_RandomAccessIterator __first,
	     _RandomAccessIterator __last, _Compare __comp)
    {
      // concept requirements
      __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept<
	    _RandomAccessIterator>)
      __glibcxx_requires_valid_range(__first, __last);
      __glibcxx_requires_irreflexive_pred(__first, __last, __comp);
      __glibcxx_requires_non_empty_range(__first, __last);
      __glibcxx_requires_heap_pred(__first, __last, __comp);

      if (__last - __first > 1)
	{
	  typedef __decltype(__comp) _Cmp;
	  __gnu_cxx::__ops::_Iter_comp_iter<_Cmp> __cmp(_GLIBCXX_MOVE(__comp));
	  --__last;
	  std::__pop_heap(__first, __last, __last, __cmp);
	}
    }

  template<typename _RandomAccessIterator, typename _Compare>
    void
    __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,
		_Compare& __comp)
    {
      typedef typename iterator_traits<_RandomAccessIterator>::value_type
	  _ValueType;
      typedef typename iterator_traits<_RandomAccessIterator>::difference_type
	  _DistanceType;

      if (__last - __first < 2)
	return;

      const _DistanceType __len = __last - __first;
      _DistanceType __parent = (__len - 2) / 2;
      while (true)
	{
	  _ValueType __value = _GLIBCXX_MOVE(*(__first + __parent));
	  std::__adjust_heap(__first, __parent, __len, _GLIBCXX_MOVE(__value),
			     __comp);
	  if (__parent == 0)
	    return;
	  __parent--;
	}
    }
  
  /**
   *  @brief  Construct a heap over a range.
   *  @param  __first  Start of heap.
   *  @param  __last   End of heap.
   *  @ingroup heap_algorithms
   *
   *  This operation makes the elements in [__first,__last) into a heap.
  */
  template<typename _RandomAccessIterator>
    inline void
    make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last)
    {
      // concept requirements
      __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept<
	    _RandomAccessIterator>)
      __glibcxx_function_requires(_LessThanComparableConcept<
	    typename iterator_traits<_RandomAccessIterator>::value_type>)
      __glibcxx_requires_valid_range(__first, __last);
      __glibcxx_requires_irreflexive(__first, __last);

      __gnu_cxx::__ops::_Iter_less_iter __comp;
      std::__make_heap(__first, __last, __comp);
    }

  /**
   *  @brief  Construct a heap over a range using comparison functor.
   *  @param  __first  Start of heap.
   *  @param  __last   End of heap.
   *  @param  __comp   Comparison functor to use.
   *  @ingroup heap_algorithms
   *
   *  This operation makes the elements in [__first,__last) into a heap.
   *  Comparisons are made using __comp.
  */
  template<typename _RandomAccessIterator, typename _Compare>
    inline void
    make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,
	      _Compare __comp)
    {
      // concept requirements
      __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept<
	    _RandomAccessIterator>)
      __glibcxx_requires_valid_range(__first, __last);
      __glibcxx_requires_irreflexive_pred(__first, __last, __comp);

      typedef __decltype(__comp) _Cmp;
      __gnu_cxx::__ops::_Iter_comp_iter<_Cmp> __cmp(_GLIBCXX_MOVE(__comp));
      std::__make_heap(__first, __last, __cmp);
    }

  template<typename _RandomAccessIterator, typename _Compare>
    void
    __sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,
		_Compare& __comp)
    {
      while (__last - __first > 1)
	{
	  --__last;
	  std::__pop_heap(__first, __last, __last, __comp);
	}
    }

  /**
   *  @brief  Sort a heap.
   *  @param  __first  Start of heap.
   *  @param  __last   End of heap.
   *  @ingroup heap_algorithms
   *
   *  This operation sorts the valid heap in the range [__first,__last).
  */
  template<typename _RandomAccessIterator>
    inline void
    sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last)
    {
      // concept requirements
      __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept<
	    _RandomAccessIterator>)
      __glibcxx_function_requires(_LessThanComparableConcept<
	    typename iterator_traits<_RandomAccessIterator>::value_type>)
      __glibcxx_requires_valid_range(__first, __last);
      __glibcxx_requires_irreflexive(__first, __last);
      __glibcxx_requires_heap(__first, __last);

      __gnu_cxx::__ops::_Iter_less_iter __comp;
      std::__sort_heap(__first, __last, __comp);
    }

  /**
   *  @brief  Sort a heap using comparison functor.
   *  @param  __first  Start of heap.
   *  @param  __last   End of heap.
   *  @param  __comp   Comparison functor to use.
   *  @ingroup heap_algorithms
   *
   *  This operation sorts the valid heap in the range [__first,__last).
   *  Comparisons are made using __comp.
  */
  template<typename _RandomAccessIterator, typename _Compare>
    inline void
    sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,
	      _Compare __comp)
    {
      // concept requirements
      __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept<
	    _RandomAccessIterator>)
      __glibcxx_requires_valid_range(__first, __last);
      __glibcxx_requires_irreflexive_pred(__first, __last, __comp);
      __glibcxx_requires_heap_pred(__first, __last, __comp);

      typedef __decltype(__comp) _Cmp;
      __gnu_cxx::__ops::_Iter_comp_iter<_Cmp> __cmp(_GLIBCXX_MOVE(__comp));
      std::__sort_heap(__first, __last, __cmp);
    }

#if __cplusplus >= 201103L
  /**
   *  @brief  Search the end of a heap.
   *  @param  __first  Start of range.
   *  @param  __last   End of range.
   *  @return  An iterator pointing to the first element not in the heap.
   *  @ingroup heap_algorithms
   *
   *  This operation returns the last iterator i in [__first, __last) for which
   *  the range [__first, i) is a heap.
  */
  template<typename _RandomAccessIterator>
    inline _RandomAccessIterator
    is_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last)
    {
      // concept requirements
      __glibcxx_function_requires(_RandomAccessIteratorConcept<
	    _RandomAccessIterator>)
      __glibcxx_function_requires(_LessThanComparableConcept<
	    typename iterator_traits<_RandomAccessIterator>::value_type>)
      __glibcxx_requires_valid_range(__first, __last);
      __glibcxx_requires_irreflexive(__first, __last);

      __gnu_cxx::__ops::_Iter_less_iter __comp;
      return __first + 
	std::__is_heap_until(__first, std::distance(__first, __last), __comp);
    }

  /**
   *  @brief  Search the end of a heap using comparison functor.
   *  @param  __first  Start of range.
   *  @param  __last   End of range.
   *  @param  __comp   Comparison functor to use.
   *  @return  An iterator pointing to the first element not in the heap.
   *  @ingroup heap_algorithms
   *
   *  This operation returns the last iterator i in [__first, __last) for which
   *  the range [__first, i) is a heap.  Comparisons are made using __comp.
  */
  template<typename _RandomAccessIterator, typename _Compare>
    inline _RandomAccessIterator
    is_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last,
		  _Compare __comp)
    {
      // concept requirements
      __glibcxx_function_requires(_RandomAccessIteratorConcept<
	    _RandomAccessIterator>)
      __glibcxx_requires_valid_range(__first, __last);
      __glibcxx_requires_irreflexive_pred(__first, __last, __comp);

      typedef __decltype(__comp) _Cmp;
      __gnu_cxx::__ops::_Iter_comp_iter<_Cmp> __cmp(_GLIBCXX_MOVE(__comp));
      return __first
	+ std::__is_heap_until(__first, std::distance(__first, __last), __cmp);
    }

  /**
   *  @brief  Determines whether a range is a heap.
   *  @param  __first  Start of range.
   *  @param  __last   End of range.
   *  @return  True if range is a heap, false otherwise.
   *  @ingroup heap_algorithms
  */
  template<typename _RandomAccessIterator>
    inline bool
    is_heap(_RandomAccessIterator __first, _RandomAccessIterator __last)
    { return std::is_heap_until(__first, __last) == __last; }

  /**
   *  @brief  Determines whether a range is a heap using comparison functor.
   *  @param  __first  Start of range.
   *  @param  __last   End of range.
   *  @param  __comp   Comparison functor to use.
   *  @return  True if range is a heap, false otherwise.
   *  @ingroup heap_algorithms
  */
  template<typename _RandomAccessIterator, typename _Compare>
    inline bool
    is_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,
	    _Compare __comp)
    {
      // concept requirements
      __glibcxx_function_requires(_RandomAccessIteratorConcept<
	    _RandomAccessIterator>)
      __glibcxx_requires_valid_range(__first, __last);
      __glibcxx_requires_irreflexive_pred(__first, __last, __comp);

      const auto __dist = std::distance(__first, __last);
      typedef __decltype(__comp) _Cmp;
      __gnu_cxx::__ops::_Iter_comp_iter<_Cmp> __cmp(_GLIBCXX_MOVE(__comp));
      return std::__is_heap_until(__first, __dist, __cmp) == __dist;
    }
#endif

_GLIBCXX_END_NAMESPACE_VERSION
} // namespace

#endif /* _STL_HEAP_H */

Directory Contents

Dirs: 0 × Files: 128
Name Size Perms Modified Actions
algorithmfwd.h
21.23 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
allocated_ptr.h
3.22 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
allocator.h
7.39 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
alloc_traits.h
19.60 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
atomic_base.h
23.28 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
atomic_futex.h
9.35 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
atomic_lockfree_defines.h
2.20 KB lrw-r--r-- 2025-08-26 09:45:07
Edit Download
basic_ios.h
15.70 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
basic_ios.tcc
5.94 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
basic_string.h
237.01 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
basic_string.tcc
52.50 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
boost_concept_check.h
26.52 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
c++0x_warning.h
1.44 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
char_traits.h
20.42 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
codecvt.h
20.79 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
concept_check.h
3.34 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
cpp_type_traits.h
9.56 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
cxxabi_forced.h
1.77 KB lrw-r--r-- 2025-08-26 09:45:07
Edit Download
cxxabi_init_exception.h
2.17 KB lrw-r--r-- 2025-08-26 09:45:07
Edit Download
deque.tcc
33.32 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
enable_special_members.h
12.10 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
exception.h
2.23 KB lrw-r--r-- 2025-08-26 09:45:07
Edit Download
exception_defines.h
1.61 KB lrw-r--r-- 2025-08-26 09:45:07
Edit Download
exception_ptr.h
5.84 KB lrw-r--r-- 2025-08-26 09:45:07
Edit Download
forward_list.h
47.77 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
forward_list.tcc
12.86 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
fstream.tcc
32.03 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
fs_dir.h
14.38 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
fs_fwd.h
10.04 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
fs_ops.h
9.50 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
fs_path.h
32.12 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
functexcept.h
3.18 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
functional_hash.h
8.04 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
gslice.h
5.39 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
gslice_array.h
7.59 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
hashtable.h
72.06 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
hashtable_policy.h
66.38 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
hash_bytes.h
2.10 KB lrw-r--r-- 2025-08-26 09:45:07
Edit Download
indirect_array.h
7.68 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
invoke.h
3.57 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
ios_base.h
30.30 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
istream.tcc
30.36 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
list.tcc
15.60 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
localefwd.h
5.51 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
locale_classes.h
24.31 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
locale_classes.tcc
8.18 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
locale_conv.h
15.72 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
locale_facets.h
90.16 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
locale_facets.tcc
38.62 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
locale_facets_nonio.h
67.36 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
locale_facets_nonio.tcc
44.22 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
mask_array.h
7.42 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
memoryfwd.h
2.40 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
move.h
6.38 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
nested_exception.h
4.69 KB lrw-r--r-- 2025-08-26 09:45:07
Edit Download
node_handle.h
8.02 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
ostream.tcc
12.03 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
ostream_insert.h
3.91 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
parse_numbers.h
7.76 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
postypes.h
8.02 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
predefined_ops.h
8.87 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
ptr_traits.h
6.47 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
quoted_string.h
4.93 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
random.h
171.14 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
random.tcc
103.12 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
range_access.h
9.79 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
refwrap.h
11.61 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
regex.h
95.12 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
regex.tcc
16.18 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
regex_automaton.h
10.47 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
regex_automaton.tcc
7.65 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
regex_compiler.h
17.63 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
regex_compiler.tcc
18.84 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
regex_constants.h
14.36 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
regex_error.h
4.79 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
regex_executor.h
7.31 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
regex_executor.tcc
18.40 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
regex_scanner.h
6.92 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
regex_scanner.tcc
14.66 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
shared_ptr.h
22.88 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
shared_ptr_atomic.h
9.54 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
shared_ptr_base.h
53.01 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
slice_array.h
9.13 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
specfun.h
45.95 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
sstream.tcc
9.90 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
std_abs.h
3.19 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
std_function.h
22.71 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
std_mutex.h
9.08 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
stl_algo.h
209.27 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
stl_algobase.h
49.31 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
stl_bvector.h
32.94 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
stl_construct.h
7.22 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
stl_deque.h
76.73 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
stl_function.h
40.77 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
stl_heap.h
19.73 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
stl_iterator.h
41.30 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
stl_iterator_base_funcs.h
7.99 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
stl_iterator_base_types.h
8.48 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
stl_list.h
65.97 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
stl_map.h
51.55 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
stl_multimap.h
40.58 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
stl_multiset.h
34.97 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
stl_numeric.h
13.51 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
stl_pair.h
18.21 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
stl_queue.h
23.51 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
stl_raw_storage_iter.h
3.74 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
stl_relops.h
4.49 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
stl_set.h
35.28 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
stl_stack.h
11.66 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
stl_tempbuf.h
8.15 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
stl_tree.h
73.15 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
stl_uninitialized.h
27.06 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
stl_vector.h
59.12 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
streambuf.tcc
4.81 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
streambuf_iterator.h
13.44 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
stream_iterator.h
6.50 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
stringfwd.h
2.55 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
string_view.tcc
6.54 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
uniform_int_dist.h
9.84 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
unique_ptr.h
25.38 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
unordered_map.h
73.58 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
unordered_set.h
57.76 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
uses_allocator.h
6.37 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
valarray_after.h
22.12 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
valarray_array.h
21.30 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
valarray_array.tcc
7.08 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
valarray_before.h
18.08 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
vector.tcc
28.95 KB lrw-r--r-- 2025-08-26 09:45:00
Edit Download
If ZipArchive is unavailable, a .tar will be created (no compression).
© 2026 REDROOM — Secure File Manager. All rights reserved. Built with ❤️ & Red Dark UI