tobid7/renderd7
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

BCSTM-Player |

Browse Source
This commit is contained in:
tobid7
2021-07-23 13:58:16 +00:00
parent f51ddecf3d
commit c537fc095a
101 changed files with 39980 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

47
external/tween-engine/src/paths/CatmullRom.cpp vendored Normal file
View File

@ -0,0 +1,47 @@
//
// CatmullRom.cpp
//
// This code is derived from Universal Tween Engine
// Licensed under Apache License 2.0 - http://www.apache.org/licenses/LICENSE-2.0
//
#include <math.h>
#include <TweenEngine/paths/CatmullRom.h>
namespace TweenEngine
{
float CatmullRom::compute(float t, float *points, int pointsCnt)
{
int segment = (int) floor((pointsCnt-1) * t);
segment = segment > 0 ? segment : 0;
segment = segment < (pointsCnt-2) ? segment : pointsCnt-2;
t = t * (pointsCnt-1) - segment;
if (segment == 0)
{
return catmullRomSpline(points[0], points[0], points[1], points[2], t);
}
if (segment == pointsCnt-2)
{
return catmullRomSpline(points[pointsCnt-3], points[pointsCnt-2], points[pointsCnt-1], points[pointsCnt-1], t);
}
return catmullRomSpline(points[segment-1], points[segment], points[segment+1], points[segment+2], t);
}
float CatmullRom::catmullRomSpline(float a, float b, float c, float d, float t)
{
float t1 = (c - a) * 0.5f;
float t2 = (d - b) * 0.5f;
float h1 = +2 * t * t * t - 3 * t * t + 1;
float h2 = -2 * t * t * t + 3 * t * t;
float h3 = t * t * t - 2 * t * t + t;
float h4 = t * t * t - t * t;
return b * h1 + c * h2 + t1 * h3 + t2 * h4;
}
}

23
external/tween-engine/src/paths/LinearPath.cpp vendored Normal file
View File

@ -0,0 +1,23 @@
//
// Linear.cpp
//
// This code is derived from Universal Tween Engine
// Licensed under Apache License 2.0 - http://www.apache.org/licenses/LICENSE-2.0
//
#include <math.h>
#include <TweenEngine/paths/LinearPath.h>
namespace TweenEngine
{
float LinearPath::compute(float t, float *points, int pointsCnt)
{
int segment = (int) floor((pointsCnt-1) * t);
segment = segment > 0 ? segment : 0;
segment = segment < (pointsCnt-2) ? segment : pointsCnt-2;
t = t * (pointsCnt-1) - segment;
return points[segment] + t * (points[segment+1] - points[segment]);
}
}