1 # This file is part of NIT ( http://www.nitlanguage.org ).
3 # Copyright 2005-2008 Jean Privat <jean@pryen.org>
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
9 # http://www.apache.org/licenses/LICENSE-2.0
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.
19 super AbstractSorter[Int]
20 redef fun compare
(a
: Int, b
: Int): Int
29 super AbstractSorter[Int]
30 redef fun compare
(a
: Int, b
: Int): Int
32 return (a
%10) <=> (b
%10)
38 fun get_an_array
(nb
: Int): Array[Int]
40 var res
= new Array[Int].with_capacity
(nb
)
42 while res
.length
< nb
do
43 j
= (j
* 3451 + 234) % 56557
52 var q
= get_an_array
(50)
54 (new ComparableSorter[Int]).sort
(q
)
56 (new DecimalSorter).sort
(q
)
58 (new BackIntSorter).sort
(q
)
60 (new DecimalSorter).sort
(q
)