at:tutorial:basic
Differences
This shows you the differences between two versions of the page.
| Both sides previous revisionPrevious revisionNext revision | Previous revisionNext revisionBoth sides next revision | ||
| at:tutorial:basic [2007/04/06 08:29] – * elisag | at:tutorial:basic [2007/04/06 08:32] – * elisag | ||
|---|---|---|---|
| Line 2: | Line 2: | ||
| **IN PROGRESS: FIRST DRAFT!!** | **IN PROGRESS: FIRST DRAFT!!** | ||
| - | - TODO: Adding Table splicing, | + | - Add quasi-quoting? |
| </ | </ | ||
| ====== Functional and Imperative Programming ====== | ====== Functional and Imperative Programming ====== | ||
| Line 303: | Line 303: | ||
| Boolean infix operators such as & and | are not shortcut. Thus, both arguments will be evaluated. For lazy evaluation, you should use the natives methods. For example, false.and: { 1/0 } will return false without executing the second argument. | Boolean infix operators such as & and | are not shortcut. Thus, both arguments will be evaluated. For lazy evaluation, you should use the natives methods. For example, false.and: { 1/0 } will return false without executing the second argument. | ||
| - | |||
| ===== Control Flow Structures ===== | ===== Control Flow Structures ===== | ||
| Line 324: | Line 323: | ||
| def pivot := table[(left+right) /- 2]; | def pivot := table[(left+right) /- 2]; | ||
| def save := nil; | def save := nil; | ||
| - | | + | |
| while: { cmp(table[left], | while: { cmp(table[left], | ||
| left := left + 1 | left := left + 1 | ||
at/tutorial/basic.txt · Last modified: 2020/02/09 22:05 by elisag