----------------------------------------------------------------------------- -- | -- Module : Data.Set.Lens -- Copyright : (C) 2012 Edward Kmett -- License : BSD-style (see the file LICENSE) -- Maintainer : Edward Kmett -- Stability : provisional -- Portability : portable -- ---------------------------------------------------------------------------- module Data.Set.Lens ( contains , setmapped , setOf ) where import Control.Applicative import Control.Lens.Type import Control.Lens.Setter import Control.Lens.Getter import Data.Set as Set -- | This 'Lens' can be used to read, write or delete a member of a 'Set' -- -- >>> :m + Data.Set.Lens Control.Lens -- >>> contains 3 .~ False $ Set.fromList [1,2,3,4] -- fromList [1,2,4] -- -- > contains :: Ord k => k -> (Bool -> f Bool) -> Set k -> f (Set k) contains :: Ord k => k -> Simple Lens (Set k) Bool contains k f s = go <$> f (Set.member k s) where go False = Set.delete k s go True = Set.insert k s {-# INLINE contains #-} -- | This 'Setter' can be used to change the type of a 'Set' by mapping -- the elements to new values. -- -- Sadly, you can't create a valid 'Traversal' for a 'Set', but you can -- manipulate it by reading using 'folded' and reindexing it via 'setmap'. -- -- >>> :m + Data.Set.Lens Control.Lens -- >>> over setmapped (+1) (fromList [1,2,3,4]) -- fromList [2,3,4,5] setmapped :: (Ord i, Ord j) => Setter (Set i) (Set j) i j setmapped = sets Set.map -- | Construct a set from a 'Getter', 'Fold', 'Traversal', 'Lens' or 'Iso'. -- -- >>> :m + Data.Set.Lens Control.Lens -- >>> setOf (folded._2) [("hello",1),("world",2),("!!!",3)] -- fromList [1,2,3] -- -- @ -- setOf :: 'Getter' a c -> a -> 'Set' c -- setOf :: 'Ord' c => 'Fold' a c -> a -> 'Set' c -- setOf :: 'Simple' 'Iso' a c -> a -> 'Set' c -- setOf :: 'Simple' 'Lens' a c -> a -> 'Set' c -- setOf :: 'Ord' c => 'Simple' 'Traversal' a c -> a -> 'Set' c -- @ setOf :: Getting (Set c) a c -> a -> Set c setOf l = runAccessor . l (Accessor . Set.singleton)