Hoogle Search

Within Stackage Nightly 2025-09-30 (ghc-9.12.2)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

Exact lookup

1. setLabel :: a -> TreePos Full a -> TreePos Full a

   rosezipper	Data.Tree.Zipper

   Change the label at the current node.

2. setTree :: Tree a -> TreePos Full a -> TreePos Full a

   rosezipper	Data.Tree.Zipper

   Change the current tree.

3. setL :: Lens a b -> b -> a -> a

   time-lens	Data.Time.Lens

   Get the setter function from a lens

4. setVerbosity :: HasVerbosity s => Verbosity -> s -> s

   verbosity	Data.Verbosity.Class

   Specialization of verbosity lens in to setter function.

5. setAt :: [a] -> Int -> a -> [a]

   yjtools	Data.List.Tools

   No documentation available.

6. memset :: Ptr Word8 -> Word8 -> CSize -> IO (Ptr Word8)

   bytestring	Data.ByteString.Internal

   Deprecated: Use Foreign.Marshal.Utils.fillBytes instead

7. reverseTopSort :: Graph -> [Vertex]

   containers	Data.Graph

   Reverse ordering of topSort. See note in topSort.

8. fromSet :: (Key -> a) -> IntSet -> IntMap a

   containers	Data.IntMap.Internal

   Build a map from a set of keys and a function which for each key computes its value.

   fromSet (\k -> replicate k 'a') (Data.IntSet.fromList [3, 5]) == fromList [(5,"aaaaa"), (3,"aaa")]
   fromSet undefined Data.IntSet.empty == empty
   

9. keysSet :: IntMap a -> IntSet

   containers	Data.IntMap.Internal

   The set of all keys of the map.

   keysSet (fromList [(5,"a"), (3,"b")]) == Data.IntSet.fromList [3,5]
   keysSet empty == Data.IntSet.empty
   

10. fromSet :: (Key -> a) -> IntSet -> IntMap a

    containers	Data.IntMap.Lazy

    Build a map from a set of keys and a function which for each key computes its value.

    fromSet (\k -> replicate k 'a') (Data.IntSet.fromList [3, 5]) == fromList [(5,"aaaaa"), (3,"aaa")]
    fromSet undefined Data.IntSet.empty == empty
    

Page 69 of many | Previous | Next