three.js/src/animation/AnimationHandler.js

/**
 * @author mikael emtinger / http://gomo.se/
 */

THREE.AnimationHandler = (function() {

	var playing = [];
	var library = {};
	var that    = {};


	//--- update ---

	that.update = function( deltaTimeMS ) {

		for( var i = 0; i < playing.length; i++ )
			playing[ i ].update( deltaTimeMS );

	};


	//--- add ---

	that.addToUpdate = function( animation ) {

		if( playing.indexOf( animation ) === -1 )
			playing.push( animation );

	};


	//--- remove ---

	that.removeFromUpdate = function( animation ) {

		var index = playing.indexOf( animation );

		if( index !== -1 )
			playing.splice( index, 1 );

	};


	//--- add ---
	
	that.add = function( data ) {

		if( library[ data.name ] !== undefined )
			console.log( "THREE.AnimationHandler.add: Warning! " + data.name + " already exists in library. Overwriting." );

		library[ data.name ] = data;
		initData( data );
	};


	//--- get ---
	
	that.get = function( name ) {
		
		if( typeof name === "string" ) {
			
			if( library[ name ] ) {
				
				return library[ name ];
			
			} else {
				
				console.log( "THREE.AnimationHandler.get: Couldn't find animation " + name );
				return null;	
			}
		}
		else {
			
			// todo: add simple tween library
		}
		
	};

	//--- parse ---
	
	that.parse = function( root ) {
		
		// setup hierarchy

		var hierarchy = [];
	
		if ( root instanceof THREE.SkinnedMesh ) {
	
			for( var b = 0; b < root.bones.length; b++ ) {
	
				hierarchy.push( root.bones[ b ] );
	
			}
	
		} else {
	
			parseRecurseHierarchy( root, hierarchy );
	
		}
		
		return hierarchy;
	};

	var parseRecurseHierarchy = function( root, hierarchy ) {
		
		hierarchy.push( root );
		
		for( var c = 0; c < root.children.length; c++ ) 
			parseRecurseHierarchy( root.children[ c ], hierarchy );
	}


	//--- init data ---

	var initData = function( data ) {
 
		if( data.initialized === true )
			return;

		// THIS SHOULD BE REMOVED WHEN LENGTH IS UPDATED TO MS IN EXPORT FORMAT!
		data.length = parseInt( data.length * 1000, 10 );	
		data.fps   *= 0.001;
		

		// loop through all keys

		for( var h = 0; h < data.hierarchy.length; h++ ) {

			for( var k = 0; k < data.hierarchy[ h ].keys.length; k++ ) {

				// remove minus times

				if( data.hierarchy[ h ].keys[ k ].time < 0 )
					data.hierarchy[ h ].keys[ k ].time = 0;


				// THIS SHOULD BE REMOVED WHEN LENGTH IS UPDATED TO MS IN EXPORT FORMAT!
				data.hierarchy[ h ].keys[ k ].time = parseInt( data.hierarchy[ h ].keys[ k ].time * 1000, 10 );

				// set index

				data.hierarchy[ h ].keys[ k ].index = k;


				// create quaternions

				if( data.hierarchy[ h ].keys[ k ].rot !== undefined &&
				 !( data.hierarchy[ h ].keys[ k ].rot instanceof THREE.Quaternion ) ) {

					var quat = data.hierarchy[ h ].keys[ k ].rot;
					data.hierarchy[ h ].keys[ k ].rot = new THREE.Quaternion( quat[0], quat[1], quat[2], quat[3] );

				}
			}
		}


		// JIT

		var lengthInFrames = parseInt( data.length * data.fps * 0.001, 10 );

		data.JIT = {};
		data.JIT.hierarchy = [];

		for( var h = 0; h < data.hierarchy.length; h++ )
			data.JIT.hierarchy.push( new Array( lengthInFrames ));


		// done

		data.initialized = true;

	};


	// interpolation typess

	that.LINEAR = 0;
	that.CATMULLROM = 1;
	that.CATMULLROM_FORWARD = 2;

	return that;
}());