Hoogle Search

Within LTS Haskell 24.49 (ghc-9.10.3)

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

Exact lookup

1. telFromList' :: (a -> ArgName) -> ListTel' a -> Telescope

   Agda	Agda.Syntax.Internal

   No documentation available.

2. importedNameMapFromList :: (Ord n1, Ord m1) => [ImportedName' (n1, n2) (m1, m2)] -> ImportedNameMap n1 n2 m1 m2

   Agda	Agda.Syntax.Scope.Monad

   Create a ImportedNameMap.

3. primStringFromListInjective :: TCM PrimitiveImpl

   Agda	Agda.TypeChecking.Primitive

   No documentation available.

4. graphFromList :: Ord n => [Edge n e] -> Graph n e

   Agda	Agda.TypeChecking.SizedTypes.WarshallSolver

   No documentation available.

5. profileOptionsFromList :: [ProfileOption] -> ProfileOptions

   Agda	Agda.Utils.ProfileOptions

   Use only for serialization.

6. coinMapFromList :: Ord a => [CoinMapEntry a] -> CoinMap a

   cardano-coin-selection	Cardano.CoinSelection

   Constructs a CoinMap from a list of entries. See CoinMapEntry.

7. autoFromList :: Storable a => [a] -> Vector (ZeroBased Int) a

   comfort-blas	Numeric.BLAS.Vector

   No documentation available.

8. unsafeFindCycleFromList :: CycleFinder a -> [a] -> (Int, Int, ([a], [a]))

   data-findcycle	Data.FindCycle

   Runs the CycleFinder for a given input list. This function is provided as a convenience for when you already have a list of values you'd like to find a cycle in. It's referred to as "unsafe", because it might lead to surprising results when the input doesn't satisfy the invariants that different algorithms assume. All algorithms assume that the sequence they're searching can be constructed by repeated function application from a starting value. Many sequences can't be, such as [1,2,1,3,1,4,1,5,...] (because there can only be one unique successor of 1). Algorithms also assume the input sequence to be infinite, and they will commonly consume more than <math> (or <math>) elements from it. If you provide a finite input list, cycles might not be identified correctly if the chosen algorithm runs into the end of it, even though the input does technically contain an identifiable cycle. If an assumption is violated, algorithms might wrongly identify cycles or never terminate. Try to stick to findCycle, findCycleExtract, cycleExp, or cycleExp' if possible, or only pass infinite lists generated via iterate f x (or equivalent) to unsafeFindCycleFromList. Similar to findCycleExtract, just don't evaluate the last part of the return value if you don't need it and want to avoid the cost of computing it.

9. deltaSetFromList :: Ord a => [DeltaSet1 a] -> DeltaSet a

   delta-types	Data.Delta.Set

   Collect insertions or deletions of elements into a DeltaSet. To save space, combinations of Insert and Delete for the same element are simplified when possible. These simplifications always preserve the property

   apply (deltaSetFromList ds) = apply ds
   

10. unsafeFromList :: (Eq a, Hashable a) => [(a, [a])] -> DiGraph a

    digraph	Data.DiGraph

    Unsafely construct a graph from adjacency lists. This function assumes that the input includes a adjacency list of each vertex that appears in a adjacency list of another vertex. Generally, fromList should be preferred.

Page 75 of many | Previous | Next