Partial is:module

ConstraintKind synonym for marking partial functions

Lazy ByteString partial functions. Import as:

import qualified RIO.ByteString.Lazy.Partial as BL'

Strict ByteString partial functions. Import as:

import qualified RIO.ByteString.Partial as B'

Unicode Char partial functions. Import as:

import qualified RIO.Char.Partial as C'

Strict HashMap partial functions. Import as:

import qualified RIO.HashMap.Partial as HM'

List partial functions. Import as:

import qualified RIO.List.Partial as L'

Strict Map partial functions. Import as:

import qualified RIO.Map.Partial as Map'

NonEmpty list partial functions. Import as:

import qualified RIO.NonEmpty.Partial as NE'

Partial functions. Import as:

import qualified RIO.Partial as RIO'

Set partial functions. Import as:

import qualified RIO.Set.Partial as Set'

Lazy Text partial functions. Import as:

import qualified RIO.Text.Lazy.Partial as TL'

Strict Text partial functions. Import as:

import qualified RIO.Text.Partial as T'

Boxed Vector partial functions. Import as:

import qualified RIO.Vector.Boxed.Partial as VB'

Generic Vector interface partial functions. Import as:

import qualified RIO.Vector.Partial as V'

Storable Vector partial functions. Import as:

import qualified RIO.Vector.Storable.Partial as VS'

Unboxed Vector partial functions. Import as:

import qualified RIO.Vector.Unboxed.Partial as VU'

Partial functions vocabulary This module provides common partial functions for operating on ShortText. The use of these functions is discouraged as they tend to be error-prone.

Code related to PSBT parsing and serialization.

Often, various operations on values are only partially defined (in the case of Crucible expressions, consider loading a value from a pointer - this is only defined in the case that the pointer is valid and non-null). The PartExpr type allows for packaging values together with predicates that express their partiality: the value is only valid if the predicate is true.

This module provides methods to support operations on partially ordered collections. The partial ordering relationship is represented by Maybe Ordering. Thanks to members of the haskell-cafe mailing list - Robert (rvollmert-lists@gmx.net) and Tom Pledger (Tom.Pledger@peace.com) - who suggested key ideas on which some of the code in this module is based.

Implementation of partial fractions. Useful e.g. for fractions of integers and fractions of polynomials. For the considered ring the prime factorization must be unique.

Define Transcendental functions on arbitrary fields. These functions are defined for only a few (in most cases only one) arguments, that's why we discourage making these types instances of C. But instances of C can be useful when working with power series. If you intend to work with power series with Rational coefficients, you might consider using MathObj.PowerSeries.T (Number.PartiallyTranscendental.T Rational) instead of MathObj.PowerSeries.T Rational.