{-# LANGUAGE DeriveFoldable, DeriveFunctor, LambdaCase #-}

module Data.Loc.List.OneToTwo
  (
  -- * Imports
  -- $imports

  -- * Type
    OneToTwo (..)

  -- * Tuple conversion
  , toTuple
  , toTuple'
  ) where

import Data.Loc.Internal.Prelude

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

{- |

>>> toTuple (One 1)
(1,Nothing)

>>> toTuple (Two 1 2)
(1,Just 2)

-}
toTuple :: OneToTwo a -> (a, Maybe a)
toTuple :: OneToTwo a -> (a, Maybe a)
toTuple =
  \case
    One a
a -> (a
a, Maybe a
forall a. Maybe a
Nothing)
    Two a
a a
b -> (a
a, a -> Maybe a
forall a. a -> Maybe a
Just a
b)

{- |

>>> toTuple' (One 1)
(Nothing,1)

>>> toTuple' (Two 1 2)
(Just 1,2)

-}
toTuple' :: OneToTwo a -> (Maybe a, a)
toTuple' :: OneToTwo a -> (Maybe a, a)
toTuple' =
  \case
    One a
a -> (Maybe a
forall a. Maybe a
Nothing, a
a)
    Two a
a a
b -> (a -> Maybe a
forall a. a -> Maybe a
Just a
a, a
b)

{- $imports

Recommended import:

> import Data.Loc.List.OneToTwo (OneToTwo)
> import qualified Data.Loc.List.OneToTwo as OneToTwo

-}