Data.Monoid.Deletable

data Deletable m

If @m@ is a 'Monoid', then @Deletable m@ (intuitively speaking)

Constructors

• Deletable Int m Int

Instances

• Functor Deletable
• Foldable Deletable
• Traversable Deletable
• (Semigroup m) => Semigroup (Deletable m)
• (Semigroup m, Monoid m) => Monoid (Deletable m)

  r == l = Deletable r (stimes n m) l l < r = Deletable (i(r-l) + l) m l otherwise = Deletable r m (i(l-r) + r)

unDelete :: forall m. Deletable m -> m

Project the wrapped value out of a Deletable value.

toDeletable :: forall m. m -> Deletable m

Inject a value into a Deletable wrapper. Satisfies the

deleteL :: forall m. Monoid m => Deletable m

A "left bracket", which causes everything between it and the

deleteR :: forall m. Monoid m => Deletable m

A "right bracket", denoting the end of the section that should