da1f80c1f2
This reverts commit 78b22393a8.
It caused a regression in FBX import leading to crashes.
Fixes #36908.
138 lines
4.4 KiB
C++
138 lines
4.4 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 AI_GENERIC_PROPERTY_H_INCLUDED
|
|
#define AI_GENERIC_PROPERTY_H_INCLUDED
|
|
|
|
#ifdef __GNUC__
|
|
# pragma GCC system_header
|
|
#endif
|
|
|
|
#include <assimp/Importer.hpp>
|
|
#include <assimp/ai_assert.h>
|
|
#include <assimp/Hash.h>
|
|
|
|
#include <map>
|
|
|
|
// ------------------------------------------------------------------------------------------------
|
|
template <class T>
|
|
inline
|
|
bool SetGenericProperty(std::map< unsigned int, T >& list,
|
|
const char* szName, const T& value) {
|
|
ai_assert(nullptr != szName);
|
|
const uint32_t hash = SuperFastHash(szName);
|
|
|
|
typename std::map<unsigned int, T>::iterator it = list.find(hash);
|
|
if (it == list.end()) {
|
|
list.insert(std::pair<unsigned int, T>( hash, value ));
|
|
return false;
|
|
}
|
|
(*it).second = value;
|
|
|
|
return true;
|
|
}
|
|
|
|
// ------------------------------------------------------------------------------------------------
|
|
template <class T>
|
|
inline
|
|
const T& GetGenericProperty(const std::map< unsigned int, T >& list,
|
|
const char* szName, const T& errorReturn) {
|
|
ai_assert(nullptr != szName);
|
|
const uint32_t hash = SuperFastHash(szName);
|
|
|
|
typename std::map<unsigned int, T>::const_iterator it = list.find(hash);
|
|
if (it == list.end()) {
|
|
return errorReturn;
|
|
}
|
|
|
|
return (*it).second;
|
|
}
|
|
|
|
// ------------------------------------------------------------------------------------------------
|
|
// Special version for pointer types - they will be deleted when replaced with another value
|
|
// passing NULL removes the whole property
|
|
template <class T>
|
|
inline
|
|
void SetGenericPropertyPtr(std::map< unsigned int, T* >& list,
|
|
const char* szName, T* value, bool* bWasExisting = nullptr ) {
|
|
ai_assert(nullptr != szName);
|
|
const uint32_t hash = SuperFastHash(szName);
|
|
|
|
typename std::map<unsigned int, T*>::iterator it = list.find(hash);
|
|
if (it == list.end()) {
|
|
if (bWasExisting) {
|
|
*bWasExisting = false;
|
|
}
|
|
|
|
list.insert(std::pair<unsigned int,T*>( hash, value ));
|
|
return;
|
|
}
|
|
if ((*it).second != value) {
|
|
delete (*it).second;
|
|
(*it).second = value;
|
|
}
|
|
if (!value) {
|
|
list.erase(it);
|
|
}
|
|
if (bWasExisting) {
|
|
*bWasExisting = true;
|
|
}
|
|
}
|
|
|
|
// ------------------------------------------------------------------------------------------------
|
|
template <class T>
|
|
inline
|
|
bool HasGenericProperty(const std::map< unsigned int, T >& list,
|
|
const char* szName) {
|
|
ai_assert(nullptr != szName);
|
|
const uint32_t hash = SuperFastHash(szName);
|
|
|
|
typename std::map<unsigned int, T>::const_iterator it = list.find(hash);
|
|
if (it == list.end()) {
|
|
return false;
|
|
}
|
|
|
|
return true;
|
|
}
|
|
|
|
#endif // !! AI_GENERIC_PROPERTY_H_INCLUDED
|