A typeclass approach for getting an approximation to an A
using error B
in type C
.
A Bound represents one side of an interval; it is parameterized on T, the ordered type covered by the interval.
This class provides operators for Bound[T] instances when T is a member of the EuclideanRing typeclass (i.
This class provides operators for Bound[T] instances when T is a member of the Field typeclass (i.
This class provides operators for Bound[T] instances when T is a member of the Ring typeclass (i.
Closed is a closed bound (the interval contains this boundary limit).
ClosedAbove is a closed upper bound, i.
ClosedBelow is a closed lower bound, i.
ContinuousInterval represents a lower and upper bound of an ordered type T, where T is a member of EuclideanRing.
DiscreteInterval represents a lower and upper bound of an ordered type T, where T is a member of EuclideanRing.
GenContinuousInterval is an interval whose T is a member of Field.
GenDiscreteInterval is an interval whose T is a member of EuclideanRing.
GenInterval is a trait representing the most generic kind of interval.
GenRingInterval is an interval whose T is a member of Ring.
A generic implementation of ceil/floor that can be mixed in.
Number with an underlying Long representation.
Interval represents a lower and upper bound of an ordered type T.
Lower represents a Bound which is a lower bound.
TODO 3.
Open is a open bound (the interval does not contain this boundary limit).
OpenAbove is an open upper bound, i.
OpenBelow is an open lower bound, i.
An general Real type.
RingInterval represents a lower and upper bound of an ordered type T, where T is a member of Ring.
Provides a type to do safe long arithmetic.
Given a function for finding approximate medians, this will create an exact median finder.
Interface for a sorting strategy object.
Unbound represents a boundary which does not limit its "side" of the interval, i.
UnboundAbove represents an unrestrainted upper bound, i.
UnboundBelow represents an unrestrainted lower bound, i.
Upper represents a Bound which is an upper bound.
FastComplex is an ugly, beautiful hack.
Simple implementation of insertion sort.
In-place merge sort implementation.
Convenient apply and implicits for Numbers
In-place quicksort implementation.
Object providing in-place sorting capability for arrays.