FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
mathjs/src/utils/function.js at develop · pointGH/mathjs · GitHub
pointGH
/
mathjs
Public
forked from
josdejong/mathjs
Notifications
You must be signed in to change notification settings
Fork
0
Star
0
Code
Pull requests
0
Actions
Projects
Security and quality
0
Insights
Additional navigation options
Code
Pull requests
Actions
Projects
Security and quality
Insights
Expand file tree
Breadcrumbs
mathjs
/
src
/
utils
/
function.js
Copy path
More file actions
More file actions
Latest commit
History
History
History
86 lines (75 loc) · 2.64 KB
Breadcrumbs
mathjs
/
src
/
utils
/
function.js
Copy path
File metadata and controls
86 lines (75 loc) · 2.64 KB
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
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
// function utils
/**
* Memoize a given function by caching the computed result.
* The cache of a memoized function can be cleared by deleting the `cache`
* property of the function.
*
*
@param
{
function
} fn The function to be memoized.
* Must be a pure function.
*
@param
{
function(args: Array)
} [hasher] A custom hash builder.
* Is JSON.stringify by default.
*
@return
{
function
} Returns the memoized function
*/
export
function
memoize
(
fn
,
hasher
)
{
return
function
memoize
(
)
{
if
(
typeof
memoize
.
cache
!==
'object'
)
{
memoize
.
cache
=
{
}
}
const
args
=
[
]
for
(
let
i
=
0
;
i
<
arguments
.
length
;
i
++
)
{
args
[
i
]
=
arguments
[
i
]
}
const
hash
=
hasher
?
hasher
(
args
)
:
JSON
.
stringify
(
args
)
if
(
!
(
hash
in
memoize
.
cache
)
)
{
memoize
.
cache
[
hash
]
=
fn
.
apply
(
fn
,
args
)
}
return
memoize
.
cache
[
hash
]
}
}
/**
* Memoize a given function by caching all results and the arguments,
* and comparing against the arguments of previous results before
* executing again.
* This is less performant than `memoize` which calculates a hash,
* which is very fast to compare. Use `memoizeCompare` only when it is
* not possible to create a unique serializable hash from the function
* arguments.
* The isEqual function must compare two sets of arguments
* and return true when equal (can be a deep equality check for example).
*
@param
{
function
} fn
*
@param
{
function(a: *, b: *) : boolean
} isEqual
*
@returns
{
function
}
*/
export
function
memoizeCompare
(
fn
,
isEqual
)
{
const
memoize
=
function
memoize
(
)
{
const
args
=
[
]
for
(
let
i
=
0
;
i
<
arguments
.
length
;
i
++
)
{
args
[
i
]
=
arguments
[
i
]
}
for
(
let
c
=
0
;
c
<
memoize
.
cache
.
length
;
c
++
)
{
const
cached
=
memoize
.
cache
[
c
]
if
(
isEqual
(
args
,
cached
.
args
)
)
{
// TODO: move this cache entry to the top so recently used entries move up?
return
cached
.
res
}
}
const
res
=
fn
.
apply
(
fn
,
args
)
memoize
.
cache
.
unshift
(
{
args
,
res
}
)
return
res
}
memoize
.
cache
=
[
]
return
memoize
}
/**
* Find the maximum number of arguments expected by a typed function.
*
@param
{
function
} fn A typed function
*
@return
{
number
} Returns the maximum number of expected arguments.
* Returns -1 when no signatures where found on the function.
*/
export
function
maxArgumentCount
(
fn
)
{
return
Object
.
keys
(
fn
.
signatures
||
{
}
)
.
reduce
(
function
(
args
,
signature
)
{
const
count
=
(
signature
.
match
(
/
,
/
g
)
||
[
]
)
.
length
+
1
return
Math
.
max
(
args
,
count
)
}
,
-
1
)
}
Back
|
FazBrowse Home
|
New Git URL