Data.HashSet.InsOrd

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

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

Documentation

data InsOrdHashSet k

HashSet which tries it's best to remember insertion order of elements.

Instances

Foldable InsOrdHashSet

Defined in Data.HashSet.InsOrd

Methods

fold :: Monoid m => InsOrdHashSet m -> m

foldMap :: Monoid m => (a -> m) -> InsOrdHashSet a -> m

foldr :: (a -> b -> b) -> b -> InsOrdHashSet a -> b

foldr' :: (a -> b -> b) -> b -> InsOrdHashSet a -> b

foldl :: (b -> a -> b) -> b -> InsOrdHashSet a -> b

foldl' :: (b -> a -> b) -> b -> InsOrdHashSet a -> b

foldr1 :: (a -> a -> a) -> InsOrdHashSet a -> a

foldl1 :: (a -> a -> a) -> InsOrdHashSet a -> a

toList :: InsOrdHashSet a -> [a]

null :: InsOrdHashSet a -> Bool

length :: InsOrdHashSet a -> Int

elem :: Eq a => a -> InsOrdHashSet a -> Bool

maximum :: Ord a => InsOrdHashSet a -> a

minimum :: Ord a => InsOrdHashSet a -> a

sum :: Num a => InsOrdHashSet a -> a

product :: Num a => InsOrdHashSet a -> a

(Eq k, Hashable k) => IsList (InsOrdHashSet k)

Defined in Data.HashSet.InsOrd

Associated Types

type Item (InsOrdHashSet k) :: Type

Methods

fromList :: [Item (InsOrdHashSet k)] -> InsOrdHashSet k

fromListN :: Int -> [Item (InsOrdHashSet k)] -> InsOrdHashSet k

toList :: InsOrdHashSet k -> [Item (InsOrdHashSet k)]

Eq k => Eq (InsOrdHashSet k)

Defined in Data.HashSet.InsOrd

Methods

(==) :: InsOrdHashSet k -> InsOrdHashSet k -> Bool

(/=) :: InsOrdHashSet k -> InsOrdHashSet k -> Bool

(Data k, Eq k, Hashable k) => Data (InsOrdHashSet k)

Defined in Data.HashSet.InsOrd

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> InsOrdHashSet k -> c (InsOrdHashSet k)

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (InsOrdHashSet k)

toConstr :: InsOrdHashSet k -> Constr

dataTypeOf :: InsOrdHashSet k -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (InsOrdHashSet k))

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (InsOrdHashSet k))

gmapT :: (forall b. Data b => b -> b) -> InsOrdHashSet k -> InsOrdHashSet k

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> InsOrdHashSet k -> r

gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> InsOrdHashSet k -> r

gmapQ :: (forall d. Data d => d -> u) -> InsOrdHashSet k -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> InsOrdHashSet k -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> InsOrdHashSet k -> m (InsOrdHashSet k)

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> InsOrdHashSet k -> m (InsOrdHashSet k)

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> InsOrdHashSet k -> m (InsOrdHashSet k)

(Eq k, Hashable k, Read k) => Read (InsOrdHashSet k)

Defined in Data.HashSet.InsOrd

Methods

readsPrec :: Int -> ReadS (InsOrdHashSet k)

readList :: ReadS [InsOrdHashSet k]

readPrec :: ReadPrec (InsOrdHashSet k)

readListPrec :: ReadPrec [InsOrdHashSet k]

Show k => Show (InsOrdHashSet k)

Defined in Data.HashSet.InsOrd

Methods

showsPrec :: Int -> InsOrdHashSet k -> ShowS

show :: InsOrdHashSet k -> String

showList :: [InsOrdHashSet k] -> ShowS

(Eq k, Hashable k) => Semigroup (InsOrdHashSet k)

Defined in Data.HashSet.InsOrd

Methods

(<>) :: InsOrdHashSet k -> InsOrdHashSet k -> InsOrdHashSet k

sconcat :: NonEmpty (InsOrdHashSet k) -> InsOrdHashSet k

stimes :: Integral b => b -> InsOrdHashSet k -> InsOrdHashSet k

(Eq k, Hashable k) => Monoid (InsOrdHashSet k)

Defined in Data.HashSet.InsOrd

Methods

mempty :: InsOrdHashSet k

mappend :: InsOrdHashSet k -> InsOrdHashSet k -> InsOrdHashSet k

mconcat :: [InsOrdHashSet k] -> InsOrdHashSet k

Hashable k => Hashable (InsOrdHashSet k)

hashWithSalt salt . toHashSet = hashWithSalt salt.

Defined in Data.HashSet.InsOrd

Methods

hashWithSalt :: Int -> InsOrdHashSet k -> Int

hash :: InsOrdHashSet k -> Int

ToJSON a => ToJSON (InsOrdHashSet a)

Defined in Data.HashSet.InsOrd

Methods

toJSON :: InsOrdHashSet a -> Value

toEncoding :: InsOrdHashSet a -> Encoding

toJSONList :: [InsOrdHashSet a] -> Value

toEncodingList :: [InsOrdHashSet a] -> Encoding

(Eq a, Hashable a, FromJSON a) => FromJSON (InsOrdHashSet a)

Defined in Data.HashSet.InsOrd

Methods

parseJSON :: Value -> Parser (InsOrdHashSet a)

parseJSONList :: Value -> Parser [InsOrdHashSet a]

(Eq a, Hashable a) => Contains (InsOrdHashSet a)

Defined in Data.HashSet.InsOrd

Methods

contains :: Index (InsOrdHashSet a) -> Lens' (InsOrdHashSet a) Bool

(Eq k, Hashable k) => Ixed (InsOrdHashSet k)

Defined in Data.HashSet.InsOrd

Methods

ix :: Index (InsOrdHashSet k) -> Traversal' (InsOrdHashSet k) (IxValue (InsOrdHashSet k))

(Eq k, Hashable k) => At (InsOrdHashSet k)

Defined in Data.HashSet.InsOrd

Methods

at :: Index (InsOrdHashSet k) -> Lens' (InsOrdHashSet k) (Maybe (IxValue (InsOrdHashSet k)))

(Eq a, Hashable a) => Contains (InsOrdHashSet a)

Defined in Data.HashSet.InsOrd

Methods

contains :: Index (InsOrdHashSet a) -> Lens' (InsOrdHashSet a) Bool

(Eq k, Hashable k) => Ixed (InsOrdHashSet k)

Defined in Data.HashSet.InsOrd

Associated Types

type IxKind (InsOrdHashSet k) :: OpticKind

Methods

ix :: Index (InsOrdHashSet k) -> Optic' (IxKind (InsOrdHashSet k)) NoIx (InsOrdHashSet k) (IxValue (InsOrdHashSet k))

(Eq k, Hashable k) => At (InsOrdHashSet k)

Defined in Data.HashSet.InsOrd

Methods

at :: Index (InsOrdHashSet k) -> Lens' (InsOrdHashSet k) (Maybe (IxValue (InsOrdHashSet k)))

type Item (InsOrdHashSet k)

Defined in Data.HashSet.InsOrd

type Item (InsOrdHashSet k) = k

type Index (InsOrdHashSet a)

Defined in Data.HashSet.InsOrd

type Index (InsOrdHashSet a) = a

type IxValue (InsOrdHashSet a)

Defined in Data.HashSet.InsOrd

type IxValue (InsOrdHashSet a) = ()

type Index (InsOrdHashSet a)

Defined in Data.HashSet.InsOrd

type Index (InsOrdHashSet a) = a

type IxValue (InsOrdHashSet a)

Defined in Data.HashSet.InsOrd

type IxValue (InsOrdHashSet a) = ()

type IxKind (InsOrdHashSet k)

Defined in Data.HashSet.InsOrd

type IxKind (InsOrdHashSet k) = An_AffineTraversal

Construction

empty :: InsOrdHashSet k

singleton :: Hashable k => k -> InsOrdHashSet k

Basic interface

null :: InsOrdHashSet k -> Bool

size :: InsOrdHashSet k -> Int

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

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

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

Combine

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

Transformations

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

Unordered

Difference and intersection

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

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

Folds

Unordered

Filter

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

Conversions

toList :: InsOrdHashSet k -> [k]

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

toHashSet :: InsOrdHashSet k -> HashSet k

fromHashSet :: HashSet k -> InsOrdHashSet k

Lenses

hashSet :: Iso' (InsOrdHashSet a) (HashSet a)

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

Debugging

valid :: InsOrdHashSet a -> Bool

Test if the internal map structure is valid.