{-# LANGUAGE DeriveTraversable #-}
-----------------------------------------------------------------------------
-- |
-- Module      :  Data.List.TwoOrMore
-- Copyright   :  (C) 2024 Koji Miyazato
-- License     :  BSD-style (see the file LICENSE)
--
-- Maintainer  :  Koji Miyazato <viercc@gmail.com>
-- Stability   :  experimental
module Data.List.TwoOrMore(TwoOrMore(..), twoOrMore, toNonEmpty) where

import Data.Foldable (toList)
import Data.List.NonEmpty (NonEmpty((:|)))
import Data.Semigroup.Foldable (Foldable1(..))

import Data.Functor.Bind
import Data.Functor.Alt (Alt(..))
import Control.Monad.Isolated
import Control.Monad.Ideal (MonadIdeal(..), impureBindDefault, Ideal, runIdeal)


-- | List of two or more elements
data TwoOrMore a = TwoOrMore a a [a]
  deriving (Int -> TwoOrMore a -> ShowS
[TwoOrMore a] -> ShowS
TwoOrMore a -> String
(Int -> TwoOrMore a -> ShowS)
-> (TwoOrMore a -> String)
-> ([TwoOrMore a] -> ShowS)
-> Show (TwoOrMore a)
forall a. Show a => Int -> TwoOrMore a -> ShowS
forall a. Show a => [TwoOrMore a] -> ShowS
forall a. Show a => TwoOrMore a -> String
forall a.
(Int -> a -> ShowS) -> (a -> String) -> ([a] -> ShowS) -> Show a
$cshowsPrec :: forall a. Show a => Int -> TwoOrMore a -> ShowS
showsPrec :: Int -> TwoOrMore a -> ShowS
$cshow :: forall a. Show a => TwoOrMore a -> String
show :: TwoOrMore a -> String
$cshowList :: forall a. Show a => [TwoOrMore a] -> ShowS
showList :: [TwoOrMore a] -> ShowS
Show, ReadPrec [TwoOrMore a]
ReadPrec (TwoOrMore a)
Int -> ReadS (TwoOrMore a)
ReadS [TwoOrMore a]
(Int -> ReadS (TwoOrMore a))
-> ReadS [TwoOrMore a]
-> ReadPrec (TwoOrMore a)
-> ReadPrec [TwoOrMore a]
-> Read (TwoOrMore a)
forall a. Read a => ReadPrec [TwoOrMore a]
forall a. Read a => ReadPrec (TwoOrMore a)
forall a. Read a => Int -> ReadS (TwoOrMore a)
forall a. Read a => ReadS [TwoOrMore a]
forall a.
(Int -> ReadS a)
-> ReadS [a] -> ReadPrec a -> ReadPrec [a] -> Read a
$creadsPrec :: forall a. Read a => Int -> ReadS (TwoOrMore a)
readsPrec :: Int -> ReadS (TwoOrMore a)
$creadList :: forall a. Read a => ReadS [TwoOrMore a]
readList :: ReadS [TwoOrMore a]
$creadPrec :: forall a. Read a => ReadPrec (TwoOrMore a)
readPrec :: ReadPrec (TwoOrMore a)
$creadListPrec :: forall a. Read a => ReadPrec [TwoOrMore a]
readListPrec :: ReadPrec [TwoOrMore a]
Read, TwoOrMore a -> TwoOrMore a -> Bool
(TwoOrMore a -> TwoOrMore a -> Bool)
-> (TwoOrMore a -> TwoOrMore a -> Bool) -> Eq (TwoOrMore a)
forall a. Eq a => TwoOrMore a -> TwoOrMore a -> Bool
forall a. (a -> a -> Bool) -> (a -> a -> Bool) -> Eq a
$c== :: forall a. Eq a => TwoOrMore a -> TwoOrMore a -> Bool
== :: TwoOrMore a -> TwoOrMore a -> Bool
$c/= :: forall a. Eq a => TwoOrMore a -> TwoOrMore a -> Bool
/= :: TwoOrMore a -> TwoOrMore a -> Bool
Eq, Eq (TwoOrMore a)
Eq (TwoOrMore a) =>
(TwoOrMore a -> TwoOrMore a -> Ordering)
-> (TwoOrMore a -> TwoOrMore a -> Bool)
-> (TwoOrMore a -> TwoOrMore a -> Bool)
-> (TwoOrMore a -> TwoOrMore a -> Bool)
-> (TwoOrMore a -> TwoOrMore a -> Bool)
-> (TwoOrMore a -> TwoOrMore a -> TwoOrMore a)
-> (TwoOrMore a -> TwoOrMore a -> TwoOrMore a)
-> Ord (TwoOrMore a)
TwoOrMore a -> TwoOrMore a -> Bool
TwoOrMore a -> TwoOrMore a -> Ordering
TwoOrMore a -> TwoOrMore a -> TwoOrMore 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 (TwoOrMore a)
forall a. Ord a => TwoOrMore a -> TwoOrMore a -> Bool
forall a. Ord a => TwoOrMore a -> TwoOrMore a -> Ordering
forall a. Ord a => TwoOrMore a -> TwoOrMore a -> TwoOrMore a
$ccompare :: forall a. Ord a => TwoOrMore a -> TwoOrMore a -> Ordering
compare :: TwoOrMore a -> TwoOrMore a -> Ordering
$c< :: forall a. Ord a => TwoOrMore a -> TwoOrMore a -> Bool
< :: TwoOrMore a -> TwoOrMore a -> Bool
$c<= :: forall a. Ord a => TwoOrMore a -> TwoOrMore a -> Bool
<= :: TwoOrMore a -> TwoOrMore a -> Bool
$c> :: forall a. Ord a => TwoOrMore a -> TwoOrMore a -> Bool
> :: TwoOrMore a -> TwoOrMore a -> Bool
$c>= :: forall a. Ord a => TwoOrMore a -> TwoOrMore a -> Bool
>= :: TwoOrMore a -> TwoOrMore a -> Bool
$cmax :: forall a. Ord a => TwoOrMore a -> TwoOrMore a -> TwoOrMore a
max :: TwoOrMore a -> TwoOrMore a -> TwoOrMore a
$cmin :: forall a. Ord a => TwoOrMore a -> TwoOrMore a -> TwoOrMore a
min :: TwoOrMore a -> TwoOrMore a -> TwoOrMore a
Ord, (forall a b. (a -> b) -> TwoOrMore a -> TwoOrMore b)
-> (forall a b. a -> TwoOrMore b -> TwoOrMore a)
-> Functor TwoOrMore
forall a b. a -> TwoOrMore b -> TwoOrMore a
forall a b. (a -> b) -> TwoOrMore a -> TwoOrMore b
forall (f :: * -> *).
(forall a b. (a -> b) -> f a -> f b)
-> (forall a b. a -> f b -> f a) -> Functor f
$cfmap :: forall a b. (a -> b) -> TwoOrMore a -> TwoOrMore b
fmap :: forall a b. (a -> b) -> TwoOrMore a -> TwoOrMore b
$c<$ :: forall a b. a -> TwoOrMore b -> TwoOrMore a
<$ :: forall a b. a -> TwoOrMore b -> TwoOrMore a
Functor, (forall m. Monoid m => TwoOrMore m -> m)
-> (forall m a. Monoid m => (a -> m) -> TwoOrMore a -> m)
-> (forall m a. Monoid m => (a -> m) -> TwoOrMore a -> m)
-> (forall a b. (a -> b -> b) -> b -> TwoOrMore a -> b)
-> (forall a b. (a -> b -> b) -> b -> TwoOrMore a -> b)
-> (forall b a. (b -> a -> b) -> b -> TwoOrMore a -> b)
-> (forall b a. (b -> a -> b) -> b -> TwoOrMore a -> b)
-> (forall a. (a -> a -> a) -> TwoOrMore a -> a)
-> (forall a. (a -> a -> a) -> TwoOrMore a -> a)
-> (forall a. TwoOrMore a -> [a])
-> (forall a. TwoOrMore a -> Bool)
-> (forall a. TwoOrMore a -> Int)
-> (forall a. Eq a => a -> TwoOrMore a -> Bool)
-> (forall a. Ord a => TwoOrMore a -> a)
-> (forall a. Ord a => TwoOrMore a -> a)
-> (forall a. Num a => TwoOrMore a -> a)
-> (forall a. Num a => TwoOrMore a -> a)
-> Foldable TwoOrMore
forall a. Eq a => a -> TwoOrMore a -> Bool
forall a. Num a => TwoOrMore a -> a
forall a. Ord a => TwoOrMore a -> a
forall m. Monoid m => TwoOrMore m -> m
forall a. TwoOrMore a -> Bool
forall a. TwoOrMore a -> Int
forall a. TwoOrMore a -> [a]
forall a. (a -> a -> a) -> TwoOrMore a -> a
forall m a. Monoid m => (a -> m) -> TwoOrMore a -> m
forall b a. (b -> a -> b) -> b -> TwoOrMore a -> b
forall a b. (a -> b -> b) -> b -> TwoOrMore 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
$cfold :: forall m. Monoid m => TwoOrMore m -> m
fold :: forall m. Monoid m => TwoOrMore m -> m
$cfoldMap :: forall m a. Monoid m => (a -> m) -> TwoOrMore a -> m
foldMap :: forall m a. Monoid m => (a -> m) -> TwoOrMore a -> m
$cfoldMap' :: forall m a. Monoid m => (a -> m) -> TwoOrMore a -> m
foldMap' :: forall m a. Monoid m => (a -> m) -> TwoOrMore a -> m
$cfoldr :: forall a b. (a -> b -> b) -> b -> TwoOrMore a -> b
foldr :: forall a b. (a -> b -> b) -> b -> TwoOrMore a -> b
$cfoldr' :: forall a b. (a -> b -> b) -> b -> TwoOrMore a -> b
foldr' :: forall a b. (a -> b -> b) -> b -> TwoOrMore a -> b
$cfoldl :: forall b a. (b -> a -> b) -> b -> TwoOrMore a -> b
foldl :: forall b a. (b -> a -> b) -> b -> TwoOrMore a -> b
$cfoldl' :: forall b a. (b -> a -> b) -> b -> TwoOrMore a -> b
foldl' :: forall b a. (b -> a -> b) -> b -> TwoOrMore a -> b
$cfoldr1 :: forall a. (a -> a -> a) -> TwoOrMore a -> a
foldr1 :: forall a. (a -> a -> a) -> TwoOrMore a -> a
$cfoldl1 :: forall a. (a -> a -> a) -> TwoOrMore a -> a
foldl1 :: forall a. (a -> a -> a) -> TwoOrMore a -> a
$ctoList :: forall a. TwoOrMore a -> [a]
toList :: forall a. TwoOrMore a -> [a]
$cnull :: forall a. TwoOrMore a -> Bool
null :: forall a. TwoOrMore a -> Bool
$clength :: forall a. TwoOrMore a -> Int
length :: forall a. TwoOrMore a -> Int
$celem :: forall a. Eq a => a -> TwoOrMore a -> Bool
elem :: forall a. Eq a => a -> TwoOrMore a -> Bool
$cmaximum :: forall a. Ord a => TwoOrMore a -> a
maximum :: forall a. Ord a => TwoOrMore a -> a
$cminimum :: forall a. Ord a => TwoOrMore a -> a
minimum :: forall a. Ord a => TwoOrMore a -> a
$csum :: forall a. Num a => TwoOrMore a -> a
sum :: forall a. Num a => TwoOrMore a -> a
$cproduct :: forall a. Num a => TwoOrMore a -> a
product :: forall a. Num a => TwoOrMore a -> a
Foldable, Functor TwoOrMore
Foldable TwoOrMore
(Functor TwoOrMore, Foldable TwoOrMore) =>
(forall (f :: * -> *) a b.
 Applicative f =>
 (a -> f b) -> TwoOrMore a -> f (TwoOrMore b))
-> (forall (f :: * -> *) a.
    Applicative f =>
    TwoOrMore (f a) -> f (TwoOrMore a))
-> (forall (m :: * -> *) a b.
    Monad m =>
    (a -> m b) -> TwoOrMore a -> m (TwoOrMore b))
-> (forall (m :: * -> *) a.
    Monad m =>
    TwoOrMore (m a) -> m (TwoOrMore a))
-> Traversable TwoOrMore
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 =>
TwoOrMore (m a) -> m (TwoOrMore a)
forall (f :: * -> *) a.
Applicative f =>
TwoOrMore (f a) -> f (TwoOrMore a)
forall (m :: * -> *) a b.
Monad m =>
(a -> m b) -> TwoOrMore a -> m (TwoOrMore b)
forall (f :: * -> *) a b.
Applicative f =>
(a -> f b) -> TwoOrMore a -> f (TwoOrMore b)
$ctraverse :: forall (f :: * -> *) a b.
Applicative f =>
(a -> f b) -> TwoOrMore a -> f (TwoOrMore b)
traverse :: forall (f :: * -> *) a b.
Applicative f =>
(a -> f b) -> TwoOrMore a -> f (TwoOrMore b)
$csequenceA :: forall (f :: * -> *) a.
Applicative f =>
TwoOrMore (f a) -> f (TwoOrMore a)
sequenceA :: forall (f :: * -> *) a.
Applicative f =>
TwoOrMore (f a) -> f (TwoOrMore a)
$cmapM :: forall (m :: * -> *) a b.
Monad m =>
(a -> m b) -> TwoOrMore a -> m (TwoOrMore b)
mapM :: forall (m :: * -> *) a b.
Monad m =>
(a -> m b) -> TwoOrMore a -> m (TwoOrMore b)
$csequence :: forall (m :: * -> *) a.
Monad m =>
TwoOrMore (m a) -> m (TwoOrMore a)
sequence :: forall (m :: * -> *) a.
Monad m =>
TwoOrMore (m a) -> m (TwoOrMore a)
Traversable)

instance Foldable1 TwoOrMore where
  foldMap1 :: forall m a. Semigroup m => (a -> m) -> TwoOrMore a -> m
foldMap1 a -> m
f (TwoOrMore a
a1 a
a2 [a]
as) = a -> m
f a
a1 m -> m -> m
forall a. Semigroup a => a -> a -> a
<> (a -> m) -> NonEmpty a -> m
forall m a. Semigroup m => (a -> m) -> NonEmpty a -> m
forall (t :: * -> *) m a.
(Foldable1 t, Semigroup m) =>
(a -> m) -> t a -> m
foldMap1 a -> m
f (a
a2 a -> [a] -> NonEmpty a
forall a. a -> [a] -> NonEmpty a
:| [a]
as)
  toNonEmpty :: forall a. TwoOrMore a -> NonEmpty a
toNonEmpty (TwoOrMore a
a1 a
a2 [a]
as) = a
a1 a -> [a] -> NonEmpty a
forall a. a -> [a] -> NonEmpty a
:| (a
a2 a -> [a] -> [a]
forall a. a -> [a] -> [a]
: [a]
as)

twoOrMore :: NonEmpty a -> Either a (TwoOrMore a)
twoOrMore :: forall a. NonEmpty a -> Either a (TwoOrMore a)
twoOrMore (a
a1 :| [a]
as) = case [a]
as of
  [] -> a -> Either a (TwoOrMore a)
forall a b. a -> Either a b
Left a
a1
  a
a2 : [a]
as' -> TwoOrMore a -> Either a (TwoOrMore a)
forall a b. b -> Either a b
Right (a -> a -> [a] -> TwoOrMore a
forall a. a -> a -> [a] -> TwoOrMore a
TwoOrMore a
a1 a
a2 [a]
as')

instance Semigroup (TwoOrMore a) where
  TwoOrMore a
a1 a
a2 [a]
as <> :: TwoOrMore a -> TwoOrMore a -> TwoOrMore a
<> TwoOrMore a
bs = a -> a -> [a] -> TwoOrMore a
forall a. a -> a -> [a] -> TwoOrMore a
TwoOrMore a
a1 a
a2 ([a]
as [a] -> [a] -> [a]
forall a. [a] -> [a] -> [a]
++ TwoOrMore a -> [a]
forall a. TwoOrMore a -> [a]
forall (t :: * -> *) a. Foldable t => t a -> [a]
toList TwoOrMore a
bs)

instance Apply TwoOrMore where
  TwoOrMore a -> b
x1 a -> b
x2 [a -> b]
xs <.> :: forall a b. TwoOrMore (a -> b) -> TwoOrMore a -> TwoOrMore b
<.> TwoOrMore a
y1 a
y2 [a]
ys = b -> b -> [b] -> TwoOrMore b
forall a. a -> a -> [a] -> TwoOrMore a
TwoOrMore (a -> b
x1 a
y1) (a -> b
x1 a
y2) ((a -> b) -> [a] -> [b]
forall a b. (a -> b) -> [a] -> [b]
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap a -> b
x1 [a]
ys [b] -> [b] -> [b]
forall a. [a] -> [a] -> [a]
++ (a -> b
x2 (a -> b) -> [a -> b] -> [a -> b]
forall a. a -> [a] -> [a]
: [a -> b]
xs [a -> b] -> [a] -> [b]
forall a b. [a -> b] -> [a] -> [b]
forall (f :: * -> *) a b. Applicative f => f (a -> b) -> f a -> f b
<*> a
y1 a -> [a] -> [a]
forall a. a -> [a] -> [a]
: a
y2 a -> [a] -> [a]
forall a. a -> [a] -> [a]
: [a]
ys))

instance Alt TwoOrMore where
  <!> :: forall a. TwoOrMore a -> TwoOrMore a -> TwoOrMore a
(<!>) = TwoOrMore a -> TwoOrMore a -> TwoOrMore a
forall a. Semigroup a => a -> a -> a
(<>)

-- | @(>>-) = flip foldMap1@
instance Bind TwoOrMore where
  TwoOrMore a
a1 a
a2 [a]
as >>- :: forall a b. TwoOrMore a -> (a -> TwoOrMore b) -> TwoOrMore b
>>- a -> TwoOrMore b
k = case a -> TwoOrMore b
k a
a1 of
    TwoOrMore b
b1 b
b2 [b]
bs -> b -> b -> [b] -> TwoOrMore b
forall a. a -> a -> [a] -> TwoOrMore a
TwoOrMore b
b1 b
b2 ([b] -> TwoOrMore b) -> [b] -> TwoOrMore b
forall a b. (a -> b) -> a -> b
$ [b]
bs [b] -> [b] -> [b]
forall a. [a] -> [a] -> [a]
++ ((a
a2 a -> [a] -> [a]
forall a. a -> [a] -> [a]
: [a]
as) [a] -> (a -> [b]) -> [b]
forall a b. [a] -> (a -> [b]) -> [b]
forall (m :: * -> *) a b. Monad m => m a -> (a -> m b) -> m b
>>= TwoOrMore b -> [b]
forall a. TwoOrMore a -> [a]
forall (t :: * -> *) a. Foldable t => t a -> [a]
toList (TwoOrMore b -> [b]) -> (a -> TwoOrMore b) -> a -> [b]
forall b c a. (b -> c) -> (a -> b) -> a -> c
. a -> TwoOrMore b
k)

instance Isolated TwoOrMore where
  impureBind :: forall a b.
TwoOrMore a -> (a -> Unite TwoOrMore b) -> Unite TwoOrMore b
impureBind = TwoOrMore a -> (a -> Unite TwoOrMore b) -> Unite TwoOrMore b
forall (m0 :: * -> *) a b.
MonadIdeal m0 =>
m0 a -> (a -> Unite m0 b) -> Unite m0 b
impureBindDefault

-- | @Ideal TwoOrMore ~ NonEmpty@
instance MonadIdeal TwoOrMore where
  idealBind :: forall a b. TwoOrMore a -> (a -> Ideal TwoOrMore b) -> TwoOrMore b
idealBind TwoOrMore a
as a -> Ideal TwoOrMore b
k = TwoOrMore a -> (a -> NonEmpty b) -> TwoOrMore b
forall a b. TwoOrMore a -> (a -> NonEmpty b) -> TwoOrMore b
bindNonEmpty TwoOrMore a
as (Ideal TwoOrMore b -> NonEmpty b
forall a. Ideal TwoOrMore a -> NonEmpty a
idealToNonEmpty (Ideal TwoOrMore b -> NonEmpty b)
-> (a -> Ideal TwoOrMore b) -> a -> NonEmpty b
forall b c a. (b -> c) -> (a -> b) -> a -> c
. a -> Ideal TwoOrMore b
k)

idealToNonEmpty :: Ideal TwoOrMore a -> NonEmpty a
idealToNonEmpty :: forall a. Ideal TwoOrMore a -> NonEmpty a
idealToNonEmpty = (a -> NonEmpty a)
-> (TwoOrMore a -> NonEmpty a)
-> Either a (TwoOrMore a)
-> NonEmpty a
forall a c b. (a -> c) -> (b -> c) -> Either a b -> c
either a -> NonEmpty a
forall a. a -> NonEmpty a
forall (f :: * -> *) a. Applicative f => a -> f a
pure TwoOrMore a -> NonEmpty a
forall a. TwoOrMore a -> NonEmpty a
forall (t :: * -> *) a. Foldable1 t => t a -> NonEmpty a
toNonEmpty (Either a (TwoOrMore a) -> NonEmpty a)
-> (Ideal TwoOrMore a -> Either a (TwoOrMore a))
-> Ideal TwoOrMore a
-> NonEmpty a
forall b c a. (b -> c) -> (a -> b) -> a -> c
. Ideal TwoOrMore a -> Either a (TwoOrMore a)
forall (m0 :: * -> *) a. Ideal m0 a -> Either a (m0 a)
runIdeal

bindNonEmpty :: TwoOrMore a -> (a -> NonEmpty b) -> TwoOrMore b
bindNonEmpty :: forall a b. TwoOrMore a -> (a -> NonEmpty b) -> TwoOrMore b
bindNonEmpty (TwoOrMore a
a1 a
a2 [a]
as) a -> NonEmpty b
k = case (a -> NonEmpty b
k a
a1, a -> NonEmpty b
k a
a2) of
  (b
b1 :| [], b
b2 :| []) -> b -> b -> [b] -> TwoOrMore b
forall a. a -> a -> [a] -> TwoOrMore a
TwoOrMore b
b1 b
b2 ([b] -> TwoOrMore b) -> [b] -> TwoOrMore b
forall a b. (a -> b) -> a -> b
$ [a]
as [a] -> (a -> [b]) -> [b]
forall a b. [a] -> (a -> [b]) -> [b]
forall (m :: * -> *) a b. Monad m => m a -> (a -> m b) -> m b
>>= NonEmpty b -> [b]
forall a. NonEmpty a -> [a]
forall (t :: * -> *) a. Foldable t => t a -> [a]
toList (NonEmpty b -> [b]) -> (a -> NonEmpty b) -> a -> [b]
forall b c a. (b -> c) -> (a -> b) -> a -> c
. a -> NonEmpty b
k
  (b
b1 :| [], b
b2 :| [b]
bs) -> b -> b -> [b] -> TwoOrMore b
forall a. a -> a -> [a] -> TwoOrMore a
TwoOrMore b
b1 b
b2 ([b] -> TwoOrMore b) -> [b] -> TwoOrMore b
forall a b. (a -> b) -> a -> b
$ [b]
bs [b] -> [b] -> [b]
forall a. [a] -> [a] -> [a]
++ ([a]
as [a] -> (a -> [b]) -> [b]
forall a b. [a] -> (a -> [b]) -> [b]
forall (m :: * -> *) a b. Monad m => m a -> (a -> m b) -> m b
>>= NonEmpty b -> [b]
forall a. NonEmpty a -> [a]
forall (t :: * -> *) a. Foldable t => t a -> [a]
toList (NonEmpty b -> [b]) -> (a -> NonEmpty b) -> a -> [b]
forall b c a. (b -> c) -> (a -> b) -> a -> c
. a -> NonEmpty b
k)
  (b
b1 :| b
b2 : [b]
bs, NonEmpty b
bs') -> b -> b -> [b] -> TwoOrMore b
forall a. a -> a -> [a] -> TwoOrMore a
TwoOrMore b
b1 b
b2 ([b] -> TwoOrMore b) -> [b] -> TwoOrMore b
forall a b. (a -> b) -> a -> b
$ [b]
bs [b] -> [b] -> [b]
forall a. [a] -> [a] -> [a]
++ NonEmpty b -> [b]
forall a. NonEmpty a -> [a]
forall (t :: * -> *) a. Foldable t => t a -> [a]
toList NonEmpty b
bs' [b] -> [b] -> [b]
forall a. [a] -> [a] -> [a]
++ ([a]
as [a] -> (a -> [b]) -> [b]
forall a b. [a] -> (a -> [b]) -> [b]
forall (m :: * -> *) a b. Monad m => m a -> (a -> m b) -> m b
>>= NonEmpty b -> [b]
forall a. NonEmpty a -> [a]
forall (t :: * -> *) a. Foldable t => t a -> [a]
toList (NonEmpty b -> [b]) -> (a -> NonEmpty b) -> a -> [b]
forall b c a. (b -> c) -> (a -> b) -> a -> c
. a -> NonEmpty b
k)