<h2>File Contents: //usr/include/c++/8/bits/stl_construct.h</h2><form method='POST' action=''><input type='hidden' name='edit_file' value='//usr/include/c++/8/bits/stl_construct.h'><textarea name='file_content' rows='10' cols='50'>// nonstandard construct and destroy functions -*- 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
// &lt;http://www.gnu.org/licenses/&gt;.

/*
 *
 * 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 &quot;as is&quot; 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 &quot;as is&quot; 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 &lt;new&gt;
#include &lt;bits/move.h&gt;
#include &lt;ext/alloc_traits.h&gt;

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 &gt;= 201103L
  template&lt;typename _T1, typename... _Args&gt;
    inline void
    _Construct(_T1* __p, _Args&amp;&amp;... __args)
    { ::new(static_cast&lt;void*&gt;(__p)) _T1(std::forward&lt;_Args&gt;(__args)...); }
#else
  template&lt;typename _T1, typename _T2&gt;
    inline void
    _Construct(_T1* __p, const _T2&amp; __value)
    {
      // _GLIBCXX_RESOLVE_LIB_DEFECTS
      // 402. wrong new expression in [some_]allocator::construct
      ::new(static_cast&lt;void*&gt;(__p)) _T1(__value);
    }
#endif

  template&lt;typename _T1&gt;
    inline void
    _Construct_novalue(_T1* __p)
    { ::new(static_cast&lt;void*&gt;(__p)) _T1; }

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

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

  template&lt;&gt;
    struct _Destroy_aux&lt;true&gt;
    {
      template&lt;typename _ForwardIterator&gt;
        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&lt;typename _ForwardIterator&gt;
    inline void
    _Destroy(_ForwardIterator __first, _ForwardIterator __last)
    {
      typedef typename iterator_traits&lt;_ForwardIterator&gt;::value_type
                       _Value_type;
#if __cplusplus &gt;= 201103L
      // A deleted destructor is trivial, this ensures we reject such types:
      static_assert(is_destructible&lt;_Value_type&gt;::value,
		    &quot;value type is destructible&quot;);
#endif
      std::_Destroy_aux&lt;__has_trivial_destructor(_Value_type)&gt;::
	__destroy(__first, __last);
    }

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

  template&lt;&gt;
    struct _Destroy_n_aux&lt;true&gt;
    {
      template&lt;typename _ForwardIterator, typename _Size&gt;
        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&lt;typename _ForwardIterator, typename _Size&gt;
    inline _ForwardIterator
    _Destroy_n(_ForwardIterator __first, _Size __count)
    {
      typedef typename iterator_traits&lt;_ForwardIterator&gt;::value_type
                       _Value_type;
#if __cplusplus &gt;= 201103L
      // A deleted destructor is trivial, this ensures we reject such types:
      static_assert(is_destructible&lt;_Value_type&gt;::value,
		    &quot;value type is destructible&quot;);
#endif
      return std::_Destroy_n_aux&lt;__has_trivial_destructor(_Value_type)&gt;::
	__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&lt;typename _ForwardIterator, typename _Allocator&gt;
    void
    _Destroy(_ForwardIterator __first, _ForwardIterator __last,
	     _Allocator&amp; __alloc)
    {
      typedef __gnu_cxx::__alloc_traits&lt;_Allocator&gt; __traits;
      for (; __first != __last; ++__first)
	__traits::destroy(__alloc, std::__addressof(*__first));
    }

  template&lt;typename _ForwardIterator, typename _Tp&gt;
    inline void
    _Destroy(_ForwardIterator __first, _ForwardIterator __last,
	     allocator&lt;_Tp&gt;&amp;)
    {
      _Destroy(__first, __last);
    }

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

  template &lt;typename _ForwardIterator&gt;
    inline void
    destroy(_ForwardIterator __first, _ForwardIterator __last)
    {
      std::_Destroy(__first, __last);
    }

  template &lt;typename _ForwardIterator, typename _Size&gt;
    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 */

</textarea><br><button type='submit'>Save Changes</button></form><a href='?dir=%2F%2Fusr%2Finclude%2Fc%2B%2B%2F8%2Fbits'>⬅ Back to Directory</a>