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.

1 type
18 values

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

datadata InsOrdHashSet k

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

2 declarations

valueempty :: InsOrdHashSet k

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

Basic interface

5 declarations

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

1 declaration

valueunion

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

Transformations

1 declaration

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

Unordered

Difference and intersection

2 declarations

valuedifference

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

valueintersection

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

Folds

0 declarations

Unordered

Filter

1 declaration

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

Conversions

4 declarations

valuetoList :: InsOrdHashSet k -> [k]

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

valuetoHashSet :: InsOrdHashSet k -> HashSet k

valuefromHashSet :: HashSet k -> InsOrdHashSet k

Lenses

1 declaration

valuehashSet

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

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

Debugging

1 declaration

valuevalid :: InsOrdHashSet a -> Bool

Test if the internal map structure is valid.