aboutsummaryrefslogtreecommitdiff
path: root/src/dotty/tools/dotc/typer/Applications.scala
diff options
context:
space:
mode:
authorMartin Odersky <odersky@gmail.com>2014-03-20 10:54:25 +0100
committerTobias Schlatter <tobias@meisch.ch>2014-03-21 11:28:30 +0100
commit72a5f392bf11b6474b351cd81a17d0ceeed13dcc (patch)
tree852be17c2bf42d380eb8078823bca2bfe60b0ccc /src/dotty/tools/dotc/typer/Applications.scala
parent07939c96715cd5adf7f220d239f61b73dd00edc3 (diff)
downloaddotty-72a5f392bf11b6474b351cd81a17d0ceeed13dcc.tar.gz
dotty-72a5f392bf11b6474b351cd81a17d0ceeed13dcc.tar.bz2
dotty-72a5f392bf11b6474b351cd81a17d0ceeed13dcc.zip
Reverting decision what constitutes a double def.
test case t0273. Was positive in Scala 2, is now deemed to be negative. Two two definitions def a = () => () def a[T] = (p:A) => () do have matching signatures, so should constitute a double definition. I previously thought that we can get away if the two definitions have different result types, but then you immediately have a problem because the denotations have matching signatures for the pruposes of "&" yet cannot be merged. Which of the two definitions would override a definition in a base class is then an arbitrary decision.
Diffstat (limited to 'src/dotty/tools/dotc/typer/Applications.scala')
0 files changed, 0 insertions, 0 deletions