Hoogle Search
Within LTS Haskell 24.5 (ghc-9.10.2)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
fromLists :: Enum a => [[T [] a]] -> T aboard-games Game.Mastermind.CodeSet.Union No documentation available.
fromListL :: [(ByteString, a)] -> Trie abytestring-trie Data.Trie.Convenience A left-fold version of fromList. If you run into issues with stack overflows when using fromList or fromListR, then you should use this function instead.
fromListR :: [(ByteString, a)] -> Trie abytestring-trie Data.Trie.Convenience An explicitly right-fold variant of fromList. It is a good consumer for list fusion. Worst-case behavior is somewhat worse than worst-case for fromListL. The fromList function is currently just an alias for fromListR.
fromListS :: [(ByteString, a)] -> Trie abytestring-trie Data.Trie.Convenience This variant sorts the list before folding over it. This adds <math> overhead and requires the whole list be in memory at once, but it ensures that the list is in best-case order. The benefits generally outweigh the costs.
fromListWith :: (a -> a -> a) -> [(ByteString, a)] -> Trie abytestring-trie Data.Trie.Convenience A variant of fromListR that takes a function for combining values on conflict. The first argument to the combining function is the "new" value from the initial portion of the list; the second argument is the value that has been accumulated into the trie from the tail of the list (just like the first argument to foldr). Thus, fromList = fromListWith const.
fromListWith' :: (a -> a -> a) -> [(ByteString, a)] -> Trie abytestring-trie Data.Trie.Convenience A variant of fromListWith which applies the combining function strictly. This function is a good consumer for list fusion. If you need list fusion and are running into stack overflow problems with fromListWith, then this function may solve the problem.
fromListWithL :: (a -> a -> a) -> [(ByteString, a)] -> Trie abytestring-trie Data.Trie.Convenience A left-fold variant of fromListWith. Note that the arguments to the combining function are swapped: the first is the value in the trie which has been accumulated from the initial part of the list; the second argument is the "new" value from the remaining tail of the list (just like the first argument to foldl). Thus, fromListL = fromListWithL const.
fromListWithL' :: (a -> a -> a) -> [(ByteString, a)] -> Trie abytestring-trie Data.Trie.Convenience A variant of fromListWithL which applies the combining function strictly.
-
clash-prelude Clash.Explicit.Signal Like fromList, but resets on reset and has a defined reset value.
>>> let rst = unsafeFromActiveHigh (fromList [True, True, False, False, True, False]) >>> let res = fromListWithReset @System rst Nothing [Just 'a', Just 'b', Just 'c'] >>> sampleN 6 res [Nothing,Nothing,Just 'a',Just 'b',Nothing,Just 'a']
NB: This function is not synthesizable fromList_lazy :: forall a (dom :: Domain) . [a] -> Signal dom aclash-prelude Clash.Explicit.Signal Create a Signal from a list Every element in the list will correspond to a value of the signal for one clock cycle.
>>> sampleN 2 (fromList [1,2,3,4,5] :: Signal System Int) [1,2]
NB: This function is not synthesizable