forked from bonzini/smalltalk
-
Notifications
You must be signed in to change notification settings - Fork 0
/
lists2.st
52 lines (43 loc) · 1.66 KB
/
lists2.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
"======================================================================
|
| Benchmark for big OrderedCollections
|
|
======================================================================"
"======================================================================
|
| Copyright (C) 2003, 2007, 2008 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.
|
======================================================================"
Eval [
n := Smalltalk arguments isEmpty
ifTrue: [ 200000 ]
ifFalse: [ 1 max: Smalltalk arguments first asInteger ].
a := (1 to: n) asOrderedCollection.
b := OrderedCollection new: n.
[a isEmpty] whileFalse: [
b addLast: a removeFirst; addLast: a removeLast ].
[b isEmpty] whileFalse: [
a addFirst: b removeLast; addFirst: b removeFirst ].
a size printNl.
(a copyFrom: 1 to: (10 min: a size))
do: [ :each | each print ]
separatedBy: [ Transcript space ].
Transcript nl
]