1.1 --- /dev/null	Thu Jan 01 00:00:00 1970 +0000
     1.2 +++ b/libs/assimp/FindInstancesProcess.h	Sat Feb 01 19:58:19 2014 +0200
     1.3 @@ -0,0 +1,135 @@
     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 +/** @file  FindInstancesProcess.h
    1.45 + *  @brief Declares the aiProcess_FindInstances post-process step
    1.46 + */
    1.47 +#ifndef AI_FINDINSTANCES_H_INC
    1.48 +#define AI_FINDINSTANCES_H_INC
    1.49 +
    1.50 +#include "BaseProcess.h"
    1.51 +#include "ProcessHelper.h"
    1.52 +
    1.53 +class FindInstancesProcessTest;
    1.54 +namespace Assimp	{
    1.55 +
    1.56 +// -------------------------------------------------------------------------------
    1.57 +/** @brief Get a pseudo(!)-hash representing a mesh.
    1.58 + *
    1.59 + *  The hash is built from number of vertices, faces, primitive types,
    1.60 + *  .... but *not* from the real mesh data. The funcction is not a perfect hash.
    1.61 + *  @param in Input mesh
    1.62 + *  @return Hash. 
    1.63 + */
    1.64 +inline uint64_t GetMeshHash(aiMesh* in) 
    1.65 +{
    1.66 +	ai_assert(NULL != in);
    1.67 +
    1.68 +	// ... get an unique value representing the vertex format of the mesh
    1.69 +	const unsigned int fhash = GetMeshVFormatUnique(in);
    1.70 +
    1.71 +	// and bake it with number of vertices/faces/bones/matidx/ptypes
    1.72 +	return ((uint64_t)fhash << 32u) | ((
    1.73 +		(in->mNumBones << 16u) ^  (in->mNumVertices)       ^
    1.74 +		(in->mNumFaces<<4u)    ^  (in->mMaterialIndex<<15) ^
    1.75 +		(in->mPrimitiveTypes<<28)) & 0xffffffff );
    1.76 +}
    1.77 +
    1.78 +// -------------------------------------------------------------------------------
    1.79 +/** @brief Perform a component-wise comparison of two arrays
    1.80 + *
    1.81 + *  @param first First array
    1.82 + *  @param second Second aray
    1.83 + *  @param size Size of both arrays
    1.84 + *  @param e Epsilon
    1.85 + *  @return true if the arrays are identical
    1.86 + */
    1.87 +inline bool CompareArrays(const aiVector3D* first, const aiVector3D* second, 
    1.88 +	unsigned int size, float e) 
    1.89 +{
    1.90 +	for (const aiVector3D* end = first+size; first != end; ++first,++second) {
    1.91 +		if ( (*first - *second).SquareLength() >= e)
    1.92 +			return false;
    1.93 +	}
    1.94 +	return true;
    1.95 +}
    1.96 +
    1.97 +// and the same for colors ...
    1.98 +inline bool CompareArrays(const aiColor4D* first, const aiColor4D* second, 
    1.99 +	unsigned int size, float e) 
   1.100 +{
   1.101 +	for (const aiColor4D* end = first+size; first != end; ++first,++second) {
   1.102 +		if ( GetColorDifference(*first,*second) >= e)
   1.103 +			return false;
   1.104 +	}
   1.105 +	return true;
   1.106 +}
   1.107 +
   1.108 +// ---------------------------------------------------------------------------
   1.109 +/** @brief A post-processing steps to search for instanced meshes
   1.110 +*/
   1.111 +class FindInstancesProcess : public BaseProcess
   1.112 +{
   1.113 +public:
   1.114 +
   1.115 +	FindInstancesProcess();
   1.116 +	~FindInstancesProcess();
   1.117 +
   1.118 +public:
   1.119 +	// -------------------------------------------------------------------
   1.120 +	// Check whether step is active in given flags combination
   1.121 +	bool IsActive( unsigned int pFlags) const;
   1.122 +
   1.123 +	// -------------------------------------------------------------------
   1.124 +	// Execute step on a given scene
   1.125 +	void Execute( aiScene* pScene);
   1.126 +
   1.127 +	// -------------------------------------------------------------------
   1.128 +	// Setup properties prior to executing the process
   1.129 +	void SetupProperties(const Importer* pImp);
   1.130 +
   1.131 +private:
   1.132 +
   1.133 +	bool configSpeedFlag;
   1.134 +
   1.135 +}; // ! end class FindInstancesProcess
   1.136 +}  // ! end namespace Assimp
   1.137 +
   1.138 +#endif // !! AI_FINDINSTANCES_H_INC