Hoogle Search
Within LTS Haskell 24.50 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
setFirst :: forall x y c . Additive c => c -> BackpropFunc (c, x) y -> BackpropFunc x yinf-backprop Prelude.InfBackprop Transforms a 2-argument differentiable function into a single argument function by fixing its first argument.
>>> import Prelude (Float) >>> import InfBackprop (call, derivative) >>> call (setFirst 8 (/)) 4 :: Float 2.0
>>> import Debug.SimpleExpr.Expr (variable) >>> x = variable "x" >>> y = variable "y" >>> derivative (setFirst x (*)) y 1·x
getFirstChild :: (MonadDOM m, IsNode self) => self -> m (Maybe Node)jsaddle-dom JSDOM.Generated.Node getFirstChildUnchecked :: (MonadDOM m, IsNode self) => self -> m Nodejsaddle-dom JSDOM.Generated.Node getFirstChildUnsafe :: (MonadDOM m, IsNode self, HasCallStack) => self -> m Nodejsaddle-dom JSDOM.Generated.Node getFirstElementChild :: (MonadDOM m, IsParentNode self) => self -> m (Maybe Element)jsaddle-dom JSDOM.Generated.ParentNode getFirstElementChildUnchecked :: (MonadDOM m, IsParentNode self) => self -> m Elementjsaddle-dom JSDOM.Generated.ParentNode getFirstElementChildUnsafe :: (MonadDOM m, IsParentNode self, HasCallStack) => self -> m Elementjsaddle-dom JSDOM.Generated.ParentNode getFirstEmptyRegionIndex :: MonadDOM m => WebKitNamedFlow -> m Intjsaddle-dom JSDOM.Generated.WebKitNamedFlow deleteFirstsBy :: (a -> a -> Bool) -> [a] -> [a] -> [a]listsafe Data.List.Safe The deleteFirstsBy function takes a predicate and two lists and returns the first list with the first occurrence of each element of the second list removed. This is the non-overloaded version of (\\).
(\\) == deleteFirstsBy (==)
The second list must be finite, but the first may be infinite.Examples
>>> deleteFirstsBy (>) [1..10] [3, 4, 5] [4,5,6,7,8,9,10]
>>> deleteFirstsBy (/=) [1..10] [1, 3, 5] [4,5,6,7,8,9,10]
-
lmdb Database.LMDB.Raw No documentation available.