Library privacy.

dart/frog/leg/elements/elements.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.
 
 #library('elements');
 
 #import('../tree/tree.dart');
 #import('../scanner/scannerlib.dart');
 #import('../leg.dart');  // TODO(karlklose): we only need type.
 #import('../util/util.dart');
@@ skipping 124 matching lines @@
 
   Token position() => null;
 
   Token findMyName(Token token) {
     for (Token t = token; t !== EOF_TOKEN; t = t.next) {
       if (t.value == name) return t;
     }
     return token;
   }
 
-  const Element(this.name, this.kind, this.enclosingElement);
+  Element(this.name, this.kind, this.enclosingElement) {
+    assert(getLibrary() !== null);
+  }
 
   // TODO(kasperl): This is a very bad hash code for the element and
   // there's no reason why two elements with the same name should have
   // the same hash code. Replace this with a simple id in the element?
   int hashCode() => name.hashCode();
 
   CompilationUnitElement getCompilationUnit() {
     Element element = this;
     while (element !== null && !element.isCompilationUnit()) {
       element = element.enclosingElement;
@@ skipping 129 matching lines @@
 
   Element find(SourceString elementName) {
     return elements[elementName];
   }
 
   void forEachExport(f(Element element)) {
     elements.forEach((SourceString _, Element e) {
       if (this === e.getLibrary()
           && e.kind !== ElementKind.PREFIX
           && e.kind !== ElementKind.FOREIGN) {
-        f(e);
+        if (!e.name.isPrivate()) f(e);
       }
     });
   }
 }
 
 class PrefixElement extends Element {
   Map<SourceString, Element> imported;
 
   PrefixElement(SourceString prefix, Element enclosing)
     : imported = new Map<SourceString, Element>(),
@@ skipping 402 matching lines @@
     return result;
   }
 
   Element lookupLocalMember(SourceString memberName) {
     return localMembers[memberName];
   }
 
   Element lookupSuperMember(SourceString memberName) {
     for (ClassElement s = superclass; s != null; s = s.superclass) {
       Element e = s.lookupLocalMember(memberName);
-      if (e !== null) return e;
+      if (e !== null) {
+        if (!memberName.isPrivate() || getLibrary() === e.getLibrary()) {
+          return e;
+        }
+      }
     }
     return null;
   }
 
   Element lookupConstructor(SourceString className,
                             [SourceString constructorName =
                                  const SourceString(''),
                             Element noMatch(Element)]) {
     // TODO(karlklose): have a map from class names to a map of constructors
     //                  instead of creating the name here?
@@ skipping 189 matching lines @@
   final Node node;
   Type bound;
   Type type;
   TypeVariableElement(name, Element enclosing, this.node, this.type,
                       [this.bound])
     : super(name, ElementKind.TYPE_VARIABLE, enclosing);
   Type computeType(compiler) => type;
   Node parseNode(compiler) => node;
   toString() => "${enclosingElement.toString()}.${name.slowToString()}";
 }