spire icon indicating copy to clipboard operation
spire copied to clipboard

Powerful new number types and numeric abstractions for Scala.

Results 135 spire issues
Sort by recently updated
recently updated
newest added

Remove EuclideanRing. Implement the default methods for Field.

This package adds methods on primitive types that are not present by default. These could be generalized in a typeclass which would mean "this type is a signed integer type";...

housekeeping

I noted that there are no instances of `ConvertibleFrom` or `ConvertibleTo` for `UByte`, `UInt`, `ULong` etc though it is available for `Natural` Is there a reason for that or could...

It would be good to have an easy way to access the maximum and minimum value in the very common case of bounded intervals. @AlecZorab requested this on gitter. Maybe...

extension

In [`random.rng.Utils.longFromSeed`](https://github.com/typelevel/spire/blob/0ee38b7abc9a42fe92a63c654498305ec80be454/core/src/main/scala/spire/random/rng/Utils.scala#L54), a `@volatile` counter variable is used. The intent is presumably to guarantee that two RNG constructions initiated during the same nanosecond will result in two independent RNGs. The...

scala 2.12.10 spire 0.14.1 JRE - tested both on JRE8 and JRE11 After hours tracking down a memory spike (that was enough to tip over to an OOM at the...

When adding longer series of _n_ Doubles the worst-case error can grow proportionally to _n_. The [Kahan summation algorithm](https://en.wikipedia.org/wiki/Kahan_summation_algorithm) is a simple way to keep the error bounded and independent...

new feature

Most of the data types provided by the intervalsets library have been added to spire-extras already, but IntervalMap was not. I propose adding this data type as well, since it...

We state ``` /** Performs a binary search, returns an index using the same convention as java.util.Arrays.binarySearch. */ final def search[@sp A: Order](as: Array[A], item: A, lower: Int, upper: Int):...

good first issue

Default constructors of `BigInt` (and `BigDecimal`) from the string representation have O(n^2) complexity, while for power of 2 bases (like 16) and for others (like 10) corresponding complexities can be...