Make isEmpty a getter.

lib/compiler/implementation/util/link_implementation.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.
 
 class LinkIterator<T> implements Iterator<T> {
   Link<T> current;
   LinkIterator(Link<T> this.current);
-  bool get hasNext => !current.isEmpty();
+  bool get hasNext => !current.isEmpty;
   T next() {
     T result = current.head;
     current = current.tail;
     return result;
   }
 }
 
 class LinkEntry<T> extends Link<T> {
   final T head;
   Link<T> tail;
 
   LinkEntry(T this.head, [Link<T> tail])
     : this.tail = ((tail == null) ? new Link<T>() : tail);
 
   Link<T> prepend(T element) {
     // TODO(ahe): Use new Link<T>, but this cost 8% performance on VM.
     return new LinkEntry<T>(element, this);
   }
 
   void printOn(StringBuffer buffer, [separatedBy]) {
     buffer.add(head);
     if (separatedBy == null) separatedBy = '';
-    for (Link link = tail; !link.isEmpty(); link = link.tail) {
+    for (Link link = tail; !link.isEmpty; link = link.tail) {
       buffer.add(separatedBy);
       buffer.add(link.head);
     }
   }
 
   String toString() {
     StringBuffer buffer = new StringBuffer();
     buffer.add('[ ');
     printOn(buffer, ', ');
     buffer.add(' ]');
     return buffer.toString();
   }
 
   Link<T> reverse() {
     Link<T> result = const Link();
-    for (Link<T> link = this; !link.isEmpty(); link = link.tail) {
+    for (Link<T> link = this; !link.isEmpty; link = link.tail) {
       result = result.prepend(link.head);
     }
     return result;
   }
 
   Link<T> reversePrependAll(Link<T> from) {
     Link<T> result;
-    for (result = this; !from.isEmpty(); from = from.tail) {
+    for (result = this; !from.isEmpty; from = from.tail) {
       result = result.prepend(from.head);
     }
     return result;
   }
 
 
-  bool isEmpty() => false;
+  bool get isEmpty => false;
 
   List<T> toList() {
     List<T> list = new List<T>();
-    for (Link<T> link = this; !link.isEmpty(); link = link.tail) {
+    for (Link<T> link = this; !link.isEmpty; link = link.tail) {
       list.addLast(link.head);
     }
     return list;
   }
 
   void forEach(void f(T element)) {
-    for (Link<T> link = this; !link.isEmpty(); link = link.tail) {
+    for (Link<T> link = this; !link.isEmpty; link = link.tail) {
       f(link.head);
     }
   }
 
   bool operator ==(other) {
     if (other is !Link<T>) return false;
     Link<T> myElements = this;
-    while (!myElements.isEmpty() && !other.isEmpty()) {
+    while (!myElements.isEmpty && !other.isEmpty) {
       if (myElements.head != other.head) {
         return false;
       }
       myElements = myElements.tail;
       other = other.tail;
     }
-    return myElements.isEmpty() && other.isEmpty();
+    return myElements.isEmpty && other.isEmpty;
   }
 }
 
 class LinkBuilderImplementation<T> implements LinkBuilder<T> {
   LinkEntry<T> head = null;
   LinkEntry<T> lastLink = null;
   int length = 0;
 
   LinkBuilderImplementation();
 
@@ skipping 10 matching lines @@
     length++;
     LinkEntry<T> entry = new LinkEntry<T>(t, null);
     if (head == null) {
       head = entry;
     } else {
       lastLink.tail = entry;
     }
     lastLink = entry;
   }
 }