Make mappedBy lazy.

utils/pub/yaml/parser.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.
 
 /**
  * Translates a string of characters into a YAML serialization tree.
  *
  * This parser is designed to closely follow the spec. All productions in the
  * spec are numbered, and the corresponding methods in the parser have the same
  * numbers. This is certainly not the most efficient way of parsing YAML, but it
@@ skipping 395 matching lines @@
    * Adds a tag and an anchor to [node], if they're defined.
    */
   _Node addProps(_Node node, _Pair<_Tag, String> props) {
     if (props == null || node == null) return node;
     if (truth(props.first)) node.tag = props.first;
     if (truth(props.last)) node.anchor = props.last;
     return node;
   }
 
   /** Creates a MappingNode from [pairs]. */
-  _MappingNode mappedBy(List<_Pair<_Node, _Node>> pairs) {
+  _MappingNode map(List<_Pair<_Node, _Node>> pairs) {
     var content = new Map<_Node, _Node>();
     pairs.forEach((pair) => content[pair.first] = pair.last);
     return new _MappingNode("?", content);
   }
 
   /** Runs [fn] in a context named [name]. Used for error reporting. */
   context(String name, fn()) {
     try {
       contextStack.add(name);
       return fn();
@@ skipping 891 matching lines @@
     var pair = or([
       () => transaction(() {
         if (!truth(c_indicator(C_MAPPING_KEY))) return null;
         if (!truth(s_separate(indent, ctx))) return null;
         return ns_flowMapExplicitEntry(indent, ctx);
       }),
       () => ns_flowPairEntry(indent, ctx)
     ]);
     if (!truth(pair)) return null;
 
-    return mappedBy([pair]);
+    return map([pair]);
   }
 
   // 151
   _Pair<_Node, _Node> ns_flowPairEntry(int indent, int ctx) => or([
     () => ns_flowPairYamlKeyEntry(indent, ctx),
     () => c_ns_flowMapEmptyKeyEntry(indent, ctx),
     () => c_ns_flowPairJsonKeyEntry(indent, ctx)
   ]);
 
   // 152
@@ skipping 362 matching lines @@
   _Node l_blockMapping(int indent) => context('mapping', () {
     var additionalIndent = countIndentation() - indent;
     if (additionalIndent <= 0) return null;
 
     var pairs = oneOrMore(() => transaction(() {
       if (!truth(s_indent(indent + additionalIndent))) return null;
       return ns_l_blockMapEntry(indent + additionalIndent);
     }));
     if (!truth(pairs)) return null;
 
-    return mappedBy(pairs);
+    return map(pairs);
   });
 
   // 188
   _Pair<_Node, _Node> ns_l_blockMapEntry(int indent) => or([
     () => c_l_blockMapExplicitEntry(indent),
     () => ns_l_blockMapImplicitEntry(indent)
   ]);
 
   // 189
   _Pair<_Node, _Node> c_l_blockMapExplicitEntry(int indent) {
@@ skipping 48 matching lines @@
   _Node ns_l_compactMapping(int indent) => context('mapping', () {
     var first = ns_l_blockMapEntry(indent);
     if (!truth(first)) return null;
 
     var pairs = zeroOrMore(() => transaction(() {
         if (!truth(s_indent(indent))) return null;
         return ns_l_blockMapEntry(indent);
       }));
     pairs.insertRange(0, 1, first);
 
-    return mappedBy(pairs);
+    return map(pairs);
   });
 
   // 196
   _Node s_l_blockNode(int indent, int ctx) => or([
     () => s_l_blockInBlock(indent, ctx),
     () => s_l_flowInBlock(indent)
   ]);
 
   // 197
   _Node s_l_flowInBlock(int indent) => transaction(() {
@@ skipping 199 matching lines @@
       var pair = contents[i];
       if (pair.first.contains(pos)) return pair.last;
     }
     return null;
   }
 
   /** Associates [value] with [range]. */
   operator[]=(_Range range, E value) =>
     contents.add(new _Pair<_Range, E>(range, value));
 }