syntax: 'meth' -> 'fun', 'attr' -> 'var'
[nit.git] / tests / example_sorter.nit
1 # This file is part of NIT ( http://www.nitlanguage.org ).
2 #
3 # Copyright 2005-2008 Jean Privat <jean@pryen.org>
4 #
5 # Licensed under the Apache License, Version 2.0 (the "License");
6 # you may not use this file except in compliance with the License.
7 # You may obtain a copy of the License at
8 #
9 # http://www.apache.org/licenses/LICENSE-2.0
10 #
11 # Unless required by applicable law or agreed to in writing, software
12 # distributed under the License is distributed on an "AS IS" BASIS,
13 # WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
14 # See the License for the specific language governing permissions and
15 # limitations under the License.
16
17
18 class BackIntSorter
19 special AbstractSorter[Int]
20 redef fun compare(a: Int, b: Int): Int
21 do
22 return b <=> a
23 end
24
25 init do end
26 end
27
28 class DecimalSorter
29 special AbstractSorter[Int]
30 redef fun compare(a: Int, b: Int): Int
31 do
32 return (a%10) <=> (b%10)
33 end
34
35 init do end
36 end
37
38 fun get_an_array(nb: Int): Array[Int]
39 do
40 var res = new Array[Int].with_capacity(nb)
41 var j = 64
42 while res.length < nb do
43 j = (j * 3451 + 234) % 56557
44 var k = j % 90 + 10
45 res.add(k)
46 end
47 return res
48 end
49
50 #
51
52 var q = get_an_array(50)
53 print(q.join(" "))
54 (new ComparableSorter[Int]).sort(q)
55 print(q.join(" "))
56 (new DecimalSorter).sort(q)
57 print(q.join(" "))
58 (new BackIntSorter).sort(q)
59 print(q.join(" "))
60 (new DecimalSorter).sort(q)
61 print(q.join(" "))