Data.Vector.Persistent.Internal.CoercibleUtils

Documentation

(#.) :: Coercible b c => (b -> c) -> (a -> b) -> a -> c infixr 9

Coercive left-composition.

>>> (All #. not) True
All {getAll = False}

The semantics with respect to bottoms are:

p #. ⊥ ≡ ⊥
p #. f ≡ p . f

(.#) :: Coercible a b => (b -> c) -> (a -> b) -> a -> c infixr 9

Coercive right-composition.

>>> (stimes 2 .# Product) 3
Product {getProduct = 9}

The semantics with respect to bottoms are:

⊥ .# p ≡ ⊥
f .# p ≡ p . f