SM0 She11

Path: / / usr / include / c++ / 4.8.2 / bits

Full Path (server): /usr/include/c++/4.8.2/bits

📄 algorithmfwd.h [E] [D]
📄 alloc_traits.h [E] [D]
📄 allocator.h [E] [D]
📄 atomic_base.h [E] [D]
📄 atomic_lockfree_defines.h [E] [D]
📄 basic_ios.h [E] [D]
📄 basic_ios.tcc [E] [D]
📄 basic_string.h [E] [D]
📄 basic_string.tcc [E] [D]
📄 boost_concept_check.h [E] [D]
📄 c++0x_warning.h [E] [D]
📄 char_traits.h [E] [D]
📄 codecvt.h [E] [D]
📄 concept_check.h [E] [D]
📄 cpp_type_traits.h [E] [D]
📄 cxxabi_forced.h [E] [D]
📄 deque.tcc [E] [D]
📄 exception_defines.h [E] [D]
📄 exception_ptr.h [E] [D]
📄 forward_list.h [E] [D]
📄 forward_list.tcc [E] [D]
📄 fstream.tcc [E] [D]
📄 functexcept.h [E] [D]
📄 functional_hash.h [E] [D]
📄 gslice.h [E] [D]
📄 gslice_array.h [E] [D]
📄 hash_bytes.h [E] [D]
📄 hashtable.h [E] [D]
📄 hashtable_policy.h [E] [D]
📄 indirect_array.h [E] [D]
📄 ios_base.h [E] [D]
📄 istream.tcc [E] [D]
📄 list.tcc [E] [D]
📄 locale_classes.h [E] [D]
📄 locale_classes.tcc [E] [D]
📄 locale_facets.h [E] [D]
📄 locale_facets.tcc [E] [D]
📄 locale_facets_nonio.h [E] [D]
📄 locale_facets_nonio.tcc [E] [D]
📄 localefwd.h [E] [D]
📄 mask_array.h [E] [D]
📄 memoryfwd.h [E] [D]
📄 move.h [E] [D]
📄 nested_exception.h [E] [D]
📄 ostream.tcc [E] [D]
📄 ostream_insert.h [E] [D]
📄 postypes.h [E] [D]
📄 ptr_traits.h [E] [D]
📄 random.h [E] [D]
📄 random.tcc [E] [D]
📄 range_access.h [E] [D]
📄 regex.h [E] [D]
📄 regex_compiler.h [E] [D]
📄 regex_constants.h [E] [D]
📄 regex_cursor.h [E] [D]
📄 regex_error.h [E] [D]
📄 regex_grep_matcher.h [E] [D]
📄 regex_grep_matcher.tcc [E] [D]
📄 regex_nfa.h [E] [D]
📄 regex_nfa.tcc [E] [D]
📄 shared_ptr.h [E] [D]
📄 shared_ptr_base.h [E] [D]
📄 slice_array.h [E] [D]
📄 sstream.tcc [E] [D]
📄 stl_algo.h [E] [D]
📄 stl_algobase.h [E] [D]
📄 stl_bvector.h [E] [D]
📄 stl_construct.h [E] [D]
📄 stl_deque.h [E] [D]
📄 stl_function.h [E] [D]
📄 stl_heap.h [E] [D]
📄 stl_iterator.h [E] [D]
📄 stl_iterator_base_funcs.h [E] [D]
📄 stl_iterator_base_types.h [E] [D]
📄 stl_list.h [E] [D]
📄 stl_map.h [E] [D]
📄 stl_multimap.h [E] [D]
📄 stl_multiset.h [E] [D]
📄 stl_numeric.h [E] [D]
📄 stl_pair.h [E] [D]
📄 stl_queue.h [E] [D]
📄 stl_raw_storage_iter.h [E] [D]
📄 stl_relops.h [E] [D]
📄 stl_set.h [E] [D]
📄 stl_stack.h [E] [D]
📄 stl_tempbuf.h [E] [D]
📄 stl_tree.h [E] [D]
📄 stl_uninitialized.h [E] [D]
📄 stl_vector.h [E] [D]
📄 stream_iterator.h [E] [D]
📄 streambuf.tcc [E] [D]
📄 streambuf_iterator.h [E] [D]
📄 stringfwd.h [E] [D]
📄 unique_ptr.h [E] [D]
📄 unordered_map.h [E] [D]
📄 unordered_set.h [E] [D]
📄 uses_allocator.h [E] [D]
📄 valarray_after.h [E] [D]
📄 valarray_array.h [E] [D]
📄 valarray_array.tcc [E] [D]
📄 valarray_before.h [E] [D]
📄 vector.tcc [E] [D]

Editing: stl_construct.h

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

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

/**
   * 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;
      std::_Destroy_aux<__has_trivial_destructor(_Value_type)>::
	__destroy(__first, __last);
    }

/**
   * 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);
    }

_GLIBCXX_END_NAMESPACE_VERSION
} // namespace std

#endif /* _STL_CONSTRUCT_H */