This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
// This is javascript code. | |
const pluckDeep = key => obj => key.split('.').reduce((accum, key) => accum[key], obj) | |
const compose = (...fns) => res => fns.reduce((accum, next) => next(accum), res) | |
const unfold = (f, seed) => { | |
const go = (f, seed, acc) => { | |
const res = f(seed) | |
return res ? go(f, res[1], acc.concat([res[0]])) : acc | |
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
// This is javascript code. | |
const pluckDeep = key => obj => key.split('.').reduce((accum, key) => accum[key], obj) | |
const compose = (...fns) => res => fns.reduce((accum, next) => next(accum), res) | |
const unfold = (f, seed) => { | |
const go = (f, seed, acc) => { | |
const res = f(seed) | |
return res ? go(f, res[1], acc.concat([res[0]])) : acc | |
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
// This is javascript code. | |
const pluckDeep = key => obj => key.split('.').reduce((accum, key) => accum[key], obj) | |
const compose = (...fns) => res => fns.reduce((accum, next) => next(accum), res) | |
const unfold = (f, seed) => { | |
const go = (f, seed, acc) => { | |
const res = f(seed) | |
return res ? go(f, res[1], acc.concat([res[0]])) : acc | |
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
// This is javascript code. | |
const pluckDeep = key => obj => key.split('.').reduce((accum, key) => accum[key], obj) | |
const compose = (...fns) => res => fns.reduce((accum, next) => next(accum), res) | |
const unfold = (f, seed) => { | |
const go = (f, seed, acc) => { | |
const res = f(seed) | |
return res ? go(f, res[1], acc.concat([res[0]])) : acc | |
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
// This is javascript code. | |
const pluckDeep = key => obj => key.split('.').reduce((accum, key) => accum[key], obj) | |
const compose = (...fns) => res => fns.reduce((accum, next) => next(accum), res) | |
const unfold = (f, seed) => { | |
const go = (f, seed, acc) => { | |
const res = f(seed) | |
return res ? go(f, res[1], acc.concat([res[0]])) : acc | |
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
// This is javascript code. | |
const pluckDeep = key => obj => key.split('.').reduce((accum, key) => accum[key], obj) | |
const compose = (...fns) => res => fns.reduce((accum, next) => next(accum), res) | |
const unfold = (f, seed) => { | |
const go = (f, seed, acc) => { | |
const res = f(seed) | |
return res ? go(f, res[1], acc.concat([res[0]])) : acc | |
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
// This is javascript code. | |
const pluckDeep = key => obj => key.split('.').reduce((accum, key) => accum[key], obj) | |
const compose = (...fns) => res => fns.reduce((accum, next) => next(accum), res) | |
const unfold = (f, seed) => { | |
const go = (f, seed, acc) => { | |
const res = f(seed) | |
return res ? go(f, res[1], acc.concat([res[0]])) : acc | |
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
// This is javascript code. | |
const pluckDeep = key => obj => key.split('.').reduce((accum, key) => accum[key], obj) | |
const compose = (...fns) => res => fns.reduce((accum, next) => next(accum), res) | |
const unfold = (f, seed) => { | |
const go = (f, seed, acc) => { | |
const res = f(seed) | |
return res ? go(f, res[1], acc.concat([res[0]])) : acc | |
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
// This is javascript code. | |
const pluckDeep = key => obj => key.split('.').reduce((accum, key) => accum[key], obj) | |
const compose = (...fns) => res => fns.reduce((accum, next) => next(accum), res) | |
const unfold = (f, seed) => { | |
const go = (f, seed, acc) => { | |
const res = f(seed) | |
return res ? go(f, res[1], acc.concat([res[0]])) : acc | |
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
// This is javascript code. | |
const pluckDeep = key => obj => key.split('.').reduce((accum, key) => accum[key], obj) | |
const compose = (...fns) => res => fns.reduce((accum, next) => next(accum), res) | |
const unfold = (f, seed) => { | |
const go = (f, seed, acc) => { | |
const res = f(seed) | |
return res ? go(f, res[1], acc.concat([res[0]])) : acc | |
} |
NewerOlder