Safe Haskell	Trustworthy
Language	Haskell2010

Data.HashSet.InsOrd

Contents

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

Description

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

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

Synopsis

data InsOrdHashSet k
empty :: InsOrdHashSet k
singleton :: Hashable k => k -> InsOrdHashSet k
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
union :: ( Eq k, Hashable k) => InsOrdHashSet k -> InsOrdHashSet k -> InsOrdHashSet k
map :: ( Hashable b, Eq b) => (a -> b) -> InsOrdHashSet a -> InsOrdHashSet b
difference :: ( Eq a, Hashable a) => InsOrdHashSet a -> InsOrdHashSet a -> InsOrdHashSet a
intersection :: ( Eq a, Hashable a) => InsOrdHashSet a -> InsOrdHashSet a -> InsOrdHashSet a
filter :: (a -> Bool ) -> InsOrdHashSet a -> InsOrdHashSet a
toList :: InsOrdHashSet k -> [k]
fromList :: ( Eq k, Hashable k) => [k] -> InsOrdHashSet k
toHashSet :: InsOrdHashSet k -> HashSet k
fromHashSet :: HashSet k -> InsOrdHashSet k
hashSet :: Iso' ( InsOrdHashSet a) ( HashSet a)
valid :: InsOrdHashSet a -> Bool

Documentation

data InsOrdHashSet k Source #

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

Instances

Instances details

Foldable InsOrdHashSet Source #
Instance details Defined in Data.HashSet.InsOrd Methods fold :: Monoid m => InsOrdHashSet m -> m Source # foldMap :: Monoid m => (a -> m) -> InsOrdHashSet a -> m Source # foldMap' :: Monoid m => (a -> m) -> InsOrdHashSet a -> m Source # foldr :: (a -> b -> b) -> b -> InsOrdHashSet a -> b Source # foldr' :: (a -> b -> b) -> b -> InsOrdHashSet a -> b Source # foldl :: (b -> a -> b) -> b -> InsOrdHashSet a -> b Source # foldl' :: (b -> a -> b) -> b -> InsOrdHashSet a -> b Source # foldr1 :: (a -> a -> a) -> InsOrdHashSet a -> a Source # foldl1 :: (a -> a -> a) -> InsOrdHashSet a -> a Source # toList :: InsOrdHashSet a -> [a] Source # null :: InsOrdHashSet a -> Bool Source # length :: InsOrdHashSet a -> Int Source # elem :: Eq a => a -> InsOrdHashSet a -> Bool Source # maximum :: Ord a => InsOrdHashSet a -> a Source # minimum :: Ord a => InsOrdHashSet a -> a Source # sum :: Num a => InsOrdHashSet a -> a Source # product :: Num a => InsOrdHashSet a -> a Source #
NFData1 InsOrdHashSet Source #	Since: 0.2.5
Instance details Defined in Data.HashSet.InsOrd Methods liftRnf :: (a -> ()) -> InsOrdHashSet a -> () Source #
( Eq k, Hashable k) => IsList ( InsOrdHashSet k) Source #
Instance details Defined in Data.HashSet.InsOrd Associated Types type Item ( InsOrdHashSet k) Source # Methods fromList :: [ Item ( InsOrdHashSet k)] -> InsOrdHashSet k Source # fromListN :: Int -> [ Item ( InsOrdHashSet k)] -> InsOrdHashSet k Source # toList :: InsOrdHashSet k -> [ Item ( InsOrdHashSet k)] Source #
Eq k => Eq ( InsOrdHashSet k) Source #
Instance details Defined in Data.HashSet.InsOrd Methods (==) :: InsOrdHashSet k -> InsOrdHashSet k -> Bool Source # (/=) :: InsOrdHashSet k -> InsOrdHashSet k -> Bool Source #
( Data k, Eq k, Hashable k) => Data ( InsOrdHashSet k) Source #
Instance details 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) Source # gunfold :: ( forall b r. Data b => c (b -> r) -> c r) -> ( forall r. r -> c r) -> Constr -> c ( InsOrdHashSet k) Source # toConstr :: InsOrdHashSet k -> Constr Source # dataTypeOf :: InsOrdHashSet k -> DataType Source # dataCast1 :: Typeable t => ( forall d. Data d => c (t d)) -> Maybe (c ( InsOrdHashSet k)) Source # dataCast2 :: Typeable t => ( forall d e. ( Data d, Data e) => c (t d e)) -> Maybe (c ( InsOrdHashSet k)) Source # gmapT :: ( forall b. Data b => b -> b) -> InsOrdHashSet k -> InsOrdHashSet k Source # gmapQl :: (r -> r' -> r) -> r -> ( forall d. Data d => d -> r') -> InsOrdHashSet k -> r Source # gmapQr :: forall r r'. (r' -> r -> r) -> r -> ( forall d. Data d => d -> r') -> InsOrdHashSet k -> r Source # gmapQ :: ( forall d. Data d => d -> u) -> InsOrdHashSet k -> [u] Source # gmapQi :: Int -> ( forall d. Data d => d -> u) -> InsOrdHashSet k -> u Source # gmapM :: Monad m => ( forall d. Data d => d -> m d) -> InsOrdHashSet k -> m ( InsOrdHashSet k) Source # gmapMp :: MonadPlus m => ( forall d. Data d => d -> m d) -> InsOrdHashSet k -> m ( InsOrdHashSet k) Source # gmapMo :: MonadPlus m => ( forall d. Data d => d -> m d) -> InsOrdHashSet k -> m ( InsOrdHashSet k) Source #
( Eq k, Hashable k, Read k) => Read ( InsOrdHashSet k) Source #
Instance details Defined in Data.HashSet.InsOrd Methods readsPrec :: Int -> ReadS ( InsOrdHashSet k) Source # readList :: ReadS [ InsOrdHashSet k] Source # readPrec :: ReadPrec ( InsOrdHashSet k) Source # readListPrec :: ReadPrec [ InsOrdHashSet k] Source #
Show k => Show ( InsOrdHashSet k) Source #
Instance details Defined in Data.HashSet.InsOrd Methods showsPrec :: Int -> InsOrdHashSet k -> ShowS Source # show :: InsOrdHashSet k -> String Source # showList :: [ InsOrdHashSet k] -> ShowS Source #
( Eq k, Hashable k) => Semigroup ( InsOrdHashSet k) Source #
Instance details Defined in Data.HashSet.InsOrd Methods (<>) :: InsOrdHashSet k -> InsOrdHashSet k -> InsOrdHashSet k Source # sconcat :: NonEmpty ( InsOrdHashSet k) -> InsOrdHashSet k Source # stimes :: Integral b => b -> InsOrdHashSet k -> InsOrdHashSet k Source #
( Eq k, Hashable k) => Monoid ( InsOrdHashSet k) Source #
Instance details Defined in Data.HashSet.InsOrd Methods mempty :: InsOrdHashSet k Source # mappend :: InsOrdHashSet k -> InsOrdHashSet k -> InsOrdHashSet k Source # mconcat :: [ InsOrdHashSet k] -> InsOrdHashSet k Source #
Hashable k => Hashable ( InsOrdHashSet k) Source #	`hashWithSalt salt . toHashSet = hashWithSalt salt` .
Instance details Defined in Data.HashSet.InsOrd Methods hashWithSalt :: Int -> InsOrdHashSet k -> Int Source # hash :: InsOrdHashSet k -> Int Source #
ToJSON a => ToJSON ( InsOrdHashSet a) Source #
Instance details Defined in Data.HashSet.InsOrd Methods toJSON :: InsOrdHashSet a -> Value Source # toEncoding :: InsOrdHashSet a -> Encoding Source # toJSONList :: [ InsOrdHashSet a] -> Value Source # toEncodingList :: [ InsOrdHashSet a] -> Encoding Source #
( Eq a, Hashable a, FromJSON a) => FromJSON ( InsOrdHashSet a) Source #
Instance details Defined in Data.HashSet.InsOrd Methods parseJSON :: Value -> Parser ( InsOrdHashSet a) Source # parseJSONList :: Value -> Parser [ InsOrdHashSet a] Source #
NFData k => NFData ( InsOrdHashSet k) Source #	Since: 0.2.5
Instance details Defined in Data.HashSet.InsOrd Methods rnf :: InsOrdHashSet k -> () Source #
( Eq a, Hashable a) => Contains ( InsOrdHashSet a) Source #
Instance details Defined in Data.HashSet.InsOrd Methods contains :: Index ( InsOrdHashSet a) -> Lens' ( InsOrdHashSet a) Bool Source #
( Eq k, Hashable k) => Ixed ( InsOrdHashSet k) Source #
Instance details Defined in Data.HashSet.InsOrd Methods ix :: Index ( InsOrdHashSet k) -> Traversal' ( InsOrdHashSet k) ( IxValue ( InsOrdHashSet k)) Source #
( Eq k, Hashable k) => At ( InsOrdHashSet k) Source #
Instance details Defined in Data.HashSet.InsOrd Methods at :: Index ( InsOrdHashSet k) -> Lens' ( InsOrdHashSet k) ( Maybe ( IxValue ( InsOrdHashSet k))) Source #
( Eq a, Hashable a) => Contains ( InsOrdHashSet a) Source #
Instance details Defined in Data.HashSet.InsOrd Methods contains :: Index ( InsOrdHashSet a) -> Lens' ( InsOrdHashSet a) Bool Source #
( Eq k, Hashable k) => Ixed ( InsOrdHashSet k) Source #
Instance details Defined in Data.HashSet.InsOrd Associated Types type IxKind ( InsOrdHashSet k) Source # Methods ix :: Index ( InsOrdHashSet k) -> Optic' ( IxKind ( InsOrdHashSet k)) NoIx ( InsOrdHashSet k) ( IxValue ( InsOrdHashSet k)) Source #
( Eq k, Hashable k) => At ( InsOrdHashSet k) Source #
Instance details Defined in Data.HashSet.InsOrd Methods at :: Index ( InsOrdHashSet k) -> Lens' ( InsOrdHashSet k) ( Maybe ( IxValue ( InsOrdHashSet k))) Source #
type Item ( InsOrdHashSet k) Source #
Instance details Defined in Data.HashSet.InsOrd type Item ( InsOrdHashSet k) = k
type Index ( InsOrdHashSet a) Source #
Instance details Defined in Data.HashSet.InsOrd type Index ( InsOrdHashSet a) = a
type IxValue ( InsOrdHashSet a) Source #
Instance details Defined in Data.HashSet.InsOrd type IxValue ( InsOrdHashSet a) = ()
type Index ( InsOrdHashSet a) Source #
Instance details Defined in Data.HashSet.InsOrd type Index ( InsOrdHashSet a) = a
type IxValue ( InsOrdHashSet a) Source #
Instance details Defined in Data.HashSet.InsOrd type IxValue ( InsOrdHashSet a) = ()
type IxKind ( InsOrdHashSet k) Source #
Instance details Defined in Data.HashSet.InsOrd type IxKind ( InsOrdHashSet k) = An_AffineTraversal