Skip to content

HTTPS clone URL

Subversion checkout URL

You can clone with HTTPS or Subversion.

Download ZIP
Commits on Apr 21, 2015
  1. Merge pull request #428 from AlecZorab/master

    authored
    clarify eqv method on Opt.Eq and add tests
  2. clarify eqv method on Opt.Eq and add tests

    azorab authored
Commits on Apr 19, 2015
  1. Merge pull request #426 from kevinmeredith/readme_fix_424

    authored
    Add Import for Implicit Resolution in README
  2. @kevinmeredith
Commits on Apr 11, 2015
  1. Merge pull request #422 from non/topic/remove-rat-approx-context

    authored
    Remove ApproximationContext[Rational] and all uses.
Commits on Apr 10, 2015
  1. fix the FIXMEs

    authored
  2. Remove ApproximationContext[Rational] and all uses.

    authored
    This commit tears out support for NRoot[Rational] using
    implicit ApproximationContext[Rational] instances. Now
    that we have Algebraic and Real, we don't need to support
    this case.
    
    We do still have Numeric[Rational] and Fractional[Rational],
    but those just use Double approximations. Users who require
    more precision can reach for Real or Algebraic.
    
    Fixes #392.
Commits on Apr 9, 2015
  1. @tixxit

    Merge pull request #421 from non/fix-sbt-warning

    tixxit authored
    Remove warning on SBT startup.
Commits on Apr 8, 2015
  1. Merge pull request #388 from non/bug/fix-ulong-to-float

    authored
    Fix bugs with ULong#toFloat and ULong#toDouble.
  2. Remove warning on SBT startup.

    authored
Commits on Apr 7, 2015
  1. Merge pull request #413 from seratch/minor-updates

    authored
    Upgrade minor versions of sbt, scala and libraryDependencies
Commits on Apr 6, 2015
  1. @seratch
  2. @tixxit

    Merge pull request #419 from non/topic/static-analysis2

    tixxit authored
    Use stricter scalac options with Spire.
  3. @seratch
  4. Use stricter scalac options with Spire.

    authored
    This commit adds several extra scalac options that will help
    us catch errors. All warnings have been eliminated, and moving
    forward we should prevent any new warnings from being added.
    
    (Due to inliner warnings, which can't be suppressed, we can't
    use -Xfatal-warnings, unfortunately.)
    
    Eventually I'd like to do more static checking (and maybe
    enforce some common style/idioms), but this is a good first
    step.
Commits on Apr 5, 2015
  1. Merge pull request #418 from xuwei-k/random-Op-resume

    authored
    spire.random.Op#resume should be final.
  2. @xuwei-k

    spire.random.Op#resume should be final.

    xuwei-k authored
    scalac can't apply tail call optimization non-final method.
  3. Merge pull request #417 from xuwei-k/SI-9173

    authored
    explicit return type annotation for Opt#toRight, toLeft
  4. @xuwei-k

    explicit return type annotation for Opt#toRight, toLeft

    xuwei-k authored
    ```
    scala> spire.util.Opt("a").toRight(1)
    res0: Product with Serializable with scala.util.Either[Int,String] = Right(a)
    ```
  5. Merge pull request #416 from xuwei-k/patch-1

    authored
    update readme. latest version is 0.9.1
  6. @xuwei-k
Commits on Mar 24, 2015
  1. Merge pull request #411 from non/bug/polynomial-equals-hashcode

    authored
    Unify and fix Polynomial's equals and hashCode methods.
Commits on Mar 23, 2015
  1. Merge pull request #412 from rklaehn/feature/polynomial-unicode-super…

    authored
    …script
    
    Use unicode superscripts for exponents of polynomials
Commits on Mar 22, 2015
  1. @rklaehn
  2. @rklaehn
  3. @rklaehn

    Use unicode superscripts for exponents of polynomials

    rklaehn authored
    Also allow unicode superscripts when parsing polynomials
Commits on Mar 20, 2015
  1. fix typo

    authored
  2. remove debugging printlns

    authored
  3. Unify and fix Polynomial's equals and hashCode methods.

    authored
    This commit adds a termsIterator method to Polynomial. This method
    returns an Iterator[Term[C]] for all non-zero coefficients in the
    polynomial, from smallest-exponent to largest. This iterator is
    used to implement equality and hashCode in a standardized way that
    works for dense and sparse polynomials.
    
    The hashing formula used is essentially:
    
      val it: Iterator[Term[C]] = p.termsIterator
      val ns: Iterator[Int] = it.map(t => (0xfeed1257 * t.exp) ^ t.coeff.##)
      val hashCode: Int = ns.foldLeft(0)(_ ^ _)
    
    One useful side-effect is that if the terms iterator is empty
    (i.e. the polynomial is zero) the hash code is 0. Also, if p
    consists of a single term whose exponent is zero, the overall
    hashCode will be identical to the hash code of the term's
    cofficient.
    
    One gotcha with the termsIterator method is that it uses a
    (_ == 0) test to filter out terms whose coefficient is zero.
    This necessary in order to support universal equality, and is
    documented in the method's ScalaDoc comment. We could choose
    to make this method private to Spire if it is deemed to be
    "too dangerous".
  4. @tixxit

    Merge pull request #408 from non/bug/rational-coop-equality

    tixxit authored
    Fix cooperative equality bug with Rational.
Commits on Mar 18, 2015
  1. Fix cooperative equality bug with Rational.

    authored
    Resolves #406.
Commits on Mar 17, 2015
  1. Merge pull request #403 from dwijnand/re-enable-warn-unused-import

    authored
    Re-enable -Ywarn-unused-import, with a useful REPL.
  2. @dwijnand
Something went wrong with that request. Please try again.