Basic numeric class.
Minimal complete definition: all except negate or (-)
Odds and ends, mostly functions for reading and showing RealFloat-like kind of values.
Functions for finding prime numbers, checking whether a number is prime, finding the factors of a number etc.
This package includes the Sieve of O'Neill and two generalizations of the Sieve of Eratosthenes. The Sieve of O'Neill is a fully incremental primality sieve based on priority queues. The other two are array based, and are not incremental. One sieves the smallest prime factor, and is useful if you want to factor a large quantity of small numbers. The other sieves Euler's Totient, which is the number of positive integers relatively prime and less than a given number.
Num, Enum, Eq, Integral, Ord, Real, and Show instances for Lazy ByteStrings
Extract the numerator of the ratio in reduced form: the numerator and denominator have no common factor and the denominator is positive.
Combinators for creating bijections from a subset of an arbitrary type to a range of Ints, , e.g. for using libraries that require Int IDs.
Instances of the numerical classes for a variety of different numbers: (computable) real numbers, arbitrary precision fixed numbers, arbitrary precision floating point numbers, differentiable numbers, symbolic numbers, natural numbers, interval arithmetic.
the value passed to the +RTS -N flag. This is the number of Haskell threads that can run truly simultaneously at any given time, and is typically set to the number of physical CPU cores on the machine.
Contains the number of entries in the colormap of the current window's current layer (0 in RGBA mode).
Contains Just the number of dials and buttons of an attached dial & button box or Nothing if there is none.
Show more results