| 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.collection; | 8 library engine.utilities.collection; |
| 9 | 9 |
| 10 import "dart:math" as math; | 10 import "dart:math" as math; |
| (...skipping 451 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 462 component.add(w); | 462 component.add(w); |
| 463 _nodeMap[w].component = component; | 463 _nodeMap[w].component = component; |
| 464 } while (!identical(w, v)); | 464 } while (!identical(w, v)); |
| 465 _allComponents.add(component); | 465 _allComponents.add(component); |
| 466 } | 466 } |
| 467 return vInfo; | 467 return vInfo; |
| 468 } | 468 } |
| 469 } | 469 } |
| 470 | 470 |
| 471 /** | 471 /** |
| 472 * An efficient [int] set. | |
| 473 * Currently not really efficient. | |
| 474 */ | |
| 475 class IntSet { | |
| 476 HashSet<int> _set = new HashSet<int>(); | |
| 477 | |
| 478 bool get isEmpty { | |
| 479 return _set.isEmpty; | |
| 480 } | |
| 481 | |
| 482 void add(int value) { | |
| 483 _set.add(value); | |
| 484 } | |
| 485 | |
| 486 int remove() { | |
| 487 int value = _set.first; | |
| 488 _set.remove(value); | |
| 489 return value; | |
| 490 } | |
| 491 | |
| 492 @override | |
| 493 String toString() { | |
| 494 return _set.toString(); | |
| 495 } | |
| 496 } | |
| 497 | |
| 498 /** | |
| 499 * The class `ListUtilities` defines utility methods useful for working with [Li
st | 472 * The class `ListUtilities` defines utility methods useful for working with [Li
st |
| 500 ]. | 473 ]. |
| 501 */ | 474 */ |
| 502 class ListUtilities { | 475 class ListUtilities { |
| 503 /** | 476 /** |
| 504 * Add all of the elements in the given array to the given list. | 477 * Add all of the elements in the given array to the given list. |
| 505 * | 478 * |
| 506 * @param list the list to which the elements are to be added | 479 * @param list the list to which the elements are to be added |
| 507 * @param elements the elements to be added to the list | 480 * @param elements the elements to be added to the list |
| 508 */ | 481 */ |
| (...skipping 252 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 761 /** | 734 /** |
| 762 * Map the key to the value. | 735 * Map the key to the value. |
| 763 * | 736 * |
| 764 * @param key the token being mapped to the value | 737 * @param key the token being mapped to the value |
| 765 * @param value the token to which the key will be mapped | 738 * @param value the token to which the key will be mapped |
| 766 */ | 739 */ |
| 767 void put(Token key, Token value) { | 740 void put(Token key, Token value) { |
| 768 _map[key] = value; | 741 _map[key] = value; |
| 769 } | 742 } |
| 770 } | 743 } |
| OLD | NEW |