max package:ghc-lib-parser

Retrieves the maximal key of the map, and the map stripped of that element, or Nothing if passed an empty map.

Retrieves the maximal (key,value) pair of the map, and the map stripped of that element, or Nothing if passed an empty map.

maxViewWithKey (fromList [(5,"a"), (3,"b")]) == Just ((5,"a"), singleton 3 "b")
maxViewWithKey empty == Nothing

Retrieves the maximal key of the set, and the set stripped of that element, or Nothing if passed an empty set.

Limit the maximum number of errors to show

Max size, in bytes, of inline array allocations.

Only inline memcpy if it generates no more than this many pseudo (roughly: Cmm) instructions.

Only inline memset if it generates no more than this many pseudo (roughly: Cmm) instructions.

Soft limit on the number of models the pattern match checker checks a pattern against. A safe guard against exponential blow-up.

Maximum number of refinement hole fits to show in typed hole error messages

Maximum number of bindings from the type envt to show in type error messages

Max simplifier iterations

Maximum number of unmatched patterns to show in non-exhaustiveness warnings

Maximum number of hole fits to show in typed hole error messages

The largest element of a non-empty structure. This function is non-total and will raise a runtime exception if the structure happens to be empty. A structure that supports random access and maintains its elements in order should provide a specialised implementation to return the maximum in faster than linear time.

Examples

Basic usage:

>>> maximum [1..10]
10

>>> maximum []
*** Exception: Prelude.maximum: empty list

>>> maximum Nothing
*** Exception: maximum: empty structure

WARNING: This function is partial for possibly-empty structures like lists.

In case of loopy given constraints, how many times should we allow superclass expansions Should be less than max_SOLVER_ITERATIONS See Note [Expanding Recursive Superclasses and ExpansionFuel]

In case of loopy quantified constraints constraints, how many times should we allow superclass expansions Should be less than mAX_SOLVER_ITERATIONS See Note [Expanding Recursive Superclasses and ExpansionFuel]

Default maximum depth for both class instance search and type family reduction. See also #5395.

Default maximum constraint-solver iterations Typically there should be very few