Refactor the collection of initializer list types

lib/compiler/implementation/enqueue.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.
 
 class EnqueueTask extends CompilerTask {
   final Enqueuer codegen;
   final Enqueuer resolution;
 
   String get name() => 'Enqueue';
 
@@ skipping 271 matching lines @@
 
   void registerDynamicInvocation(SourceString methodName, Selector selector) {
     assert(selector !== null);
     registerInvocation(methodName, selector);
   }
 
   void registerDynamicInvocationOf(Element element) {
     addToWorkList(element);
   }
 
-  void registerFieldInitializer(SourceString name, Type type, bool isInteger) {
-    task.measure(() {
-      universe.updateFieldIntegerInitializers(type, name, isInteger);
-    });
-  }
-
   void registerDynamicGetter(SourceString methodName, Selector selector) {
     registerInvokedGetter(methodName, selector);
   }
 
   void registerDynamicSetter(SourceString methodName, Selector selector) {
     registerInvokedSetter(methodName, selector);
   }
 
   void registerFieldGetter(SourceString getterName, Type type) {
     task.measure(() {
       registerNewSelector(getterName,
                           new TypedSelector(type, Selector.GETTER),
                           universe.fieldGetters);
     });
   }
 
-  void registerFieldSetter(SourceString setterName, Type type, bool isInteger) {
+  void registerFieldSetter(SourceString setterName, Type type) {
     task.measure(() {
       registerNewSelector(setterName,
                           new TypedSelector(type, Selector.SETTER),
                           universe.fieldSetters);
-      universe.updateFieldIntegerSetters(type, setterName, isInteger);
     });
   }
 
   // TODO(ngeoffray): This should get a type.
   void registerIsCheck(Element element) {
     universe.isChecks.add(element);
   }
 
   void forEach(f(WorkItem work)) {
     while (!queue.isEmpty()) {
       f(queue.removeLast());
     }
   }
 }