Safe Haskell | Safe-Inferred |
---|---|
Language | GHC2021 |
Unimap.Find
Description
(Import this module qualified)
Documentation
Constructors
ChangedYes | |
ChangedNo |
Constructors
Equiv | |
Fields
|
Constructors
InsertResAdded !(UnionFind k) | |
InsertResDuplicate |
Constructors
InsertValInserted | |
InsertValDuplicate |
Instances
Constructors
LookupResMissing !k | |
LookupResFound !k !(IntLikeSet k) !(Maybe (UnionFind k)) |
Constructors
LookupValMissing !k | |
LookupValOk !k !(IntLikeSet k) !Changed |
compactLM :: (Coercible k Int, MonadState s m) => UnionFindLens s k -> m (IntLikeMap k k) Source #
compactM :: (Coercible k Int, MonadState (UnionFind k) m) => m (IntLikeMap k k) Source #
Constructors
MergeResMissing !k | |
MergeResMerged !k !(IntLikeSet k) !(UnionFind k) |
Constructors
MergeValMissing !k | |
MergeValMerged !k !(IntLikeSet k) |
mergeOneLM :: (Coercible k Int, Eq k, MonadState s m) => UnionFindLens s k -> k -> k -> m (MergeVal k) Source #
mergeOneM :: (Coercible k Int, Eq k, MonadState (UnionFind k) m) => k -> k -> m (MergeVal k) Source #
mergeMany :: (Traversable f, Coercible k Int, Eq k) => k -> f k -> UnionFind k -> MergeRes k Source #
mergeManyLM :: (Traversable f, Coercible k Int, Eq k, MonadState s m) => UnionFindLens s k -> k -> f k -> m (MergeVal k) Source #
mergeManyM :: (Traversable f, Coercible k Int, Eq k, MonadState (UnionFind k) m) => k -> f k -> m (MergeVal k) Source #