| OLD | NEW |
| 1 // Copyright (c) 2011, the Dart project authors. Please see the AUTHORS file | 1 // Copyright (c) 2011, 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 part of dart.collection; | 5 part of dart.collection; |
| 6 | 6 |
| 7 /** | 7 /** |
| 8 * A [Queue] is a collection that can be manipulated at both ends. One | 8 * A [Queue] is a collection that can be manipulated at both ends. One |
| 9 * can iterate over the elements of a queue through [forEach] or with | 9 * can iterate over the elements of a queue through [forEach] or with |
| 10 * an [Iterator]. | 10 * an [Iterator]. |
| (...skipping 76 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 87 * The `test` function must not throw or modify the queue. | 87 * The `test` function must not throw or modify the queue. |
| 88 */ | 88 */ |
| 89 void retainWhere(bool test(E element)); | 89 void retainWhere(bool test(E element)); |
| 90 | 90 |
| 91 /** | 91 /** |
| 92 * Removes all elements in the queue. The size of the queue becomes zero. | 92 * Removes all elements in the queue. The size of the queue becomes zero. |
| 93 */ | 93 */ |
| 94 void clear(); | 94 void clear(); |
| 95 } | 95 } |
| 96 | 96 |
| 97 class _DoubleLink<Link extends _DoubleLink> { | 97 class _DoubleLink<Link extends _DoubleLink<Link>> { |
| 98 Link _previousLink; | 98 Link _previousLink; |
| 99 Link _nextLink; | 99 Link _nextLink; |
| 100 | 100 |
| 101 void _link(Link previous, Link next) { | 101 void _link(Link previous, Link next) { |
| 102 _nextLink = next; | 102 _nextLink = next; |
| 103 _previousLink = previous; | 103 _previousLink = previous; |
| 104 if (previous != null) previous._nextLink = this; | 104 if (previous != null) previous._nextLink = this; |
| 105 if (next != null) next._previousLink = this; | 105 if (next != null) next._previousLink = this; |
| 106 } | 106 } |
| 107 | 107 |
| (...skipping 764 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 872 _queue._checkModification(_modificationCount); | 872 _queue._checkModification(_modificationCount); |
| 873 if (_position == _end) { | 873 if (_position == _end) { |
| 874 _current = null; | 874 _current = null; |
| 875 return false; | 875 return false; |
| 876 } | 876 } |
| 877 _current = _queue._table[_position]; | 877 _current = _queue._table[_position]; |
| 878 _position = (_position + 1) & (_queue._table.length - 1); | 878 _position = (_position + 1) & (_queue._table.length - 1); |
| 879 return true; | 879 return true; |
| 880 } | 880 } |
| 881 } | 881 } |
| OLD | NEW |