summaryrefslogtreecommitdiff
path: root/src/library/scala/reflect/api/Trees.scala
diff options
context:
space:
mode:
authorPaul Phillips <paulp@improving.org>2012-02-12 12:40:11 -0800
committerPaul Phillips <paulp@improving.org>2012-02-12 12:40:11 -0800
commit6b56405cb39b979dccbadd06110e283a254b6150 (patch)
tree0754d9f35804a127eeef7829966aa673467eeec3 /src/library/scala/reflect/api/Trees.scala
parent5133a89556b5194dc53e396168eab73ab7d52e9c (diff)
downloadscala-6b56405cb39b979dccbadd06110e283a254b6150.tar.gz
scala-6b56405cb39b979dccbadd06110e283a254b6150.tar.bz2
scala-6b56405cb39b979dccbadd06110e283a254b6150.zip
Updated existentials test with non-working parts.
Lazy accessors have the same essential problem as described in recent commit messages, so this still doesn't work: def f() = { case class Bob(); Bob } ; lazy val g = f On the whole I'm trying to solve this at the wrong level. The derived accessor methods and fields of a declaration should not ever wander far enough apart that there is any challenge in reconciling them. (The same is true for case classes/objects.) They're dependent synthetics who know about one another from the beginning, all we have to do is not forget. In the meantime, test case.
Diffstat (limited to 'src/library/scala/reflect/api/Trees.scala')
0 files changed, 0 insertions, 0 deletions