nuclear@0: /* nuclear@0: Open Asset Import Library (assimp) nuclear@0: ---------------------------------------------------------------------- nuclear@0: nuclear@0: Copyright (c) 2006-2018, assimp team nuclear@0: nuclear@0: nuclear@0: All rights reserved. nuclear@0: nuclear@0: Redistribution and use of this software in source and binary forms, nuclear@0: with or without modification, are permitted provided that the nuclear@0: following conditions are met: nuclear@0: nuclear@0: * Redistributions of source code must retain the above nuclear@0: copyright notice, this list of conditions and the nuclear@0: following disclaimer. nuclear@0: nuclear@0: * Redistributions in binary form must reproduce the above nuclear@0: copyright notice, this list of conditions and the nuclear@0: following disclaimer in the documentation and/or other nuclear@0: materials provided with the distribution. nuclear@0: nuclear@0: * Neither the name of the assimp team, nor the names of its nuclear@0: contributors may be used to endorse or promote products nuclear@0: derived from this software without specific prior nuclear@0: written permission of the assimp team. nuclear@0: nuclear@0: THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS nuclear@0: "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT nuclear@0: LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR nuclear@0: A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT nuclear@0: OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, nuclear@0: SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT nuclear@0: LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, nuclear@0: DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY nuclear@0: THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT nuclear@0: (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE nuclear@0: OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. nuclear@0: nuclear@0: ---------------------------------------------------------------------- nuclear@0: */ nuclear@0: nuclear@0: #ifndef AI_GENERIC_PROPERTY_H_INCLUDED nuclear@0: #define AI_GENERIC_PROPERTY_H_INCLUDED nuclear@0: nuclear@0: #include nuclear@0: #include nuclear@0: #include "Hash.h" nuclear@0: nuclear@0: #include nuclear@0: nuclear@0: // ------------------------------------------------------------------------------------------------ nuclear@0: template nuclear@0: inline nuclear@0: bool SetGenericProperty(std::map< unsigned int, T >& list, nuclear@0: const char* szName, const T& value) { nuclear@0: ai_assert(0 != szName); nuclear@0: const uint32_t hash = SuperFastHash(szName); nuclear@0: nuclear@0: typename std::map::iterator it = list.find(hash); nuclear@0: if (it == list.end()) { nuclear@0: list.insert(std::pair( hash, value )); nuclear@0: return false; nuclear@0: } nuclear@0: (*it).second = value; nuclear@0: nuclear@0: return true; nuclear@0: } nuclear@0: nuclear@0: // ------------------------------------------------------------------------------------------------ nuclear@0: template nuclear@0: inline nuclear@0: const T& GetGenericProperty(const std::map< unsigned int, T >& list, nuclear@0: const char* szName, const T& errorReturn) { nuclear@0: ai_assert(0 != szName); nuclear@0: const uint32_t hash = SuperFastHash(szName); nuclear@0: nuclear@0: typename std::map::const_iterator it = list.find(hash); nuclear@0: if (it == list.end()) { nuclear@0: return errorReturn; nuclear@0: } nuclear@0: nuclear@0: return (*it).second; nuclear@0: } nuclear@0: nuclear@0: // ------------------------------------------------------------------------------------------------ nuclear@0: // Special version for pointer types - they will be deleted when replaced with another value nuclear@0: // passing NULL removes the whole property nuclear@0: template nuclear@0: inline nuclear@0: void SetGenericPropertyPtr(std::map< unsigned int, T* >& list, nuclear@0: const char* szName, T* value, bool* bWasExisting = 0 ) { nuclear@0: ai_assert(0 != szName); nuclear@0: const uint32_t hash = SuperFastHash(szName); nuclear@0: nuclear@0: typename std::map::iterator it = list.find(hash); nuclear@0: if (it == list.end()) { nuclear@0: if (bWasExisting) { nuclear@0: *bWasExisting = false; nuclear@0: } nuclear@0: nuclear@0: list.insert(std::pair( hash, value )); nuclear@0: return; nuclear@0: } nuclear@0: if ((*it).second != value) { nuclear@0: delete (*it).second; nuclear@0: (*it).second = value; nuclear@0: } nuclear@0: if (!value) { nuclear@0: list.erase(it); nuclear@0: } nuclear@0: if (bWasExisting) { nuclear@0: *bWasExisting = true; nuclear@0: } nuclear@0: } nuclear@0: nuclear@0: // ------------------------------------------------------------------------------------------------ nuclear@0: template nuclear@0: inline nuclear@0: bool HasGenericProperty(const std::map< unsigned int, T >& list, nuclear@0: const char* szName) { nuclear@0: ai_assert(0 != szName); nuclear@0: const uint32_t hash = SuperFastHash(szName); nuclear@0: nuclear@0: typename std::map::const_iterator it = list.find(hash); nuclear@0: if (it == list.end()) { nuclear@0: return false; nuclear@0: } nuclear@0: nuclear@0: return true; nuclear@0: } nuclear@0: nuclear@0: #endif // !! AI_GENERIC_PROPERTY_H_INCLUDED