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.

  1. fromListWithReset :: forall (dom :: Domain) a . (HiddenReset dom, NFDataX a) => a -> [a] -> Signal dom a

    clash-prelude Clash.Prelude

    Like fromList, but resets on reset and has a defined reset value.

    >>> let rst = unsafeFromActiveHigh (fromList [True, True, False, False, True, False])
    
    >>> let res = withReset rst (fromListWithReset Nothing [Just 'a', Just 'b', Just 'c'])
    
    >>> sampleN @System 6 res
    [Nothing,Nothing,Just 'a',Just 'b',Nothing,Just 'a']
    
    NB: This function is not synthesizable

  2. fromList_lazy :: forall a (dom :: Domain) . [a] -> Signal dom a

    clash-prelude Clash.Prelude

    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

  3. fromListWithReset :: forall (dom :: Domain) a . (HiddenReset dom, NFDataX a) => a -> [a] -> Signal dom a

    clash-prelude Clash.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 = withReset rst (fromListWithReset Nothing [Just 'a', Just 'b', Just 'c'])
    
    >>> sampleN @System 6 res
    [Nothing,Nothing,Just 'a',Just 'b',Nothing,Just 'a']
    
    NB: This function is not synthesizable

  4. fromList_lazy :: forall a (dom :: Domain) . [a] -> Signal dom a

    clash-prelude Clash.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

  5. fromList_lazy :: forall a (dom :: Domain) . [a] -> Signal dom a

    clash-prelude Clash.Signal.Internal

    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

  6. fromListT :: forall (m :: Type -> Type) o i u . Monad m => ListT m (Maybe o) -> Pipe i o u m ()

    conduino Data.Conduino

    A source is essentially ListT producing a Maybe result. This converts a ListT to the source it encodes. See ZipSource for a wrapper over Pipe that gives the right Functor and Alternative instances.

  7. fromListWith :: Ord k => (a -> a -> a) -> [(Interval k, a)] -> IntervalMap k a

    data-interval Data.IntervalMap.Lazy

    Build a map from a list of key/value pairs with a combining function.

  8. fromListWith :: Ord k => (a -> a -> a) -> [(Interval k, a)] -> IntervalMap k a

    data-interval Data.IntervalMap.Strict

    Build a map from a list of key/value pairs with a combining function.

  9. fromListWithKey :: GCompare k2 => (forall (v :: k1) . () => k2 v -> f v -> f v -> f v) -> [DSum k2 f] -> MonoidalDMap k2 f

    dependent-monoidal-map Data.Dependent.Map.Monoidal

    O(n*log n). Build a map from a list of key/value pairs with a combining function. See also fromAscListWithKey.

  10. fromListFL :: Focus -> [a] -> Maybe (FocusList a)

    focuslist Data.FocusList

    Safely create a FocusList from a list.

    >>> fromListFL (Focus 1) ["cat","dog","goat"]
    Just (FocusList (Focus 1) ["cat","dog","goat"])
    
    >>> fromListFL NoFocus []
    Just (FocusList NoFocus [])
    
    If the Focus is out of range for the list, then Nothing will be returned.
    >>> fromListFL (Focus (-1)) ["cat","dog","goat"]
    Nothing
    
    >>> fromListFL (Focus 3) ["cat","dog","goat"]
    Nothing
    
    >>> fromListFL NoFocus ["cat","dog","goat"]
    Nothing
    
    complexity: O(n) where n is the length of the input list.

Page 58 of many | Previous | Next