andre/30-seconds-of-code
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Travis build: 379 [cron]

Browse Source
This commit is contained in:
30secondsofcode
2018-09-05 20:05:59 +00:00
parent f87902bd47
commit b52f44162f
3 changed files with 1559 additions and 1551 deletions
Download Patch File Download Diff File Expand all files Collapse all files

48
docs/index.html
View File

File diff suppressed because one or more lines are too long

4
snippet_data/snippets.json
View File

@ -2503,7 +2503,7 @@
"fileName": "intersectionBy.md", "fileName": "intersectionBy.md",
"text": "Returns a list of elements that exist in both arrays, after applying the provided function to each array element of both.\n\nCreate a `Set` by applying `fn` to all elements in `b`, then use `Array.filter()` on `a` to only keep elements, which produce values contained in `b` when `fn` is applied to them.", "text": "Returns a list of elements that exist in both arrays, after applying the provided function to each array element of both.\n\nCreate a `Set` by applying `fn` to all elements in `b`, then use `Array.filter()` on `a` to only keep elements, which produce values contained in `b` when `fn` is applied to them.",
"codeBlocks": [ "codeBlocks": [
"const intersectionBy = (a, b, fn) => {\n const s = new Set(b.map(x => fn(x)));\n return a.filter(x => s.has(fn(x)));\n};", "const intersectionBy = (a, b, fn) => {\n const s = new Set(b.map(fn));\n return a.filter(x => s.has(fn(x)));\n};",
"intersectionBy([2.1, 1.2], [2.3, 3.4], Math.floor); // [2.1]" "intersectionBy([2.1, 1.2], [2.3, 3.4], Math.floor); // [2.1]"
], ],
"tags": [ "tags": [
@ -2513,7 +2513,7 @@
}, },
"meta": { "meta": {
"archived": false, "archived": false,
"hash": "4df9daee1b38b51d92741ea763fdfb42e85331c1cb747ec413c45543243f1f48" "hash": "78c90426a81372be83af6ef2bdee0147263361673ab99fa2315ead2720d991b8"
} }
}, },
{ {

3058
test/testlog
View File

File diff suppressed because it is too large Load Diff