Geforce File Manager

NAME	SIZE	ACTIONS
📁 pb_ds		[ DEL ]
📄 algorithm	19,290 B	[ EDIT ] \| [ DEL ]
📄 aligned_buffer.h	3,972 B	[ EDIT ] \| [ DEL ]
📄 alloc_traits.h	5,702 B	[ EDIT ] \| [ DEL ]
📄 array_allocator.h	5,386 B	[ EDIT ] \| [ DEL ]
📄 atomicity.h	3,509 B	[ EDIT ] \| [ DEL ]
📄 bitmap_allocator.h	31,822 B	[ EDIT ] \| [ DEL ]
📄 cast.h	4,447 B	[ EDIT ] \| [ DEL ]
📄 cmath	6,570 B	[ EDIT ] \| [ DEL ]
📄 codecvt_specializations.h	16,353 B	[ EDIT ] \| [ DEL ]
📄 concurrence.h	7,611 B	[ EDIT ] \| [ DEL ]
📄 debug_allocator.h	5,716 B	[ EDIT ] \| [ DEL ]
📄 enc_filebuf.h	2,247 B	[ EDIT ] \| [ DEL ]
📄 extptr_allocator.h	6,189 B	[ EDIT ] \| [ DEL ]
📄 functional	14,292 B	[ EDIT ] \| [ DEL ]
📄 hash_map	17,775 B	[ EDIT ] \| [ DEL ]
📄 hash_set	17,195 B	[ EDIT ] \| [ DEL ]
📄 iterator	4,031 B	[ EDIT ] \| [ DEL ]
📄 malloc_allocator.h	5,086 B	[ EDIT ] \| [ DEL ]
📄 memory	7,156 B	[ EDIT ] \| [ DEL ]
📄 mt_allocator.h	23,507 B	[ EDIT ] \| [ DEL ]
📄 new_allocator.h	4,805 B	[ EDIT ] \| [ DEL ]
📄 numeric	4,731 B	[ EDIT ] \| [ DEL ]
📄 numeric_traits.h	4,575 B	[ EDIT ] \| [ DEL ]
📄 pod_char_traits.h	5,556 B	[ EDIT ] \| [ DEL ]
📄 pointer.h	19,827 B	[ EDIT ] \| [ DEL ]
📄 pool_allocator.h	8,821 B	[ EDIT ] \| [ DEL ]
📄 random	111,395 B	[ EDIT ] \| [ DEL ]
📄 random.tcc	60,247 B	[ EDIT ] \| [ DEL ]
📄 rb_tree	3,311 B	[ EDIT ] \| [ DEL ]
📄 rc_string_base.h	23,735 B	[ EDIT ] \| [ DEL ]
📄 rope	87,637 B	[ EDIT ] \| [ DEL ]
📄 ropeimpl.h	48,437 B	[ EDIT ] \| [ DEL ]
📄 slist	29,603 B	[ EDIT ] \| [ DEL ]
📄 sso_string_base.h	16,314 B	[ EDIT ] \| [ DEL ]
📄 stdio_filebuf.h	5,670 B	[ EDIT ] \| [ DEL ]
📄 stdio_sync_filebuf.h	8,782 B	[ EDIT ] \| [ DEL ]
📄 string_conversions.h	3,597 B	[ EDIT ] \| [ DEL ]
📄 throw_allocator.h	24,537 B	[ EDIT ] \| [ DEL ]
📄 type_traits.h	5,914 B	[ EDIT ] \| [ DEL ]
📄 typelist.h	16,480 B	[ EDIT ] \| [ DEL ]
📄 vstring.h	110,576 B	[ EDIT ] \| [ DEL ]
📄 vstring.tcc	23,614 B	[ EDIT ] \| [ DEL ]
📄 vstring_fwd.h	3,222 B	[ EDIT ] \| [ DEL ]
📄 vstring_util.h	5,767 B	[ EDIT ] \| [ DEL ]

[ CLOSE ]

EDIT: vstring_util.h

// Versatile string utility -*- C++ -*-

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

#ifndef _VSTRING_UTIL_H
#define _VSTRING_UTIL_H 1

#pragma GCC system_header

#include <ext/vstring_fwd.h>
#include <debug/debug.h>
#include <bits/stl_function.h>  // For less
#include <bits/functexcept.h>
#include <bits/localefwd.h>
#include <bits/ostream_insert.h>
#include <bits/stl_iterator.h>
#include <ext/numeric_traits.h>
#include <bits/move.h>
#include <bits/range_access.h>

namespace __gnu_cxx _GLIBCXX_VISIBILITY(default)
{
_GLIBCXX_BEGIN_NAMESPACE_VERSION

template<typename _CharT, typename _Traits, typename _Alloc>
    struct __vstring_utility
    {
      typedef typename _Alloc::template rebind<_CharT>::other _CharT_alloc_type;

typedef _Traits					    traits_type;
      typedef typename _Traits::char_type		    value_type;
      typedef typename _CharT_alloc_type::size_type	    size_type;
      typedef typename _CharT_alloc_type::difference_type   difference_type;
      typedef typename _CharT_alloc_type::pointer	    pointer;
      typedef typename _CharT_alloc_type::const_pointer	    const_pointer;

// For __sso_string.
      typedef __gnu_cxx::
      __normal_iterator<pointer, __gnu_cxx::
			__versa_string<_CharT, _Traits, _Alloc,
				       __sso_string_base> >
	__sso_iterator;
      typedef __gnu_cxx::
      __normal_iterator<const_pointer, __gnu_cxx::
			__versa_string<_CharT, _Traits, _Alloc,
				       __sso_string_base> >
	__const_sso_iterator;

// For __rc_string.
      typedef __gnu_cxx::
      __normal_iterator<pointer, __gnu_cxx::
			__versa_string<_CharT, _Traits, _Alloc,
				       __rc_string_base> >
	__rc_iterator;
      typedef __gnu_cxx::
      __normal_iterator<const_pointer, __gnu_cxx::
			__versa_string<_CharT, _Traits, _Alloc,
				       __rc_string_base> >
	__const_rc_iterator;

// NB:  When the allocator is empty, deriving from it saves space
      // (http://www.cantrip.org/emptyopt.html).
      template<typename _Alloc1>
	struct _Alloc_hider
	: public _Alloc1
	{
	  _Alloc_hider(_CharT* __ptr)
	  : _Alloc1(), _M_p(__ptr) { }

_Alloc_hider(const _Alloc1& __a, _CharT* __ptr)
	  : _Alloc1(__a), _M_p(__ptr) { }

_CharT*  _M_p; // The actual data.
	};

// When __n = 1 way faster than the general multichar
      // traits_type::copy/move/assign.
      static void
      _S_copy(_CharT* __d, const _CharT* __s, size_type __n)
      {
	if (__n == 1)
	  traits_type::assign(*__d, *__s);
	else
	  traits_type::copy(__d, __s, __n);
      }

static void
      _S_move(_CharT* __d, const _CharT* __s, size_type __n)
      {
	if (__n == 1)
	  traits_type::assign(*__d, *__s);
	else
	  traits_type::move(__d, __s, __n);
      }

static void
      _S_assign(_CharT* __d, size_type __n, _CharT __c)
      {
	if (__n == 1)
	  traits_type::assign(*__d, __c);
	else
	  traits_type::assign(__d, __n, __c);
      }

// _S_copy_chars is a separate template to permit specialization
      // to optimize for the common case of pointers as iterators.
      template<typename _Iterator>
	static void
	_S_copy_chars(_CharT* __p, _Iterator __k1, _Iterator __k2)
	{
	  for (; __k1 != __k2; ++__k1, ++__p)
	    traits_type::assign(*__p, *__k1); // These types are off.
	}

static void
      _S_copy_chars(_CharT* __p, __sso_iterator __k1, __sso_iterator __k2)
      { _S_copy_chars(__p, __k1.base(), __k2.base()); }

static void
      _S_copy_chars(_CharT* __p, __const_sso_iterator __k1,
		    __const_sso_iterator __k2)
      { _S_copy_chars(__p, __k1.base(), __k2.base()); }

static void
      _S_copy_chars(_CharT* __p, __rc_iterator __k1, __rc_iterator __k2)
      { _S_copy_chars(__p, __k1.base(), __k2.base()); }

static void
      _S_copy_chars(_CharT* __p, __const_rc_iterator __k1,
		    __const_rc_iterator __k2)
      { _S_copy_chars(__p, __k1.base(), __k2.base()); }

static void
      _S_copy_chars(_CharT* __p, _CharT* __k1, _CharT* __k2)
      { _S_copy(__p, __k1, __k2 - __k1); }

static void
      _S_copy_chars(_CharT* __p, const _CharT* __k1, const _CharT* __k2)
      { _S_copy(__p, __k1, __k2 - __k1); }

static int
      _S_compare(size_type __n1, size_type __n2)
      {
	const difference_type __d = difference_type(__n1 - __n2);

if (__d > __numeric_traits_integer<int>::__max)
	  return __numeric_traits_integer<int>::__max;
	else if (__d < __numeric_traits_integer<int>::__min)
	  return __numeric_traits_integer<int>::__min;
	else
	  return int(__d);
      }
    };

_GLIBCXX_END_NAMESPACE_VERSION
} // namespace

#endif /* _VSTRING_UTIL_H */