miniassimp
diff include/miniassimp/GenericProperty.h @ 0:879c81d94345
initial commit
author | John Tsiombikas <nuclear@member.fsf.org> |
---|---|
date | Mon, 28 Jan 2019 18:19:26 +0200 |
parents | |
children |
line diff
1.1 --- /dev/null Thu Jan 01 00:00:00 1970 +0000 1.2 +++ b/include/miniassimp/GenericProperty.h Mon Jan 28 18:19:26 2019 +0200 1.3 @@ -0,0 +1,133 @@ 1.4 +/* 1.5 +Open Asset Import Library (assimp) 1.6 +---------------------------------------------------------------------- 1.7 + 1.8 +Copyright (c) 2006-2018, assimp team 1.9 + 1.10 + 1.11 +All rights reserved. 1.12 + 1.13 +Redistribution and use of this software in source and binary forms, 1.14 +with or without modification, are permitted provided that the 1.15 +following conditions are met: 1.16 + 1.17 +* Redistributions of source code must retain the above 1.18 + copyright notice, this list of conditions and the 1.19 + following disclaimer. 1.20 + 1.21 +* Redistributions in binary form must reproduce the above 1.22 + copyright notice, this list of conditions and the 1.23 + following disclaimer in the documentation and/or other 1.24 + materials provided with the distribution. 1.25 + 1.26 +* Neither the name of the assimp team, nor the names of its 1.27 + contributors may be used to endorse or promote products 1.28 + derived from this software without specific prior 1.29 + written permission of the assimp team. 1.30 + 1.31 +THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 1.32 +"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 1.33 +LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR 1.34 +A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 1.35 +OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, 1.36 +SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT 1.37 +LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 1.38 +DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 1.39 +THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 1.40 +(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 1.41 +OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 1.42 + 1.43 +---------------------------------------------------------------------- 1.44 +*/ 1.45 + 1.46 +#ifndef AI_GENERIC_PROPERTY_H_INCLUDED 1.47 +#define AI_GENERIC_PROPERTY_H_INCLUDED 1.48 + 1.49 +#include <miniassimp/Importer.hpp> 1.50 +#include <miniassimp/ai_assert.h> 1.51 +#include "Hash.h" 1.52 + 1.53 +#include <map> 1.54 + 1.55 +// ------------------------------------------------------------------------------------------------ 1.56 +template <class T> 1.57 +inline 1.58 +bool SetGenericProperty(std::map< unsigned int, T >& list, 1.59 + const char* szName, const T& value) { 1.60 + ai_assert(0 != szName); 1.61 + const uint32_t hash = SuperFastHash(szName); 1.62 + 1.63 + typename std::map<unsigned int, T>::iterator it = list.find(hash); 1.64 + if (it == list.end()) { 1.65 + list.insert(std::pair<unsigned int, T>( hash, value )); 1.66 + return false; 1.67 + } 1.68 + (*it).second = value; 1.69 + 1.70 + return true; 1.71 +} 1.72 + 1.73 +// ------------------------------------------------------------------------------------------------ 1.74 +template <class T> 1.75 +inline 1.76 +const T& GetGenericProperty(const std::map< unsigned int, T >& list, 1.77 + const char* szName, const T& errorReturn) { 1.78 + ai_assert(0 != szName); 1.79 + const uint32_t hash = SuperFastHash(szName); 1.80 + 1.81 + typename std::map<unsigned int, T>::const_iterator it = list.find(hash); 1.82 + if (it == list.end()) { 1.83 + return errorReturn; 1.84 + } 1.85 + 1.86 + return (*it).second; 1.87 +} 1.88 + 1.89 +// ------------------------------------------------------------------------------------------------ 1.90 +// Special version for pointer types - they will be deleted when replaced with another value 1.91 +// passing NULL removes the whole property 1.92 +template <class T> 1.93 +inline 1.94 +void SetGenericPropertyPtr(std::map< unsigned int, T* >& list, 1.95 + const char* szName, T* value, bool* bWasExisting = 0 ) { 1.96 + ai_assert(0 != szName); 1.97 + const uint32_t hash = SuperFastHash(szName); 1.98 + 1.99 + typename std::map<unsigned int, T*>::iterator it = list.find(hash); 1.100 + if (it == list.end()) { 1.101 + if (bWasExisting) { 1.102 + *bWasExisting = false; 1.103 + } 1.104 + 1.105 + list.insert(std::pair<unsigned int,T*>( hash, value )); 1.106 + return; 1.107 + } 1.108 + if ((*it).second != value) { 1.109 + delete (*it).second; 1.110 + (*it).second = value; 1.111 + } 1.112 + if (!value) { 1.113 + list.erase(it); 1.114 + } 1.115 + if (bWasExisting) { 1.116 + *bWasExisting = true; 1.117 + } 1.118 +} 1.119 + 1.120 +// ------------------------------------------------------------------------------------------------ 1.121 +template <class T> 1.122 +inline 1.123 +bool HasGenericProperty(const std::map< unsigned int, T >& list, 1.124 + const char* szName) { 1.125 + ai_assert(0 != szName); 1.126 + const uint32_t hash = SuperFastHash(szName); 1.127 + 1.128 + typename std::map<unsigned int, T>::const_iterator it = list.find(hash); 1.129 + if (it == list.end()) { 1.130 + return false; 1.131 + } 1.132 + 1.133 + return true; 1.134 +} 1.135 + 1.136 +#endif // !! AI_GENERIC_PROPERTY_H_INCLUDED