Rename InterfaceMirror to ClassMirror

pkg/dartdoc/lib/mirrors_util.dart

 // Copyright (c) 2012, 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.
 
 #library('mirrors.util');
 
 // TODO(rnystrom): Use "package:" URL (#4968).
 #import('mirrors.dart');
 #import('../../../lib/compiler/implementation/util/characters.dart');
 
 //------------------------------------------------------------------------------
 // Utility functions for using the Mirror API
 //------------------------------------------------------------------------------
 
 /**
  * Returns an iterable over the type declarations directly inheriting from
  * the declaration of this type.
  */
-Iterable<InterfaceMirror> computeSubdeclarations(InterfaceMirror type) {
+Iterable<ClassMirror> computeSubdeclarations(ClassMirror type) {
   type = type.declaration;
-  var subtypes = <InterfaceMirror>[];
+  var subtypes = <ClassMirror>[];
   type.system.libraries.forEach((_, library) {
-    for (InterfaceMirror otherType in library.types.values) {
+    for (ClassMirror otherType in library.types.values) {
       var superClass = otherType.superclass;
       if (superClass !== null) {
         superClass = superClass.declaration;
         if (type.library === superClass.library) {
           if (superClass == type) {
              subtypes.add(otherType);
           }
         }
       }
       final superInterfaces = otherType.interfaces;
-      for (InterfaceMirror superInterface in superInterfaces) {
+      for (ClassMirror superInterface in superInterfaces) {
         superInterface = superInterface.declaration;
         if (type.library === superInterface.library) {
           if (superInterface == type) {
             subtypes.add(otherType);
           }
         }
       }
     }
   });
   return subtypes;
@@ skipping 21 matching lines @@
     var charCode = text.charCodeAt(index);
     if (charCode == $CR || charCode == $LF) {
       break;
     }
     index--;
     column++;
   }
   return column;
 }
 
-class HierarchyIterable implements Iterable<InterfaceMirror> {
+class HierarchyIterable implements Iterable<ClassMirror> {
   final bool includeType;
-  final InterfaceMirror type;
+  final ClassMirror type;
 
   HierarchyIterable(this.type, {bool includeType})
       : this.includeType = includeType;
 
-  Iterator<InterfaceMirror> iterator() =>
+  Iterator<ClassMirror> iterator() =>
       new HierarchyIterator(type, includeType: includeType);
 }
 
 /**
  * [HierarchyIterator] iterates through the class hierarchy of the provided
  * type.
  *
  * First is the superclass relation is traversed, skipping [Object], next the
  * superinterface relation and finally is [Object] visited. The supertypes are
  * visited in breadth first order and a superinterface is visited more than once
  * if implemented through multiple supertypes.
  */
-class HierarchyIterator implements Iterator<InterfaceMirror> {
-  final Queue<InterfaceMirror> queue = new Queue<InterfaceMirror>();
-  InterfaceMirror object;
+class HierarchyIterator implements Iterator<ClassMirror> {
+  final Queue<ClassMirror> queue = new Queue<ClassMirror>();
+  ClassMirror object;
 
-  HierarchyIterator(InterfaceMirror type, {bool includeType}) {
+  HierarchyIterator(ClassMirror type, {bool includeType}) {
     if (includeType) {
       queue.add(type);
     } else {
       push(type);
     }
   }
 
-  InterfaceMirror push(InterfaceMirror type) {
+  ClassMirror push(ClassMirror type) {
     if (type.superclass !== null) {
       if (type.superclass.isObject) {
         object = type.superclass;
       } else {
         queue.addFirst(type.superclass);
       }
     }
     queue.addAll(type.interfaces);
     return type;
   }
 
-  InterfaceMirror next() {
-    InterfaceMirror type;
+  ClassMirror next() {
+    ClassMirror type;
     if (queue.isEmpty) {
       if (object === null) {
         throw new StateError("No more elements");
       }
       type = object;
       object = null;
       return type;
     } else {
       return push(queue.removeFirst());
     }
   }
 
   bool get hasNext => !queue.isEmpty || object !== null;
 }