forked from bonzini/smalltalk
/
ackermann.st
67 lines (61 loc) · 1.85 KB
/
ackermann.st
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
"======================================================================
|
| Benchmark for message sending and integer ops
|
|
======================================================================"
"======================================================================
|
| Copyright (C) 2003, 2007 Free Software Foundation.
| Written by Paolo Bonzini
|
| This file is part of GNU Smalltalk.
|
| GNU Smalltalk is free software; you can redistribute it and/or modify it
| under the terms of the GNU General Public License as published by the Free
| Software Foundation; either version 2, or (at your option) any later version.
|
| GNU Smalltalk is distributed in the hope that it will be useful, but WITHOUT
| ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
| FOR A PARTICULAR PURPOSE. See the GNU General Public License for more
| details.
|
| You should have received a copy of the GNU General Public License along with
| GNU Smalltalk; see the file COPYING. If not, write to the Free Software
| Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
|
======================================================================"
Integer extend [
ack: n [
self = 0 ifTrue: [ ^n + 1 ].
n = 0 ifTrue: [ ^self - 1 ack: 1 ].
^self - 1 ack: (self ack: n - 1)
]
ackIt: nn [
| n |
^[
| m stack |
m := self. n := nn.
stack := OrderedCollection new.
[ m = 0
ifTrue: [
n := n + 1.
m := stack removeLast ]
ifFalse: [
n = 0
ifTrue: [
m := m - 1.
n := 1 ]
ifFalse: [
stack addLast: m - 1.
n := n - 1 ] ]
] repeat
] on: Error do: [ :ex | ex return: n ]
]
]
Eval [
n := Smalltalk arguments isEmpty
ifTrue: [ 4 ]
ifFalse: [ Smalltalk arguments first asInteger ].
('Ack(3,%1): %2' % { n. (3 ack: n) }) displayNl.
]