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.
autoFromList :: Storable a => [a] -> Vector (ZeroBased Int) acomfort-blas Numeric.BLAS.Vector No documentation available.
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.
deltaSetFromList :: Ord a => [DeltaSet1 a] -> DeltaSet adelta-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
unsafeFromList :: (Eq a, Hashable a) => [(a, [a])] -> DiGraph adigraph 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.
unsafeFromListFL :: Focus -> [a] -> FocusList afocuslist Data.FocusList Unsafely create a FocusList. This does not check that the focus actually exists in the list. This is an internal function and should generally not be used. It is only safe to use if you ALREADY know the Focus is within the list. Instead, you should generally use fromListFL. The following is an example of using unsafeFromListFL correctly.
>>> unsafeFromListFL (Focus 1) [0..2] FocusList (Focus 1) [0,1,2]
>>> unsafeFromListFL NoFocus [] FocusList NoFocus []
unsafeFromListFL can also be used uncorrectly. The following is an example of unsafeFromListFL allowing you to create a FocusList that does not pass invariantFL.>>> unsafeFromListFL (Focus 100) [0..2] FocusList (Focus 100) [0,1,2]
If fromListFL returns a Just FocusList, then unsafeFromListFL should return the same FocusList. complexity: O(n) where n is the length of the input list.accessibleListNewFromList :: (HasCallStack, MonadIO m, IsAccessible a) => [a] -> m AccessibleListgi-gtk4 GI.Gtk.Structs.AccessibleList Allocates a new GtkAccessibleList, doing a shallow copy of the passed list of GtkAccessible instances. Since: 4.14
pMapFromList :: forall (c :: Type -> Type) v . NonEmptyLike c => [(Text, v)] -> PMap c vgreskell Data.Greskell.PMap Make a PMap from list of entries.
headersFromList :: [(ByteString, ByteString)] -> Headershw-kafka-client Kafka.Types No documentation available.
unzipFromListN2 :: (Storable a, Storable b) => Int -> [(a, b)] -> (Vector a, Vector b)hw-prim HaskellWorks.Data.Vector.Storable No documentation available.
jhFromList :: [(String, JExpr)] -> JValjmacro Language.Javascript.JMacro No documentation available.