84 lines
2.7 KiB
C
84 lines
2.7 KiB
C
|
/*
|
||
|
Open Asset Import Library (assimp)
|
||
|
----------------------------------------------------------------------
|
||
|
|
||
|
Copyright (c) 2006-2019, assimp team
|
||
|
|
||
|
|
||
|
All rights reserved.
|
||
|
|
||
|
Redistribution and use of this software in source and binary forms,
|
||
|
with or without modification, are permitted provided that the
|
||
|
following conditions are met:
|
||
|
|
||
|
* Redistributions of source code must retain the above
|
||
|
copyright notice, this list of conditions and the
|
||
|
following disclaimer.
|
||
|
|
||
|
* Redistributions in binary form must reproduce the above
|
||
|
copyright notice, this list of conditions and the
|
||
|
following disclaimer in the documentation and/or other
|
||
|
materials provided with the distribution.
|
||
|
|
||
|
* Neither the name of the assimp team, nor the names of its
|
||
|
contributors may be used to endorse or promote products
|
||
|
derived from this software without specific prior
|
||
|
written permission of the assimp team.
|
||
|
|
||
|
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
||
|
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
||
|
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
||
|
A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
||
|
OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
||
|
SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
||
|
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
||
|
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
||
|
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
||
|
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
||
|
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
||
|
|
||
|
----------------------------------------------------------------------
|
||
|
*/
|
||
|
#pragma once
|
||
|
|
||
|
#ifndef MMD_CPP14_H
|
||
|
#define MMD_CPP14_H
|
||
|
|
||
|
#include <cstddef>
|
||
|
#include <memory>
|
||
|
#include <type_traits>
|
||
|
#include <utility>
|
||
|
|
||
|
namespace mmd {
|
||
|
template<class T> struct _Unique_if {
|
||
|
typedef std::unique_ptr<T> _Single_object;
|
||
|
};
|
||
|
|
||
|
template<class T> struct _Unique_if<T[]> {
|
||
|
typedef std::unique_ptr<T[]> _Unknown_bound;
|
||
|
};
|
||
|
|
||
|
template<class T, size_t N> struct _Unique_if<T[N]> {
|
||
|
typedef void _Known_bound;
|
||
|
};
|
||
|
|
||
|
template<class T, class... Args>
|
||
|
typename _Unique_if<T>::_Single_object
|
||
|
make_unique(Args&&... args) {
|
||
|
return std::unique_ptr<T>(new T(std::forward<Args>(args)...));
|
||
|
}
|
||
|
|
||
|
template<class T>
|
||
|
typename _Unique_if<T>::_Unknown_bound
|
||
|
make_unique(size_t n) {
|
||
|
typedef typename std::remove_extent<T>::type U;
|
||
|
return std::unique_ptr<T>(new U[n]());
|
||
|
}
|
||
|
|
||
|
template<class T, class... Args>
|
||
|
typename _Unique_if<T>::_Known_bound
|
||
|
make_unique(Args&&...) = delete;
|
||
|
}
|
||
|
|
||
|
#endif
|