rev |
line source |
nuclear@0
|
1 /*
|
nuclear@0
|
2 Open Asset Import Library (assimp)
|
nuclear@0
|
3 ----------------------------------------------------------------------
|
nuclear@0
|
4
|
nuclear@0
|
5 Copyright (c) 2006-2018, assimp team
|
nuclear@0
|
6
|
nuclear@0
|
7
|
nuclear@0
|
8 All rights reserved.
|
nuclear@0
|
9
|
nuclear@0
|
10 Redistribution and use of this software in source and binary forms,
|
nuclear@0
|
11 with or without modification, are permitted provided that the
|
nuclear@0
|
12 following conditions are met:
|
nuclear@0
|
13
|
nuclear@0
|
14 * Redistributions of source code must retain the above
|
nuclear@0
|
15 copyright notice, this list of conditions and the
|
nuclear@0
|
16 following disclaimer.
|
nuclear@0
|
17
|
nuclear@0
|
18 * Redistributions in binary form must reproduce the above
|
nuclear@0
|
19 copyright notice, this list of conditions and the
|
nuclear@0
|
20 following disclaimer in the documentation and/or other
|
nuclear@0
|
21 materials provided with the distribution.
|
nuclear@0
|
22
|
nuclear@0
|
23 * Neither the name of the assimp team, nor the names of its
|
nuclear@0
|
24 contributors may be used to endorse or promote products
|
nuclear@0
|
25 derived from this software without specific prior
|
nuclear@0
|
26 written permission of the assimp team.
|
nuclear@0
|
27
|
nuclear@0
|
28 THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
nuclear@0
|
29 "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
nuclear@0
|
30 LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
nuclear@0
|
31 A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
nuclear@0
|
32 OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
nuclear@0
|
33 SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
nuclear@0
|
34 LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
nuclear@0
|
35 DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
nuclear@0
|
36 THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
nuclear@0
|
37 (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
nuclear@0
|
38 OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
nuclear@0
|
39
|
nuclear@0
|
40 ----------------------------------------------------------------------
|
nuclear@0
|
41 */
|
nuclear@0
|
42
|
nuclear@0
|
43 #ifndef AI_GENERIC_PROPERTY_H_INCLUDED
|
nuclear@0
|
44 #define AI_GENERIC_PROPERTY_H_INCLUDED
|
nuclear@0
|
45
|
nuclear@0
|
46 #include <miniassimp/Importer.hpp>
|
nuclear@0
|
47 #include <miniassimp/ai_assert.h>
|
nuclear@0
|
48 #include "Hash.h"
|
nuclear@0
|
49
|
nuclear@0
|
50 #include <map>
|
nuclear@0
|
51
|
nuclear@0
|
52 // ------------------------------------------------------------------------------------------------
|
nuclear@0
|
53 template <class T>
|
nuclear@0
|
54 inline
|
nuclear@0
|
55 bool SetGenericProperty(std::map< unsigned int, T >& list,
|
nuclear@0
|
56 const char* szName, const T& value) {
|
nuclear@0
|
57 ai_assert(0 != szName);
|
nuclear@0
|
58 const uint32_t hash = SuperFastHash(szName);
|
nuclear@0
|
59
|
nuclear@0
|
60 typename std::map<unsigned int, T>::iterator it = list.find(hash);
|
nuclear@0
|
61 if (it == list.end()) {
|
nuclear@0
|
62 list.insert(std::pair<unsigned int, T>( hash, value ));
|
nuclear@0
|
63 return false;
|
nuclear@0
|
64 }
|
nuclear@0
|
65 (*it).second = value;
|
nuclear@0
|
66
|
nuclear@0
|
67 return true;
|
nuclear@0
|
68 }
|
nuclear@0
|
69
|
nuclear@0
|
70 // ------------------------------------------------------------------------------------------------
|
nuclear@0
|
71 template <class T>
|
nuclear@0
|
72 inline
|
nuclear@0
|
73 const T& GetGenericProperty(const std::map< unsigned int, T >& list,
|
nuclear@0
|
74 const char* szName, const T& errorReturn) {
|
nuclear@0
|
75 ai_assert(0 != szName);
|
nuclear@0
|
76 const uint32_t hash = SuperFastHash(szName);
|
nuclear@0
|
77
|
nuclear@0
|
78 typename std::map<unsigned int, T>::const_iterator it = list.find(hash);
|
nuclear@0
|
79 if (it == list.end()) {
|
nuclear@0
|
80 return errorReturn;
|
nuclear@0
|
81 }
|
nuclear@0
|
82
|
nuclear@0
|
83 return (*it).second;
|
nuclear@0
|
84 }
|
nuclear@0
|
85
|
nuclear@0
|
86 // ------------------------------------------------------------------------------------------------
|
nuclear@0
|
87 // Special version for pointer types - they will be deleted when replaced with another value
|
nuclear@0
|
88 // passing NULL removes the whole property
|
nuclear@0
|
89 template <class T>
|
nuclear@0
|
90 inline
|
nuclear@0
|
91 void SetGenericPropertyPtr(std::map< unsigned int, T* >& list,
|
nuclear@0
|
92 const char* szName, T* value, bool* bWasExisting = 0 ) {
|
nuclear@0
|
93 ai_assert(0 != szName);
|
nuclear@0
|
94 const uint32_t hash = SuperFastHash(szName);
|
nuclear@0
|
95
|
nuclear@0
|
96 typename std::map<unsigned int, T*>::iterator it = list.find(hash);
|
nuclear@0
|
97 if (it == list.end()) {
|
nuclear@0
|
98 if (bWasExisting) {
|
nuclear@0
|
99 *bWasExisting = false;
|
nuclear@0
|
100 }
|
nuclear@0
|
101
|
nuclear@0
|
102 list.insert(std::pair<unsigned int,T*>( hash, value ));
|
nuclear@0
|
103 return;
|
nuclear@0
|
104 }
|
nuclear@0
|
105 if ((*it).second != value) {
|
nuclear@0
|
106 delete (*it).second;
|
nuclear@0
|
107 (*it).second = value;
|
nuclear@0
|
108 }
|
nuclear@0
|
109 if (!value) {
|
nuclear@0
|
110 list.erase(it);
|
nuclear@0
|
111 }
|
nuclear@0
|
112 if (bWasExisting) {
|
nuclear@0
|
113 *bWasExisting = true;
|
nuclear@0
|
114 }
|
nuclear@0
|
115 }
|
nuclear@0
|
116
|
nuclear@0
|
117 // ------------------------------------------------------------------------------------------------
|
nuclear@0
|
118 template <class T>
|
nuclear@0
|
119 inline
|
nuclear@0
|
120 bool HasGenericProperty(const std::map< unsigned int, T >& list,
|
nuclear@0
|
121 const char* szName) {
|
nuclear@0
|
122 ai_assert(0 != szName);
|
nuclear@0
|
123 const uint32_t hash = SuperFastHash(szName);
|
nuclear@0
|
124
|
nuclear@0
|
125 typename std::map<unsigned int, T>::const_iterator it = list.find(hash);
|
nuclear@0
|
126 if (it == list.end()) {
|
nuclear@0
|
127 return false;
|
nuclear@0
|
128 }
|
nuclear@0
|
129
|
nuclear@0
|
130 return true;
|
nuclear@0
|
131 }
|
nuclear@0
|
132
|
nuclear@0
|
133 #endif // !! AI_GENERIC_PROPERTY_H_INCLUDED
|