Rename XMatching to XWhere.

sdk/lib/collection/queue.dart

 // Copyright (c) 2011, the Dart project authors.  Please see the AUTHORS file
 // for details. All rights reserved. Use of this source code is governed by a
 // BSD-style license that can be found in the LICENSE file.
 
 part of dart.collection;
 
 /**
  * A [Queue] is a collection that can be manipulated at both ends. One
  * can iterate over the elements of a queue through [forEach] or with
  * an [Iterator].
@@ skipping 207 matching lines @@
       if (entry.element == o) {
         entry.remove();
         _elementCount--;
         return;
       }
       entry = entry._next;
     }
   }
 
   void removeAll(Iterable elements) {
-    // Use this method when remove is slow and removeMatching more efficient.
+    // Use this method when remove is slow and removeWhere more efficient.
     IterableMixinWorkaround.removeAllList(this, elements);
   }
 
-  void removeMatching(bool test(E element)) {
+  void removeWhere(bool test(E element)) {
     DoubleLinkedQueueEntry<E> entry = firstEntry();
     while (!identical(entry, _sentinel)) {
       DoubleLinkedQueueEntry<E> next = entry._next;
       if (test(entry.element)) {
         entry.remove();
         _elementCount--;
       }
       entry = next;
     }
   }
 
-  void retainMatching(bool test(E element)) {
+  void retainWhere(bool test(E element)) {
     DoubleLinkedQueueEntry<E> entry = firstEntry();
     while (!identical(entry, _sentinel)) {
       DoubleLinkedQueueEntry<E> next = entry._next;
       if (!test(entry.element)) {
         entry.remove();
         _elementCount--;
       }
       entry = next;
     }
   }
@@ skipping 80 matching lines @@
 
 /**
  * List based [Queue].
  *
  * Keeps a cyclic buffer of elements, and grows to a larger buffer when
  * it fills up. This guarantees constant time peek and remove operations, and
  * amortized constant time add operations.
  *
  * The structure is efficient for any queue or stack usage.
  *
- * Collection operations like [removeAll] and [removeMatching] are very
+ * Collection operations like [removeAll] and [removeWhere] are very
  * inefficient. If those are needed, use a [DoubleLinkedQueue] instead.
  */
 class ListQueue<E> extends Collection<E> implements Queue<E>{
   static const int _INITIAL_CAPACITY = 8;
   List<E> _table;
   int _head;
   int _tail;
   int _modificationCount = 0;
 
   /**
@@ skipping 126 matching lines @@
   }
 
   void removeAll(Iterable objectsToRemove) {
     IterableMixinWorkaround.removeAllList(this, objectsToRemove);
   }
 
   void retainAll(Iterable objectsToRetain) {
     IterableMixinWorkaround.retainAll(this, objectsToRetain);
   }
 
-  void _filterMatching(bool test(E element), bool removeMatching) {
+  void _filterWhere(bool test(E element), bool removeMatching) {
     int index = _head;
     int modificationCount = _modificationCount;
     int i = _head;
     while (i != _tail) {
       E element = _table[i];
       bool remove = (test(element) == removeMatching);
       _checkModification(modificationCount);
       if (remove) {
         i = _remove(i);
         modificationCount = ++_modificationCount;
       } else {
         i = (i + 1) & (_table.length - 1);
       }
     }
   }
 
   /**
    * Remove all elements matched by [test].
    *
    * This method is inefficient since it works by repeatedly removing single
    * elements, each of which can take linear time.
    */
-  void removeMatching(bool test(E element)) {
-    _filterMatching(test, true);
+  void removeWhere(bool test(E element)) {
+    _filterWhere(test, true);
   }
 
   /**
    * Remove all elements not matched by [test].
    *
    * This method is inefficient since it works by repeatedly removing single
    * elements, each of which can take linear time.
    */
-  void retainMatching(bool test(E element)) {
-    _filterMatching(test, false);
+  void retainWhere(bool test(E element)) {
+    _filterWhere(test, false);
   }
 
   void clear() {
     if (_head != _tail) {
       for (int i = _head; i != _tail; i = (i + 1) & (_table.length - 1)) {
         _table[i] = null;
       }
       _head = _tail = 0;
       _modificationCount++;
     }
@@ skipping 170 matching lines @@
     _queue._checkModification(_modificationCount);
     if (_position == _end) {
       _current = null;
       return false;
     }
     _current = _queue._table[_position];
     _position = (_position + 1) & (_queue._table.length - 1);
     return true;
   }
 }