Data.Delta.Set

Delta types for Set.

Single element

data DeltaSet1 a

Delta type for Set where a single element is deleted or added.

Constructors

Insert a

Delete a

Instances

Show a => Show (DeltaSet1 a)

Defined in Data.Delta.Set

Methods

showsPrec :: Int -> DeltaSet1 a -> ShowS

show :: DeltaSet1 a -> String

showList :: [DeltaSet1 a] -> ShowS

Ord a => Delta (DeltaSet1 a)

Defined in Data.Delta.Set

Associated Types

type Base (DeltaSet1 a)

Methods

apply :: DeltaSet1 a -> Base (DeltaSet1 a) -> Base (DeltaSet1 a)

Eq a => Eq (DeltaSet1 a)

Defined in Data.Delta.Set

Methods

(==) :: DeltaSet1 a -> DeltaSet1 a -> Bool

(/=) :: DeltaSet1 a -> DeltaSet1 a -> Bool

Ord a => Ord (DeltaSet1 a)

Defined in Data.Delta.Set

Methods

compare :: DeltaSet1 a -> DeltaSet1 a -> Ordering

(<) :: DeltaSet1 a -> DeltaSet1 a -> Bool

(<=) :: DeltaSet1 a -> DeltaSet1 a -> Bool

(>) :: DeltaSet1 a -> DeltaSet1 a -> Bool

(>=) :: DeltaSet1 a -> DeltaSet1 a -> Bool

max :: DeltaSet1 a -> DeltaSet1 a -> DeltaSet1 a

min :: DeltaSet1 a -> DeltaSet1 a -> DeltaSet1 a

type Base (DeltaSet1 a)

Defined in Data.Delta.Set

type Base (DeltaSet1 a) = Set a

The following cancellation laws hold:

apply [Insert a, Delete a] = apply (Insert a)

apply [Insert a, Insert a] = apply (Insert a)

apply [Delete a, Insert a] = apply (Delete a)

apply [Delete a, Delete a] = apply (Delete a)

Multiple elements

data DeltaSet a

Delta type for a Set where collections of elements are inserted or deleted.

Instances

Ord a => Monoid (DeltaSet a)

Defined in Data.Delta.Set

Methods

mempty :: DeltaSet a

mappend :: DeltaSet a -> DeltaSet a -> DeltaSet a

mconcat :: [DeltaSet a] -> DeltaSet a

Ord a => Semigroup (DeltaSet a)

Remember that the semigroup instance is required to satisfy the following properties:

apply mempty = id

apply (d1 <> d2) = apply d1 . apply d2

Defined in Data.Delta.Set

Methods

(<>) :: DeltaSet a -> DeltaSet a -> DeltaSet a

sconcat :: NonEmpty (DeltaSet a) -> DeltaSet a

stimes :: Integral b => b -> DeltaSet a -> DeltaSet a

Ord a => Delta (DeltaSet a)

Defined in Data.Delta.Set

Associated Types

type Base (DeltaSet a)

Methods

apply :: DeltaSet a -> Base (DeltaSet a) -> Base (DeltaSet a)

Eq a => Eq (DeltaSet a)

Defined in Data.Delta.Set

Methods

(==) :: DeltaSet a -> DeltaSet a -> Bool

(/=) :: DeltaSet a -> DeltaSet a -> Bool

type Base (DeltaSet a)

Defined in Data.Delta.Set

type Base (DeltaSet a) = Set a

diffSet :: Ord a => Set a -> Set a -> DeltaSet a

The smallest delta that changes the second argument to the first argument.

new = apply (diffSet new old) old

diffSet (Set.fromList "ac") (Set.fromList "ab") = deltaSetFromList [Insert 'c', Delete 'b']

listFromDeltaSet :: DeltaSet a -> [DeltaSet1 a]

Flatten a DeltaSet to a list of DeltaSet1.

In the result list, the set of a appearing as Insert a is disjoint from the set of a appearing as Delete a.

deltaSetFromList :: Ord a => [DeltaSet1 a] -> DeltaSet a

Collect insertions or deletions of elements into a DeltaSet.

To save space, combinations of Insert and Delete for the same element are simplified when possible. These simplifications always preserve the property

apply (deltaSetFromList ds) = apply ds