1.1 --- /dev/null	Thu Jan 01 00:00:00 1970 +0000
     1.2 +++ b/libs/assimp/OptimizeGraph.h	Sat Feb 01 19:58:19 2014 +0200
     1.3 @@ -0,0 +1,142 @@
     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  OptimizeGraph.h
    1.45 + *  @brief Declares a post processing step to optimize the scenegraph
    1.46 + */
    1.47 +#ifndef AI_OPTIMIZEGRAPHPROCESS_H_INC
    1.48 +#define AI_OPTIMIZEGRAPHPROCESS_H_INC
    1.49 +
    1.50 +#include "BaseProcess.h"
    1.51 +#include "ProcessHelper.h"
    1.52 +#include "assimp/types.h"
    1.53 +
    1.54 +struct aiMesh;
    1.55 +class OptimizeGraphProcessTest;
    1.56 +namespace Assimp	{
    1.57 +
    1.58 +// -----------------------------------------------------------------------------
    1.59 +/** @brief Postprocessing step to optimize the scenegraph
    1.60 + *
    1.61 + *  The implementation tries to merge nodes, even if they use different
    1.62 + *  transformations. Animations are preserved. 
    1.63 + *
    1.64 + *  @see aiProcess_OptimizeGraph for a detailed description of the
    1.65 + *  algorithm being applied.
    1.66 + */
    1.67 +class OptimizeGraphProcess : public BaseProcess
    1.68 +{
    1.69 +public:
    1.70 +
    1.71 +	OptimizeGraphProcess();
    1.72 +	~OptimizeGraphProcess();
    1.73 +
    1.74 +public:
    1.75 +	// -------------------------------------------------------------------
    1.76 +	bool IsActive( unsigned int pFlags) const;
    1.77 +
    1.78 +	// -------------------------------------------------------------------
    1.79 +	void Execute( aiScene* pScene);
    1.80 +	
    1.81 +	// -------------------------------------------------------------------
    1.82 +	void SetupProperties(const Importer* pImp);
    1.83 +
    1.84 +
    1.85 +	// -------------------------------------------------------------------
    1.86 +	/** @brief Add a list of node names to be locked and not modified.
    1.87 +	 *  @param in List of nodes. See #AI_CONFIG_PP_OG_EXCLUDE_LIST for
    1.88 +	 *    format explanations.
    1.89 +	 */
    1.90 +	inline void AddLockedNodeList(std::string& in)
    1.91 +	{
    1.92 +		ConvertListToStrings (in,locked_nodes);
    1.93 +	}
    1.94 +
    1.95 +	// -------------------------------------------------------------------
    1.96 +	/** @brief Add another node to be locked and not modified.
    1.97 +	 *  @param name Name to be locked
    1.98 +	 */
    1.99 +	inline void AddLockedNode(std::string& name)
   1.100 +	{
   1.101 +		locked_nodes.push_back(name);
   1.102 +	}
   1.103 +
   1.104 +	// -------------------------------------------------------------------
   1.105 +	/** @brief Rmeove a node from the list of locked nodes.
   1.106 +	 *  @param name Name to be unlocked
   1.107 +	 */
   1.108 +	inline void RemoveLockedNode(std::string& name)
   1.109 +	{
   1.110 +		locked_nodes.remove(name);
   1.111 +	}
   1.112 +
   1.113 +protected:
   1.114 +
   1.115 +	void CollectNewChildren(aiNode* nd, std::list<aiNode*>& nodes);
   1.116 +	void FindInstancedMeshes (aiNode* pNode);
   1.117 +
   1.118 +private:
   1.119 +
   1.120 +#ifdef AI_OG_USE_HASHING
   1.121 +	typedef std::set<unsigned int> LockedSetType;
   1.122 +#else
   1.123 +	typedef std::set<std::string> LockedSetType;
   1.124 +#endif
   1.125 +
   1.126 +
   1.127 +	//! Scene we're working with
   1.128 +	aiScene* mScene;
   1.129 +
   1.130 +	//! List of locked names. Stored is the hash of the name
   1.131 +	LockedSetType locked;
   1.132 +
   1.133 +	//! List of nodes to be locked in addition to those with animations, lights or cameras assigned.
   1.134 +	std::list<std::string> locked_nodes;
   1.135 +
   1.136 +	//! Node counters for logging purposes
   1.137 +	unsigned int nodes_in,nodes_out, count_merged;
   1.138 +
   1.139 +	//! Reference counters for meshes
   1.140 +	std::vector<unsigned int> meshes;
   1.141 +};
   1.142 +
   1.143 +} // end of namespace Assimp
   1.144 +
   1.145 +#endif // AI_OPTIMIZEGRAPHPROCESS_H_INC