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

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

Issue 1878253002: Adds support for remaining generic method syntax constructs. (Closed) Base URL: https://github.com/dart-lang/sdk.git@master
Patch Set: Added comment at a tricky point Created 4 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) 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 4
5 /// Dart test verifying that the parser can handle type parameterization of
6 /// function declarations and function invocations. Variant of code from
7 /// DEP #22, adjusted to use generic top level functions.
8
9 library generic_functions_test;
10
5 import "package:expect/expect.dart"; 11 import "package:expect/expect.dart";
6 12
7 // Dart test verifying that the parser can handle type parameterization of
8 // function declarations and function invocations. Variant of code from
9 // DEP #22, adjusted to use generic top level functions.
10
11 class BinaryTreeNode<K extends Comparable<K>, V> { 13 class BinaryTreeNode<K extends Comparable<K>, V> {
12 final K _key; 14 final K _key;
13 final V _value; 15 final V _value;
14 final BinaryTreeNode<K, V> _left; 16 final BinaryTreeNode<K, V> _left;
15 final BinaryTreeNode<K, V> _right; 17 final BinaryTreeNode<K, V> _right;
16 18
17 BinaryTreeNode(this._key, this._value, 19 BinaryTreeNode(this._key, this._value,
18 {BinaryTreeNode<K, V> left: null, BinaryTreeNode<K, V> right: null}) : 20 {BinaryTreeNode<K, V> left: null, BinaryTreeNode<K, V> right: null}) :
19 _left = left, _right = right; 21 _left = left, _right = right;
20 22
(...skipping 76 matching lines...) Expand 10 before | Expand all | Expand 10 after
97 99
98 sT = sT.insert(0, ""); 100 sT = sT.insert(0, "");
99 sT = sT.insert(1, " "); 101 sT = sT.insert(1, " ");
100 sT = sT.insert(2, " "); 102 sT = sT.insert(2, " ");
101 sT = sT.insert(3, " "); 103 sT = sT.insert(3, " ");
102 104
103 BinaryTree<num, num> iT = sT.map<num>((String s) => s.length); 105 BinaryTree<num, num> iT = sT.map<num>((String s) => s.length);
104 106
105 Expect.equals(iT.foldPre<num>(0, (int i, num s) => i + s), 6); 107 Expect.equals(iT.foldPre<num>(0, (int i, num s) => i + s), 6);
106 } 108 }
OLDNEW

Powered by Google App Engine
This is Rietveld 408576698