November 2017
Intermediate to advanced
670 pages
17h 35m
English
Given the previous three rules, we can write a reduction function. When we run a reduction on an array of integers using addition, we seed our operation with a 0 (the identity element).
When we run a reduction on an array of integers using multiplication, we seed our operation with a 1 (the identity element).
That's the idea. The following table summarizes a number of possible reductions:
|
Type |
Operation |
Unit/zero/neutral value |
|
ints |
+ |
0 |
|
ints |
* |
1 |
|
string |
+ (concat strings) |
“” |
|
bool |
&& |
true |
|
bool |
|| |
false |
|
list |
<< (concat list) |
[] |