* feat(tools): add seed/solution restore script * chore(curriculum): remove empty sections' markers * chore(curriculum): add seed + solution to Chinese * chore: remove old formatter * fix: update getChallenges parse translated challenges separately, without reference to the source * chore(curriculum): add dashedName to English * chore(curriculum): add dashedName to Chinese * refactor: remove unused challenge property 'name' * fix: relax dashedName requirement * fix: stray tag Remove stray `pre` tag from challenge file. Signed-off-by: nhcarrigan <nhcarrigan@gmail.com> Co-authored-by: nhcarrigan <nhcarrigan@gmail.com>
103 lines
2.3 KiB
Markdown
103 lines
2.3 KiB
Markdown
---
|
|
id: 587d7dab367417b2b2512b70
|
|
title: Introduction to Currying and Partial Application
|
|
challengeType: 1
|
|
forumTopicId: 301232
|
|
dashedName: introduction-to-currying-and-partial-application
|
|
---
|
|
|
|
# --description--
|
|
|
|
The <dfn>arity</dfn> of a function is the number of arguments it requires. <dfn>Currying</dfn> a function means to convert a function of N arity into N functions of arity 1.
|
|
|
|
In other words, it restructures a function so it takes one argument, then returns another function that takes the next argument, and so on.
|
|
|
|
Here's an example:
|
|
|
|
```js
|
|
//Un-curried function
|
|
function unCurried(x, y) {
|
|
return x + y;
|
|
}
|
|
|
|
//Curried function
|
|
function curried(x) {
|
|
return function(y) {
|
|
return x + y;
|
|
}
|
|
}
|
|
//Alternative using ES6
|
|
const curried = x => y => x + y
|
|
|
|
curried(1)(2) // Returns 3
|
|
```
|
|
|
|
This is useful in your program if you can't supply all the arguments to a function at one time. You can save each function call into a variable, which will hold the returned function reference that takes the next argument when it's available. Here's an example using the curried function in the example above:
|
|
|
|
```js
|
|
// Call a curried function in parts:
|
|
var funcForY = curried(1);
|
|
console.log(funcForY(2)); // Prints 3
|
|
```
|
|
|
|
Similarly, <dfn>partial application</dfn> can be described as applying a few arguments to a function at a time and returning another function that is applied to more arguments. Here's an example:
|
|
|
|
```js
|
|
//Impartial function
|
|
function impartial(x, y, z) {
|
|
return x + y + z;
|
|
}
|
|
var partialFn = impartial.bind(this, 1, 2);
|
|
partialFn(10); // Returns 13
|
|
```
|
|
|
|
# --instructions--
|
|
|
|
Fill in the body of the `add` function so it uses currying to add parameters `x`, `y`, and `z`.
|
|
|
|
# --hints--
|
|
|
|
`add(10)(20)(30)` should return `60`.
|
|
|
|
```js
|
|
assert(add(10)(20)(30) === 60);
|
|
```
|
|
|
|
`add(1)(2)(3)` should return `6`.
|
|
|
|
```js
|
|
assert(add(1)(2)(3) === 6);
|
|
```
|
|
|
|
`add(11)(22)(33)` should return `66`.
|
|
|
|
```js
|
|
assert(add(11)(22)(33) === 66);
|
|
```
|
|
|
|
Your code should include a final statement that returns `x + y + z`.
|
|
|
|
```js
|
|
assert(code.match(/[xyz]\s*?\+\s*?[xyz]\s*?\+\s*?[xyz]/g));
|
|
```
|
|
|
|
# --seed--
|
|
|
|
## --seed-contents--
|
|
|
|
```js
|
|
function add(x) {
|
|
// Only change code below this line
|
|
|
|
|
|
// Only change code above this line
|
|
}
|
|
add(10)(20)(30);
|
|
```
|
|
|
|
# --solutions--
|
|
|
|
```js
|
|
const add = x => y => z => x + y + z
|
|
```
|