Skip to content

Commit 232e4f5

Browse files
committed
Easing: revert to pre-ES2018 syntax.
1 parent 6dd0a63 commit 232e4f5

File tree

1 file changed

+15
-15
lines changed

1 file changed

+15
-15
lines changed

lib/easing.js

+15-15
Original file line numberDiff line numberDiff line change
@@ -11,53 +11,53 @@ const {
1111

1212
const ease = {};
1313
ease.linear = n => n;
14-
ease.inQuad = n => n ** 2;
14+
ease.inQuad = n => n * n;
1515
ease.outQuad = n => n * (2 - n);
1616
ease.inOutQuad = n => {
1717
n *= 2;
1818
return n < 1 ?
1919
HALF * n * n :
2020
-HALF * (--n * (n - 2) - 1);
2121
};
22-
ease.inCube = n => n ** 3;
22+
ease.inCube = n => n * n * n;
2323
ease.outCube = n => --n * n * n + 1;
2424
ease.inOutCube = n => {
2525
n *= 2;
2626
return n < 1 ?
27-
HALF * (n ** 3) :
27+
HALF * (n * n * n) :
2828
HALF * ((n -= 2) * n * n + 2);
2929
};
3030

31-
ease.inQuart = n => n ** 4;
32-
ease.outQuart = n => 1 - (--n * (n ** 3));
31+
ease.inQuart = n => n * n * n * n;
32+
ease.outQuart = n => 1 - (--n * (n * n * n));
3333
ease.inOutQuart = n => {
3434
n *= 2;
3535
return n < 1 ?
36-
HALF * (n ** 4) :
37-
-HALF * ((n -= 2) * (n ** 3) - 2);
36+
HALF * (n * n * n * n) :
37+
-HALF * ((n -= 2) * (n * n * n) - 2);
3838
};
3939

40-
ease.inQuint = n => n ** 5;
41-
ease.outQuint = n => --n * (n ** 4) + 1;
40+
ease.inQuint = n => n * n * n * n * n;
41+
ease.outQuint = n => --n * (n * n * n * n) + 1;
4242
ease.inOutQuint = n => {
4343
n *= 2;
4444
return n < 1 ?
45-
HALF * (n ** 5) :
46-
HALF * ((n -= 2) * (n ** 4) + 2);
45+
HALF * (n * n * n * n * n) :
46+
HALF * ((n -= 2) * (n * n * n * n) + 2);
4747
};
4848

4949
ease.inSine = n => 1 - cos(n * PI / 2);
5050
ease.outSine = n => sin(n * PI / 2);
5151
ease.inOutSine = n => HALF * (1 - cos(PI * n));
5252

53-
ease.inExpo = n => 0 === n ? 0 : 1024 ** (n - 1);
54-
ease.outExpo = n => 1 === n ? n : 1 - 2 ** (-10 * n);
53+
ease.inExpo = n => 0 === n ? 0 : Math.pow(1024, n - 1);
54+
ease.outExpo = n => 1 === n ? n : 1 - Math.pow(2, -10 * n);
5555
ease.inOutExpo = n => {
5656
if (n === 0) { return 0; }
5757
if (n === 1) { return 1; }
5858
return (n *= 2) < 1 ?
59-
HALF * (1024 ** (n - 1)) :
60-
HALF * (-(2 ** (-10 * (n - 1))) + 2);
59+
HALF * Math.pow(1024, n - 1) :
60+
HALF * (-Math.pow(2, -10 * (n - 1)) + 2);
6161
};
6262

6363
ease.inCirc = n => 1 - sqrt(1 - n * n);

0 commit comments

Comments
 (0)