Size: a a a
ЖК
findA :: forall a f. (Alternative f) => (a -> f Bool) -> [a] -> f (Maybe a)
findA f = fmap asum . h boolToMaybe . g
where
g :: [a] -> [f (a,Bool)]
g = zipWith (liftA2 (,)) . fmap pure <*> fmap f
h :: (Bool -> a -> Maybe a) -> [f (a,Bool)] -> f [Maybe a]
h = traverse . fmap . uncurry . flip
к
findA :: forall a f. (Alternative f) => (a -> f Bool) -> [a] -> f (Maybe a)
findA f = fmap asum . h boolToMaybe . g
where
g :: [a] -> [f (a,Bool)]
g = zipWith (liftA2 (,)) . fmap pure <*> fmap f
h :: (Bool -> a -> Maybe a) -> [f (a,Bool)] -> f [Maybe a]
h = traverse . fmap . uncurry . flip
ЖК
ЗП
findA :: forall a f. (Alternative f) => (a -> f Bool) -> [a] -> f (Maybe a)
findA f = fmap asum . h boolToMaybe . g
where
g :: [a] -> [f (a,Bool)]
g = zipWith (liftA2 (,)) . fmap pure <*> fmap f
h :: (Bool -> a -> Maybe a) -> [f (a,Bool)] -> f [Maybe a]
h = traverse . fmap . uncurry . flip
filterA g >=> safeHead?ЖК
filterA g >=> safeHead?к
filterA g >=> safeHead?ЗП
ЖК
ЗП
ЗП
foldMap via FirstЗП
A
findA :: forall a f. (Alternative f) => (a -> f Bool) -> [a] -> f (Maybe a)
findA f = fmap asum . h boolToMaybe . g
where
g :: [a] -> [f (a,Bool)]
g = zipWith (liftA2 (,)) . fmap pure <*> fmap f
h :: (Bool -> a -> Maybe a) -> [f (a,Bool)] -> f [Maybe a]
h = traverse . fmap . uncurry . flip
findA :: Applicative f => (a -> f Bool) -> [a] -> f (Maybe a)
findA g s = asum <$> traverse g' s where
g' a = (\b -> if b then Just a else Nothing) <$> g a
ЗП
A
filterA g >=> safeHead?ЖК
foldMap via First