| Commit message (Collapse) | Author | Age | Files | Lines |
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
Created dev tag which is the merge-base of master and 2.9.1 (merge-base
is the last common commit), and told ant to generate build strings based
on that. So distributions look like
scala-2.10.0.dev-1289-gbba3918
Where the 1289 means you are 1289 commits ahead of "dev" and
the last segment (minus the g) is the sha-1 hash.
This no doubt breaks windows even further. Help getting it
back on its feet greatly appreciated.
|
|\ |
|
| | |
|
| |
| |
| |
| |
| |
| | |
We're not buying anything with it off by default. Added a
-P:continuations:disable option to disable. -P:continuations:enable
lives on as a no-op. Review by @odersky.
|
|\ \
| | |
| | |
| | |
| | | |
Conflicts:
build.xml
|
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | | |
ScalaDoc."
This reverts commit 086b558f2d025323c86226b2560578c50ee48b84.
It causes two scaladoc tests to fail; the scaladoc tests are almost
completely opaque and I have no time to reverse engineer them.
|
| | | | |
| | \ | |
| | \ | |
| | \ | |
| | \ | |
| | \ | |
| |\ \ \ \ \
| | | | | | |
| | | | | | |
| | | | | | | |
'dcsobral/parserFilter', 'soc/library-range-sum', 'szeiger/feature/enumeration-valueset', 'szeiger/issue/5117' and 'jsuereth/pull-binary-error-message' into develop
|
| | | | | | |
| | | | | | |
| | | | | | |
| | | | | | | |
after initial checkout.
|
| | | |_|/ /
| | |/| | |
| | | | | |
| | | | | |
| | | | | |
| | | | | |
| | | | | |
| | | | | |
| | | | | | |
in for comprehensions. This is required when pattern matching is used on the
result of the generators.
It is implemented through a new filterWithError method on ParseResult.
Contributed by: Daniel C. Sobral
|
| |/ / / /
| | | | |
| | | | |
| | | | |
| | | | | |
which can be used to reliably override the default no success
messages.
|
| | | | | | |
| \ \ \ \ | |
|\ \ \ \ \ \
| | | | | | |
| | | | | | |
| | | | | | | |
'ijuma/feature/signum' into develop
|
| | | | | | |
| | | | | | |
| | | | | | |
| | | | | | |
| | | | | | |
| | | | | | |
| | | | | | |
| | | | | | | |
The Java implementation is faster as it doesn't have branches.
java.lang.Math includes implementations of signum for Double and Float,
but I didn't change the ones in scala.math because there is a difference
on how negative zero is handled.
|
| | |_|_|_|/
| |/| | | |
| | | | | |
| | | | | |
| | | | | |
| | | | | |
| | | | | |
| | | | | | |
Multiple minor fixes to Martin's implementation of reflection infrastructure.
Dominating theme is allowing for the fact that compilation via reflection
involves numerous exports/imports between various reflection universes.
Fixes SI-5230. Review by @odersky.
|
| | | | | |
| | | | | |
| | | | | |
| | | | | | |
and :+, plus one for ++:.
|
|/ / / / /
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | | |
Rolled damaru-levenshtein algorithm back to my original "pure"
version. Cut max distance to 1. Turned on by default because
now it offers nothing unexpected, and removed short-lived
-Ysuggest-idents option.
|
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | | |
Suggest possible alternatives when an identifier is not in scope.
% scala -Ysuggest-idents
scala> import scala.collection.mutable._
import scala.collection.mutable._
scala> new MistBuffer
<console>:11: error: not found: type MistBuffer (similar: ListBuffer, Buffer)
new MistBuffer
^
Too bad, no MistBuffer. We'll settle for ListBuffer.
|
| | | | |
| | | | |
| | | | |
| | | | |
| | | | | |
No secondary "reassignment to val" for unknown identifiers
in assignment position.
|
| | | | | |
|
|/ / / / |
|
| | | |
| | | |
| | | |
| | | | |
This probably doesn't work on windows, help appreciated.
|
| | | | |
|
| | | | |
|
| | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | | |
ScalaDoc."
This reverts commit 086b558f2d025323c86226b2560578c50ee48b84.
It causes two scaladoc tests to fail; the scaladoc tests are almost
completely opaque and I have no time to reverse engineer them.
|
| | | | | |
| \ \ \ | |
| \ \ \ | |
| \ \ \ | |
| \ \ \ | |
| \ \ \ | |
|\ \ \ \ \ \ \
| | | |_|_|/ /
| | |/| | | /
| | | | |_|/
| | | |/| | |
'dcsobral/parserFilter', 'soc/library-range-sum', 'szeiger/feature/enumeration-valueset', 'szeiger/issue/5117' and 'jsuereth/pull-binary-error-message' into develop
|
| | | | |/
| | | | |
| | | | |
| | | | |
| | | | | |
Added better warning message if you've forgotten to run
pull-binary-libs.sh after initial checkout.
|
| | | | |
| | | | |
| | | | |
| | | | | |
Closes SI-5117.
|
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | | |
- Make Enumeration.ValueSet a SortedSet and back it by a BitSet
- Add toBitMask and fromBitMask methods for value sets
- Add an Ordering for the values
- Deprecate names seq in the Enumeration constructor
- Add + method to Value for easy ValueSet creation
|
| | |/ /
| | | |
| | | |
| | | | |
Partially fixes SI-4658. NumericRange stays slow, thanks to the brilliant idea that Numeric doesn't need a division operation.
|
| | |/
| |/|
| | |
| | |
| | |
| | |
| | | |
Complement map and flatMap when used in for comprehensions. This is
required when pattern matching is used on the result of the generators.
It is implemented through a new filterWithError method on ParseResult.
|
|/ /
| |
| |
| | |
Can be used to reliably override the default no success messages.
|
| | | |
| \ | |
|\ \ \
| | | |
| | | |
| | | | |
'soc/scaladoc-spacing' into develop
|
| | |/ |
|
| |/
| |
| |
| | |
Closes SI-3481.
|
|/
|
|
|
| |
Using java.lang.Long.bitCount for the size computation is a lot faster
than the previous Scala implementation. Closes SI-2196.
|
|\ |
|
| |\ \ \
| | | | |
| | | | |
| | | | | |
into develop
|
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | | |
I haven't been able to find any reason for that reversal, but
this version is an improved version provided with SI-3796, which
never got committed along with the patch.
This version generates trees directly instead of using the methods
under test. It also puts an upper bound on tree size and, therefore,
execution time.
|
| | | |/ |
|
| | |/
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | | |
the requirement of a !# line when using it. This is how some other
languages, such as ruby, are run.
Typical usage:
#!/usr/bin/env scala
println("Hello, "+args(0)+"!")
Contributed by: Daniel C. Sobral
|
| |/ |
|
|/
|
|
|
|
|
|
| |
Two files, one with the shas which survived and one with the
missing ones. The missing ones map the svn revisions to the
corresponding sha in the scala-full repository:
https://github.com/paulp/legacy-svn-scala-full
|
|\ \ \
| | | |
| | | |
| | | | |
'remotes/odersky/topic/reify', 'remotes/robinst/master' and 'remotes/szeiger/bitset' into pending
|
| | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | | |
- Mutable and immutable BitSets now extend SortedSet, using a fixed
Ordering.Int and an efficient bit mask based rangeImpl()
- fromArray methods in both implementations are deprecated in favor of
new fromBitMask and fromBitMaskNoCopy methods
- New toBitMask method for converting bit sets back to Array[Long] bit
masks
- immutable.BitSet uses a more efficient Builder, based on
mutable.BitSet (closes SI-4647)
- Delete scala.tools.nsc.util.BitSet (not used anywhere)
Review by @odersky
|
| | |/ |
|
| |/
| |
| |
| | |
emptyValDef has special meaning in the compiler, so reify needs to preserve it by identity and not just by structure.
|
| |
| |
| |
| | |
Turns out that forcing AnnotationInfo on .pos is too eager. Protected by if (forced) now.
|
|/
|
|
| |
Lazy annotation now return positions and one can also set them. Fixes a problem reported by Greg (no ticket created).
|
|\
| |
| |
| | |
A bit more work on the layout layout
|
| | |
|
|\ \
| |/
|/|
| | |
The README.rst still says "Subversion repository"
|