Hoogle Search

Within LTS Haskell 24.4 (ghc-9.10.2)

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

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

    data-clist Data.CircularList

    Make a (balanced) CList from a list.

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

    data-clist Data.CircularList.Internal

    Make a (balanced) CList from a list.

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

    dense-linear-algebra Statistics.Matrix

    Convert from a row-major list.

  4. 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

  5. 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.

  6. fromList :: forall input (length :: Nat) output . (KnownNat length, ILL input length output) => [output] -> Maybe input

    indexed-list-literals Data.IndexedListLiterals 

    > fromList [1,2,3] :: Maybe (Int, Int, Int)
Just (1,2,3)

    > fromList ["word","up"] :: Maybe (String, String, String)
Nothing

    > fromList ['z'] :: Maybe (Only Char)
Just (Only 'z')

  7. fromList :: [Item (KVITable v)] -> KVITable v

    kvitable Data.KVITable

    Converts a list of ([(Key,Val)], Value) tuples to a KVI table.

  8. fromList :: Ord key => Maybe Integer -> [(key, val)] -> LRU key val

    lrucache Data.Cache.LRU

    Build a new LRU from the given maximum size and list of contents, in order from most recently accessed to least recently accessed.

  9. fromList :: Ord key => Maybe Integer -> [(key, val)] -> IO (AtomicLRU key val)

    lrucache Data.Cache.LRU.IO

    Build a new LRU from the optional maximum size and list of contents. See fromList for the semantics.

  10. fromList :: Ord key => Maybe Integer -> [(key, val)] -> IO (AtomicLRU key val)

    lrucache Data.Cache.LRU.IO.Internal

    Build a new LRU from the optional maximum size and list of contents. See fromList for the semantics.

Page 22 of many | Previous | Next