Subversion Repository Public Repository

Divide-Dependencies

This repository has no backups
This repository's network speed is throttled to 100KB/sec

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
/*
---------------------------------------------------------------------------
Open Asset Import Library (ASSIMP)
---------------------------------------------------------------------------

Copyright (c) 2006-2010, ASSIMP Development Team

All rights reserved.

Redistribution and use of this software in source and binary forms, 
with or without modification, are permitted provided that the following 
conditions are met:

* Redistributions of source code must retain the above
  copyright notice, this list of conditions and the
  following disclaimer.

* Redistributions in binary form must reproduce the above
  copyright notice, this list of conditions and the
  following disclaimer in the documentation and/or other
  materials provided with the distribution.

* Neither the name of the ASSIMP team, nor the names of its
  contributors may be used to endorse or promote products
  derived from this software without specific prior
  written permission of the ASSIMP Development Team.

THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 
OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT 
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
---------------------------------------------------------------------------
*/

/** @file aiAnim.h
 *  @brief Defines the data structures in which the imported animations
 *  are returned.
 */
#ifndef AI_ANIM_H_INC
#define AI_ANIM_H_INC

#include "aiTypes.h"
#include "aiQuaternion.h"

#ifdef __cplusplus
extern "C" {
#endif

// ---------------------------------------------------------------------------
/** A time-value pair specifying a certain 3D vector for the given time. */
struct aiVectorKey
{
	/** The time of this key */
	double mTime;     
	
	/** The value of this key */
	C_STRUCT aiVector3D mValue; 

#ifdef __cplusplus

	//! Default constructor
	aiVectorKey(){}

	//! Construction from a given time and key value
	aiVectorKey(double time, const aiVector3D& value)
		:	mTime	(time)
		,	mValue	(value)
	{}


	typedef aiVector3D elem_type;

	// Comparison operators. For use with std::find();
	bool operator == (const aiVectorKey& o) const {
		return o.mValue == this->mValue;
	}
	bool operator != (const aiVectorKey& o) const {
		return o.mValue != this->mValue;
	}

	// Relational operators. For use with std::sort();
	bool operator < (const aiVectorKey& o) const {
		return mTime < o.mTime;
	}
	bool operator > (const aiVectorKey& o) const {
		return mTime > o.mTime;
	}
#endif
};

// ---------------------------------------------------------------------------
/** A time-value pair specifying a rotation for the given time. 
 *  Rotations are expressed with quaternions. */
struct aiQuatKey
{
	/** The time of this key */
	double mTime;     

	/** The value of this key */
	C_STRUCT aiQuaternion mValue; 

#ifdef __cplusplus
	aiQuatKey(){
	}

	/** Construction from a given time and key value */
	aiQuatKey(double time, const aiQuaternion& value)
		:	mTime	(time)
		,	mValue	(value)
	{}

	typedef aiQuaternion elem_type;

	// Comparison operators. For use with std::find();
	bool operator == (const aiQuatKey& o) const {
		return o.mValue == this->mValue;
	}
	bool operator != (const aiQuatKey& o) const {
		return o.mValue != this->mValue;
	}

	// Relational operators. For use with std::sort();
	bool operator < (const aiQuatKey& o) const {
		return mTime < o.mTime;
	}
	bool operator > (const aiQuatKey& o) const {
		return mTime > o.mTime;
	}
#endif
};

// ---------------------------------------------------------------------------
/** Binds a anim mesh to a specific point in time. */
struct aiMeshKey 
{
	/** The time of this key */
	double mTime;

	/** Index into the aiMesh::mAnimMeshes array of the 
	 *  mesh coresponding to the #aiMeshAnim hosting this
	 *  key frame. The referenced anim mesh is evaluated
	 *  according to the rules defined in the docs for #aiAnimMesh.*/
	unsigned int mValue;

#ifdef __cplusplus

	aiMeshKey() {
	}

	/** Construction from a given time and key value */
	aiMeshKey(double time, const unsigned int value)
		:	mTime	(time)
		,	mValue	(value)
	{}

	typedef unsigned int elem_type;

	// Comparison operators. For use with std::find();
	bool operator == (const aiMeshKey& o) const {
		return o.mValue == this->mValue;
	}
	bool operator != (const aiMeshKey& o) const {
		return o.mValue != this->mValue;
	}

	// Relational operators. For use with std::sort();
	bool operator < (const aiMeshKey& o) const {
		return mTime < o.mTime;
	}
	bool operator > (const aiMeshKey& o) const {
		return mTime > o.mTime;
	}

#endif
};

// ---------------------------------------------------------------------------
/** Defines how an animation channel behaves outside the defined time
 *  range. This corresponds to aiNodeAnim::mPreState and 
 *  aiNodeAnim::mPostState.*/
enum aiAnimBehaviour
{
	/** The value from the default node transformation is taken*/
	aiAnimBehaviour_DEFAULT  = 0x0,  

	/** The nearest key value is used without interpolation */
	aiAnimBehaviour_CONSTANT = 0x1,

	/** The value of the nearest two keys is linearly
	 *  extrapolated for the current time value.*/
	aiAnimBehaviour_LINEAR   = 0x2,

	/** The animation is repeated.
	 *
	 *  If the animation key go from n to m and the current
	 *  time is t, use the value at (t-n) % (|m-n|).*/
	aiAnimBehaviour_REPEAT   = 0x3,



	/** This value is not used, it is just here to force the
	 *  the compiler to map this enum to a 32 Bit integer  */
#ifndef SWIG
	_aiAnimBehaviour_Force32Bit = 0x8fffffff
#endif
};

// ---------------------------------------------------------------------------
/** Describes the animation of a single node. The name specifies the 
 *  bone/node which is affected by this animation channel. The keyframes
 *  are given in three separate series of values, one each for position, 
 *  rotation and scaling. The transformation matrix computed from these
 *  values replaces the node's original transformation matrix at a
 *  specific time.
 *  This means all keys are absolute and not relative to the bone default pose.
 *  The order in which the transformations are applied is
 *  - as usual - scaling, rotation, translation.
 *
 *  @note All keys are returned in their correct, chronological order.
 *  Duplicate keys don't pass the validation step. Most likely there
 *  will be no negative time values, but they are not forbidden also ( so 
 *  implementations need to cope with them! ) */
struct aiNodeAnim
{
	/** The name of the node affected by this animation. The node 
	 *  must exist and it must be unique.*/
	C_STRUCT aiString mNodeName;

	/** The number of position keys */
	unsigned int mNumPositionKeys;

	/** The position keys of this animation channel. Positions are 
	 * specified as 3D vector. The array is mNumPositionKeys in size.
	 *
	 * If there are position keys, there will also be at least one
	 * scaling and one rotation key.*/
	C_STRUCT aiVectorKey* mPositionKeys;

	/** The number of rotation keys */
	unsigned int mNumRotationKeys;

	/** The rotation keys of this animation channel. Rotations are 
	 *  given as quaternions,  which are 4D vectors. The array is 
	 *  mNumRotationKeys in size.
	 *
	 * If there are rotation keys, there will also be at least one
	 * scaling and one position key. */
	C_STRUCT aiQuatKey* mRotationKeys;


	/** The number of scaling keys */
	unsigned int mNumScalingKeys;

	/** The scaling keys of this animation channel. Scalings are 
	 *  specified as 3D vector. The array is mNumScalingKeys in size.
	 *
	 * If there are scaling keys, there will also be at least one
	 * position and one rotation key.*/
	C_STRUCT aiVectorKey* mScalingKeys;


	/** Defines how the animation behaves before the first
	 *  key is encountered.
	 *
	 *  The default value is aiAnimBehaviour_DEFAULT (the original
	 *  transformation matrix of the affected node is used).*/
	C_ENUM aiAnimBehaviour mPreState;

	/** Defines how the animation behaves after the last 
	 *  key was processed.
	 *
	 *  The default value is aiAnimBehaviour_DEFAULT (the original
	 *  transformation matrix of the affected node is taken).*/
	C_ENUM aiAnimBehaviour mPostState;

#ifdef __cplusplus
	aiNodeAnim()
	{
		mNumPositionKeys = 0; mPositionKeys = NULL; 
		mNumRotationKeys = 0; mRotationKeys = NULL; 
		mNumScalingKeys  = 0; mScalingKeys  = NULL; 

		mPreState = mPostState = aiAnimBehaviour_DEFAULT;
	}

	~aiNodeAnim()
	{
		delete [] mPositionKeys;
		delete [] mRotationKeys;
		delete [] mScalingKeys;
	}
#endif // __cplusplus
};

// ---------------------------------------------------------------------------
/** Describes vertex-based animations for a single mesh or a group of
 *  meshes. Meshes carry the animation data for each frame in their
 *  aiMesh::mAnimMeshes array. The purpose of aiMeshAnim is to 
 *  define keyframes linking each mesh attachment to a particular
 *  point in time. */
struct aiMeshAnim
{
	/** Name of the mesh to be animated. An empty string is not allowed,
	 *  animated meshes need to be named (not necessarily uniquely,
	 *  the name can basically serve as wildcard to select a group
	 *  of meshes with similar animation setup)*/
	C_STRUCT aiString mName;

	/** Size of the #mKeys array. Must be 1, at least. */
	unsigned int mNumKeys;

	/** Key frames of the animation. May not be NULL. */
	C_STRUCT aiMeshKey* mKeys;

#ifdef __cplusplus

	aiMeshAnim()
		: mNumKeys()
		, mKeys()
	{}

	~aiMeshAnim()
	{
		delete[] mKeys;
	}

#endif
};

// ---------------------------------------------------------------------------
/** An animation consists of keyframe data for a number of nodes. For 
 *  each node affected by the animation a separate series of data is given.*/
struct aiAnimation
{
	/** The name of the animation. If the modeling package this data was 
	 *  exported from does support only a single animation channel, this 
	 *  name is usually empty (length is zero). */
	C_STRUCT aiString mName;

	/** Duration of the animation in ticks.  */
	double mDuration;

	/** Ticks per second. 0 if not specified in the imported file */
	double mTicksPerSecond;

	/** The number of bone animation channels. Each channel affects
	 *  a single node. */
	unsigned int mNumChannels;

	/** The node animation channels. Each channel affects a single node. 
	 *  The array is mNumChannels in size. */
	C_STRUCT aiNodeAnim** mChannels;


	/** The number of mesh animation channels. Each channel affects
	 *  a single mesh and defines vertex-based animation. */
	unsigned int mNumMeshChannels;

	/** The mesh animation channels. Each channel affects a single mesh. 
	 *  The array is mNumMeshChannels in size. */
	C_STRUCT aiMeshAnim** mMeshChannels;

#ifdef __cplusplus
	aiAnimation()
		: mDuration(-1.)
		, mTicksPerSecond()
		, mNumChannels()
		, mChannels()
		, mNumMeshChannels()
		, mMeshChannels()
	{
	}

	~aiAnimation()
	{
		// DO NOT REMOVE THIS ADDITIONAL CHECK
		if (mNumChannels && mChannels)	{
			for( unsigned int a = 0; a < mNumChannels; a++) {
				delete mChannels[a];
			}

		delete [] mChannels;
		}
		if (mNumMeshChannels && mMeshChannels)	{
			for( unsigned int a = 0; a < mNumMeshChannels; a++) {
				delete mMeshChannels[a];
			}

		delete [] mMeshChannels;
		}
	}
#endif // __cplusplus
};

#ifdef __cplusplus
}


// some C++ utilities for inter- and extrapolation
namespace Assimp {

// ---------------------------------------------------------------------------
/** @brief CPP-API: Utility class to simplify interpolations of various data types.
 *
 *  The type of interpolation is choosen automatically depending on the
 *  types of the arguments. */
template <typename T>
struct Interpolator		
{	
	// ------------------------------------------------------------------
	/** @brief Get the result of the interpolation between a,b.
	 *
	 *  The interpolation algorithm depends on the type of the operands.
	 *  aiQuaternion's and aiQuatKey's SLERP, the rest does a simple
	 *  linear interpolation. */
	void operator () (T& out,const T& a, const T& b, float d) const {
		out = a + (b-a)*d;
	}
}; // ! Interpolator <T>

//! @cond Never

template <>
struct Interpolator	<aiQuaternion>	{	
	void operator () (aiQuaternion& out,const aiQuaternion& a, 
		const aiQuaternion& b, float d) const
	{
		aiQuaternion::Interpolate(out,a,b,d);
	}
}; // ! Interpolator <aiQuaternion>

template <>
struct Interpolator	<unsigned int>	{	
	void operator () (unsigned int& out,unsigned int a, 
		unsigned int b, float d) const
	{
		out = d>0.5f ? b : a;
	}
}; // ! Interpolator <aiQuaternion>

template <>
struct Interpolator	 <aiVectorKey>	{	
	void operator () (aiVector3D& out,const aiVectorKey& a,
		const aiVectorKey& b, float d) const	
	{
		Interpolator<aiVector3D> ipl;
		ipl(out,a.mValue,b.mValue,d);
	}
}; // ! Interpolator <aiVectorKey>

template <>
struct Interpolator <aiQuatKey>		{
	void operator () (aiQuaternion& out, const aiQuatKey a,
		const aiQuatKey& b, float d) const
	{
		Interpolator<aiQuaternion> ipl;
		ipl(out,a.mValue,b.mValue,d);
	}
}; // ! Interpolator <aiQuatKey>

template <>
struct Interpolator <aiMeshKey>		{
	void operator () (unsigned int& out, const aiMeshKey a,
		const aiMeshKey& b, float d) const
	{
		Interpolator<unsigned int> ipl;
		ipl(out,a.mValue,b.mValue,d);
	}
}; // ! Interpolator <aiQuatKey>

//! @endcond
} //  ! end namespace Assimp



#endif // __cplusplus
#endif // AI_ANIM_H_INC

Commits for Divide-Dependencies/physx/APEX_1.4/externals/extensions/externals/include/assimp/aiAnim.h

Diff revisions: vs.
Revision Author Commited Message
105 IonutCava picture IonutCava Tue 16 Apr, 2019 19:55:41 +0000

Forgot to actually add physx