Gecko [ v99win.today ]

Name	Size	Permission
algorithmfwd.h	21.23 KB	-rw-r--r--
alloc_traits.h	20.98 KB	-rw-r--r--
allocated_ptr.h	3.22 KB	-rw-r--r--
allocator.h	7.76 KB	-rw-r--r--
atomic_base.h	24.41 KB	-rw-r--r--
atomic_futex.h	9.28 KB	-rw-r--r--
atomic_lockfree_defines.h	2.3 KB	-rw-r--r--
basic_ios.h	15.7 KB	-rw-r--r--
basic_ios.tcc	5.94 KB	-rw-r--r--
basic_string.h	241.46 KB	-rw-r--r--
basic_string.tcc	52.63 KB	-rw-r--r--
boost_concept_check.h	26.52 KB	-rw-r--r--
c++0x_warning.h	1.44 KB	-rw-r--r--
char_traits.h	24.23 KB	-rw-r--r--
codecvt.h	24.83 KB	-rw-r--r--
concept_check.h	3.34 KB	-rw-r--r--
cpp_type_traits.h	9.71 KB	-rw-r--r--
cxxabi_forced.h	1.77 KB	-rw-r--r--
cxxabi_init_exception.h	2.17 KB	-rw-r--r--
deque.tcc	33.6 KB	-rw-r--r--
enable_special_members.h	12.1 KB	-rw-r--r--
erase_if.h	1.99 KB	-rw-r--r--
exception.h	2.43 KB	-rw-r--r--
exception_defines.h	1.61 KB	-rw-r--r--
exception_ptr.h	6 KB	-rw-r--r--
forward_list.h	48.25 KB	-rw-r--r--
forward_list.tcc	13.69 KB	-rw-r--r--
fs_dir.h	14.81 KB	-rw-r--r--
fs_fwd.h	11.41 KB	-rw-r--r--
fs_ops.h	9.5 KB	-rw-r--r--
fs_path.h	36.07 KB	-rw-r--r--
fstream.tcc	32.87 KB	-rw-r--r--
functexcept.h	3.35 KB	-rw-r--r--
functional_hash.h	8.37 KB	-rw-r--r--
gslice.h	5.39 KB	-rw-r--r--
gslice_array.h	7.67 KB	-rw-r--r--
hash_bytes.h	2.1 KB	-rw-r--r--
hashtable.h	73.06 KB	-rw-r--r--
hashtable_policy.h	66.51 KB	-rw-r--r--
indirect_array.h	7.68 KB	-rw-r--r--
invoke.h	3.57 KB	-rw-r--r--
ios_base.h	30.7 KB	-rw-r--r--
istream.tcc	30.36 KB	-rw-r--r--
list.tcc	16.57 KB	-rw-r--r--
locale_classes.h	24.32 KB	-rw-r--r--
locale_classes.tcc	8.18 KB	-rw-r--r--
locale_conv.h	18.36 KB	-rw-r--r--
locale_facets.h	90.17 KB	-rw-r--r--
locale_facets.tcc	38.62 KB	-rw-r--r--
locale_facets_nonio.h	67.38 KB	-rw-r--r--
locale_facets_nonio.tcc	44.22 KB	-rw-r--r--
localefwd.h	5.8 KB	-rw-r--r--
mask_array.h	7.5 KB	-rw-r--r--
memoryfwd.h	2.4 KB	-rw-r--r--
move.h	6.38 KB	-rw-r--r--
nested_exception.h	4.69 KB	-rw-r--r--
node_handle.h	8.02 KB	-rw-r--r--
ostream.tcc	12.03 KB	-rw-r--r--
ostream_insert.h	3.91 KB	-rw-r--r--
parse_numbers.h	7.76 KB	-rw-r--r--
postypes.h	8.27 KB	-rw-r--r--
predefined_ops.h	8.87 KB	-rw-r--r--
ptr_traits.h	6.57 KB	-rw-r--r--
quoted_string.h	4.93 KB	-rw-r--r--
random.h	173.87 KB	-rw-r--r--
random.tcc	103.14 KB	-rw-r--r--
range_access.h	9.85 KB	-rw-r--r--
refwrap.h	12.62 KB	-rw-r--r--
regex.h	96.44 KB	-rw-r--r--
regex.tcc	16.19 KB	-rw-r--r--
regex_automaton.h	10.49 KB	-rw-r--r--
regex_automaton.tcc	7.54 KB	-rw-r--r--
regex_compiler.h	16.1 KB	-rw-r--r--
regex_compiler.tcc	18.49 KB	-rw-r--r--
regex_constants.h	14.36 KB	-rw-r--r--
regex_error.h	4.79 KB	-rw-r--r--
regex_executor.h	7.31 KB	-rw-r--r--
regex_executor.tcc	18.4 KB	-rw-r--r--
regex_scanner.h	6.92 KB	-rw-r--r--
regex_scanner.tcc	14.66 KB	-rw-r--r--
shared_ptr.h	23.73 KB	-rw-r--r--
shared_ptr_atomic.h	9.55 KB	-rw-r--r--
shared_ptr_base.h	52.59 KB	-rw-r--r--
slice_array.h	9.21 KB	-rw-r--r--
specfun.h	45.95 KB	-rw-r--r--
sstream.tcc	9.9 KB	-rw-r--r--
std_abs.h	3.3 KB	-rw-r--r--
std_function.h	23.01 KB	-rw-r--r--
std_mutex.h	4.66 KB	-rw-r--r--
stl_algo.h	210.37 KB	-rw-r--r--
stl_algobase.h	50.21 KB	-rw-r--r--
stl_bvector.h	33.09 KB	-rw-r--r--
stl_construct.h	7.22 KB	-rw-r--r--
stl_deque.h	78.24 KB	-rw-r--r--
stl_function.h	41.3 KB	-rw-r--r--
stl_heap.h	19.73 KB	-rw-r--r--
stl_iterator.h	41.75 KB	-rw-r--r--
stl_iterator_base_funcs.h	7.99 KB	-rw-r--r--
stl_iterator_base_types.h	8.48 KB	-rw-r--r--
stl_list.h	66.22 KB	-rw-r--r--
stl_map.h	52.24 KB	-rw-r--r--
stl_multimap.h	41.25 KB	-rw-r--r--
stl_multiset.h	35.63 KB	-rw-r--r--
stl_numeric.h	14.04 KB	-rw-r--r--
stl_pair.h	18.21 KB	-rw-r--r--
stl_queue.h	24 KB	-rw-r--r--
stl_raw_storage_iter.h	3.74 KB	-rw-r--r--
stl_relops.h	4.49 KB	-rw-r--r--
stl_set.h	35.93 KB	-rw-r--r--
stl_stack.h	11.94 KB	-rw-r--r--
stl_tempbuf.h	8.09 KB	-rw-r--r--
stl_tree.h	73.26 KB	-rw-r--r--
stl_uninitialized.h	30.72 KB	-rw-r--r--
stl_vector.h	63.45 KB	-rw-r--r--
stream_iterator.h	6.71 KB	-rw-r--r--
streambuf.tcc	4.81 KB	-rw-r--r--
streambuf_iterator.h	13.56 KB	-rw-r--r--
string_view.tcc	6.54 KB	-rw-r--r--
stringfwd.h	2.63 KB	-rw-r--r--
uniform_int_dist.h	10.01 KB	-rw-r--r--
unique_lock.h	5.96 KB	-rw-r--r--
unique_ptr.h	26.92 KB	-rw-r--r--
unordered_map.h	75.08 KB	-rw-r--r--
unordered_set.h	59.25 KB	-rw-r--r--
uses_allocator.h	6.66 KB	-rw-r--r--
valarray_after.h	22.3 KB	-rw-r--r--
valarray_array.h	20.8 KB	-rw-r--r--
valarray_array.tcc	7.08 KB	-rw-r--r--
valarray_before.h	18.69 KB	-rw-r--r--
vector.tcc	30.26 KB	-rw-r--r--

Code Editor : stl_construct.h

// nonstandard construct and destroy functions -*- C++ -*-

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

#ifndef _STL_CONSTRUCT_H
#define _STL_CONSTRUCT_H 1

#include <new>
#include <bits/move.h>
#include <ext/alloc_traits.h>

namespace std _GLIBCXX_VISIBILITY(default)
{
_GLIBCXX_BEGIN_NAMESPACE_VERSION

/**
   * Constructs an object in existing memory by invoking an allocated
   * object's constructor with an initializer.
   */
#if __cplusplus >= 201103L
  template<typename _T1, typename... _Args>
    inline void
    _Construct(_T1* __p, _Args&&... __args)
    { ::new(static_cast<void*>(__p)) _T1(std::forward<_Args>(__args)...); }
#else
  template<typename _T1, typename _T2>
    inline void
    _Construct(_T1* __p, const _T2& __value)
    {
      // _GLIBCXX_RESOLVE_LIB_DEFECTS
      // 402. wrong new expression in [some_]allocator::construct
      ::new(static_cast<void*>(__p)) _T1(__value);
    }
#endif

template<typename _T1>
    inline void
    _Construct_novalue(_T1* __p)
    { ::new(static_cast<void*>(__p)) _T1; }

/**
   * Destroy the object pointed to by a pointer type.
   */
  template<typename _Tp>
    inline void
    _Destroy(_Tp* __pointer)
    { __pointer->~_Tp(); }

template<bool>
    struct _Destroy_aux
    {
      template<typename _ForwardIterator>
        static void
        __destroy(_ForwardIterator __first, _ForwardIterator __last)
	{
	  for (; __first != __last; ++__first)
	    std::_Destroy(std::__addressof(*__first));
	}
    };

template<>
    struct _Destroy_aux<true>
    {
      template<typename _ForwardIterator>
        static void
        __destroy(_ForwardIterator, _ForwardIterator) { }
    };

/**
   * Destroy a range of objects.  If the value_type of the object has
   * a trivial destructor, the compiler should optimize all of this
   * away, otherwise the objects' destructors must be invoked.
   */
  template<typename _ForwardIterator>
    inline void
    _Destroy(_ForwardIterator __first, _ForwardIterator __last)
    {
      typedef typename iterator_traits<_ForwardIterator>::value_type
                       _Value_type;
#if __cplusplus >= 201103L
      // A deleted destructor is trivial, this ensures we reject such types:
      static_assert(is_destructible<_Value_type>::value,
		    "value type is destructible");
#endif
      std::_Destroy_aux<__has_trivial_destructor(_Value_type)>::
	__destroy(__first, __last);
    }

template<bool>
    struct _Destroy_n_aux
    {
      template<typename _ForwardIterator, typename _Size>
        static _ForwardIterator
        __destroy_n(_ForwardIterator __first, _Size __count)
	{
	  for (; __count > 0; (void)++__first, --__count)
	    std::_Destroy(std::__addressof(*__first));
	  return __first;
	}
    };

template<>
    struct _Destroy_n_aux<true>
    {
      template<typename _ForwardIterator, typename _Size>
        static _ForwardIterator
        __destroy_n(_ForwardIterator __first, _Size __count)
	{
	  std::advance(__first, __count);
	  return __first;
	}
    };

/**
   * Destroy a range of objects.  If the value_type of the object has
   * a trivial destructor, the compiler should optimize all of this
   * away, otherwise the objects' destructors must be invoked.
   */
  template<typename _ForwardIterator, typename _Size>
    inline _ForwardIterator
    _Destroy_n(_ForwardIterator __first, _Size __count)
    {
      typedef typename iterator_traits<_ForwardIterator>::value_type
                       _Value_type;
#if __cplusplus >= 201103L
      // A deleted destructor is trivial, this ensures we reject such types:
      static_assert(is_destructible<_Value_type>::value,
		    "value type is destructible");
#endif
      return std::_Destroy_n_aux<__has_trivial_destructor(_Value_type)>::
	__destroy_n(__first, __count);
    }

/**
   * Destroy a range of objects using the supplied allocator.  For
   * nondefault allocators we do not optimize away invocation of 
   * destroy() even if _Tp has a trivial destructor.
   */

template<typename _ForwardIterator, typename _Allocator>
    void
    _Destroy(_ForwardIterator __first, _ForwardIterator __last,
	     _Allocator& __alloc)
    {
      typedef __gnu_cxx::__alloc_traits<_Allocator> __traits;
      for (; __first != __last; ++__first)
	__traits::destroy(__alloc, std::__addressof(*__first));
    }

template<typename _ForwardIterator, typename _Tp>
    inline void
    _Destroy(_ForwardIterator __first, _ForwardIterator __last,
	     allocator<_Tp>&)
    {
      _Destroy(__first, __last);
    }

#if __cplusplus > 201402L
  template <typename _Tp>
    inline void
    destroy_at(_Tp* __location)
    {
      std::_Destroy(__location);
    }

template <typename _ForwardIterator>
    inline void
    destroy(_ForwardIterator __first, _ForwardIterator __last)
    {
      std::_Destroy(__first, __last);
    }

template <typename _ForwardIterator, typename _Size>
    inline _ForwardIterator
    destroy_n(_ForwardIterator __first, _Size __count)
    {
      return std::_Destroy_n(__first, __count);
    }
#endif

_GLIBCXX_END_NAMESPACE_VERSION
} // namespace std

#endif /* _STL_CONSTRUCT_H */

${this.title}

Code Editor : stl_construct.h