/ -package:base

Fractional division.

fractional division

Infix shorthand for divide.

Division of dimensions corresponds to subtraction of the base dimensions' exponents.

Divides one Quantity by another or one Unit by another. The intimidating type signature captures the similarity between these operations and ensures that composite Units are NonMetric.

Forms the quotient of two dimensions.

Forms the quotient of two dynamic units.

Form a UnitName by dividing one by another.

Forms the quotient of two Variants. The quotient of units is a non-metric unit. The quotient of quantities is a quantity.

Overloaded division.

Forms the quotient of ExactPi' types (in the arithmetic sense).

Fractional division.

TypeInt division.

The ratio of two type-level numbers

Division binary differentiable operation

Examples of usage

>>> import Prelude (Float)

>>> import InfBackprop (call, derivative)

>>> call (/) (6, 3) :: Float
2.0

>>> import Debug.SimpleExpr.Expr (variable)

>>> x = variable "x"

>>> y = variable "y"

>>> derivative (/) (x, y)
(1·(1/y),1·(-(x)·(1/(y·y))))

Modify the target(s) of a Lens', Iso, Setter or Traversal by dividing by a value.

>>> execState (do _1 //= c; _2 //= d) (a,b)
(a / c,b / d)

(//=) :: (MonadState s m, Fractional a) => Setter' s a    -> a -> m ()
(//=) :: (MonadState s m, Fractional a) => Iso' s a       -> a -> m ()
(//=) :: (MonadState s m, Fractional a) => Lens' s a      -> a -> m ()
(//=) :: (MonadState s m, Fractional a) => Traversal' s a -> a -> m ()

Divide the target(s) of a numerically valued Lens, Iso, Setter or Traversal.

>>> (a,b) & _1 //~ c
(a / c,b)

>>> (a,b) & both //~ c
(a / c,b / c)

>>> ("Hawaii",10) & _2 //~ 2
("Hawaii",5.0)

(//~) :: Fractional a => Setter' s a    -> a -> s -> s
(//~) :: Fractional a => Iso' s a       -> a -> s -> s
(//~) :: Fractional a => Lens' s a      -> a -> s -> s
(//~) :: Fractional a => Traversal' s a -> a -> s -> s

Constructs an array identical to the first argument except that it has been updated by the associations in the right argument. For example, if m is a 1-origin, n by n matrix, then

m//[((i,i), 0) | i <- [1..n]]

is the same matrix, except with the diagonal zeroed. Repeated indices in the association list are handled as for array: Haskell 2010 specifies that the resulting array is undefined (i.e. bottom), but GHC's implementation uses the last association for each index.