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/06/25 21:03] – tvcutsem | at:tutorial:basic [2020/02/09 19:25] – adding elisag | ||
---|---|---|---|
Line 1: | Line 1: | ||
- | < | ||
- | **This Tutorial is still under heavy construction!!** | ||
- | </ | ||
====== Functional and Imperative Programming ====== | ====== Functional and Imperative Programming ====== | ||
Line 69: | Line 66: | ||
>>[1, [1, 2, [" | >>[1, [1, 2, [" | ||
</ | </ | ||
+ | |||
==== Table Splicing ==== | ==== Table Splicing ==== | ||
Line 86: | Line 84: | ||
>rest | >rest | ||
>>[2, 3, 4] | >>[2, 3, 4] | ||
+ | </ | ||
+ | |||
+ | ==== Multidimensional tables ==== | ||
+ | |||
+ | < | ||
+ | |||
+ | def a := [[1,0,0], [0,1,0], [0,0,1]]; | ||
+ | >> | ||
+ | >a[1][2] | ||
+ | >>0 | ||
+ | >a[1] | ||
+ | >>[1, 0, 0] | ||
+ | </ | ||
+ | |||
+ | An implicit definition of the same table can be expressed as follows: | ||
+ | |||
+ | < | ||
+ | def i := 0; | ||
+ | def aux[3] {0}; | ||
+ | def b[3] { i := i + 1; aux := [0,0,0]; aux[i] :=1; aux}; | ||
</ | </ | ||
Line 176: | Line 194: | ||
</ | </ | ||
- | In that case, the //sum// function still accepts an arbitrary number of arguments as long as two arguments are supplied. //a// and //b// are considered as mandatory arguments of the argument list. | + | In that case, the //sum// function still accepts an arbitrary number of arguments as long as two arguments are supplied. //a// and //b// are considered as mandatory arguments of the argument list. |
+ | |||
+ | The splice operator can also be used to transform a table into an argument list for a function, for example: | ||
+ | < | ||
+ | def args := [3,4,5]; | ||
+ | > sum(1,2, @args); | ||
+ | >> 15 | ||
+ | </ | ||
+ | |||
+ | One way to think about this is that the splice operator splices the '' | ||
+ | < | ||
+ | > sum(1, | ||
+ | >> 21 | ||
+ | </ | ||
+ | |||
+ | ==== Optional Parameters ==== | ||
A function can also declare optional arguments as shown below. Optional arguments can be omitted in a function call. If this is the case, the default expression provided in their definition is evaluated and passed as argument to the function instead. | A function can also declare optional arguments as shown below. Optional arguments can be omitted in a function call. If this is the case, the default expression provided in their definition is evaluated and passed as argument to the function instead. | ||
Line 204: | Line 237: | ||
>def [get, set] := makeCell(42); | >def [get, set] := makeCell(42); | ||
>> | >> | ||
+ | >get(); | ||
+ | >>42 | ||
</ | </ | ||
Line 225: | Line 260: | ||
def total := a + b; | def total := a + b; | ||
| | ||
- | }; sum(1,2,3) | + | }; |
+ | >>< | ||
+ | >sum(1,2,3) | ||
>>6 | >>6 | ||
</ | </ | ||
Line 234: | Line 271: | ||
AmbientTalk borrows its block syntax from languages like Smalltalk and Self, where the role of the curly braces is played by square brackets, i.e. '' | AmbientTalk borrows its block syntax from languages like Smalltalk and Self, where the role of the curly braces is played by square brackets, i.e. '' | ||
</ | </ | ||
+ | |||
+ | |||
===== Keywords ===== | ===== Keywords ===== | ||
Line 243: | Line 282: | ||
def i := 0; | def i := 0; | ||
def mapped[tbl.length] { | def mapped[tbl.length] { | ||
- | | + | i := i+1; |
+ | clo( tbl[ i ] ) | ||
}; | }; | ||
} | } | ||
Line 264: | Line 304: | ||
</ | </ | ||
- | However, it is impossible | + | It is also possible |
+ | |||
+ | < | ||
+ | foo: | ||
+ | </ | ||
+ | |||
+ | <note important> | ||
+ | Be careful when nesting calls to keyworded functions: | ||
+ | </ | ||
===== Native Data Types ===== | ===== Native Data Types ===== | ||
The basic data types in AmbientTalk are numbers (i.e. integers), fractions (i.e. double precision floating point numbers), text (i.e. strings), tables (i.e. arrays) and booleans. In fact, instances of these data types are nothing but objects and as such, they respond to a variety of native methods. Objects will be the subject of the next chapter of the tutorial. This section explains the basic data types and includes some examples how to manipulate them. The complete list of methods can be found in the language reference. | The basic data types in AmbientTalk are numbers (i.e. integers), fractions (i.e. double precision floating point numbers), text (i.e. strings), tables (i.e. arrays) and booleans. In fact, instances of these data types are nothing but objects and as such, they respond to a variety of native methods. Objects will be the subject of the next chapter of the tutorial. This section explains the basic data types and includes some examples how to manipulate them. The complete list of methods can be found in the language reference. | ||
+ | |||
+ | |||
==== Numerical data types ==== | ==== Numerical data types ==== | ||
Line 301: | Line 351: | ||
Numbers also support some useful iterator methods such as: | Numbers also support some useful iterator methods such as: | ||
< | < | ||
- | >6.to: 0 step: 2 do: { |i| system.println(i) } | + | >1.to: 5 do: { |i| system.println(i)} |
+ | 1 | ||
+ | 2 | ||
+ | 3 | ||
+ | 4 | ||
+ | 5 | ||
+ | >1.to: 5 step: 2 do: { |i| system.println(i)} | ||
+ | 1 | ||
+ | 3 | ||
+ | 5 | ||
+ | > | ||
6 | 6 | ||
4 | 4 | ||
2 | 2 | ||
+ | 0 | ||
>> | >> | ||
> | > | ||
Line 339: | Line 400: | ||
>> | >> | ||
</ | </ | ||
+ | |||
==== Tables ==== | ==== Tables ==== | ||
- | We have already | + | We have already |
< | < | ||
> | > | ||
Line 399: | Line 461: | ||
>>1 | >>1 | ||
> def [i, j] := [1,3] | > def [i, j] := [1,3] | ||
- | >>>[1, 3] | + | >>[1, 3] |
>{i < j}.whileTrue: | >{i < j}.whileTrue: | ||
1 | 1 | ||
Line 410: | Line 472: | ||
===== Control Flow Constructs ===== | ===== Control Flow Constructs ===== | ||
- | Control flow constructs are defined in the lexical root of AmbientTalk. The lexical root is an object containing globally visible native methods (i.e. it is the top-level environment). We have already seen in the previous sections examples of use of the foreach and if/then structures. A list of traditional control flow structures defined in AmbientTalk is shown below: | + | Control flow constructs are defined in the "lexical root". The lexical root is an object containing globally visible native methods (i.e. it is the top-level environment). We have already seen in the previous sections examples of use of the foreach and '' |
< | < | ||
- | if: booleanCondition then: consequent | + | if: booleanCondition then: consequentClosure |
- | if: booleanCondition then: consequent | + | if: booleanCondition then: consequentClosure |
- | while: | + | while: |
- | foreach: | + | foreach: |
- | do: body if: condition | + | do: bodyClosure |
- | do: body unless: condition | + | do: bodyClosure |
</ | </ | ||
- | Note that '' | + | <note warn> |
+ | Note that '' | ||
+ | </ | ||
- | An example of usage for some of these structures is shown below in the definition of the sort function. | + | The above definitions in the lexical root of AmbientTalk are simply convenience functions for the methods defined on booleans and closures. For example, an if-statement can also be encoded as a message send, as in Smalltalk: '' |
+ | |||
+ | An example of usage for some of the above structures is shown below in the definition of the sort function. | ||
< | < | ||
>def sort(table, cmp := { |e1,e2| e1 < e2 }) { | >def sort(table, cmp := { |e1,e2| e1 < e2 }) { | ||
- | def quickSort(table, | + | |
- | def left := low; | + | def left := low; |
- | def right := high; | + | def right := high; |
- | def pivot := table[(left+right) /- 2]; | + | def pivot := table[(left+right) /- 2]; |
- | def save := nil; | + | def save := nil; |
- | while: { left <= right } do: { | + | while: { left <= right } do: { |
- | | + | while: { cmp(table[left], |
- | left := left + 1 | + | left := left + 1 |
- | }; | + | }; |
- | | + | while: { cmp(pivot, table[right]) } do: { |
- | right := right - 1 | + | right := right - 1 |
- | }; | + | }; |
- | | + | if: (left <= right) then: { |
- | | + | // swap elements |
- | | + | save := table[left]; |
- | table[left] := table[right]; | + | table[left] := table[right]; |
- | table[right] := save; | + | table[right] := save; |
- | left := left + 1; | + | left := left + 1; |
- | right := right - 1; | + | right := right - 1; |
- | | + | }; |
- | }; | + | }; |
- | if: (low< | + | if: (low< |
- | if: (high> | + | if: (high> |
- | | + | table; |
- | | + | }; |
- | | + | quickSort(table, |
- | }; | + | }; |
>>< | >>< | ||
> | > | ||
Line 457: | Line 523: | ||
</ | </ | ||
- | AmbientTalk has no '' | + | AmbientTalk has no '' |
at/tutorial/basic.txt · Last modified: 2020/02/09 22:05 by elisag