1.1 --- /dev/null	Thu Jan 01 00:00:00 1970 +0000
     1.2 +++ b/libs/assimp/assimp/metadata.h	Sat Feb 01 19:58:19 2014 +0200
     1.3 @@ -0,0 +1,120 @@
     1.4 +/*
     1.5 +---------------------------------------------------------------------------
     1.6 +Open Asset Import Library (assimp)
     1.7 +---------------------------------------------------------------------------
     1.8 +
     1.9 +Copyright (c) 2006-2012, assimp team
    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 following 
    1.15 +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 +/** @file metadata.h
    1.46 + *  @brief Defines the data structures for holding node meta information.
    1.47 + */
    1.48 +#ifndef __AI_METADATA_H_INC__
    1.49 +#define __AI_METADATA_H_INC__
    1.50 +
    1.51 +#ifdef __cplusplus
    1.52 +extern "C" {
    1.53 +#endif
    1.54 +
    1.55 +// -------------------------------------------------------------------------------
    1.56 +/**
    1.57 +  * Container for holding metadata.
    1.58 +  *
    1.59 +  * Metadata is a key-value store using string keys and values.
    1.60 +  */
    1.61 + // -------------------------------------------------------------------------------
    1.62 +struct aiMetadata 
    1.63 +{
    1.64 +	/** Length of the mKeys and mValues arrays, respectively */
    1.65 +	unsigned int mNumProperties;
    1.66 +
    1.67 +	/** Arrays of keys, may not be NULL. Entries in this array may not be NULL as well. */
    1.68 +	C_STRUCT aiString** mKeys;
    1.69 +
    1.70 +	/** Arrays of values, may not be NULL. Entries in this array may be NULL if the
    1.71 +	  * corresponding property key has no assigned value. */
    1.72 +	C_STRUCT aiString** mValues;
    1.73 +
    1.74 +#ifdef __cplusplus
    1.75 +
    1.76 +	/** Constructor */
    1.77 +	aiMetadata()
    1.78 +	{
    1.79 +		// set all members to zero by default
    1.80 +		mKeys = NULL;
    1.81 +		mValues = NULL;
    1.82 +		mNumProperties = 0;
    1.83 +	}
    1.84 +
    1.85 +
    1.86 +	/** Destructor */
    1.87 +	~aiMetadata()
    1.88 +	{
    1.89 +		if (mKeys && mValues) {
    1.90 +			for (unsigned i=0; i<mNumProperties; ++i) {
    1.91 +				if (mKeys[i]) {
    1.92 +					delete mKeys[i];
    1.93 +				}
    1.94 +				if (mValues[i]) {
    1.95 +					delete mValues[i];
    1.96 +				}
    1.97 +			}
    1.98 +			delete [] mKeys;
    1.99 +			delete [] mValues;
   1.100 +		}
   1.101 +	}
   1.102 +
   1.103 +
   1.104 +	inline bool Get(const aiString& key, aiString& value)
   1.105 +	{
   1.106 +		for (unsigned i=0; i<mNumProperties; ++i) {
   1.107 +			if (mKeys[i] && *mKeys[i]==key) {
   1.108 +				value=*mValues[i];
   1.109 +				return true;
   1.110 +			}
   1.111 +		}
   1.112 +		return false;
   1.113 +	}
   1.114 +#endif // __cplusplus
   1.115 +};
   1.116 +
   1.117 +#ifdef __cplusplus
   1.118 +} //extern "C" {
   1.119 +#endif
   1.120 +
   1.121 +#endif // __AI_METADATA_H_INC__
   1.122 +
   1.123 +