Moduleth-desugar-1.19Haskell2010

Language.Haskell.TH.Desugar.OSet

An OSet behaves much like a Set, with all the same asymptotics, but also remembers the order that values were inserted.

This module offers a simplified version of the Data.Set.Ordered API that assumes left-biased indices everywhere.

Contents

Trivial sets
Insertion
Query
Deletion
Indexing
List conversions
Set conversion

Synopsis

newtype OSet
value empty
value singleton
value insertPre
value insertPost
value union
value null
value size
value member
value notMember
value delete
value filter
value \\
value intersection
type Index
value lookupIndex
value lookupAt
value fromList
value toAscList
value toSet

Packageth-desugar-1.19
Exports20
LanguageHaskell2010
LicenceBSD-3-Clause
SourceOSet.hs

newtypenewtype OSet a

Source#

An ordered set whose insertPre, insertPost, intersection, and union operations are biased towards leftmost indices when when breaking ties between keys.

Instances8Foldable, Eq, Data, Ord, Read, Show, …

Foldable OSetDefined in th-desugar-1.19 · Language.Haskell.TH.Desugar.OSet
Eq a => Eq (OSet a)Defined in th-desugar-1.19 · Language.Haskell.TH.Desugar.OSet
(Data a, Ord a) => Data (OSet a)Defined in th-desugar-1.19 · Language.Haskell.TH.Desugar.OSet
Ord a => Ord (OSet a)Defined in th-desugar-1.19 · Language.Haskell.TH.Desugar.OSet
(Ord a, Read a) => Read (OSet a)Defined in th-desugar-1.19 · Language.Haskell.TH.Desugar.OSet
Show a => Show (OSet a)Defined in th-desugar-1.19 · Language.Haskell.TH.Desugar.OSet
Ord a => Semigroup (OSet a)Defined in th-desugar-1.19 · Language.Haskell.TH.Desugar.OSet
Ord a => Monoid (OSet a)Defined in th-desugar-1.19 · Language.Haskell.TH.Desugar.OSet

Trivial sets

valueempty :: OSet a

valuesingleton :: a -> OSet a

Insertion

valueinsertPre :: Ord a => a -> OSet a -> OSet a

Source#

The element's index will be lower than the indices of the elements in the OSet.

valueinsertPost :: Ord a => OSet a -> a -> OSet a

Source#

The element's index will be higher than the indices of the elements in the OSet.

valueunion :: Ord a => OSet a -> OSet a -> OSet a

Query

valuenull :: OSet a -> Bool

valuesize :: OSet a -> Int

valuemember :: Ord a => a -> OSet a -> Bool

valuenotMember :: Ord a => a -> OSet a -> Bool

Deletion

valuedelete :: Ord a => a -> OSet a -> OSet a

valuefilter :: Ord a => (a -> Bool) -> OSet a -> OSet a

value(\\) :: Ord a => OSet a -> OSet a -> OSet a

valueintersection :: Ord a => OSet a -> OSet a -> OSet a

Indexing

typetype Index = Int

Source#

A 0-based index, much like the indices used by lists' !! operation. All indices are with respect to insertion order.

valuelookupIndex :: Ord a => a -> OSet a -> Maybe Index

valuelookupAt :: Index -> OSet a -> Maybe a

List conversions

valuefromList :: Ord a => [a] -> OSet a

valuetoAscList :: OSet a -> [a]

`Set` conversion

valuetoSet :: OSet a -> Set a

Trivial sets

Insertion

Query

Deletion

Indexing

List conversions

Set conversion

`Set` conversion