| Safe Haskell | None |
|---|---|
| Language | Haskell2010 |
Basics
Contents
Description
Tons of useful functions that get imported by default.
Synopsis
- type Int = Int64
- type Float = Double
- (+) :: Num number => number -> number -> number
- (-) :: Num number => number -> number -> number
- (*) :: Num number => number -> number -> number
- (/) :: Float -> Float -> Float
- (//) :: Int -> Int -> Int
- (^) :: Float -> Float -> Float
- toFloat :: Int -> Float
- round :: Float -> Int
- floor :: Float -> Int
- ceiling :: Float -> Int
- truncate :: Float -> Int
- (==) :: Eq a => a -> a -> Bool
- (/=) :: Eq a => a -> a -> Bool
- (<) :: Ord comparable => comparable -> comparable -> Bool
- (>) :: Ord comparable => comparable -> comparable -> Bool
- (<=) :: Ord comparable => comparable -> comparable -> Bool
- (>=) :: Ord comparable => comparable -> comparable -> Bool
- max :: Ord comparable => comparable -> comparable -> comparable
- min :: Ord comparable => comparable -> comparable -> comparable
- compare :: Ord comparable => comparable -> comparable -> Order
- type Order = Ordering
- data Ordering
- data Bool
- not :: Bool -> Bool
- (&&) :: Bool -> Bool -> Bool
- (||) :: Bool -> Bool -> Bool
- xor :: Bool -> Bool -> Bool
- (++) :: Semigroup appendable => appendable -> appendable -> appendable
- modBy :: Int -> Int -> Int
- remainderBy :: Int -> Int -> Int
- negate :: Num number => number -> number
- abs :: Num number => number -> number
- clamp :: Ord number => number -> number -> number -> number
- sqrt :: Float -> Float
- logBase :: Float -> Float -> Float
- e :: Float
- degrees :: Float -> Float
- radians :: Float -> Float
- turns :: Float -> Float
- pi :: Float
- cos :: Float -> Float
- sin :: Float -> Float
- tan :: Float -> Float
- acos :: Float -> Float
- asin :: Float -> Float
- atan :: Float -> Float
- atan2 :: Float -> Float -> Float
- toPolar :: (Float, Float) -> (Float, Float)
- fromPolar :: (Float, Float) -> (Float, Float)
- isNaN :: Float -> Bool
- isInfinite :: Float -> Bool
- identity :: a -> a
- always :: a -> b -> a
- (<|) :: (a -> b) -> a -> b
- (|>) :: a -> (a -> b) -> b
- (<<) :: (b -> c) -> (a -> b) -> a -> c
- (>>) :: (a -> b) -> (b -> c) -> a -> c
- type Never = Void
- never :: Never -> a
- class Eq a
- class Eq a => Ord a
- class Num a
Math
An Int is a whole number. Valid syntax for integers includes:
0 42 9000 0xFF -- 255 in hexadecimal 0x000A -- 10 in hexadecimal
Note: Int math is well-defined in the range -2^31 to 2^31 - 1.
Historical Note: The name Int comes from the term integer. It appears that the int abbreviation was introduced in ALGOL 68, shortening it from integer in ALGOL 60. Today, almost all programming languages use this abbreviation.
A Float is a floating-point number. Valid syntax for floats includes:
0 42 3.14 0.1234 6.022e23 -- == (6.022 * 10^23) 6.022e+23 -- == (6.022 * 10^23) 1.602e-19 -- == (1.602 * 10^-19) 1e3 -- == (1 * 10^3) == 1000
Historical Note: The particular details of floats (e.g. NaN) are
specified by IEEE 754 which is
literally hard-coded into almost all CPUs in the world. That means if you
think NaN is weird, you must successfully overtake Intel and AMD with a
chip that is not backwards compatible with any widely-used assembly
language.
(+) :: Num number => number -> number -> number infixl 6 Source #
Add two numbers. The number type variable means this operation can be
specialized to Int -> Int -> Int or to Float -> Float -> Float. So you
can do things like this:
3002 + 4004 == 7006 -- all ints 3.14 + 3.14 == 6.28 -- all floats
You _cannot_ add an Int and a Float directly though. Use functions like
toFloat or round to convert both values to the same type. So if you
needed to add a list length to a Float for some reason, you could say one
of these:
3.14 + toFloat (List.length [1,2,3]) == 6.14 round 3.14 + List.length [1,2,3] == 6
Note: Languages like Java and JavaScript automatically convert Int
values to Float values when you mix and match. This can make it difficult
to be sure exactly what type of number you are dealing with. When you try to
infer these conversions (as Scala does) it can be even more confusing. Elm
has opted for a design that makes all conversions explicit.
(-) :: Num number => number -> number -> number infixl 6 Source #
Subtract numbers like 4 - 3 == 1.
See '(+)' for docs on the number type variable.
(*) :: Num number => number -> number -> number infixl 7 Source #
Multiply numbers like 2 * 3 == 6.
See '(+)' for docs on the number type variable.
(//) :: Int -> Int -> Int infixl 7 Source #
Integer division:
3 // 2 == 1
Notice that the remainder is discarded.
(^) :: Float -> Float -> Float infixr 8 Source #
Exponentiation
3^2 == 9 3^3 == 27
Breaking from Elm here, in that this is only defined for Float arguments.
The exponentiation story in Haskell is a little more complex. See the (^),
(^^), and (__) operations as a starting point.
toFloat :: Int -> Float Source #
Convert an integer into a float. Useful when mixing Int and Float
values like this:
halfOf :: Int -> Float halfOf number = toFloat number / 2
round :: Float -> Int Source #
Round a number to the nearest integer.
round 1.0 == 1 round 1.2 == 1 round 1.5 == 2 round 1.8 == 2
round -1.2 == -1 round -1.5 == -1 round -1.8 == -2
floor :: Float -> Int Source #
Floor function, rounding down.
floor 1.0 == 1 floor 1.2 == 1 floor 1.5 == 1 floor 1.8 == 1
floor -1.2 == -2 floor -1.5 == -2 floor -1.8 == -2
ceiling :: Float -> Int Source #
Ceiling function, rounding up.
ceiling 1.0 == 1 ceiling 1.2 == 2 ceiling 1.5 == 2 ceiling 1.8 == 2
ceiling -1.2 == -1 ceiling -1.5 == -1 ceiling -1.8 == -1
truncate :: Float -> Int Source #
Truncate a number, rounding towards zero.
truncate 1.0 == 1 truncate 1.2 == 1 truncate 1.5 == 1 truncate 1.8 == 1
truncate -1.2 == -1 truncate -1.5 == -1 truncate -1.8 == -1
Equality
(==) :: Eq a => a -> a -> Bool infix 4 Source #
Check if values are “the same”.
Breaking from Elm, this relies on Haskell's Eq typeclass. For example:
data Foo = Bar | Baz deriving (Eq)
(/=) :: Eq a => a -> a -> Bool infix 4 Source #
Check if values are not “the same”.
Like with (==), this relies on Haskell's Eq typeclass.
So (a /= b) is the same as (not (a == b)).
Comparison
These functions only work on Order-able types. This includes numbers,
characters, strings, lists of comparable things, and tuples of comparable
things.
max :: Ord comparable => comparable -> comparable -> comparable Source #
Find the larger of two comparables.
max 42 12345678 == 12345678 max "abc" "xyz" == "xyz"
min :: Ord comparable => comparable -> comparable -> comparable Source #
Find the smaller of two comparables.
min 42 12345678 == 42 min "abc" "xyz" == "abc"
compare :: Ord comparable => comparable -> comparable -> Order Source #
Compare any two comparable values. Comparable values include String,
Char, Int, Float, or a list or tuple containing comparable values. These
are also the only values that work as Dict keys or Set members.
compare 3 4 == LT compare 4 4 == EQ compare 5 4 == GT
type Order = Ordering Source #
Represents the relative ordering of two things. The relations are less than, equal to, and greater than.
Instances
| Bounded Ordering | Since: base-2.1 |
| Enum Ordering | Since: base-2.1 |
| Eq Ordering | |
| Ord Ordering | |
Defined in GHC.Classes | |
| Read Ordering | Since: base-2.1 |
| Show Ordering | Since: base-2.1 |
| Ix Ordering | Since: base-2.1 |
Defined in GHC.Arr | |
| Generic Ordering | |
| Semigroup Ordering | Since: base-4.9.0.0 |
| Monoid Ordering | Since: base-2.1 |
| Hashable Ordering | |
Defined in Data.Hashable.Class | |
| ToJSON Ordering | |
Defined in Data.Aeson.Types.ToJSON | |
| type Rep Ordering | Since: base-4.6.0.0 |
Booleans
Instances
(&&) :: Bool -> Bool -> Bool infixr 3 Source #
The logical AND operator. True if both inputs are True.
True && True == True True && False == False False && True == False False && False == False
(||) :: Bool -> Bool -> Bool infixr 2 Source #
The logical OR operator. True if one or both inputs are True.
True || True == True True || False == True False || True == True False || False == False
xor :: Bool -> Bool -> Bool Source #
The exclusive-or operator. True if exactly one input is True.
xor True True == False xor True False == True xor False True == True xor False False == False
Append Strings and Lists
(++) :: Semigroup appendable => appendable -> appendable -> appendable infixr 5 Source #
Put two appendable things together. This includes strings, lists, and text.
"hello" ++ "world" == "helloworld" [1,1,2] ++ [3,5,8] == [1,1,2,3,5,8]
Fancier Math
modBy :: Int -> Int -> Int Source #
Perform modular arithmetic. A common trick is to use (n mod 2) to detect even and odd numbers:
modBy 2 0 == 0 modBy 2 1 == 1 modBy 2 2 == 0 modBy 2 3 == 1
Our modBy function works in the typical mathematical way when you run into
negative numbers:
List.map (modBy 4) [ -5, -4, -3, -2, -1, 0, 1, 2, 3, 4, 5 ] -- [ 3, 0, 1, 2, 3, 0, 1, 2, 3, 0, 1 ]
Use '@remainderBy@' for a different treatment of negative numbers, or read Daan Leijen’s Division and Modulus for Computer Scientists for more information.
remainderBy :: Int -> Int -> Int Source #
Get the remainder after division. Here are bunch of examples of dividing by four:
List.map (remainderBy 4) [ -5, -4, -3, -2, -1, 0, 1, 2, 3, 4, 5 ] -- [ -1, 0, -3, -2, -1, 0, 1, 2, 3, 0, 1 ]
Use '@modBy@' for a different treatment of negative numbers, or read Daan Leijen’s Division and Modulus for Computer Scientists for more information.
negate :: Num number => number -> number Source #
Negate a number.
negate 42 == -42 negate -42 == 42 negate 0 == 0
abs :: Num number => number -> number Source #
Get the absolute value of a number.
abs 16 == 16 abs -4 == 4 abs -8.5 == 8.5 abs 3.14 == 3.14
clamp :: Ord number => number -> number -> number -> number Source #
Clamps a number within a given range. With the expression
clamp 100 200 x the results are as follows:
100 if x < 100 x if 100 <= x < 200 200 if 200 <= x
sqrt :: Float -> Float Source #
Take the square root of a number.
sqrt 4 == 2 sqrt 9 == 3 sqrt 16 == 4 sqrt 25 == 5
logBase :: Float -> Float -> Float Source #
Calculate the logarithm of a number with a given base.
logBase 10 100 == 2 logBase 2 256 == 8
Angles
degrees :: Float -> Float Source #
Convert degrees to standard Elm angles (radians).
degrees 180 == 3.141592653589793
radians :: Float -> Float Source #
Convert radians to standard Elm angles (radians).
radians pi == 3.141592653589793
turns :: Float -> Float Source #
Convert turns to standard Elm angles (radians). One turn is equal to 360°.
turns (1/2) == 3.141592653589793
Trigonometry
cos :: Float -> Float Source #
Figure out the cosine given an angle in radians.
cos (degrees 60) == 0.5000000000000001 cos (turns (1/6)) == 0.5000000000000001 cos (radians (pi/3)) == 0.5000000000000001 cos (pi/3) == 0.5000000000000001
sin :: Float -> Float Source #
Figure out the sine given an angle in radians.
sin (degrees 30) == 0.49999999999999994 sin (turns (1/12)) == 0.49999999999999994 sin (radians (pi/6)) == 0.49999999999999994 sin (pi/6) == 0.49999999999999994
tan :: Float -> Float Source #
Figure out the tangent given an angle in radians.
tan (degrees 45) == 0.9999999999999999 tan (turns (1/8)) == 0.9999999999999999 tan (radians (pi/4)) == 0.9999999999999999 tan (pi/4) == 0.9999999999999999
acos :: Float -> Float Source #
Figure out the arccosine for adjacent / hypotenuse in radians:
acos (1/2) == 1.0471975511965979 -- 60° or pi/3 radians
asin :: Float -> Float Source #
Figure out the arcsine for opposite / hypotenuse in radians:
asin (1/2) == 0.5235987755982989 -- 30° or pi/6 radians
atan :: Float -> Float Source #
This helps you find the angle (in radians) to an (x,y) coordinate, but
in a way that is rarely useful in programming. __You probably want
atan2 instead!__
This version takes y/x as its argument, so there is no way to know whether
the negative signs comes from the y or x value. So as we go counter-clockwise
around the origin from point (1,1) to (1,-1) to (-1,-1) to (-1,1) we do
not get angles that go in the full circle:
atan ( 1 / 1 ) == 0.7853981633974483 -- 45° or pi/4 radians atan ( 1 / -1 ) == -0.7853981633974483 -- 315° or 7*pi/4 radians atan ( -1 / -1 ) == 0.7853981633974483 -- 45° or pi/4 radians atan ( -1 / 1 ) == -0.7853981633974483 -- 315° or 7*pi/4 radians
Notice that everything is between pi/2 and -pi/2. That is pretty useless
for figuring out angles in any sort of visualization, so again, check out
atan2 instead!
atan2 :: Float -> Float -> Float Source #
This helps you find the angle (in radians) to an (x,y) coordinate.
So rather than saying atan (y/x) you say atan2 y x and you can get a full
range of angles:
atan2 1 1 == 0.7853981633974483 -- 45° or pi/4 radians atan2 1 -1 == 2.356194490192345 -- 135° or 3*pi/4 radians atan2 -1 -1 == -2.356194490192345 -- 225° or 5*pi/4 radians atan2 -1 1 == -0.7853981633974483 -- 315° or 7*pi/4 radians
Polar Coordinates
toPolar :: (Float, Float) -> (Float, Float) Source #
Convert Cartesian coordinates (x,y) to polar coordinates (r,θ).
toPolar (3, 4) == ( 5, 0.9272952180016122) toPolar (5,12) == (13, 1.1760052070951352)
fromPolar :: (Float, Float) -> (Float, Float) Source #
Convert polar coordinates (r,θ) to Cartesian coordinates (x,y).
fromPolar (sqrt 2, degrees 45) == (1, 1)
Floating Point Checks
isNaN :: Float -> Bool Source #
Determine whether a float is an undefined or unrepresentable number. NaN stands for *not a number* and it is a standardized part of floating point numbers.
isNaN (0/0) == True isNaN (sqrt -1) == True isNaN (1/0) == False -- infinity is a number isNaN 1 == False
isInfinite :: Float -> Bool Source #
Determine whether a float is positive or negative infinity.
isInfinite (0/0) == False isInfinite (sqrt -1) == False isInfinite (1/0) == True isInfinite 1 == False
Notice that NaN is not infinite! For float n to be finite implies that
not (isInfinite n || isNaN n) evaluates to True.
Function Helpers
Given a value, returns exactly the same value. This is called the identity function.
always :: a -> b -> a Source #
Create a function that *always* returns the same value. Useful with
functions like map:
List.map (always 0) [1,2,3,4,5] == [0,0,0,0,0]
-- List.map (\_ -> 0) [1,2,3,4,5] == [0,0,0,0,0] -- always = (\x _ -> x)
(<|) :: (a -> b) -> a -> b infixr 0 Source #
Saying f <| x is exactly the same as f x.
It can help you avoid parentheses, which can be nice sometimes. Maybe you want
to apply a function to a case expression? That sort of thing.
(|>) :: a -> (a -> b) -> b infixl 0 Source #
Saying x |> f is exactly the same as f x.
It is called the “pipe” operator because it lets you write “pipelined” code.
For example, say we have a sanitize function for turning user input into
integers:
-- BEFORE sanitize :: String -> Maybe Int sanitize input = String.toInt (String.trim input)
We can rewrite it like this:
-- AFTER
sanitize :: String -> Maybe Int
sanitize input =
input
|> String.trim
|> String.toIntTotally equivalent! I recommend trying to rewrite code that uses x |> f
into code like f x until there are no pipes left. That can help you build
your intuition.
Note: This can be overused! I think folks find it quite neat, but when you have three or four steps, the code often gets clearer if you break out a top-level helper function. Now the transformation has a name. The arguments are named. It has a type annotation. It is much more self-documenting that way! Testing the logic gets easier too. Nice side benefit!
(<<) :: (b -> c) -> (a -> b) -> a -> c infixl 9 Source #
Function composition, passing results along in the suggested direction. For example, the following code checks if the square root of a number is odd:
not << isEven << sqrt
You can think of this operator as equivalent to the following:
(g << f) == (\x -> g (f x))
So our example expands out to something like this:
\n -> not (isEven (sqrt n))
(>>) :: (a -> b) -> (b -> c) -> a -> c infixr 9 Source #
Function composition, passing results along in the suggested direction. For example, the following code checks if the square root of a number is odd:
sqrt >> isEven >> not
A value that can never happen! For context:
- The boolean type
Boolhas two values:TrueandFalse - The unit type
()has one value:() - The never type
Neverhas no values!
You may see it in the wild in Html Never which means this HTML will never
produce any messages. You would need to write an event handler like
onClick ??? :: Attribute Never but how can we fill in the question marks?!
So there cannot be any event handlers on that HTML.
You may also see this used with tasks that never fail, like Task Never ().
The Never type is useful for restricting *arguments* to a function. Maybe my
API can only accept HTML without event handlers, so I require Html Never and
users can give Html msg and everything will go fine. Generally speaking, you
do not want Never in your return types though.
A function that can never be called. Seems extremely pointless, but it *can* come in handy. Imagine you have some HTML that should never produce any messages. And say you want to use it in some other HTML that *does* produce messages. You could say:
import Html exposing (..)
embedHtml :: Html Never -> Html msg
embedHtml staticStuff =
div []
[ text "hello"
, Html.map never staticStuff
]So the never function is basically telling the type system, make sure no one
ever calls me!
Often-implemented typeclasses
The Eq class defines equality (==) and inequality (/=).
All the basic datatypes exported by the Prelude are instances of Eq,
and Eq may be derived for any datatype whose constituents are also
instances of Eq.
The Haskell Report defines no laws for Eq. However, == is customarily
expected to implement an equivalence relationship where two values comparing
equal are indistinguishable by "public" functions, with a "public" function
being one not allowing to see implementation details. For example, for a
type representing non-normalised natural numbers modulo 100, a "public"
function doesn't make the difference between 1 and 201. It is expected to
have the following properties:
Instances
| Eq Bool | |
| Eq Char | |
| Eq Double | Note that due to the presence of
Also note that
|
| Eq Float | Note that due to the presence of
Also note that
|
| Eq Int | |
| Eq Int8 | Since: base-2.1 |
| Eq Int16 | Since: base-2.1 |
| Eq Int32 | Since: base-2.1 |
| Eq Int64 | Since: base-2.1 |
| Eq Integer | |
| Eq Natural | Since: base-4.8.0.0 |
| Eq Ordering | |
| Eq Word | |
| Eq Word8 | Since: base-2.1 |
| Eq Word16 | Since: base-2.1 |
| Eq Word32 | Since: base-2.1 |
| Eq Word64 | Since: base-2.1 |
| Eq SomeTypeRep | |
Defined in Data.Typeable.Internal | |
| Eq Exp | |
| Eq Match | |
| Eq Clause | |
| Eq Pat | |
| Eq Type | |
| Eq Dec | |
| Eq Name | |
| Eq FunDep | |
| Eq InjectivityAnn | |
Defined in Language.Haskell.TH.Syntax Methods (==) :: InjectivityAnn -> InjectivityAnn -> Bool # (/=) :: InjectivityAnn -> InjectivityAnn -> Bool # | |
| Eq Overlap | |
| Eq () | |
| Eq TyCon | |
| Eq Module | |
| Eq TrName | |
| Eq Con | |
| Eq ByteString | |
Defined in Data.ByteString.Internal | |
| Eq ByteString | |
Defined in Data.ByteString.Lazy.Internal | |
| Eq Scientific | Scientific numbers can be safely compared for equality. No magnitude |
Defined in Data.Scientific | |
| Eq UTCTime | |
| Eq JSONPathElement | |
Defined in Data.Aeson.Types.Internal Methods (==) :: JSONPathElement -> JSONPathElement -> Bool # (/=) :: JSONPathElement -> JSONPathElement -> Bool # | |
| Eq Value | |
| Eq DotNetTime | |
Defined in Data.Aeson.Types.Internal | |
| Eq SumEncoding | |
Defined in Data.Aeson.Types.Internal | |
| Eq Color | |
| Eq ColorIntensity | |
Defined in System.Console.ANSI.Types Methods (==) :: ColorIntensity -> ColorIntensity -> Bool # (/=) :: ColorIntensity -> ColorIntensity -> Bool # | |
| Eq ConsoleLayer | |
Defined in System.Console.ANSI.Types | |
| Eq BlinkSpeed | |
Defined in System.Console.ANSI.Types | |
| Eq Underlining | |
Defined in System.Console.ANSI.Types | |
| Eq ConsoleIntensity | |
Defined in System.Console.ANSI.Types Methods (==) :: ConsoleIntensity -> ConsoleIntensity -> Bool # (/=) :: ConsoleIntensity -> ConsoleIntensity -> Bool # | |
| Eq SGR | |
| Eq AsyncCancelled | |
Defined in Control.Concurrent.Async Methods (==) :: AsyncCancelled -> AsyncCancelled -> Bool # (/=) :: AsyncCancelled -> AsyncCancelled -> Bool # | |
| Eq Pos | |
| Eq More | |
| Eq BigNat | |
| Eq Void | Since: base-4.8.0.0 |
| Eq SpecConstrAnnotation | Since: base-4.3.0.0 |
Defined in GHC.Exts Methods (==) :: SpecConstrAnnotation -> SpecConstrAnnotation -> Bool # (/=) :: SpecConstrAnnotation -> SpecConstrAnnotation -> Bool # | |
| Eq Version | Since: base-2.1 |
| Eq AsyncException | Since: base-4.2.0.0 |
Defined in GHC.IO.Exception Methods (==) :: AsyncException -> AsyncException -> Bool # (/=) :: AsyncException -> AsyncException -> Bool # | |
| Eq ArrayException | Since: base-4.2.0.0 |
Defined in GHC.IO.Exception Methods (==) :: ArrayException -> ArrayException -> Bool # (/=) :: ArrayException -> ArrayException -> Bool # | |
| Eq ExitCode | |
| Eq IOErrorType | Since: base-4.1.0.0 |
Defined in GHC.IO.Exception | |
| Eq MaskingState | Since: base-4.3.0.0 |
Defined in GHC.IO | |
| Eq IOException | Since: base-4.1.0.0 |
Defined in GHC.IO.Exception | |
| Eq ArithException | Since: base-3.0 |
Defined in GHC.Exception.Type Methods (==) :: ArithException -> ArithException -> Bool # (/=) :: ArithException -> ArithException -> Bool # | |
| Eq All | Since: base-2.1 |
| Eq Any | Since: base-2.1 |
| Eq Fixity | Since: base-4.6.0.0 |
| Eq Associativity | Since: base-4.6.0.0 |
Defined in GHC.Generics Methods (==) :: Associativity -> Associativity -> Bool # (/=) :: Associativity -> Associativity -> Bool # | |
| Eq SourceUnpackedness | Since: base-4.9.0.0 |
Defined in GHC.Generics Methods (==) :: SourceUnpackedness -> SourceUnpackedness -> Bool # (/=) :: SourceUnpackedness -> SourceUnpackedness -> Bool # | |
| Eq SourceStrictness | Since: base-4.9.0.0 |
Defined in GHC.Generics Methods (==) :: SourceStrictness -> SourceStrictness -> Bool # (/=) :: SourceStrictness -> SourceStrictness -> Bool # | |
| Eq DecidedStrictness | Since: base-4.9.0.0 |
Defined in GHC.Generics Methods (==) :: DecidedStrictness -> DecidedStrictness -> Bool # (/=) :: DecidedStrictness -> DecidedStrictness -> Bool # | |
| Eq SomeSymbol | Since: base-4.7.0.0 |
Defined in GHC.TypeLits | |
| Eq Lexeme | Since: base-2.1 |
| Eq Number | Since: base-4.6.0.0 |
| Eq GeneralCategory | Since: base-2.1 |
Defined in GHC.Unicode Methods (==) :: GeneralCategory -> GeneralCategory -> Bool # (/=) :: GeneralCategory -> GeneralCategory -> Bool # | |
| Eq SrcLoc | Since: base-4.9.0.0 |
| Eq Clock | |
| Eq TimeSpec | |
| Eq IntSet | |
| Eq Extension | |
| Eq ForeignSrcLang | |
Defined in GHC.ForeignSrcLang.Type Methods (==) :: ForeignSrcLang -> ForeignSrcLang -> Bool # (/=) :: ForeignSrcLang -> ForeignSrcLang -> Bool # | |
| Eq RunnerConfig | |
Defined in Hedgehog.Internal.Runner | |
| Eq FailedAnnotation | |
Defined in Hedgehog.Internal.Report Methods (==) :: FailedAnnotation -> FailedAnnotation -> Bool # (/=) :: FailedAnnotation -> FailedAnnotation -> Bool # | |
| Eq FailureReport | |
Defined in Hedgehog.Internal.Report Methods (==) :: FailureReport -> FailureReport -> Bool # (/=) :: FailureReport -> FailureReport -> Bool # | |
| Eq Progress | |
| Eq Result | |
| Eq Style | |
| Eq Markup | |
| Eq PropertyName | |
Defined in Hedgehog.Internal.Property | |
| Eq Confidence | |
Defined in Hedgehog.Internal.Property | |
| Eq PropertyConfig | |
Defined in Hedgehog.Internal.Property Methods (==) :: PropertyConfig -> PropertyConfig -> Bool # (/=) :: PropertyConfig -> PropertyConfig -> Bool # | |
| Eq TestLimit | |
| Eq TestCount | |
| Eq DiscardCount | |
Defined in Hedgehog.Internal.Property | |
| Eq DiscardLimit | |
Defined in Hedgehog.Internal.Property | |
| Eq ShrinkLimit | |
Defined in Hedgehog.Internal.Property | |
| Eq ShrinkCount | |
Defined in Hedgehog.Internal.Property | |
| Eq ShrinkRetries | |
Defined in Hedgehog.Internal.Property Methods (==) :: ShrinkRetries -> ShrinkRetries -> Bool # (/=) :: ShrinkRetries -> ShrinkRetries -> Bool # | |
| Eq GroupName | |
| Eq PropertyCount | |
Defined in Hedgehog.Internal.Property Methods (==) :: PropertyCount -> PropertyCount -> Bool # (/=) :: PropertyCount -> PropertyCount -> Bool # | |
| Eq TerminationCriteria | |
Defined in Hedgehog.Internal.Property Methods (==) :: TerminationCriteria -> TerminationCriteria -> Bool # (/=) :: TerminationCriteria -> TerminationCriteria -> Bool # | |
| Eq Log | |
| Eq Journal | |
| Eq Failure | |
| Eq Diff | |
| Eq Cover | |
| Eq CoverCount | |
Defined in Hedgehog.Internal.Property | |
| Eq CoverPercentage | |
Defined in Hedgehog.Internal.Property Methods (==) :: CoverPercentage -> CoverPercentage -> Bool # (/=) :: CoverPercentage -> CoverPercentage -> Bool # | |
| Eq LabelName | |
| Eq LineNo | |
| Eq ColumnNo | |
| Eq Span | |
| Eq Seed | |
| Eq Size | |
| Eq Backtracking | |
Defined in Options.Applicative.Types | |
| Eq ParserPrefs | |
Defined in Options.Applicative.Types | |
| Eq OptName | |
| Eq OptVisibility | |
Defined in Options.Applicative.Types Methods (==) :: OptVisibility -> OptVisibility -> Bool # (/=) :: OptVisibility -> OptVisibility -> Bool # | |
| Eq ArgPolicy | |
| Eq ArgumentReachability | |
Defined in Options.Applicative.Types Methods (==) :: ArgumentReachability -> ArgumentReachability -> Bool # (/=) :: ArgumentReachability -> ArgumentReachability -> Bool # | |
| Eq AltNodeType | |
Defined in Options.Applicative.Types | |
| Eq Doc | |
| Eq TextDetails | |
Defined in Text.PrettyPrint.Annotated.HughesPJ | |
| Eq Style | |
| Eq Mode | |
| Eq ByteArray | Since: primitive-0.6.3.0 |
| Eq DependencyType | |
Defined in Test.Tasty.Core Methods (==) :: DependencyType -> DependencyType -> Bool # (/=) :: DependencyType -> DependencyType -> Bool # | |
| Eq ModName | |
| Eq PkgName | |
| Eq Module | |
| Eq OccName | |
| Eq NameFlavour | |
Defined in Language.Haskell.TH.Syntax | |
| Eq NameSpace | |
| Eq Loc | |
| Eq Info | |
| Eq ModuleInfo | |
Defined in Language.Haskell.TH.Syntax | |
| Eq Fixity | |
| Eq FixityDirection | |
Defined in Language.Haskell.TH.Syntax Methods (==) :: FixityDirection -> FixityDirection -> Bool # (/=) :: FixityDirection -> FixityDirection -> Bool # | |
| Eq Lit | |
| Eq Body | |
| Eq Guard | |
| Eq Stmt | |
| Eq Range | |
| Eq DerivClause | |
Defined in Language.Haskell.TH.Syntax | |
| Eq DerivStrategy | |
Defined in Language.Haskell.TH.Syntax Methods (==) :: DerivStrategy -> DerivStrategy -> Bool # (/=) :: DerivStrategy -> DerivStrategy -> Bool # | |
| Eq TypeFamilyHead | |
Defined in Language.Haskell.TH.Syntax Methods (==) :: TypeFamilyHead -> TypeFamilyHead -> Bool # (/=) :: TypeFamilyHead -> TypeFamilyHead -> Bool # | |
| Eq TySynEqn | |
| Eq Foreign | |
| Eq Callconv | |
| Eq Safety | |
| Eq Pragma | |
| Eq Inline | |
| Eq RuleMatch | |
| Eq Phases | |
| Eq RuleBndr | |
| Eq AnnTarget | |
| Eq SourceUnpackedness | |
Defined in Language.Haskell.TH.Syntax Methods (==) :: SourceUnpackedness -> SourceUnpackedness -> Bool # (/=) :: SourceUnpackedness -> SourceUnpackedness -> Bool # | |
| Eq SourceStrictness | |
Defined in Language.Haskell.TH.Syntax Methods (==) :: SourceStrictness -> SourceStrictness -> Bool # (/=) :: SourceStrictness -> SourceStrictness -> Bool # | |
| Eq DecidedStrictness | |
Defined in Language.Haskell.TH.Syntax Methods (==) :: DecidedStrictness -> DecidedStrictness -> Bool # (/=) :: DecidedStrictness -> DecidedStrictness -> Bool # | |
| Eq Bang | |
| Eq PatSynDir | |
| Eq PatSynArgs | |
Defined in Language.Haskell.TH.Syntax | |
| Eq TyVarBndr | |
| Eq FamilyResultSig | |
Defined in Language.Haskell.TH.Syntax Methods (==) :: FamilyResultSig -> FamilyResultSig -> Bool # (/=) :: FamilyResultSig -> FamilyResultSig -> Bool # | |
| Eq TyLit | |
| Eq Role | |
| Eq AnnLookup | |
| Eq LocalTime | |
| Eq TimeOfDay | |
| Eq TimeZone | |
| Eq UniversalTime | |
Defined in Data.Time.Clock.Internal.UniversalTime Methods (==) :: UniversalTime -> UniversalTime -> Bool # (/=) :: UniversalTime -> UniversalTime -> Bool # | |
| Eq AbsoluteTime | |
Defined in Data.Time.Clock.Internal.AbsoluteTime | |
| Eq Day | |
| Eq UnpackedUUID | |
| Eq UUID | |
| Eq Event | |
| Eq ExternalID | |
Defined in Data.XML.Types | |
| Eq Doctype | |
| Eq Name | |
| Eq Miscellaneous | |
Defined in Data.XML.Types Methods (==) :: Miscellaneous -> Miscellaneous -> Bool # (/=) :: Miscellaneous -> Miscellaneous -> Bool # | |
| Eq Instruction | |
Defined in Data.XML.Types | |
| Eq Prologue | |
| Eq Document | |
| Eq Node | |
| Eq Element | |
| Eq Content | |
| Eq MonotonicTime Source # | |
Defined in Platform.Internal Methods (==) :: MonotonicTime -> MonotonicTime -> Bool # (/=) :: MonotonicTime -> MonotonicTime -> Bool # | |
| Eq Timeout | Since: base-4.0 |
| Eq a => Eq [a] | |
| Eq a => Eq (Maybe a) | Since: base-2.1 |
| Eq a => Eq (Ratio a) | Since: base-2.1 |
| Eq (Ptr a) | Since: base-2.1 |
| Eq (FunPtr a) | |
| Eq p => Eq (Par1 p) | Since: base-4.7.0.0 |
| Eq (Encoding' a) | |
| Eq a => Eq (IResult a) | |
| Eq a => Eq (Result a) | |
| Eq (Async a) | |
| Eq a => Eq (Complex a) | Since: base-2.1 |
| Eq a => Eq (Min a) | Since: base-4.9.0.0 |
| Eq a => Eq (Max a) | Since: base-4.9.0.0 |
| Eq a => Eq (First a) | Since: base-4.9.0.0 |
| Eq a => Eq (Last a) | Since: base-4.9.0.0 |
| Eq m => Eq (WrappedMonoid m) | Since: base-4.9.0.0 |
Defined in Data.Semigroup Methods (==) :: WrappedMonoid m -> WrappedMonoid m -> Bool # (/=) :: WrappedMonoid m -> WrappedMonoid m -> Bool # | |
| Eq a => Eq (Option a) | Since: base-4.9.0.0 |
| Eq a => Eq (ZipList a) | Since: base-4.7.0.0 |
| Eq a => Eq (Identity a) | Since: base-4.8.0.0 |
| Eq (IORef a) | ^ Pointer equality. Since: base-4.1.0.0 |
| Eq a => Eq (First a) | Since: base-2.1 |
| Eq a => Eq (Last a) | Since: base-2.1 |
| Eq a => Eq (Dual a) | Since: base-2.1 |
| Eq a => Eq (Sum a) | Since: base-2.1 |
| Eq a => Eq (Product a) | Since: base-2.1 |
| Eq a => Eq (Down a) | Since: base-4.6.0.0 |
| Eq a => Eq (NonEmpty a) | Since: base-4.9.0.0 |
| Eq a => Eq (Colour a) | |
| Eq a => Eq (AlphaColour a) | |
Defined in Data.Colour.Internal Methods (==) :: AlphaColour a -> AlphaColour a -> Bool # (/=) :: AlphaColour a -> AlphaColour a -> Bool # | |
| Eq a => Eq (Flush a) | |
| Eq a => Eq (IntMap a) | |
| Eq vertex => Eq (SCC vertex) | Since: containers-0.5.9 |
| Eq a => Eq (Tree a) | |
| Eq a => Eq (Seq a) | |
| Eq a => Eq (ViewL a) | |
| Eq a => Eq (ViewR a) | |
| Eq a => Eq (Set a) | |
| Eq1 f => Eq (Fix f) | |
| (Functor f, Eq1 f) => Eq (Mu f) | |
| (Functor f, Eq1 f) => Eq (Nu f) | |
| Eq a => Eq (DNonEmpty a) | |
| Eq a => Eq (DList a) | |
| Eq a => Eq (Hashed a) | Uses precomputed hash to detect inequality faster |
| Eq a => Eq (Label a) | |
| Eq a => Eq (Coverage a) | |
| Eq mono => Eq (NonNull mono) | |
| Eq (Doc a) | |
| Eq a => Eq (AnnotDetails a) | |
Defined in Text.PrettyPrint.Annotated.HughesPJ Methods (==) :: AnnotDetails a -> AnnotDetails a -> Bool # (/=) :: AnnotDetails a -> AnnotDetails a -> Bool # | |
| Eq a => Eq (Span a) | |
| (Eq a, Prim a) => Eq (PrimArray a) | Since: primitive-0.6.4.0 |
| Eq (MutableByteArray s) | |
Defined in Data.Primitive.ByteArray Methods (==) :: MutableByteArray s -> MutableByteArray s -> Bool # (/=) :: MutableByteArray s -> MutableByteArray s -> Bool # | |
| Eq a => Eq (SmallArray a) | |
Defined in Data.Primitive.SmallArray | |
| Eq a => Eq (Array a) | |
| Eq a => Eq (Maybe a) | |
| Eq a => Eq (Window a) | |
| Eq a => Eq (HashSet a) | Note that, in the presence of hash collisions, equal
In general, the lack of substitutivity can be observed with any function that depends on the key ordering, such as folds and traversals. |
| (Storable a, Eq a) => Eq (Vector a) | |
| (Prim a, Eq a) => Eq (Vector a) | |
| Eq a => Eq (Vector a) | |
| Eq a => Eq (Declaration a) | |
| Eq a => Eq (Line a) | |
| Eq a => Eq (Secret a) Source # | |
| Eq a => Eq (Array a) Source # | |
| (Eq a, Eq b) => Eq (Either a b) | Since: base-2.1 |
| Eq (V1 p) | Since: base-4.9.0.0 |
| Eq (U1 p) | Since: base-4.9.0.0 |
| Eq (TypeRep a) | Since: base-2.1 |
| (Eq a, Eq b) => Eq (a, b) | |
| (Eq k, Eq v) => Eq (HashMap k v) | Note that, in the presence of hash collisions, equal
In general, the lack of substitutivity can be observed with any function that depends on the key ordering, such as folds and traversals. |
| (Eq k, Eq a) => Eq (Map k a) | |
| (Ix i, Eq e) => Eq (Array i e) | Since: base-2.1 |
| Eq a => Eq (Arg a b) | Since: base-4.9.0.0 |
| Eq (Proxy s) | Since: base-4.7.0.0 |
| (Eq1 m, Eq a) => Eq (TreeT m a) | |
| (Eq a, Eq1 m) => Eq (NodeT m a) | |
| Eq (MutablePrimArray s a) | |
Defined in Data.Primitive.PrimArray Methods (==) :: MutablePrimArray s a -> MutablePrimArray s a -> Bool # (/=) :: MutablePrimArray s a -> MutablePrimArray s a -> Bool # | |
| Eq (SmallMutableArray s a) | |
Defined in Data.Primitive.SmallArray Methods (==) :: SmallMutableArray s a -> SmallMutableArray s a -> Bool # (/=) :: SmallMutableArray s a -> SmallMutableArray s a -> Bool # | |
| Eq (MutableArray s a) | |
Defined in Data.Primitive.Array Methods (==) :: MutableArray s a -> MutableArray s a -> Bool # (/=) :: MutableArray s a -> MutableArray s a -> Bool # | |
| (Eq a, Eq b) => Eq (Pair a b) | |
| (Eq a, Eq b) => Eq (These a b) | |
| (Eq a, Eq b) => Eq (Either a b) | |
| (Eq a, Eq b) => Eq (These a b) | |
| (Eq k, Eq v) => Eq (Leaf k v) | |
| (Eq value, Eq error) => Eq (Result error value) Source # | |
| Eq (f p) => Eq (Rec1 f p) | Since: base-4.7.0.0 |
| Eq (URec (Ptr ()) p) | Since: base-4.9.0.0 |
| Eq (URec Char p) | Since: base-4.9.0.0 |
| Eq (URec Double p) | Since: base-4.9.0.0 |
| Eq (URec Float p) | |
| Eq (URec Int p) | Since: base-4.9.0.0 |
| Eq (URec Word p) | Since: base-4.9.0.0 |
| (Eq a, Eq b, Eq c) => Eq (a, b, c) | |
| Eq (STArray s i e) | Since: base-2.1 |
| Eq a => Eq (Const a b) | Since: base-4.9.0.0 |
| Eq (f a) => Eq (Ap f a) | Since: base-4.12.0.0 |
| Eq (f a) => Eq (Alt f a) | Since: base-4.8.0.0 |
| Eq (a :~: b) | Since: base-4.7.0.0 |
| (Eq e, Eq1 m, Eq a) => Eq (ErrorT e m a) | |
| Eq b => Eq (Tagged s b) | |
| (Eq1 f, Eq1 g, Eq a) => Eq (These1 f g a) | |
| Eq c => Eq (K1 i c p) | Since: base-4.7.0.0 |
| (Eq (f p), Eq (g p)) => Eq ((f :+: g) p) | Since: base-4.7.0.0 |
| (Eq (f p), Eq (g p)) => Eq ((f :*: g) p) | Since: base-4.7.0.0 |
| (Eq a, Eq b, Eq c, Eq d) => Eq (a, b, c, d) | |
| (Eq1 f, Eq1 g, Eq a) => Eq (Product f g a) | Since: base-4.9.0.0 |
| (Eq1 f, Eq1 g, Eq a) => Eq (Sum f g a) | Since: base-4.9.0.0 |
| Eq (a :~~: b) | Since: base-4.10.0.0 |
| Eq (f p) => Eq (M1 i c f p) | Since: base-4.7.0.0 |
| Eq (f (g p)) => Eq ((f :.: g) p) | Since: base-4.7.0.0 |
| (Eq a, Eq b, Eq c, Eq d, Eq e) => Eq (a, b, c, d, e) | |
| (Eq1 f, Eq1 g, Eq a) => Eq (Compose f g a) | Since: base-4.9.0.0 |
| Eq (p b a) => Eq (Flip p a b) | |
| (Eq a, Eq b, Eq c, Eq d, Eq e, Eq f) => Eq (a, b, c, d, e, f) | |
| (Eq (p a b), Eq (q a b)) => Eq (Sum p q a b) | |
| (Eq (f a b), Eq (g a b)) => Eq (Product f g a b) | |
| (Eq a, Eq b, Eq c, Eq d, Eq e, Eq f, Eq g) => Eq (a, b, c, d, e, f, g) | |
| Eq (f (p a b)) => Eq (Tannen f p a b) | |
| (Eq a, Eq b, Eq c, Eq d, Eq e, Eq f, Eq g, Eq h) => Eq (a, b, c, d, e, f, g, h) | |
| (Eq a, Eq b, Eq c, Eq d, Eq e, Eq f, Eq g, Eq h, Eq i) => Eq (a, b, c, d, e, f, g, h, i) | |
| Eq (p (f a) (g b)) => Eq (Biff p f g a b) | |
| (Eq a, Eq b, Eq c, Eq d, Eq e, Eq f, Eq g, Eq h, Eq i, Eq j) => Eq (a, b, c, d, e, f, g, h, i, j) | |
| (Eq a, Eq b, Eq c, Eq d, Eq e, Eq f, Eq g, Eq h, Eq i, Eq j, Eq k) => Eq (a, b, c, d, e, f, g, h, i, j, k) | |
| (Eq a, Eq b, Eq c, Eq d, Eq e, Eq f, Eq g, Eq h, Eq i, Eq j, Eq k, Eq l) => Eq (a, b, c, d, e, f, g, h, i, j, k, l) | |
| (Eq a, Eq b, Eq c, Eq d, Eq e, Eq f, Eq g, Eq h, Eq i, Eq j, Eq k, Eq l, Eq m) => Eq (a, b, c, d, e, f, g, h, i, j, k, l, m) | |
| (Eq a, Eq b, Eq c, Eq d, Eq e, Eq f, Eq g, Eq h, Eq i, Eq j, Eq k, Eq l, Eq m, Eq n) => Eq (a, b, c, d, e, f, g, h, i, j, k, l, m, n) | |
| (Eq a, Eq b, Eq c, Eq d, Eq e, Eq f, Eq g, Eq h, Eq i, Eq j, Eq k, Eq l, Eq m, Eq n, Eq o) => Eq (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) | |
The Ord class is used for totally ordered datatypes.
Instances of Ord can be derived for any user-defined datatype whose
constituent types are in Ord. The declared order of the constructors in
the data declaration determines the ordering in derived Ord instances. The
Ordering datatype allows a single comparison to determine the precise
ordering of two objects.
The Haskell Report defines no laws for Ord. However, <= is customarily
expected to implement a non-strict partial order and have the following
properties:
- Transitivity
- if
x <= y && y <= z=True, thenx <= z=True - Reflexivity
x <= x=True- Antisymmetry
- if
x <= y && y <= x=True, thenx == y=True
Note that the following operator interactions are expected to hold:
x >= y=y <= xx < y=x <= y && x /= yx > y=y < xx < y=compare x y == LTx > y=compare x y == GTx == y=compare x y == EQmin x y == if x <= y then x else y=Truemax x y == if x >= y then x else y=True
Minimal complete definition: either compare or <=.
Using compare can be more efficient for complex types.
Instances
Basic numeric class.
The Haskell Report defines no laws for Num. However, '(+)' and '(*)' are
customarily expected to define a ring and have the following properties:
- Associativity of (+)
(x + y) + z=x + (y + z)- Commutativity of (+)
x + y=y + xfromInteger 0is the additive identityx + fromInteger 0=xnegategives the additive inversex + negate x=fromInteger 0- Associativity of (*)
(x * y) * z=x * (y * z)fromInteger 1is the multiplicative identityx * fromInteger 1=xandfromInteger 1 * x=x- Distributivity of (*) with respect to (+)
a * (b + c)=(a * b) + (a * c)and(b + c) * a=(b * a) + (c * a)
Note that it isn't customarily expected that a type instance of both Num
and Ord implement an ordered ring. Indeed, in base only Integer and
Rational do.