Denis Rosset
Denis Rosset
The `Complex` implementation is missing some intermediate operations for integer coefficients. Steps: - [ ] Implement Euclidean division by adding a typeclass `ComplexIsEuclideanRing` between `ComplexIsCRing` and `ComplexIsField`, add implementation classes...
The behavior of the binary search is the same as Java's `Arrays.binarySearch`: it either returns the index of the element, or `-insertionIndex - 1`. But for the parameters, it asks...
ceil and floor probably correspond to truncated division by 1.
This would be the right way to track a bunch of related issues.
These types are implicitly real, as 1) complex conjugation is not well supported and 2) the norm value should be real while the scalar could be complex. Until we find...
The partial structures (groupoid, ...) have little use. Deprecate them if there is no interest.
Right now, it is not clear how we handle sparse or arbitrary-sized vectors; especially how to handle zero-valued keys (Map), or trailing zeros (Seq, Array, ...). Until we find a...
This collects all proposals to integrate multivariate polynomials in Spire. Note: we should be careful about handling (non-?)commutativity, and which polynomial ring is obtained depending on the coefficient type. -...
This issue collects PR or "new feature" issues concerning the support of linear algebra in Spire. At this time, it is not clear if this should be done in Spire...
We should implement `Hash` for all Spire data types, and revisit these classes