| 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 library analyzer.src.generated.utilities_collection; | 5 library analyzer.src.generated.utilities_collection; |
| 6 | 6 |
| 7 import 'dart:collection'; | 7 import 'dart:collection'; |
| 8 import "dart:math" as math; | 8 import "dart:math" as math; |
| 9 | 9 |
| 10 import 'package:analyzer/src/generated/java_core.dart'; | 10 import 'package:analyzer/src/generated/java_core.dart'; |
| (...skipping 448 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 459 component.add(w); | 459 component.add(w); |
| 460 _nodeMap[w].component = component; | 460 _nodeMap[w].component = component; |
| 461 } while (!identical(w, v)); | 461 } while (!identical(w, v)); |
| 462 _allComponents.add(component); | 462 _allComponents.add(component); |
| 463 } | 463 } |
| 464 return vInfo; | 464 return vInfo; |
| 465 } | 465 } |
| 466 } | 466 } |
| 467 | 467 |
| 468 /** | 468 /** |
| 469 * The class `ListUtilities` defines utility methods useful for working with [Li
st | |
| 470 ]. | |
| 471 */ | |
| 472 class ListUtilities { | |
| 473 /** | |
| 474 * Add all of the elements in the given array to the given list. | |
| 475 * | |
| 476 * @param list the list to which the elements are to be added | |
| 477 * @param elements the elements to be added to the list | |
| 478 */ | |
| 479 static void addAll(List list, List<Object> elements) { | |
| 480 int count = elements.length; | |
| 481 for (int i = 0; i < count; i++) { | |
| 482 list.add(elements[i]); | |
| 483 } | |
| 484 } | |
| 485 } | |
| 486 | |
| 487 /** | |
| 488 * The interface `MapIterator` defines the behavior of objects that iterate over
the entries | 469 * The interface `MapIterator` defines the behavior of objects that iterate over
the entries |
| 489 * in a map. | 470 * in a map. |
| 490 * | 471 * |
| 491 * This interface defines the concept of a current entry and provides methods to
access the key and | 472 * This interface defines the concept of a current entry and provides methods to
access the key and |
| 492 * value in the current entry. When an iterator is first created it will be posi
tioned before the | 473 * value in the current entry. When an iterator is first created it will be posi
tioned before the |
| 493 * first entry and there is no current entry until [moveNext] is invoked. When a
ll of the | 474 * first entry and there is no current entry until [moveNext] is invoked. When a
ll of the |
| 494 * entries have been accessed there will also be no current entry. | 475 * entries have been accessed there will also be no current entry. |
| 495 * | 476 * |
| 496 * There is no guarantee made about the order in which the entries are accessibl
e. | 477 * There is no guarantee made about the order in which the entries are accessibl
e. |
| 497 */ | 478 */ |
| (...skipping 236 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 734 /** | 715 /** |
| 735 * Map the key to the value. | 716 * Map the key to the value. |
| 736 * | 717 * |
| 737 * @param key the token being mapped to the value | 718 * @param key the token being mapped to the value |
| 738 * @param value the token to which the key will be mapped | 719 * @param value the token to which the key will be mapped |
| 739 */ | 720 */ |
| 740 void put(Token key, Token value) { | 721 void put(Token key, Token value) { |
| 741 _map[key] = value; | 722 _map[key] = value; |
| 742 } | 723 } |
| 743 } | 724 } |
| OLD | NEW |