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
|
/* ScummVM - Graphic Adventure Engine
*
* ScummVM is the legal property of its developers, whose names
* are too numerous to list here. Please refer to the COPYRIGHT
* file distributed with this source distribution.
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*
*/
#include "common/file.h"
#include "tetraedge/te/te_interpolation.h"
namespace Tetraedge {
TeInterpolation::TeInterpolation() {
}
void TeInterpolation::load(Common::ReadStream &stream) {
uint32 len = stream.readUint32LE();
if (len > 1000000)
error("TeInterpolation: Unexpected interpolation length %d", len);
_array.resize(len);
for (uint32 i = 0; i < len && !stream.err(); i++)
_array[i] = stream.readFloatLE();
}
void TeInterpolation::load(Common::Path &path) {
Common::File f;
if (!f.open(path))
error("Couldn't open %s", path.toString().c_str());
load(f);
}
// Note: this function is not in the original but simplifies
// the code for TeCurveAnim2 a lot.
void TeInterpolation::load(const Common::Array<double> &array) {
_array = array;
}
void TeInterpolation::load(const Common::Array<float> &array) {
_array.clear();
for (auto f : array) {
_array.push_back(f);
}
}
double TeInterpolation::interpole(double where, double max) const {
const uint arrayLen = _array.size();
if (!arrayLen)
return 0.0;
double elemNum = (arrayLen - 1) * where / max;
int leftElemNum = (int)floor(elemNum);
if (leftElemNum >= (int)arrayLen - 1)
return _array[arrayLen - 1];
else if (leftElemNum < 0)
return _array[0];
double left = _array[leftElemNum];
double right = _array[leftElemNum + 1];
return left + (right - left) * (elemNum - leftElemNum);
}
} // end namespace Tetraedge
|
