| OLD | NEW |
| 1 // Copyright (c) 2016, the Dart project authors. Please see the AUTHORS file | 1 // Copyright (c) 2016, 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 // | |
| 5 // DartOptions=--generic-method-syntax | |
| 6 | 4 |
| 7 /// Dart test verifying that the parser can handle type parameterization of | 5 /// Dart test verifying that the parser can handle type parameterization of |
| 8 /// function declarations and function invocations. Variant of code from | 6 /// function declarations and function invocations. Variant of code from |
| 9 /// DEP #22, adjusted to use generic top level functions. | 7 /// DEP #22, adjusted to use generic top level functions. |
| 10 | 8 |
| 11 library generic_functions_test; | 9 library generic_functions_test; |
| 12 | 10 |
| 13 import "package:expect/expect.dart"; | 11 import "package:expect/expect.dart"; |
| 14 | 12 |
| 15 class BinaryTreeNode<K extends Comparable<K>, V> { | 13 class BinaryTreeNode<K extends Comparable<K>, V> { |
| (...skipping 82 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 98 | 96 |
| 99 sT = sT.insert(0, ""); | 97 sT = sT.insert(0, ""); |
| 100 sT = sT.insert(1, " "); | 98 sT = sT.insert(1, " "); |
| 101 sT = sT.insert(2, " "); | 99 sT = sT.insert(2, " "); |
| 102 sT = sT.insert(3, " "); | 100 sT = sT.insert(3, " "); |
| 103 | 101 |
| 104 BinaryTree<num, num> iT = sT.map<num>((String s) => s.length); | 102 BinaryTree<num, num> iT = sT.map<num>((String s) => s.length); |
| 105 | 103 |
| 106 Expect.equals(iT.foldPre<num>(0, (int i, num s) => i + s), 6); | 104 Expect.equals(iT.foldPre<num>(0, (int i, num s) => i + s), 6); |
| 107 } | 105 } |
| OLD | NEW |