Chromium Code Reviews
chromiumcodereview-hr@appspot.gserviceaccount.com (chromiumcodereview-hr) | Please choose your nickname with Settings | Help | Chromium Project | Gerrit Changes | Sign out
(207)

Side by Side Diff: tests/language/fixed_length_test.dart

Issue 12328104: Change new List(n) to return fixed length list. (Closed) Base URL: https://dart.googlecode.com/svn/branches/bleeding_edge/dart
Patch Set: Merge to head. Created 7 years, 9 months ago
Use n/p to move between diff chunks; N/P to move between comments. Draft comments are only viewable by you.
Jump to:
View unified diff | Download patch | Annotate | Revision Log
OLDNEW
1 // Copyright (c) 2013, the Dart project authors. Please see the AUTHORS file 1 // Copyright (c) 2013, the Dart project authors. Please see the AUTHORS file
2 // for details. All rights reserved. Use of this source code is governed by a 2 // for details. All rights reserved. Use of this source code is governed by a
3 // BSD-style license that can be found in the LICENSE file. 3 // BSD-style license that can be found in the LICENSE file.
4 4
5 // Regression test for https://code.google.com/p/dart/issues/detail?id=7994. 5 // Regression test for https://code.google.com/p/dart/issues/detail?id=7994.
6 6
7 void main() { 7 void main() {
8 Expect.equals(-1, foo()); 8 Expect.equals(-1, foo());
9 } 9 }
10 10
11 int foo() { 11 int foo() {
12 var list = new List<int>.fixedLength(1024); 12 var list = new List<int>(1024);
13 13
14 for(int i = 0; i < list.length; i++) list[i] = -i; 14 for(int i = 0; i < list.length; i++) list[i] = -i;
15 15
16 for(int n = list.length; n > 1; n--) { 16 for(int n = list.length; n > 1; n--) {
17 for(int i = 0; i < n - 1; i++) { 17 for(int i = 0; i < n - 1; i++) {
18 if (list[i] > list[i + 1]) { 18 if (list[i] > list[i + 1]) {
19 return list[i + 1]; 19 return list[i + 1];
20 } 20 }
21 } 21 }
22 } 22 }
23 } 23 }
OLDNEW

Powered by Google App Engine
This is Rietveld 408576698