{-# LANGUAGE DeriveDataTypeable #-}
{-# LANGUAGE DeriveGeneric #-}
{-# LANGUAGE DeriveTraversable #-}
{-# LANGUAGE DerivingVia #-}
{-# LANGUAGE FlexibleInstances #-}
{-# LANGUAGE LambdaCase #-}
{-# LANGUAGE MultiParamTypeClasses #-}
{-# LANGUAGE ScopedTypeVariables #-}
{-# LANGUAGE TypeFamilies #-}

{- |
Module      : Primus.ZipNonEmpty
Description : 'Control.Applicative.ZipList' version for 'NonEmpty'
Copyright   : (c) Grant Weyburne, 2022
License     : BSD-3
-}
module Primus.ZipNonEmpty (
  ZipNonEmpty (..),
  _Zip1,
  unZipNonEmpty,
) where

import Control.Applicative
import Control.DeepSeq
import Data.Coerce
import Data.Data
import qualified Data.Functor.Apply as Apply
import Data.List.NonEmpty (NonEmpty (..))
import qualified Data.List.NonEmpty as N
import Data.Semigroup.Foldable
import Data.Semigroup.Traversable
import qualified GHC.Exts as GE (IsList (..))
import GHC.Generics (Generic, Generic1)
import Primus.Error (normalError)
import Primus.Lens

-- | unwrap 'ZipNonEmpty'
unZipNonEmpty :: ZipNonEmpty a -> NonEmpty a
unZipNonEmpty :: ZipNonEmpty a -> NonEmpty a
unZipNonEmpty = ZipNonEmpty a -> NonEmpty a
coerce

-- | zippable version of 'NonEmpty'
newtype ZipNonEmpty a = ZipNonEmpty (NonEmpty a)
  deriving stock (Typeable (ZipNonEmpty a)
DataType
Constr
Typeable (ZipNonEmpty a)
-> (forall (c :: * -> *).
    (forall d b. Data d => c (d -> b) -> d -> c b)
    -> (forall g. g -> c g) -> ZipNonEmpty a -> c (ZipNonEmpty a))
-> (forall (c :: * -> *).
    (forall b r. Data b => c (b -> r) -> c r)
    -> (forall r. r -> c r) -> Constr -> c (ZipNonEmpty a))
-> (ZipNonEmpty a -> Constr)
-> (ZipNonEmpty a -> DataType)
-> (forall (t :: * -> *) (c :: * -> *).
    Typeable t =>
    (forall d. Data d => c (t d)) -> Maybe (c (ZipNonEmpty a)))
-> (forall (t :: * -> * -> *) (c :: * -> *).
    Typeable t =>
    (forall d e. (Data d, Data e) => c (t d e))
    -> Maybe (c (ZipNonEmpty a)))
-> ((forall b. Data b => b -> b) -> ZipNonEmpty a -> ZipNonEmpty a)
-> (forall r r'.
    (r -> r' -> r)
    -> r -> (forall d. Data d => d -> r') -> ZipNonEmpty a -> r)
-> (forall r r'.
    (r' -> r -> r)
    -> r -> (forall d. Data d => d -> r') -> ZipNonEmpty a -> r)
-> (forall u. (forall d. Data d => d -> u) -> ZipNonEmpty a -> [u])
-> (forall u.
    Int -> (forall d. Data d => d -> u) -> ZipNonEmpty a -> u)
-> (forall (m :: * -> *).
    Monad m =>
    (forall d. Data d => d -> m d)
    -> ZipNonEmpty a -> m (ZipNonEmpty a))
-> (forall (m :: * -> *).
    MonadPlus m =>
    (forall d. Data d => d -> m d)
    -> ZipNonEmpty a -> m (ZipNonEmpty a))
-> (forall (m :: * -> *).
    MonadPlus m =>
    (forall d. Data d => d -> m d)
    -> ZipNonEmpty a -> m (ZipNonEmpty a))
-> Data (ZipNonEmpty a)
ZipNonEmpty a -> DataType
ZipNonEmpty a -> Constr
(forall d. Data d => c (t d)) -> Maybe (c (ZipNonEmpty a))
(forall b. Data b => b -> b) -> ZipNonEmpty a -> ZipNonEmpty a
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> ZipNonEmpty a -> c (ZipNonEmpty a)
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c (ZipNonEmpty a)
forall a. Data a => Typeable (ZipNonEmpty a)
forall a. Data a => ZipNonEmpty a -> DataType
forall a. Data a => ZipNonEmpty a -> Constr
forall a.
Data a =>
(forall b. Data b => b -> b) -> ZipNonEmpty a -> ZipNonEmpty a
forall a u.
Data a =>
Int -> (forall d. Data d => d -> u) -> ZipNonEmpty a -> u
forall a u.
Data a =>
(forall d. Data d => d -> u) -> ZipNonEmpty a -> [u]
forall a r r'.
Data a =>
(r -> r' -> r)
-> r -> (forall d. Data d => d -> r') -> ZipNonEmpty a -> r
forall a r r'.
Data a =>
(r' -> r -> r)
-> r -> (forall d. Data d => d -> r') -> ZipNonEmpty a -> r
forall a (m :: * -> *).
(Data a, Monad m) =>
(forall d. Data d => d -> m d)
-> ZipNonEmpty a -> m (ZipNonEmpty a)
forall a (m :: * -> *).
(Data a, MonadPlus m) =>
(forall d. Data d => d -> m d)
-> ZipNonEmpty a -> m (ZipNonEmpty a)
forall a (c :: * -> *).
Data a =>
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c (ZipNonEmpty a)
forall a (c :: * -> *).
Data a =>
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> ZipNonEmpty a -> c (ZipNonEmpty a)
forall a (t :: * -> *) (c :: * -> *).
(Data a, Typeable t) =>
(forall d. Data d => c (t d)) -> Maybe (c (ZipNonEmpty a))
forall a (t :: * -> * -> *) (c :: * -> *).
(Data a, Typeable t) =>
(forall d e. (Data d, Data e) => c (t d e))
-> Maybe (c (ZipNonEmpty a))
forall a.
Typeable a
-> (forall (c :: * -> *).
    (forall d b. Data d => c (d -> b) -> d -> c b)
    -> (forall g. g -> c g) -> a -> c a)
-> (forall (c :: * -> *).
    (forall b r. Data b => c (b -> r) -> c r)
    -> (forall r. r -> c r) -> Constr -> c a)
-> (a -> Constr)
-> (a -> DataType)
-> (forall (t :: * -> *) (c :: * -> *).
    Typeable t =>
    (forall d. Data d => c (t d)) -> Maybe (c a))
-> (forall (t :: * -> * -> *) (c :: * -> *).
    Typeable t =>
    (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c a))
-> ((forall b. Data b => b -> b) -> a -> a)
-> (forall r r'.
    (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> a -> r)
-> (forall r r'.
    (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> a -> r)
-> (forall u. (forall d. Data d => d -> u) -> a -> [u])
-> (forall u. Int -> (forall d. Data d => d -> u) -> a -> u)
-> (forall (m :: * -> *).
    Monad m =>
    (forall d. Data d => d -> m d) -> a -> m a)
-> (forall (m :: * -> *).
    MonadPlus m =>
    (forall d. Data d => d -> m d) -> a -> m a)
-> (forall (m :: * -> *).
    MonadPlus m =>
    (forall d. Data d => d -> m d) -> a -> m a)
-> Data a
forall u. Int -> (forall d. Data d => d -> u) -> ZipNonEmpty a -> u
forall u. (forall d. Data d => d -> u) -> ZipNonEmpty a -> [u]
forall r r'.
(r -> r' -> r)
-> r -> (forall d. Data d => d -> r') -> ZipNonEmpty a -> r
forall r r'.
(r' -> r -> r)
-> r -> (forall d. Data d => d -> r') -> ZipNonEmpty a -> r
forall (m :: * -> *).
Monad m =>
(forall d. Data d => d -> m d)
-> ZipNonEmpty a -> m (ZipNonEmpty a)
forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d)
-> ZipNonEmpty a -> m (ZipNonEmpty a)
forall (c :: * -> *).
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c (ZipNonEmpty a)
forall (c :: * -> *).
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> ZipNonEmpty a -> c (ZipNonEmpty a)
forall (t :: * -> *) (c :: * -> *).
Typeable t =>
(forall d. Data d => c (t d)) -> Maybe (c (ZipNonEmpty a))
forall (t :: * -> * -> *) (c :: * -> *).
Typeable t =>
(forall d e. (Data d, Data e) => c (t d e))
-> Maybe (c (ZipNonEmpty a))
$cZipNonEmpty :: Constr
$tZipNonEmpty :: DataType
gmapMo :: (forall d. Data d => d -> m d)
-> ZipNonEmpty a -> m (ZipNonEmpty a)
$cgmapMo :: forall a (m :: * -> *).
(Data a, MonadPlus m) =>
(forall d. Data d => d -> m d)
-> ZipNonEmpty a -> m (ZipNonEmpty a)
gmapMp :: (forall d. Data d => d -> m d)
-> ZipNonEmpty a -> m (ZipNonEmpty a)
$cgmapMp :: forall a (m :: * -> *).
(Data a, MonadPlus m) =>
(forall d. Data d => d -> m d)
-> ZipNonEmpty a -> m (ZipNonEmpty a)
gmapM :: (forall d. Data d => d -> m d)
-> ZipNonEmpty a -> m (ZipNonEmpty a)
$cgmapM :: forall a (m :: * -> *).
(Data a, Monad m) =>
(forall d. Data d => d -> m d)
-> ZipNonEmpty a -> m (ZipNonEmpty a)
gmapQi :: Int -> (forall d. Data d => d -> u) -> ZipNonEmpty a -> u
$cgmapQi :: forall a u.
Data a =>
Int -> (forall d. Data d => d -> u) -> ZipNonEmpty a -> u
gmapQ :: (forall d. Data d => d -> u) -> ZipNonEmpty a -> [u]
$cgmapQ :: forall a u.
Data a =>
(forall d. Data d => d -> u) -> ZipNonEmpty a -> [u]
gmapQr :: (r' -> r -> r)
-> r -> (forall d. Data d => d -> r') -> ZipNonEmpty a -> r
$cgmapQr :: forall a r r'.
Data a =>
(r' -> r -> r)
-> r -> (forall d. Data d => d -> r') -> ZipNonEmpty a -> r
gmapQl :: (r -> r' -> r)
-> r -> (forall d. Data d => d -> r') -> ZipNonEmpty a -> r
$cgmapQl :: forall a r r'.
Data a =>
(r -> r' -> r)
-> r -> (forall d. Data d => d -> r') -> ZipNonEmpty a -> r
gmapT :: (forall b. Data b => b -> b) -> ZipNonEmpty a -> ZipNonEmpty a
$cgmapT :: forall a.
Data a =>
(forall b. Data b => b -> b) -> ZipNonEmpty a -> ZipNonEmpty a
dataCast2 :: (forall d e. (Data d, Data e) => c (t d e))
-> Maybe (c (ZipNonEmpty a))
$cdataCast2 :: forall a (t :: * -> * -> *) (c :: * -> *).
(Data a, Typeable t) =>
(forall d e. (Data d, Data e) => c (t d e))
-> Maybe (c (ZipNonEmpty a))
dataCast1 :: (forall d. Data d => c (t d)) -> Maybe (c (ZipNonEmpty a))
$cdataCast1 :: forall a (t :: * -> *) (c :: * -> *).
(Data a, Typeable t) =>
(forall d. Data d => c (t d)) -> Maybe (c (ZipNonEmpty a))
dataTypeOf :: ZipNonEmpty a -> DataType
$cdataTypeOf :: forall a. Data a => ZipNonEmpty a -> DataType
toConstr :: ZipNonEmpty a -> Constr
$ctoConstr :: forall a. Data a => ZipNonEmpty a -> Constr
gunfold :: (forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c (ZipNonEmpty a)
$cgunfold :: forall a (c :: * -> *).
Data a =>
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c (ZipNonEmpty a)
gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> ZipNonEmpty a -> c (ZipNonEmpty a)
$cgfoldl :: forall a (c :: * -> *).
Data a =>
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> ZipNonEmpty a -> c (ZipNonEmpty a)
$cp1Data :: forall a. Data a => Typeable (ZipNonEmpty a)
Data, (forall x. ZipNonEmpty a -> Rep (ZipNonEmpty a) x)
-> (forall x. Rep (ZipNonEmpty a) x -> ZipNonEmpty a)
-> Generic (ZipNonEmpty a)
forall x. Rep (ZipNonEmpty a) x -> ZipNonEmpty a
forall x. ZipNonEmpty a -> Rep (ZipNonEmpty a) x
forall a.
(forall x. a -> Rep a x) -> (forall x. Rep a x -> a) -> Generic a
forall a x. Rep (ZipNonEmpty a) x -> ZipNonEmpty a
forall a x. ZipNonEmpty a -> Rep (ZipNonEmpty a) x
$cto :: forall a x. Rep (ZipNonEmpty a) x -> ZipNonEmpty a
$cfrom :: forall a x. ZipNonEmpty a -> Rep (ZipNonEmpty a) x
Generic, (forall a. ZipNonEmpty a -> Rep1 ZipNonEmpty a)
-> (forall a. Rep1 ZipNonEmpty a -> ZipNonEmpty a)
-> Generic1 ZipNonEmpty
forall a. Rep1 ZipNonEmpty a -> ZipNonEmpty a
forall a. ZipNonEmpty a -> Rep1 ZipNonEmpty a
forall k (f :: k -> *).
(forall (a :: k). f a -> Rep1 f a)
-> (forall (a :: k). Rep1 f a -> f a) -> Generic1 f
$cto1 :: forall a. Rep1 ZipNonEmpty a -> ZipNonEmpty a
$cfrom1 :: forall a. ZipNonEmpty a -> Rep1 ZipNonEmpty a
Generic1, Int -> ZipNonEmpty a -> ShowS
[ZipNonEmpty a] -> ShowS
ZipNonEmpty a -> String
(Int -> ZipNonEmpty a -> ShowS)
-> (ZipNonEmpty a -> String)
-> ([ZipNonEmpty a] -> ShowS)
-> Show (ZipNonEmpty a)
forall a. Show a => Int -> ZipNonEmpty a -> ShowS
forall a. Show a => [ZipNonEmpty a] -> ShowS
forall a. Show a => ZipNonEmpty a -> String
forall a.
(Int -> a -> ShowS) -> (a -> String) -> ([a] -> ShowS) -> Show a
showList :: [ZipNonEmpty a] -> ShowS
$cshowList :: forall a. Show a => [ZipNonEmpty a] -> ShowS
show :: ZipNonEmpty a -> String
$cshow :: forall a. Show a => ZipNonEmpty a -> String
showsPrec :: Int -> ZipNonEmpty a -> ShowS
$cshowsPrec :: forall a. Show a => Int -> ZipNonEmpty a -> ShowS
Show, ZipNonEmpty a -> ZipNonEmpty a -> Bool
(ZipNonEmpty a -> ZipNonEmpty a -> Bool)
-> (ZipNonEmpty a -> ZipNonEmpty a -> Bool) -> Eq (ZipNonEmpty a)
forall a. Eq a => ZipNonEmpty a -> ZipNonEmpty a -> Bool
forall a. (a -> a -> Bool) -> (a -> a -> Bool) -> Eq a
/= :: ZipNonEmpty a -> ZipNonEmpty a -> Bool
$c/= :: forall a. Eq a => ZipNonEmpty a -> ZipNonEmpty a -> Bool
== :: ZipNonEmpty a -> ZipNonEmpty a -> Bool
$c== :: forall a. Eq a => ZipNonEmpty a -> ZipNonEmpty a -> Bool
Eq, Eq (ZipNonEmpty a)
Eq (ZipNonEmpty a)
-> (ZipNonEmpty a -> ZipNonEmpty a -> Ordering)
-> (ZipNonEmpty a -> ZipNonEmpty a -> Bool)
-> (ZipNonEmpty a -> ZipNonEmpty a -> Bool)
-> (ZipNonEmpty a -> ZipNonEmpty a -> Bool)
-> (ZipNonEmpty a -> ZipNonEmpty a -> Bool)
-> (ZipNonEmpty a -> ZipNonEmpty a -> ZipNonEmpty a)
-> (ZipNonEmpty a -> ZipNonEmpty a -> ZipNonEmpty a)
-> Ord (ZipNonEmpty a)
ZipNonEmpty a -> ZipNonEmpty a -> Bool
ZipNonEmpty a -> ZipNonEmpty a -> Ordering
ZipNonEmpty a -> ZipNonEmpty a -> ZipNonEmpty a
forall a.
Eq a
-> (a -> a -> Ordering)
-> (a -> a -> Bool)
-> (a -> a -> Bool)
-> (a -> a -> Bool)
-> (a -> a -> Bool)
-> (a -> a -> a)
-> (a -> a -> a)
-> Ord a
forall a. Ord a => Eq (ZipNonEmpty a)
forall a. Ord a => ZipNonEmpty a -> ZipNonEmpty a -> Bool
forall a. Ord a => ZipNonEmpty a -> ZipNonEmpty a -> Ordering
forall a. Ord a => ZipNonEmpty a -> ZipNonEmpty a -> ZipNonEmpty a
min :: ZipNonEmpty a -> ZipNonEmpty a -> ZipNonEmpty a
$cmin :: forall a. Ord a => ZipNonEmpty a -> ZipNonEmpty a -> ZipNonEmpty a
max :: ZipNonEmpty a -> ZipNonEmpty a -> ZipNonEmpty a
$cmax :: forall a. Ord a => ZipNonEmpty a -> ZipNonEmpty a -> ZipNonEmpty a
>= :: ZipNonEmpty a -> ZipNonEmpty a -> Bool
$c>= :: forall a. Ord a => ZipNonEmpty a -> ZipNonEmpty a -> Bool
> :: ZipNonEmpty a -> ZipNonEmpty a -> Bool
$c> :: forall a. Ord a => ZipNonEmpty a -> ZipNonEmpty a -> Bool
<= :: ZipNonEmpty a -> ZipNonEmpty a -> Bool
$c<= :: forall a. Ord a => ZipNonEmpty a -> ZipNonEmpty a -> Bool
< :: ZipNonEmpty a -> ZipNonEmpty a -> Bool
$c< :: forall a. Ord a => ZipNonEmpty a -> ZipNonEmpty a -> Bool
compare :: ZipNonEmpty a -> ZipNonEmpty a -> Ordering
$ccompare :: forall a. Ord a => ZipNonEmpty a -> ZipNonEmpty a -> Ordering
$cp1Ord :: forall a. Ord a => Eq (ZipNonEmpty a)
Ord, Functor ZipNonEmpty
Foldable ZipNonEmpty
Functor ZipNonEmpty
-> Foldable ZipNonEmpty
-> (forall (f :: * -> *) a b.
    Applicative f =>
    (a -> f b) -> ZipNonEmpty a -> f (ZipNonEmpty b))
-> (forall (f :: * -> *) a.
    Applicative f =>
    ZipNonEmpty (f a) -> f (ZipNonEmpty a))
-> (forall (m :: * -> *) a b.
    Monad m =>
    (a -> m b) -> ZipNonEmpty a -> m (ZipNonEmpty b))
-> (forall (m :: * -> *) a.
    Monad m =>
    ZipNonEmpty (m a) -> m (ZipNonEmpty a))
-> Traversable ZipNonEmpty
(a -> f b) -> ZipNonEmpty a -> f (ZipNonEmpty b)
forall (t :: * -> *).
Functor t
-> Foldable t
-> (forall (f :: * -> *) a b.
    Applicative f =>
    (a -> f b) -> t a -> f (t b))
-> (forall (f :: * -> *) a. Applicative f => t (f a) -> f (t a))
-> (forall (m :: * -> *) a b.
    Monad m =>
    (a -> m b) -> t a -> m (t b))
-> (forall (m :: * -> *) a. Monad m => t (m a) -> m (t a))
-> Traversable t
forall (m :: * -> *) a.
Monad m =>
ZipNonEmpty (m a) -> m (ZipNonEmpty a)
forall (f :: * -> *) a.
Applicative f =>
ZipNonEmpty (f a) -> f (ZipNonEmpty a)
forall (m :: * -> *) a b.
Monad m =>
(a -> m b) -> ZipNonEmpty a -> m (ZipNonEmpty b)
forall (f :: * -> *) a b.
Applicative f =>
(a -> f b) -> ZipNonEmpty a -> f (ZipNonEmpty b)
sequence :: ZipNonEmpty (m a) -> m (ZipNonEmpty a)
$csequence :: forall (m :: * -> *) a.
Monad m =>
ZipNonEmpty (m a) -> m (ZipNonEmpty a)
mapM :: (a -> m b) -> ZipNonEmpty a -> m (ZipNonEmpty b)
$cmapM :: forall (m :: * -> *) a b.
Monad m =>
(a -> m b) -> ZipNonEmpty a -> m (ZipNonEmpty b)
sequenceA :: ZipNonEmpty (f a) -> f (ZipNonEmpty a)
$csequenceA :: forall (f :: * -> *) a.
Applicative f =>
ZipNonEmpty (f a) -> f (ZipNonEmpty a)
traverse :: (a -> f b) -> ZipNonEmpty a -> f (ZipNonEmpty b)
$ctraverse :: forall (f :: * -> *) a b.
Applicative f =>
(a -> f b) -> ZipNonEmpty a -> f (ZipNonEmpty b)
$cp2Traversable :: Foldable ZipNonEmpty
$cp1Traversable :: Functor ZipNonEmpty
Traversable, ReadPrec [ZipNonEmpty a]
ReadPrec (ZipNonEmpty a)
Int -> ReadS (ZipNonEmpty a)
ReadS [ZipNonEmpty a]
(Int -> ReadS (ZipNonEmpty a))
-> ReadS [ZipNonEmpty a]
-> ReadPrec (ZipNonEmpty a)
-> ReadPrec [ZipNonEmpty a]
-> Read (ZipNonEmpty a)
forall a. Read a => ReadPrec [ZipNonEmpty a]
forall a. Read a => ReadPrec (ZipNonEmpty a)
forall a. Read a => Int -> ReadS (ZipNonEmpty a)
forall a. Read a => ReadS [ZipNonEmpty a]
forall a.
(Int -> ReadS a)
-> ReadS [a] -> ReadPrec a -> ReadPrec [a] -> Read a
readListPrec :: ReadPrec [ZipNonEmpty a]
$creadListPrec :: forall a. Read a => ReadPrec [ZipNonEmpty a]
readPrec :: ReadPrec (ZipNonEmpty a)
$creadPrec :: forall a. Read a => ReadPrec (ZipNonEmpty a)
readList :: ReadS [ZipNonEmpty a]
$creadList :: forall a. Read a => ReadS [ZipNonEmpty a]
readsPrec :: Int -> ReadS (ZipNonEmpty a)
$creadsPrec :: forall a. Read a => Int -> ReadS (ZipNonEmpty a)
Read)
  deriving (ZipNonEmpty a -> ()
(ZipNonEmpty a -> ()) -> NFData (ZipNonEmpty a)
forall a. NFData a => ZipNonEmpty a -> ()
forall a. (a -> ()) -> NFData a
rnf :: ZipNonEmpty a -> ()
$crnf :: forall a. NFData a => ZipNonEmpty a -> ()
NFData) via (NonEmpty a)
  deriving ((a -> ()) -> ZipNonEmpty a -> ()
(forall a. (a -> ()) -> ZipNonEmpty a -> ()) -> NFData1 ZipNonEmpty
forall a. (a -> ()) -> ZipNonEmpty a -> ()
forall (f :: * -> *).
(forall a. (a -> ()) -> f a -> ()) -> NFData1 f
liftRnf :: (a -> ()) -> ZipNonEmpty a -> ()
$cliftRnf :: forall a. (a -> ()) -> ZipNonEmpty a -> ()
NFData1, a -> ZipNonEmpty a -> Bool
ZipNonEmpty m -> m
ZipNonEmpty a -> [a]
ZipNonEmpty a -> Bool
ZipNonEmpty a -> Int
ZipNonEmpty a -> a
ZipNonEmpty a -> a
ZipNonEmpty a -> a
ZipNonEmpty a -> a
(a -> m) -> ZipNonEmpty a -> m
(a -> m) -> ZipNonEmpty a -> m
(a -> b -> b) -> b -> ZipNonEmpty a -> b
(a -> b -> b) -> b -> ZipNonEmpty a -> b
(b -> a -> b) -> b -> ZipNonEmpty a -> b
(b -> a -> b) -> b -> ZipNonEmpty a -> b
(a -> a -> a) -> ZipNonEmpty a -> a
(a -> a -> a) -> ZipNonEmpty a -> a
(forall m. Monoid m => ZipNonEmpty m -> m)
-> (forall m a. Monoid m => (a -> m) -> ZipNonEmpty a -> m)
-> (forall m a. Monoid m => (a -> m) -> ZipNonEmpty a -> m)
-> (forall a b. (a -> b -> b) -> b -> ZipNonEmpty a -> b)
-> (forall a b. (a -> b -> b) -> b -> ZipNonEmpty a -> b)
-> (forall b a. (b -> a -> b) -> b -> ZipNonEmpty a -> b)
-> (forall b a. (b -> a -> b) -> b -> ZipNonEmpty a -> b)
-> (forall a. (a -> a -> a) -> ZipNonEmpty a -> a)
-> (forall a. (a -> a -> a) -> ZipNonEmpty a -> a)
-> (forall a. ZipNonEmpty a -> [a])
-> (forall a. ZipNonEmpty a -> Bool)
-> (forall a. ZipNonEmpty a -> Int)
-> (forall a. Eq a => a -> ZipNonEmpty a -> Bool)
-> (forall a. Ord a => ZipNonEmpty a -> a)
-> (forall a. Ord a => ZipNonEmpty a -> a)
-> (forall a. Num a => ZipNonEmpty a -> a)
-> (forall a. Num a => ZipNonEmpty a -> a)
-> Foldable ZipNonEmpty
forall a. Eq a => a -> ZipNonEmpty a -> Bool
forall a. Num a => ZipNonEmpty a -> a
forall a. Ord a => ZipNonEmpty a -> a
forall m. Monoid m => ZipNonEmpty m -> m
forall a. ZipNonEmpty a -> Bool
forall a. ZipNonEmpty a -> Int
forall a. ZipNonEmpty a -> [a]
forall a. (a -> a -> a) -> ZipNonEmpty a -> a
forall m a. Monoid m => (a -> m) -> ZipNonEmpty a -> m
forall b a. (b -> a -> b) -> b -> ZipNonEmpty a -> b
forall a b. (a -> b -> b) -> b -> ZipNonEmpty a -> b
forall (t :: * -> *).
(forall m. Monoid m => t m -> m)
-> (forall m a. Monoid m => (a -> m) -> t a -> m)
-> (forall m a. Monoid m => (a -> m) -> t a -> m)
-> (forall a b. (a -> b -> b) -> b -> t a -> b)
-> (forall a b. (a -> b -> b) -> b -> t a -> b)
-> (forall b a. (b -> a -> b) -> b -> t a -> b)
-> (forall b a. (b -> a -> b) -> b -> t a -> b)
-> (forall a. (a -> a -> a) -> t a -> a)
-> (forall a. (a -> a -> a) -> t a -> a)
-> (forall a. t a -> [a])
-> (forall a. t a -> Bool)
-> (forall a. t a -> Int)
-> (forall a. Eq a => a -> t a -> Bool)
-> (forall a. Ord a => t a -> a)
-> (forall a. Ord a => t a -> a)
-> (forall a. Num a => t a -> a)
-> (forall a. Num a => t a -> a)
-> Foldable t
product :: ZipNonEmpty a -> a
$cproduct :: forall a. Num a => ZipNonEmpty a -> a
sum :: ZipNonEmpty a -> a
$csum :: forall a. Num a => ZipNonEmpty a -> a
minimum :: ZipNonEmpty a -> a
$cminimum :: forall a. Ord a => ZipNonEmpty a -> a
maximum :: ZipNonEmpty a -> a
$cmaximum :: forall a. Ord a => ZipNonEmpty a -> a
elem :: a -> ZipNonEmpty a -> Bool
$celem :: forall a. Eq a => a -> ZipNonEmpty a -> Bool
length :: ZipNonEmpty a -> Int
$clength :: forall a. ZipNonEmpty a -> Int
null :: ZipNonEmpty a -> Bool
$cnull :: forall a. ZipNonEmpty a -> Bool
toList :: ZipNonEmpty a -> [a]
$ctoList :: forall a. ZipNonEmpty a -> [a]
foldl1 :: (a -> a -> a) -> ZipNonEmpty a -> a
$cfoldl1 :: forall a. (a -> a -> a) -> ZipNonEmpty a -> a
foldr1 :: (a -> a -> a) -> ZipNonEmpty a -> a
$cfoldr1 :: forall a. (a -> a -> a) -> ZipNonEmpty a -> a
foldl' :: (b -> a -> b) -> b -> ZipNonEmpty a -> b
$cfoldl' :: forall b a. (b -> a -> b) -> b -> ZipNonEmpty a -> b
foldl :: (b -> a -> b) -> b -> ZipNonEmpty a -> b
$cfoldl :: forall b a. (b -> a -> b) -> b -> ZipNonEmpty a -> b
foldr' :: (a -> b -> b) -> b -> ZipNonEmpty a -> b
$cfoldr' :: forall a b. (a -> b -> b) -> b -> ZipNonEmpty a -> b
foldr :: (a -> b -> b) -> b -> ZipNonEmpty a -> b
$cfoldr :: forall a b. (a -> b -> b) -> b -> ZipNonEmpty a -> b
foldMap' :: (a -> m) -> ZipNonEmpty a -> m
$cfoldMap' :: forall m a. Monoid m => (a -> m) -> ZipNonEmpty a -> m
foldMap :: (a -> m) -> ZipNonEmpty a -> m
$cfoldMap :: forall m a. Monoid m => (a -> m) -> ZipNonEmpty a -> m
fold :: ZipNonEmpty m -> m
$cfold :: forall m. Monoid m => ZipNonEmpty m -> m
Foldable, Foldable ZipNonEmpty
Foldable ZipNonEmpty
-> (forall m. Semigroup m => ZipNonEmpty m -> m)
-> (forall m a. Semigroup m => (a -> m) -> ZipNonEmpty a -> m)
-> (forall a. ZipNonEmpty a -> NonEmpty a)
-> Foldable1 ZipNonEmpty
ZipNonEmpty m -> m
ZipNonEmpty a -> NonEmpty a
(a -> m) -> ZipNonEmpty a -> m
forall m. Semigroup m => ZipNonEmpty m -> m
forall a. ZipNonEmpty a -> NonEmpty a
forall m a. Semigroup m => (a -> m) -> ZipNonEmpty a -> m
forall (t :: * -> *).
Foldable t
-> (forall m. Semigroup m => t m -> m)
-> (forall m a. Semigroup m => (a -> m) -> t a -> m)
-> (forall a. t a -> NonEmpty a)
-> Foldable1 t
toNonEmpty :: ZipNonEmpty a -> NonEmpty a
$ctoNonEmpty :: forall a. ZipNonEmpty a -> NonEmpty a
foldMap1 :: (a -> m) -> ZipNonEmpty a -> m
$cfoldMap1 :: forall m a. Semigroup m => (a -> m) -> ZipNonEmpty a -> m
fold1 :: ZipNonEmpty m -> m
$cfold1 :: forall m. Semigroup m => ZipNonEmpty m -> m
$cp1Foldable1 :: Foldable ZipNonEmpty
Foldable1, a -> ZipNonEmpty b -> ZipNonEmpty a
(a -> b) -> ZipNonEmpty a -> ZipNonEmpty b
(forall a b. (a -> b) -> ZipNonEmpty a -> ZipNonEmpty b)
-> (forall a b. a -> ZipNonEmpty b -> ZipNonEmpty a)
-> Functor ZipNonEmpty
forall a b. a -> ZipNonEmpty b -> ZipNonEmpty a
forall a b. (a -> b) -> ZipNonEmpty a -> ZipNonEmpty b
forall (f :: * -> *).
(forall a b. (a -> b) -> f a -> f b)
-> (forall a b. a -> f b -> f a) -> Functor f
<$ :: a -> ZipNonEmpty b -> ZipNonEmpty a
$c<$ :: forall a b. a -> ZipNonEmpty b -> ZipNonEmpty a
fmap :: (a -> b) -> ZipNonEmpty a -> ZipNonEmpty b
$cfmap :: forall a b. (a -> b) -> ZipNonEmpty a -> ZipNonEmpty b
Functor) via NonEmpty

-- checkers hangs
instance Monoid a => Monoid (ZipNonEmpty a) where
  mempty :: ZipNonEmpty a
mempty = a -> ZipNonEmpty a
forall (f :: * -> *) a. Applicative f => a -> f a
pure a
forall a. Monoid a => a
mempty

instance Semigroup a => Semigroup (ZipNonEmpty a) where
  <> :: ZipNonEmpty a -> ZipNonEmpty a -> ZipNonEmpty a
(<>) = (a -> a -> a) -> ZipNonEmpty a -> ZipNonEmpty a -> ZipNonEmpty a
forall (f :: * -> *) a b c.
Applicative f =>
(a -> b -> c) -> f a -> f b -> f c
liftA2 a -> a -> a
forall a. Semigroup a => a -> a -> a
(<>)

instance Applicative ZipNonEmpty where
  pure :: a -> ZipNonEmpty a
pure = NonEmpty a -> ZipNonEmpty a
forall a. NonEmpty a -> ZipNonEmpty a
ZipNonEmpty (NonEmpty a -> ZipNonEmpty a)
-> (a -> NonEmpty a) -> a -> ZipNonEmpty a
forall b c a. (b -> c) -> (a -> b) -> a -> c
. a -> NonEmpty a
forall a. a -> NonEmpty a
N.repeat
  liftA2 :: (a -> b -> c) -> ZipNonEmpty a -> ZipNonEmpty b -> ZipNonEmpty c
liftA2 a -> b -> c
f (ZipNonEmpty NonEmpty a
xs) (ZipNonEmpty NonEmpty b
ys) = NonEmpty c -> ZipNonEmpty c
forall a. NonEmpty a -> ZipNonEmpty a
ZipNonEmpty ((a -> b -> c) -> NonEmpty a -> NonEmpty b -> NonEmpty c
forall a b c.
(a -> b -> c) -> NonEmpty a -> NonEmpty b -> NonEmpty c
N.zipWith a -> b -> c
f NonEmpty a
xs NonEmpty b
ys)

instance Apply.Apply ZipNonEmpty where
  <.> :: ZipNonEmpty (a -> b) -> ZipNonEmpty a -> ZipNonEmpty b
(<.>) = ZipNonEmpty (a -> b) -> ZipNonEmpty a -> ZipNonEmpty b
forall (f :: * -> *) a b. Applicative f => f (a -> b) -> f a -> f b
(<*>)

instance Traversable1 ZipNonEmpty where
  traverse1 :: (a -> f b) -> ZipNonEmpty a -> f (ZipNonEmpty b)
traverse1 a -> f b
afb = (NonEmpty b -> ZipNonEmpty b)
-> f (NonEmpty b) -> f (ZipNonEmpty b)
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap NonEmpty b -> ZipNonEmpty b
forall a. NonEmpty a -> ZipNonEmpty a
ZipNonEmpty (f (NonEmpty b) -> f (ZipNonEmpty b))
-> (ZipNonEmpty a -> f (NonEmpty b))
-> ZipNonEmpty a
-> f (ZipNonEmpty b)
forall b c a. (b -> c) -> (a -> b) -> a -> c
. (a -> f b) -> NonEmpty a -> f (NonEmpty b)
forall (t :: * -> *) (f :: * -> *) a b.
(Traversable1 t, Apply f) =>
(a -> f b) -> t a -> f (t b)
traverse1 a -> f b
afb (NonEmpty a -> f (NonEmpty b))
-> (ZipNonEmpty a -> NonEmpty a) -> ZipNonEmpty a -> f (NonEmpty b)
forall b c a. (b -> c) -> (a -> b) -> a -> c
. ZipNonEmpty a -> NonEmpty a
forall a. ZipNonEmpty a -> NonEmpty a
unZipNonEmpty

instance GE.IsList (ZipNonEmpty a) where
  type Item (ZipNonEmpty a) = a
  fromList :: [Item (ZipNonEmpty a)] -> ZipNonEmpty a
fromList =
    \case
      [] -> String -> ZipNonEmpty a
forall a. HasCallStack => String -> a
normalError String
"IsList: fromList: need at least one element"
      Item (ZipNonEmpty a)
x : [Item (ZipNonEmpty a)]
xs -> NonEmpty a -> ZipNonEmpty a
forall a. NonEmpty a -> ZipNonEmpty a
ZipNonEmpty (a
Item (ZipNonEmpty a)
x a -> [a] -> NonEmpty a
forall a. a -> [a] -> NonEmpty a
:| [a]
[Item (ZipNonEmpty a)]
xs)
  toList :: ZipNonEmpty a -> [Item (ZipNonEmpty a)]
toList = NonEmpty a -> [a]
forall a. NonEmpty a -> [a]
N.toList (NonEmpty a -> [a])
-> (ZipNonEmpty a -> NonEmpty a) -> ZipNonEmpty a -> [a]
forall b c a. (b -> c) -> (a -> b) -> a -> c
. ZipNonEmpty a -> NonEmpty a
coerce

-- | iso for the zipnonempty constructor
_Zip1 :: Iso (ZipNonEmpty a) (ZipNonEmpty b) (NonEmpty a) (NonEmpty b)
_Zip1 :: p (NonEmpty a) (f (NonEmpty b))
-> p (ZipNonEmpty a) (f (ZipNonEmpty b))
_Zip1 = (ZipNonEmpty a -> NonEmpty a)
-> (NonEmpty b -> ZipNonEmpty b)
-> Iso (ZipNonEmpty a) (ZipNonEmpty b) (NonEmpty a) (NonEmpty b)
forall s a b t. (s -> a) -> (b -> t) -> Iso s t a b
iso ZipNonEmpty a -> NonEmpty a
coerce NonEmpty b -> ZipNonEmpty b
coerce