Search results

pow :: Int -> Int -> Int

Raise an Int to the power of another Int.

pow :: Number -> Number -> Number

Return the first argument exponentiated to the power of the second argument.

pow :: Number -> Number -> Number

Return the first argument exponentiated to the power of the second argument.

> pow 3.0 2.0
9.0
> sqrt 42.0 == pow 42.0 0.5
true

pow :: UInt -> UInt -> UInt

Raises the first argument to the power of the second argument (the exponent).

> pow (fromInt 2) (fromInt 3)
8u

pow :: BigInt -> BigInt -> BigInt

Exponentiation for BigInt. If the exponent is less than 0, pow returns 0. Also, pow zero zero == one.

pow :: BigInt -> BigInt -> BigInt

Raise a BigInt to the power of another BigInt.

pow (fromInt 2) (fromInt 3) -- 2^3

pow :: Cartesian Number -> Number -> Cartesian Number

Real power of a complex

pow :: HugeNum -> Int -> HugeNum

Raise a HugeNum to an integer power.

pow :: Decimal -> Decimal -> Decimal

Exponentiation for Decimal.

pow :: Int53 -> Int53 -> Int53

Raises the first argument to the power of the second argument (the exponent).

If the exponent is less than 0, then pow returns 0.

pow (fromInt 2) (fromInt 3) == (fromInt 8)
pow (fromInt 2) (fromInt 0) == (fromInt 1)
pow (fromInt 0) (fromInt 0) == (fromInt 1)
pow (fromInt 2) (fromInt (-2)) == (fromInt 0)

pow :: forall a. Semiring a => a -> Int -> a

Integer power

pow :: BigNumber -> BigNumber -> BigNumber

pow :: BigNumber -> Int -> BigNumber

Exponentiate a BigNumber

pow :: forall a. Eq a => Semiring a => Square a -> Int -> Square a

Integer power of a square matrix

pow :: BigInt -> BigInt -> BigInt

pow :: Cartesian Number -> Number -> Cartesian Number

Real power of a complex

pow :: forall k. NumCat k => k (Number /\ Number) Number

pow :: Quat -> Number -> Quat

Calculate the scalar power of a unit quaternion.

Pow :: NumberValue -> NumberValue -> NumberValue

pow :: P5 -> Number -> Number -> Number

p5js.org documentation

pow :: Quantity -> Decimal -> Quantity

Raise a quantity to a given power.

Pow :: BinaryOperator

pow :: forall a b c r. Arith a b c r => a -> b -> c

power :: forall m. Monoid m => m -> Int -> m

Append a value to itself a certain number of times. For the Multiplicative type, and for a non-negative power, this is the same as normal number exponentiation.

If the second argument is negative this function will return mempty (unlike normal number exponentiation). The Monoid constraint alone is not enough to write a power function with the property that power x n cancels with power x (-n), i.e. power x n <> power x (-n) = mempty. For that, we would additionally need the ability to invert elements, i.e. a Group.

power [1,2] 3    == [1,2,1,2,1,2]
power [1,2] 1    == [1,2]
power [1,2] 0    == []
power [1,2] (-3) == []

power :: forall g. Group g => g -> Int -> g

Append a value (or its inverse) to itself a certain number of times.

For the Additive Int type, this is the same as multiplication.

power :: Icons

power :: forall a. HasPower a => a -> a -> a

power :: DerivedUnit -> Number -> DerivedUnit

Raise a unit to the given power.

power :: PowerBank -> Int

power :: PowerSpawn -> Int

power :: BigNumState -> BigNumState -> BigNumState

powNat :: forall proxy a b c. ExponentiationNat a b c => proxy a -> proxy b -> proxy c

> powNat d2 d3
8 -- : NProxy D8

a raised to the power of b a^b = c

powermod :: BigNumState -> BigNumState -> BigNumState -> BigNumState

powerSet :: forall a. Ord a => Set a -> Set (Set a)

powderBlue :: Color

#B0E0E6

powderblue :: Color

powerInput :: Icons

powerScale :: forall r. D3Eff (PowerScale Number r)

powerCapacity :: PowerSpawn -> Int

power_bank_hits :: Int

powerAssociative :: forall a. Eq a => (a -> a -> a) -> a -> Boolean

A magma M is power-associative if the subalgebra generated by any element is associative.

∀ m n. m,n ∈ ℤ+ x^m • x^n = x^(m + n) where x^m • x^n is defined recursively via x^1 = x, x^(n + 1) = x^n • x

powerAssociative :: forall a. Eq a => (a -> a -> a) -> a -> Boolean

A magma M is power-associative if the subalgebra generated by any element is associative.

∀ m n. m,n ∈ ℤ+ x^m • x^n = x^(m + n) where x^m • x^n is defined recursively via x^1 = x, x^(n + 1) = x^n • x

power_bank_decay :: Int

power_spawn_hits :: Int

powerSettingsNew :: Icons