Hoogle Search
Within LTS Haskell 24.6 (ghc-9.10.2)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
-
data-clist Data.CircularList Make a (balanced) CList from a list.
-
data-clist Data.CircularList.Internal Make a (balanced) CList from a list.
fromList :: Int -> Int -> [Double] -> Matrixdense-linear-algebra Statistics.Matrix Convert from a row-major list.
fromList :: (Graph g, Hashable v, Eq v) => [(v, [(v, e)])] -> g v egraphite Data.Graph.Types Construct a graph from an adjacency list with vertices in type /v and edge attributes in e
fromList :: HeapItem pol item => [item] -> Heap pol itemheap 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.
-
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')
-
intern Data.Interned.IntSet O(n*min(n,W)). Create a set from a list of integers.
fromList :: [Item (KVITable v)] -> KVITable vkvitable Data.KVITable Converts a list of ([(Key,Val)], Value) tuples to a KVI table.
-
liquid-fixpoint Language.Fixpoint.Types.Solutions Create a Solution ---------------------------------------------------------
fromList :: [(Path, a)] -> Trie aliquid-fixpoint Language.Fixpoint.Utils.Trie No documentation available.