steve
/
factor
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

Fix example in spread combinator article

db4
Aaron Schaefer 2008-12-03 13:26:31 -05:00
parent 46911bc797
commit e6b585c376
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
core/kernel/kernel-docs.factor
View File

@ -770,7 +770,7 @@ $nl
"Technically, the spread combinators are redundant because they can be simulated using shuffle words and other combinators, and in addition, they do not reduce token counts by much, if at all. However, they can make code more readable by expressing intention and exploiting any inherent symmetry. For example, a piece of code which performs three operations on three related values can be written in one of two ways:"
{ $code
"! First alternative; uses dip"
"[ [ 1 + ] dip 1 - dip ] 2 *"
"[ [ 1 + ] dip 1 - ] dip 2 *"
"! Second alternative: uses tri*"
"[ 1 + ] [ 1 - ] [ 2 * ] tri*"
}