Moduleinsert-ordered-containers-0.3.0Haskell2010

Data.HashSet.InsOrd

InsOrdHashSet is like HashSet, but it folds in insertion order.

This module interface mimics Data.HashSet, with some additions.

Contents

Construction
Basic interface
Combine
Transformations
Unordered
Difference and intersection
Folds
Unordered
Filter
Conversions
Lenses
Debugging

Synopsis

data InsOrdHashSet
value empty
value singleton
value null
value size
value member
value insert
value delete
value union
value map
value difference
value intersection
value filter
value toList
value fromList
value toHashSet
value fromHashSet
value hashSet
value valid

Packageinsert-ordered-containers-0.3.0
Exports19
LanguageHaskell2010
LicenceBSD-3-Clause
SourceInsOrd.hs

datadata InsOrdHashSet k

Source#

HashSet which tries its best to remember insertion order of elements.

Instances25Foldable, NFData1, IsList, Eq, Data, Read, …

Foldable InsOrdHashSetDefined in insert-ordered-containers-0.3.0 · Data.HashSet.InsOrd
NFData1 InsOrdHashSetDefined in insert-ordered-containers-0.3.0 · Data.HashSet.InsOrd
(Eq k, Hashable k) => IsList (InsOrdHashSet k)Defined in insert-ordered-containers-0.3.0 · Data.HashSet.InsOrd
Eq k => Eq (InsOrdHashSet k)Defined in insert-ordered-containers-0.3.0 · Data.HashSet.InsOrd
(Data k, Hashable k) => Data (InsOrdHashSet k)Defined in insert-ordered-containers-0.3.0 · Data.HashSet.InsOrd
(Eq k, Hashable k, Read k) => Read (InsOrdHashSet k)Defined in insert-ordered-containers-0.3.0 · Data.HashSet.InsOrd
Show k => Show (InsOrdHashSet k)Defined in insert-ordered-containers-0.3.0 · Data.HashSet.InsOrd
(Eq k, Hashable k) => Semigroup (InsOrdHashSet k)Defined in insert-ordered-containers-0.3.0 · Data.HashSet.InsOrd
(Eq k, Hashable k) => Monoid (InsOrdHashSet k)Defined in insert-ordered-containers-0.3.0 · Data.HashSet.InsOrd
NFData k => NFData (InsOrdHashSet k)Defined in insert-ordered-containers-0.3.0 · Data.HashSet.InsOrd
Hashable k => Hashable (InsOrdHashSet k)Defined in insert-ordered-containers-0.3.0 · Data.HashSet.InsOrd
hashWithSalt salt . toHashSet = hashWithSalt salt.
(Eq a, Hashable a, FromJSON a) => FromJSON (InsOrdHashSet a)Defined in insert-ordered-containers-0.3.0 · Data.HashSet.InsOrd
ToJSON a => ToJSON (InsOrdHashSet a)Defined in insert-ordered-containers-0.3.0 · Data.HashSet.InsOrd
(Eq k, Hashable k) => At (InsOrdHashSet k)Defined in insert-ordered-containers-0.3.0 · Data.HashSet.InsOrd
(Eq a, Hashable a) => Contains (InsOrdHashSet a)Defined in insert-ordered-containers-0.3.0 · Data.HashSet.InsOrd
(Eq k, Hashable k) => Ixed (InsOrdHashSet k)Defined in insert-ordered-containers-0.3.0 · Data.HashSet.InsOrd
(Eq k, Hashable k) => At (InsOrdHashSet k)Defined in insert-ordered-containers-0.3.0 · Data.HashSet.InsOrd
(Eq a, Hashable a) => Contains (InsOrdHashSet a)Defined in insert-ordered-containers-0.3.0 · Data.HashSet.InsOrd
(Eq k, Hashable k) => Ixed (InsOrdHashSet k)Defined in insert-ordered-containers-0.3.0 · Data.HashSet.InsOrd
type Item (InsOrdHashSet k) = kDefined in insert-ordered-containers-0.3.0 · Data.HashSet.InsOrd
type Index (InsOrdHashSet a) = aDefined in insert-ordered-containers-0.3.0 · Data.HashSet.InsOrd
type IxValue (InsOrdHashSet a) = ()Defined in insert-ordered-containers-0.3.0 · Data.HashSet.InsOrd
type Index (InsOrdHashSet a) = aDefined in insert-ordered-containers-0.3.0 · Data.HashSet.InsOrd
type IxValue (InsOrdHashSet a) = ()Defined in insert-ordered-containers-0.3.0 · Data.HashSet.InsOrd
type IxKind (InsOrdHashSet k) = An_AffineTraversalDefined in insert-ordered-containers-0.3.0 · Data.HashSet.InsOrd

Construction

valueempty :: InsOrdHashSet k

valuesingleton :: Hashable k => k -> InsOrdHashSet k

Basic interface

valuenull :: InsOrdHashSet k -> Bool

valuesize :: InsOrdHashSet k -> Int

valuemember :: (Eq k, Hashable k) => k -> InsOrdHashSet k -> Bool

valueinsert :: (Eq k, Hashable k) => k -> InsOrdHashSet k -> InsOrdHashSet k

valuedelete :: (Eq k, Hashable k) => k -> InsOrdHashSet k -> InsOrdHashSet k

Combine

valueunion

:: (Eq k, Hashable k)
=> InsOrdHashSet k
-> InsOrdHashSet k
-> InsOrdHashSet k

Transformations

valuemap :: (Hashable b, Eq b) => (a -> b) -> InsOrdHashSet a -> InsOrdHashSet b

Unordered

Difference and intersection

valuedifference

:: (Eq a, Hashable a)
=> InsOrdHashSet a
-> InsOrdHashSet a
-> InsOrdHashSet a

valueintersection

:: (Eq a, Hashable a)
=> InsOrdHashSet a
-> InsOrdHashSet a
-> InsOrdHashSet a

Folds

Unordered

Filter

valuefilter :: (a -> Bool) -> InsOrdHashSet a -> InsOrdHashSet a

Conversions

valuetoList :: InsOrdHashSet k -> [k]

valuefromList :: (Eq k, Hashable k) => [k] -> InsOrdHashSet k

valuetoHashSet :: InsOrdHashSet k -> HashSet k

valuefromHashSet :: HashSet k -> InsOrdHashSet k

Lenses

valuehashSet

:: (Profunctor p, Functor f)
=> p (HashSet a) (f (HashSet a))
-> p (InsOrdHashSet a) (f (InsOrdHashSet a))

Source#

This is a slight lie, as roundtrip doesn't preserve ordering.

Debugging

valuevalid :: InsOrdHashSet a -> Bool

Source#

Test if the internal map structure is valid.