anchor.diff:          // TODO(jacobr): this formula is primitive. We should order by
           // popularity and the number of words into the match instead.
           // Also prioritize base classes over subclasses when sorting(?)
  -        num score = -name.indexOf(query) - element.name.length * 0.001;
  +        num score = -name.indexOf(query) - (element.name.length * 0.001);
           if (element is LibraryElement) score += 200;
           if (element is ClassElement) score += 100;
           if (name == query) score += 1000;
  
positive.code: 
  final indexedLibraries = new Set<LibraryElement>();
  final searchIndex = new SimpleTrie<List<Element>>();
  
  void _indexLibrary(LibraryElement library) {
    library.traverse((Element element) {
  
negative.code:  * Search Result matching an node in the AST.
   */
  class SearchResult implements Comparable {
  
    /** [Element] this search result references. */
    Element element;
  
    /** Score of the search result match. Higher is better. */
    num score;
  
  