Data.Unrestricted.Internal.Dupable

Dupable

class Consumable a => Dupable a where

The laws of Dupable are dual to those of Monoid:

• first consume (dup2 a) ≃ a ≃ second consume (dup2 a) (neutrality)
• first dup2 (dup2 a) ≃ (second dup2 (dup2 a)) (associativity)

Where the (≃) sign represents equality up to type isomorphism.

When implementing Dupable instances for composite types, using dupV should be more convenient since V has a zipping Applicative instance.

Minimal complete definition

dupV | dup2

Methods

dupV :: forall n. KnownNat n => a %1 -> V n a

dup2 :: a %1 -> (a, a)

Instances

Dupable Bool

Defined in Data.Unrestricted.Internal.Instances

Methods

dupV :: forall (n :: Nat). KnownNat n => Bool %1 -> V n Bool

dup2 :: Bool %1 -> (Bool, Bool)

Dupable Char

Defined in Data.Unrestricted.Internal.Instances

Methods

dupV :: forall (n :: Nat). KnownNat n => Char %1 -> V n Char

dup2 :: Char %1 -> (Char, Char)

Dupable Double

Defined in Data.Unrestricted.Internal.Instances

Methods

dupV :: forall (n :: Nat). KnownNat n => Double %1 -> V n Double

dup2 :: Double %1 -> (Double, Double)

Dupable Int

Defined in Data.Unrestricted.Internal.Instances

Methods

dupV :: forall (n :: Nat). KnownNat n => Int %1 -> V n Int

dup2 :: Int %1 -> (Int, Int)

Dupable Ordering

Defined in Data.Unrestricted.Internal.Instances

Methods

dupV :: forall (n :: Nat). KnownNat n => Ordering %1 -> V n Ordering

dup2 :: Ordering %1 -> (Ordering, Ordering)

Dupable ()

Defined in Data.Unrestricted.Internal.Instances

Methods

dupV :: forall (n :: Nat). KnownNat n => () %1 -> V n ()

dup2 :: () %1 -> ((), ())

Dupable Any

Defined in Data.Unrestricted.Internal.Instances

Methods

dupV :: forall (n :: Nat). KnownNat n => Any %1 -> V n Any

dup2 :: Any %1 -> (Any, Any)

Dupable All

Defined in Data.Unrestricted.Internal.Instances

Methods

dupV :: forall (n :: Nat). KnownNat n => All %1 -> V n All

dup2 :: All %1 -> (All, All)

Dupable Pool

Defined in Foreign.Marshal.Pure

Methods

dupV :: forall (n :: Nat). KnownNat n => Pool %1 -> V n Pool

dup2 :: Pool %1 -> (Pool, Pool)

Dupable a => Dupable [a]

Defined in Data.Unrestricted.Internal.Instances

Methods

dupV :: forall (n :: Nat). KnownNat n => [a] %1 -> V n [a]

dup2 :: [a] %1 -> ([a], [a])

Dupable a => Dupable (Maybe a)

Defined in Data.Unrestricted.Internal.Instances

Methods

dupV :: forall (n :: Nat). KnownNat n => Maybe a %1 -> V n (Maybe a)

dup2 :: Maybe a %1 -> (Maybe a, Maybe a)

Dupable a => Dupable (Sum a)

Defined in Data.Unrestricted.Internal.Instances

Methods

dupV :: forall (n :: Nat). KnownNat n => Sum a %1 -> V n (Sum a)

dup2 :: Sum a %1 -> (Sum a, Sum a)

Dupable a => Dupable (Product a)

Defined in Data.Unrestricted.Internal.Instances

Methods

dupV :: forall (n :: Nat). KnownNat n => Product a %1 -> V n (Product a)

dup2 :: Product a %1 -> (Product a, Product a)

Dupable a => Dupable (NonEmpty a)

Defined in Data.Unrestricted.Internal.Instances

Methods

dupV :: forall (n :: Nat). KnownNat n => NonEmpty a %1 -> V n (NonEmpty a)

dup2 :: NonEmpty a %1 -> (NonEmpty a, NonEmpty a)

Dupable (Ur a)

Defined in Data.Unrestricted.Internal.Instances

Methods

dupV :: forall (n :: Nat). KnownNat n => Ur a %1 -> V n (Ur a)

dup2 :: Ur a %1 -> (Ur a, Ur a)

Dupable (Array a)

Defined in Data.Array.Mutable.Linear

Methods

dupV :: forall (n :: Nat). KnownNat n => Array a %1 -> V n (Array a)

dup2 :: Array a %1 -> (Array a, Array a)

Dupable (Vector a)

Defined in Data.Vector.Mutable.Linear

Methods

dupV :: forall (n :: Nat). KnownNat n => Vector a %1 -> V n (Vector a)

dup2 :: Vector a %1 -> (Vector a, Vector a)

Dupable (Set a)

Defined in Data.Set.Mutable.Linear

Methods

dupV :: forall (n :: Nat). KnownNat n => Set a %1 -> V n (Set a)

dup2 :: Set a %1 -> (Set a, Set a)

(Dupable a, Dupable b) => Dupable (Either a b)

Defined in Data.Unrestricted.Internal.Instances

Methods

dupV :: forall (n :: Nat). KnownNat n => Either a b %1 -> V n (Either a b)

dup2 :: Either a b %1 -> (Either a b, Either a b)

(Dupable a, Dupable b) => Dupable (a, b)

Defined in Data.Unrestricted.Internal.Instances

Methods

dupV :: forall (n :: Nat). KnownNat n => (a, b) %1 -> V n (a, b)

dup2 :: (a, b) %1 -> ((a, b), (a, b))

Dupable (HashMap k v)

Defined in Data.HashMap.Mutable.Linear

Methods

dupV :: forall (n :: Nat). KnownNat n => HashMap k v %1 -> V n (HashMap k v)

dup2 :: HashMap k v %1 -> (HashMap k v, HashMap k v)

(Dupable a, Dupable b, Dupable c) => Dupable (a, b, c)

Defined in Data.Unrestricted.Internal.Instances

Methods

dupV :: forall (n :: Nat). KnownNat n => (a, b, c) %1 -> V n (a, b, c)

dup2 :: (a, b, c) %1 -> ((a, b, c), (a, b, c))

dup :: Dupable a => a %1 -> (a, a)

dup3 :: Dupable a => a %1 -> (a, a, a)