add @MirrorsUsed to observe/polymer/polymer_exprs pkgs

pkg/observe/lib/src/observable_map.dart

 // Copyright (c) 2013, 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 observe;
 
 // TODO(jmesserly): this needs to be faster. We currently require multiple
 // lookups per key to get the old value.
 // TODO(jmesserly): this doesn't implement the precise interfaces like
 // LinkedHashMap, SplayTreeMap or HashMap. However it can use them for the
@@ skipping 62 matching lines @@
     if (other is SplayTreeMap) {
       result = new ObservableMap<K, V>.sorted();
     } else if (other is LinkedHashMap) {
       result = new ObservableMap<K, V>.linked();
     } else {
       result = new ObservableMap<K, V>();
     }
     return result;
   }
 
-  Iterable<K> get keys => _map.keys;
+  @reflectable Iterable<K> get keys => _map.keys;
 
-  Iterable<V> get values => _map.values;
+  @reflectable Iterable<V> get values => _map.values;
 
-  int get length =>_map.length;
+  @reflectable int get length =>_map.length;
 
-  bool get isEmpty => length == 0;
+  @reflectable bool get isEmpty => length == 0;
 
-  bool get isNotEmpty => !isEmpty;
+  @reflectable bool get isNotEmpty => !isEmpty;
 
-  bool containsValue(Object value) => _map.containsValue(value);
+  @reflectable bool containsValue(Object value) => _map.containsValue(value);
 
-  bool containsKey(Object key) => _map.containsKey(key);
+  @reflectable bool containsKey(Object key) => _map.containsKey(key);
 
-  V operator [](Object key) => _map[key];
+  @reflectable V operator [](Object key) => _map[key];
 
-  void operator []=(K key, V value) {
+  @reflectable void operator []=(K key, V value) {
     int len = _map.length;
     V oldValue = _map[key];
     _map[key] = value;
     if (hasObservers) {
       if (len != _map.length) {
         notifyPropertyChange(#length, len, _map.length);
         notifyChange(new MapChangeRecord(key, isInsert: true));
       } else if (!identical(oldValue, value)) {
         notifyChange(new MapChangeRecord(key));
       }
@@ skipping 32 matching lines @@
       });
       notifyPropertyChange(#length, len, 0);
     }
     _map.clear();
   }
 
   void forEach(void f(K key, V value)) => _map.forEach(f);
 
   String toString() => Maps.mapToString(this);
 }