FunFunc v0.2.0 FunFunc.Num

Functions for Number.

Link to this section Summary

Returns division and remainder

Checks the value is a negative number

Checks the value is not zero

Checks the value is a positive number

pred(x)

Predecessor function

succ(x)

Successor function

Iterates function for x times

Checks the value is zero

divmod(x, y)

divmod(integer(), integer()) :: {integer(), integer()}

Returns division and remainder.

iex> FunFunc.Num.divmod(5, 2)
{2, 1}
iex> FunFunc.Num.divmod(5, 0)
** (ArithmeticError) bad argument in arithmetic expression

negative?(x)

negative?(number()) :: boolean()

Checks the value is a negative number.

iex> FunFunc.Num.negative?(1)
false
iex> FunFunc.Num.negative?(0)
false
iex> FunFunc.Num.negative?(-1)
true

non_zero?(x)

non_zero?(number()) :: boolean()

Checks the value is not zero.

iex> FunFunc.Num.non_zero?(0)
false
iex> FunFunc.Num.non_zero?(1)
true

positive?(x)

positive?(number()) :: boolean()

Checks the value is a positive number.

iex> FunFunc.Num.positive?(1)
true
iex> FunFunc.Num.positive?(0)
false
iex> FunFunc.Num.positive?(-1)
false

pred(x)

pred(integer()) :: integer()

Predecessor function.

iex> FunFunc.Num.pred(43)
42

succ(x)

succ(integer()) :: integer()

Successor function.

iex> FunFunc.Num.succ(41)
42

times(x, f)

times(integer(), (... -> any())) :: atom()

Iterates function for x times.

FunFunc.Num.times(3, &IO.puts/1)
#=> 1
#=> 2
#=> 3
:ok

zero?(x)

zero?(number()) :: boolean()

Checks the value is zero.

iex> FunFunc.Num.zero?(0)
true
iex> FunFunc.Num.zero?(1)
false