core/spire.optional

spire.optional

package spire.optional

Type members

Classlikes

final
class IterableGroupoid[A, SA <: IterableOps[A, Iterable, SA]](implicit cbf: Factory[A, SA], A: Group[A]) extends Groupoid[SA]
final
class IterableSemigroupoid[A, SA <: IterableOps[A, Iterable, SA]](implicit cbf: Factory[A, SA], A: Semigroup[A]) extends Semigroupoid[SA]
trait PartialIterable0
trait PartialIterable1 extends PartialIterable0
class Perm extends Int => Int

Represents a permutation encoded as a map from preimages to images, including only pairs that are moved by the permutation (so the identity is Map.empty).

Represents a permutation encoded as a map from preimages to images, including only pairs that are moved by the permutation (so the identity is Map.empty).

Note that although the preimage and image contain only moved points, the domain and range of a Perm is all integers. This acts as the identity for integers not in the image.

Companion
object
object Perm
Companion
class
final
class PermGroup extends Group[Perm]
final
class PermIntAction extends Action[Int, Perm]
final
class PermSeqPartialAction[A, SA <: SeqOps[A, Seq, SA]](implicit cbf: Factory[A, SA]) extends PartialAction[SA, Perm]
trait VectorOrderLow
object genericEq

This provides an implicit Eq[A] for any type A using Scala's (Java's) == (equals). This is generally considered a bad idea, since it means you lose all type safety -- for instance, any 2 types can always be compared as Eq[Any].

This provides an implicit Eq[A] for any type A using Scala's (Java's) == (equals). This is generally considered a bad idea, since it means you lose all type safety -- for instance, any 2 types can always be compared as Eq[Any].

object intervalGeometricPartialOrder
object intervalSubsetPartialOrder
object intervalValuePartialOrder
object partialIterable extends PartialIterable1
object powerSetPartialOrder
object rationalTrig
object totalfloat

This provides orderings (Order and Eq) for Float and Double that have a total order. Specifically, this will order NaN's consistently, rather than having their order be undefined. However, this won't be as fast as the default ordering.

This provides orderings (Order and Eq) for Float and Double that have a total order. Specifically, this will order NaN's consistently, rather than having their order be undefined. However, this won't be as fast as the default ordering.

object vectorOrder extends VectorOrderLow

This object provides implicit instances of Eq and Order for Seq-likes that will behave like infinite vectors. Essentially all this means is that Seq(0, 0, 0) === Seq(), since both are infinite vectors of zeros. Any element not explicitly set is implied to be 0.

This object provides implicit instances of Eq and Order for Seq-likes that will behave like infinite vectors. Essentially all this means is that Seq(0, 0, 0) === Seq(), since both are infinite vectors of zeros. Any element not explicitly set is implied to be 0.