@@ -11,53 +11,53 @@ const {
11
11
12
12
const ease = { } ;
13
13
ease . linear = n => n ;
14
- ease . inQuad = n => n ** 2 ;
14
+ ease . inQuad = n => n * n ;
15
15
ease . outQuad = n => n * ( 2 - n ) ;
16
16
ease . inOutQuad = n => {
17
17
n *= 2 ;
18
18
return n < 1 ?
19
19
HALF * n * n :
20
20
- HALF * ( -- n * ( n - 2 ) - 1 ) ;
21
21
} ;
22
- ease . inCube = n => n ** 3 ;
22
+ ease . inCube = n => n * n * n ;
23
23
ease . outCube = n => -- n * n * n + 1 ;
24
24
ease . inOutCube = n => {
25
25
n *= 2 ;
26
26
return n < 1 ?
27
- HALF * ( n ** 3 ) :
27
+ HALF * ( n * n * n ) :
28
28
HALF * ( ( n -= 2 ) * n * n + 2 ) ;
29
29
} ;
30
30
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 ) ) ;
33
33
ease . inOutQuart = n => {
34
34
n *= 2 ;
35
35
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 ) ;
38
38
} ;
39
39
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 ;
42
42
ease . inOutQuint = n => {
43
43
n *= 2 ;
44
44
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 ) ;
47
47
} ;
48
48
49
49
ease . inSine = n => 1 - cos ( n * PI / 2 ) ;
50
50
ease . outSine = n => sin ( n * PI / 2 ) ;
51
51
ease . inOutSine = n => HALF * ( 1 - cos ( PI * n ) ) ;
52
52
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 ) ;
55
55
ease . inOutExpo = n => {
56
56
if ( n === 0 ) { return 0 ; }
57
57
if ( n === 1 ) { return 1 ; }
58
58
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 ) ;
61
61
} ;
62
62
63
63
ease . inCirc = n => 1 - sqrt ( 1 - n * n ) ;
0 commit comments