| Commit message (Collapse) | Author | Age | Files | Lines |
| |
|
|
|
|
|
|
|
|
| |
More specifically:
* Importers now preserve wasEmpty and original
* ToolBoxes no longer auto-evaluate nullary functions returned by runExpr
* All local symbols from previous typechecks are now correctly erased by ResetAttrs
* Originals are now reified
|
|\ \
| | |
| | |
| | | |
'scalamacros/pullrequest/5256' into develop
|
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | | |
Reflection now correctly processes classes, objects and inner classes
that are declared in classes and objects.
However classToType still crashes on compound types and local classes.
For more information on those, follow the links:
* Compound types: https://issues.scala-lang.org/browse/SI-5430
* Local classes: https://issues.scala-lang.org/browse/SI-5431
Fixes https://issues.scala-lang.org/browse/SI-5256.
Review by @paulp, @odersky.
|
| |/
| |
| |
| |
| |
| |
| |
| |
| | |
Importers now correctly process constants that carry types and symbols.
However, it is still impossible to reify classOf for a class/trait that
is defined inside a quasiquote.
Theoretically, this can be implemented, but will require attaching
original trees to classOf constants, which needs much more effort.
|
| |
| |
| |
| | |
Not to use the deprecated Enumeration constructor.
|
|/
|
|
|
|
|
|
|
|
|
|
| |
The scanner performs some sketchy heuristics when it sees an ascii 1A
since it may be EOF or it may be part of a literal. Due to this, it
failed to detect an unterminated string literal if the opening quote was
unicode-escaped, leading to memory exhaustion as it read SUs until the
universe ended.
We're parsing a fixed input with known length! There's no reason to be
guessing about whether a char is EOF. If we're at the end of the file,
it's the end of file. Otherwise, it is not the end of the file.
|
|
|
|
|
|
|
|
| |
Version number turning up more than once. Looking at the situation
I could only see the former mechanism as trouble. I deleted
build.number and in ant am generating the build string only from
tools/get-scala-revision. We may need to revisit when the time comes to
build a release.
|
|\ \ \
| | | |
| | | |
| | | | |
'scalamacros/pullrequest/5427' and 'scalamacros/pullrequest/5423' into develop
|
| | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | | |
Default getter for annotations doesn't perform initialization, hence
we've faced the following bug: https://issues.scala-lang.org/browse/SI-5423.
One of the approaches to fixing it would be to auto-complete on getter,
but according to Martin we'd better not do that because of cycles.
That's why I'm just introducing a new, eager, variation of `annotations'
and redirecting public API to it.
Review by @odersky.
|
| | |/ |
|
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | | |
Added a bunch of tests that cover changes related
to switches that were applied to Yvirtpatmat
implementation.
Note: I didn't add those tests progressively because
my changes fix trees after typer phase but do not
affect resulting bytecode. How come? It's because
-Yvirtpatmat will emit pattern for switches and then
the old pattern matcher implementation would transform
them in the old fashion in explicitouter. We cannot
disable the old pattern matcher in explicitouter yet
because it doesn't handle patterns used for catching
exceptions.
Thus, consider this as a sign of the fact that Yvirtpatmat
is still work in progress.
|
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | | |
Further improvements to how -Yvirtpatmat
handles switch-like patterns that can be
translated to switch tables.
First of all, we added a check whether
a type of an expression we pattern match
on is in the set of allowed types for
switch patterns.
If yes, we translate a pattern to switch
one by converting both an expression we
pattern match on and literals in a pattern
to an Int.
I borrowed an idea of converting to Ints
from both old pattern matcher implementation
and from how javac handles it.
|
| | | |
|
| | | |
|
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | | |
Implemented unfolding of pattern alternatives
that can be translated into switch table in
genicode. This way pattern matcher can keep
simple patterns as-is and let backend handle
translation of them instead of generating
bunch of LabelDefs and jumps.
Review by @dragos or @magarciaEPFL as both
seem to know genicode very well.
|
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | | |
The problem of emitSWITCH not handling empty
keys popped up when I tried to implement
unfolding of pattern alternatives in genicode
instead of in typers/explicitouter.
This change makes perfect sense in isolation
as bytecode allows LOOKUPSWITCHes that have
only default case. I actually verified that
this kind of bytecode is generated by javac
when one has switch statement with only
default case defined.
Review by @paulp or @dragos.
|
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | | |
Hopefully this will satisfy all version-interesting parties.
Version string now looks like this:
v2.10.0-M1-0098-gbda61bb7e5-2012-02-01
Review by @dragos and anyone who uses windows (where it
definitely won't produce that string, but hopefully it produces
some usable string.)
|
| | |
| | |
| | |
| | |
| | | |
Negative "to" index should be normalized to 0 before using it
in a difference operation.
|
| | | |
|
|/ / |
|
| | |
|
|/
|
|
|
| |
Utilize knowledge of case class synthetic equals to rule out
some comparisons statically. Closes SI-5426.
|
|
|
|
|
| |
If your compiler .desired.sha1 is newer than the jar, it will
go download it.
|
|
|
|
|
|
|
|
|
| |
This one's about a million years overdue. Try this on for size,
from the command line:
printf ":power\nList(1).?.baseClasses.sigs >\n" | scala
Also, a little more power mode refinement.
|
|\ |
|
| |\ \
| | | |
| | | |
| | | | |
'hubertp/ticket/4336' into develop
|
| | | |
| | | |
| | | |
| | | | |
Some of the type params might already be instantiated if explicit type application is done. Review by @adriaanm
|
| | |\| |
|
| | | | |
|
| | | | |
|
| |\ \ \
| | |_|/
| |/| | |
AvlTree performance improvements
|
| | | | |
|
| | | |
| | | |
| | | |
| | | | |
implementations performances.
|
| | | |
| | | |
| | | |
| | | | |
Use a specialized iterator.
|
| | | |
| | | |
| | | |
| | | | |
recursion is not necessary here.
|
| | | | |
|
|/ / /
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | | |
And disambiguations. And renamed all kinds of methods to something
less inscrutable. Moved all the instance-to-compiler-structure implicit
behind a wrapper to avoid accidental conversions. The wrapper has
a single method, ?, which you can experience like so:
// Sorry tab completion doesn't yet figure out implicit conversions
scala> val x = Map(1 -> 2).?
x: $r.power.InternalInfo[scala.collection.immutable.Map[Int,Int]] = Map(1 -> 2) (Map)
scala> x.
asInstanceOf baseTypeSeq baseTypeSeqMap baseTypeWhichDefines companion
decls declsOriginal declsOverride erasure fullManifest
glb info isInstanceOf lub memberMethods
memberTypes members membersDeclared membersInherited membersUnabridged
moduleClass name owner owners pkg
pkgClass pkgClassSymbols pkgClasses pkgMembers pkgName
pkgSymbols shortClass signature symbol toString
tpe
// This uses an implicit to install sigs (and another for '>' which is
// the generic printing function) but transparency, one step at a time.
scala> Map(1 -> 2).?.membersDeclared.sigs >
def $init$(): Unit
override def empty: scala.collection.immutable.Map[A,B]
override def toMap[T,U](implicit ev: <:<[(A, B),(T, U)]): scala.collection.immutable.Map[T,U]
override def seq: scala.collection.immutable.Map[A,B]
def withDefault[B1 >: B](d: A => B1): scala.collection.immutable.Map[A,B1]
def withDefaultValue[B1 >: B](d: B1): scala.collection.immutable.Map[A,B1]
override def updated[B1 >: B](key: A,value: B1): scala.collection.immutable.Map[A,B1]
def +[B1 >: B](kv: (A, B1)): scala.collection.immutable.Map[A,B1]
|
| | | | |
| \ \ | |
|\ \ \ \
| | | | |
| | | | |
| | | | | |
'scalamacros/ticket/5418' into develop
|
| | | | | |
|
| |/ / /
| | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | | |
This very situational option proved to be very useful when debugging
https://issues.scala-lang.org/browse/SI-5415
With the help of -Yshow-symkinds, it became possible to distinguish
a free var from a module symbol, which gave precise indication of the
root of the bug.
|
| | | | |
|
| | | | |
|
| | | | |
|
| | | |
| | | |
| | | |
| | | |
| | | | |
I love the smell of polymorphic method synthesis in the
early afternoon.
|
| | | | |
|
| | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | | |
Finally had a concrete motivation to change partest's inexplicable
ISO-8859-1 encoding to UTF-8. My test case would cause it to barf
"illegal character". Is this going to break on windows or something?
If so, it's time to fix the broken place which can't handle UTF-8.
|
| | | |
| | | |
| | | |
| | | | |
At least tell us what they are.
|
| | | |
| | | |
| | | |
| | | | |
This reverts commit 6a5901461c1aaac7dd8786cb374b079520895527.
|
| | | | | |
| \ \ \ | |
|\ \ \ \ \
| | | | | |
| | | | | |
| | | | | | |
'axel22/feature/immutable-thread-safe' into develop
|