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