deleteFirstsBy -package:slist

deleteFirstsBy :: (a -> a -> Bool) -> [a] -> [a] -> [a]
base Data.List, ghc-internal GHC.Internal.Data.List GHC.Internal.Data.OldList, xmonad-contrib XMonad.Prelude
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]
deleteFirstsBy :: (a -> a -> Bool) -> [a] -> [a] -> [a]
rio RIO.List, base-prelude BasePrelude
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.
deleteFirstsBy :: ListLike full item => (item -> item -> Bool) -> full -> full -> full
ListLike Data.ListLike Data.ListLike.Base
Generic version of deleteFirsts
deleteFirstsBy :: (a -> a -> Bool) -> [a] -> [a] -> [a]
ihaskell IHaskellPrelude, rebase Rebase.Prelude, LambdaHack Game.LambdaHack.Core.Prelude
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 (\\). The second list must be finite, but the first may be infinite.
deleteFirstsBy :: (a -> a -> Bool) -> [a] -> [a] -> [a]
prelude-compat Data.List2010
deleteFirstsBy :: (a -> b -> Bool) -> Infinite b -> [a] -> Infinite b
infinite-list Data.List.Infinite
Overloaded version of (\\).
type family DeleteFirstsBy (a1 :: a ~> a ~> Bool) (a2 :: [a]) (a3 :: [a]) :: [a]
singletons-base Data.List.Singletons
deleteFirstsByM :: Monad m => (a -> a -> m Bool) -> [a] -> [a] -> m [a]
monadlist Control.Monad.ListM
data DeleteFirstsBySym0 (a1 :: TyFun a ~> a ~> Bool [a] ~> [a] ~> [a])
singletons-base Data.List.Singletons
data DeleteFirstsBySym1 (a6989586621679544763 :: a ~> a ~> Bool) (b :: TyFun [a] [a] ~> [a])
singletons-base Data.List.Singletons
data DeleteFirstsBySym2 (a6989586621679544763 :: a ~> a ~> Bool) (a6989586621679544764 :: [a]) (c :: TyFun [a] [a])
singletons-base Data.List.Singletons
type family DeleteFirstsBySym3 (a6989586621679544763 :: a ~> a ~> Bool) (a6989586621679544764 :: [a]) (a6989586621679544765 :: [a]) :: [a]
singletons-base Data.List.Singletons
sDeleteFirstsBy :: forall a (t1 :: a ~> (a ~> Bool)) (t2 :: [a]) (t3 :: [a]) . Sing t1 -> Sing t2 -> Sing t3 -> Sing (DeleteFirstsBy t1 t2 t3)
singletons-base Data.List.Singletons
mrgDeleteFirstsBy :: (MonadUnion u, Mergeable a) => (a -> a -> SymBool) -> [a] -> [a] -> u [a]
grisette Grisette.Lib.Data.List
Symbolic version of deleteFirstsBy, the result would be merged and propagate the mergeable knowledge. Can generate O(len(lhs)) cases, and O(len(lhs)^2 * len(rhs)) sized constraints, assuming the predicate only generates O(1) constraints.