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

Side by Side Diff: tests/language_strong/index_test.dart

Issue 2771453003: Format all tests. (Closed)
Patch Set: Format files Created 3 years, 8 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
OLDNEW
1 // Copyright (c) 2011, the Dart project authors. Please see the AUTHORS file 1 // Copyright (c) 2011, 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 // Dart test program for testing index operators. 4 // Dart test program for testing index operators.
5 5
6 import "package:expect/expect.dart"; 6 import "package:expect/expect.dart";
7 7
8 class Helper { 8 class Helper {
9 static int fibonacci(int n) { 9 static int fibonacci(int n) {
10 int a = 0, b = 1, i = 0; 10 int a = 0, b = 1, i = 0;
11 while (i++ < n) { 11 while (i++ < n) {
12 a = a + b; 12 a = a + b;
13 b = a - b; 13 b = a - b;
14 } 14 }
15 return a; 15 return a;
16 } 16 }
17 } 17 }
18 18
19 class IndexTest { 19 class IndexTest {
20 static const ID_IDLE = 0; 20 static const ID_IDLE = 0;
21 21
22 static testMain() { 22 static testMain() {
23 var a = new List(10); 23 var a = new List(10);
24 Expect.equals(10, a.length); 24 Expect.equals(10, a.length);
25 for (int i = 0; i < a.length; i++) { 25 for (int i = 0; i < a.length; i++) {
26 a[i] = Helper.fibonacci(i); 26 a[i] = Helper.fibonacci(i);
27 } 27 }
28 a[ID_IDLE] = Helper.fibonacci(0); 28 a[ID_IDLE] = Helper.fibonacci(0);
29 for (int i = 2; i < a.length; i++) { 29 for (int i = 2; i < a.length; i++) {
30 Expect.equals(a[i-2] + a[i-1], a[i]); 30 Expect.equals(a[i - 2] + a[i - 1], a[i]);
31 } 31 }
32 Expect.equals(515, a[3] = 515); 32 Expect.equals(515, a[3] = 515);
33 } 33 }
34 } 34 }
35 35
36 main() { 36 main() {
37 IndexTest.testMain(); 37 IndexTest.testMain();
38 } 38 }
OLDNEW

Powered by Google App Engine
This is Rietveld 408576698