Hoogle Search
Within LTS Haskell 24.68 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
setMB :: Int -> Approx -> Approxcdar-mBound Data.CDAR.Approx No documentation available.
setCookie :: MonadCGI m => Cookie -> m ()cgi Network.CGI Set a cookie.
setHeader :: MonadCGI m => String -> String -> m ()cgi Network.CGI Add a response header. Example:
setHeader "Content-type" "text/plain"
setStatus :: MonadCGI m => Int -> String -> m ()cgi Network.CGI Set the HTTP response status.
-
clash-prelude Clash.Class.BitPack Set the bits between bit index m and bit index n. NB: Bit indices are DESCENDING.
>>> pack (-5 :: Signed 6) 0b11_1011 >>> setSlice d4 d3 0 (-5 :: Signed 6) -29 >>> pack (-29 :: Signed 6) 0b10_0011
>>> setSlice d6 d5 0 (-5 :: Signed 6) <interactive>:... • Couldn't match type ‘7 + i0’ with ‘6’ arising from a use of ‘setSlice’ The type variable ‘i0’ is ambiguous • In the expression: setSlice d6 d5 0 (- 5 :: Signed 6) In an equation for ‘it’: it = setSlice d6 d5 0 (- 5 :: Signed 6)
# 175 "srcClashClassBitPackBitIndex.hs" -
clash-prelude Clash.Class.BitPack.BitIndex Set the bits between bit index m and bit index n. NB: Bit indices are DESCENDING.
>>> pack (-5 :: Signed 6) 0b11_1011 >>> setSlice d4 d3 0 (-5 :: Signed 6) -29 >>> pack (-29 :: Signed 6) 0b10_0011
>>> setSlice d6 d5 0 (-5 :: Signed 6) <interactive>:... • Couldn't match type ‘7 + i0’ with ‘6’ arising from a use of ‘setSlice’ The type variable ‘i0’ is ambiguous • In the expression: setSlice d6 d5 0 (- 5 :: Signed 6) In an equation for ‘it’: it = setSlice d6 d5 0 (- 5 :: Signed 6)
# 175 "srcClashClassBitPackBitIndex.hs" setName :: forall (name :: Symbol) a . a -> name ::: aclash-prelude Clash.Magic Name the instance or register with the given Symbol, instead of using an auto-generated name. Pre- and suffixes annotated with prefixName and suffixName will be added to both instances and registers named with setName and instances and registers that are auto-named.
-
clash-prelude Clash.Sized.Internal.BitVector No documentation available.
setPartitionNumbers :: Num a => [[a]]combinatorial Combinatorics Number of partitions of an n element set into k non-empty subsets. Known as Stirling numbers http://oeis.org/A048993.
QC.forAll (QC.choose (0,10000)) $ \k -> QC.forAll (take 7 <$> QC.arbitrary) $ \xs -> length (Comb.setPartitions k xs) == (Comb.setPartitionNumbers !! length (xs::String) ++ repeat 0) !! k
QC.forAll (QC.choose (0,7)) $ \k xs -> length (Comb.rectifications k xs) == (Comb.setPartitionNumbers !! k ++ repeat 0) !! length (xs::String)
setPartitions :: Int -> [a] -> [[[a]]]combinatorial Combinatorics Their number is k^n.