| OLD | NEW |
| 1 // Copyright (c) 2014, the Dart project authors. Please see the AUTHORS file | 1 // Copyright (c) 2014, 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 // This code was auto-generated, is not intended to be edited, and is subject to | 5 // This code was auto-generated, is not intended to be edited, and is subject to |
| 6 // significant change. Please see the README file for more information. | 6 // significant change. Please see the README file for more information. |
| 7 | 7 |
| 8 library engine.utilities_test; | 8 library engine.utilities_test; |
| 9 | 9 |
| 10 import 'dart:collection'; | 10 import 'dart:collection'; |
| (...skipping 2384 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 2395 DirectedGraph<DirectedGraphTest_Node> graph = | 2395 DirectedGraph<DirectedGraphTest_Node> graph = |
| 2396 new DirectedGraph<DirectedGraphTest_Node>(); | 2396 new DirectedGraph<DirectedGraphTest_Node>(); |
| 2397 graph.addEdge(node1, node2); | 2397 graph.addEdge(node1, node2); |
| 2398 graph.addEdge(node2, node1); | 2398 graph.addEdge(node2, node1); |
| 2399 graph.addEdge(node1, node3); | 2399 graph.addEdge(node1, node3); |
| 2400 graph.addEdge(node3, node4); | 2400 graph.addEdge(node3, node4); |
| 2401 graph.addEdge(node4, node3); | 2401 graph.addEdge(node4, node3); |
| 2402 List<List<DirectedGraphTest_Node>> topologicalSort = | 2402 List<List<DirectedGraphTest_Node>> topologicalSort = |
| 2403 graph.computeTopologicalSort(); | 2403 graph.computeTopologicalSort(); |
| 2404 expect(topologicalSort, hasLength(2)); | 2404 expect(topologicalSort, hasLength(2)); |
| 2405 EngineTestCase.assertContains(topologicalSort[0], [node3, node4]); | 2405 expect(topologicalSort[0], unorderedEquals([node3, node4])); |
| 2406 EngineTestCase.assertContains(topologicalSort[1], [node1, node2]); | 2406 expect(topologicalSort[1], unorderedEquals([node1, node2])); |
| 2407 } | 2407 } |
| 2408 } | 2408 } |
| 2409 | 2409 |
| 2410 /** | 2410 /** |
| 2411 * Instances of the class `Node` represent simple nodes used for testing purpose
s. | 2411 * Instances of the class `Node` represent simple nodes used for testing purpose
s. |
| 2412 */ | 2412 */ |
| 2413 class DirectedGraphTest_Node { | 2413 class DirectedGraphTest_Node { |
| 2414 } | 2414 } |
| 2415 | 2415 |
| 2416 class Getter_NodeReplacerTest_testAnnotatedNode implements | 2416 class Getter_NodeReplacerTest_testAnnotatedNode implements |
| (...skipping 2882 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 5299 } | 5299 } |
| 5300 | 5300 |
| 5301 void test_get_added() { | 5301 void test_get_added() { |
| 5302 TokenMap tokenMap = new TokenMap(); | 5302 TokenMap tokenMap = new TokenMap(); |
| 5303 Token key = TokenFactory.tokenFromType(TokenType.AT); | 5303 Token key = TokenFactory.tokenFromType(TokenType.AT); |
| 5304 Token value = TokenFactory.tokenFromType(TokenType.AT); | 5304 Token value = TokenFactory.tokenFromType(TokenType.AT); |
| 5305 tokenMap.put(key, value); | 5305 tokenMap.put(key, value); |
| 5306 expect(tokenMap.get(key), same(value)); | 5306 expect(tokenMap.get(key), same(value)); |
| 5307 } | 5307 } |
| 5308 } | 5308 } |
| OLD | NEW |