Hoogle Search

Within LTS Haskell 24.31 (ghc-9.10.3)

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

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

    clash-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])
[1,2]
    NB: This function is not synthesizable

  2. fromList :: forall a (dom :: Domain) . NFDataX a => [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])
[1,2]
    NB: This function is not synthesizable

  3. fromList :: forall a (dom :: Domain) . NFDataX a => [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])
[1,2]
    NB: This function is not synthesizable

  4. fromList :: forall a (dom :: Domain) . NFDataX a => [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])
[1,2]
    NB: This function is not synthesizable

  5. fromList :: forall (n :: Nat) a . KnownNat n => [a] -> Maybe (Vec n a)

    clash-prelude Clash.Sized.Vector

    Convert a list to a vector. This function returns Nothing if the size of the list is not equal to the size of the resulting vector. 

    >>> Vec.fromList [1,2,3,4,5] :: Maybe (Vec 5 Int)
Just (1 :> 2 :> 3 :> 4 :> 5 :> Nil)

    >>> Vec.fromList [1,2,3,4,5] :: Maybe (Vec 3 Int)
Nothing

    >>> Vec.fromList [1,2,3,4,5] :: Maybe (Vec 10 Int)
Nothing
    • NB: Use listToVecTH if you want to make a statically known vector
    • NB: This function is not synthesizable

  6. fromList :: [a] -> CList a

    data-clist Data.CircularList

    Make a (balanced) CList from a list.

  7. fromList :: [a] -> CList a

    data-clist Data.CircularList.Internal

    Make a (balanced) CList from a list.

  8. fromList :: Int -> Int -> [Double] -> Matrix

    dense-linear-algebra Statistics.Matrix

    Convert from a row-major list.

  9. fromList :: (Graph g, Hashable v, Eq v) => [(v, [(v, e)])] -> g v e

    graphite Data.Graph.Types

    Construct a graph from an adjacency list with vertices in type /v and edge attributes in e

  10. fromList :: HeapItem pol item => [item] -> Heap pol item

    heap Data.Heap

    O(n log n). Build a Heap from the given items. Assuming you have a sorted list, you probably want to use fromDescList or fromAscList, they are faster than this function.

Page 22 of many | Previous | Next