{-# LANGUAGE CPP #-}
module Data.List.NonEmpty.Extra(
module Data.List.NonEmpty,
(|:), (|>), snoc, (!?),
appendl, appendr,
sortOn, union, unionBy,
nubOrd, nubOrdBy, nubOrdOn,
maximum1, minimum1, maximumBy1, minimumBy1, maximumOn1, minimumOn1
) where
import Data.Function
import qualified Data.List.Extra as List
import Data.List.NonEmpty
#if __GLASGOW_HASKELL__ <= 802
import Data.Semigroup ((<>))
#endif
infixl 5 |>, |:
(|>) :: NonEmpty a -> a -> NonEmpty a
|> :: NonEmpty a -> a -> NonEmpty a
(|>) NonEmpty a
xs a
x = NonEmpty a
xs NonEmpty a -> NonEmpty a -> NonEmpty a
forall a. Semigroup a => a -> a -> a
<> a -> NonEmpty a
forall (f :: * -> *) a. Applicative f => a -> f a
pure a
x
snoc :: NonEmpty a -> a -> NonEmpty a
snoc :: NonEmpty a -> a -> NonEmpty a
snoc = NonEmpty a -> a -> NonEmpty a
forall a. NonEmpty a -> a -> NonEmpty a
(|>)
(|:) :: [a] -> a -> NonEmpty a
|: :: [a] -> a -> NonEmpty a
(|:) [a]
xs a
x = (a -> NonEmpty a -> NonEmpty a) -> NonEmpty a -> [a] -> NonEmpty a
forall (t :: * -> *) a b.
Foldable t =>
(a -> b -> b) -> b -> t a -> b
foldr a -> NonEmpty a -> NonEmpty a
forall a. a -> NonEmpty a -> NonEmpty a
cons (a -> NonEmpty a
forall (f :: * -> *) a. Applicative f => a -> f a
pure a
x) [a]
xs
(!?) :: NonEmpty a -> Int -> Maybe a
!? :: NonEmpty a -> Int -> Maybe a
(!?) ~(a
x :| [a]
xs) Int
n
| Int
n Int -> Int -> Bool
forall a. Eq a => a -> a -> Bool
== Int
0 = a -> Maybe a
forall a. a -> Maybe a
Just a
x
| Int
n Int -> Int -> Bool
forall a. Ord a => a -> a -> Bool
> Int
0 = [a]
xs [a] -> Int -> Maybe a
forall a. [a] -> Int -> Maybe a
List.!? (Int
n Int -> Int -> Int
forall a. Num a => a -> a -> a
- Int
1)
| Bool
otherwise = Maybe a
forall a. Maybe a
Nothing
infixl 9 !?
appendl :: NonEmpty a -> [a] -> NonEmpty a
appendl :: NonEmpty a -> [a] -> NonEmpty a
appendl (a
x :| [a]
xs) [a]
l = a
x a -> [a] -> NonEmpty a
forall a. a -> [a] -> NonEmpty a
:| ([a]
xs [a] -> [a] -> [a]
forall a. [a] -> [a] -> [a]
++ [a]
l)
appendr :: [a] -> NonEmpty a -> NonEmpty a
appendr :: [a] -> NonEmpty a -> NonEmpty a
appendr [a]
l NonEmpty a
nel = (a -> NonEmpty a -> NonEmpty a) -> NonEmpty a -> [a] -> NonEmpty a
forall (t :: * -> *) a b.
Foldable t =>
(a -> b -> b) -> b -> t a -> b
foldr a -> NonEmpty a -> NonEmpty a
forall a. a -> NonEmpty a -> NonEmpty a
cons NonEmpty a
nel [a]
l
sortOn :: Ord b => (a -> b) -> NonEmpty a -> NonEmpty a
sortOn :: (a -> b) -> NonEmpty a -> NonEmpty a
sortOn a -> b
f = [a] -> NonEmpty a
forall a. [a] -> NonEmpty a
fromList ([a] -> NonEmpty a)
-> (NonEmpty a -> [a]) -> NonEmpty a -> NonEmpty a
forall b c a. (b -> c) -> (a -> b) -> a -> c
. (a -> b) -> [a] -> [a]
forall b a. Ord b => (a -> b) -> [a] -> [a]
List.sortOn a -> b
f ([a] -> [a]) -> (NonEmpty a -> [a]) -> NonEmpty a -> [a]
forall b c a. (b -> c) -> (a -> b) -> a -> c
. NonEmpty a -> [a]
forall a. NonEmpty a -> [a]
toList
union :: Eq a => NonEmpty a -> NonEmpty a -> NonEmpty a
union :: NonEmpty a -> NonEmpty a -> NonEmpty a
union = (a -> a -> Bool) -> NonEmpty a -> NonEmpty a -> NonEmpty a
forall a.
(a -> a -> Bool) -> NonEmpty a -> NonEmpty a -> NonEmpty a
unionBy a -> a -> Bool
forall a. Eq a => a -> a -> Bool
(==)
nubOrd :: Ord a => NonEmpty a -> NonEmpty a
nubOrd :: NonEmpty a -> NonEmpty a
nubOrd = (a -> a -> Ordering) -> NonEmpty a -> NonEmpty a
forall a. (a -> a -> Ordering) -> NonEmpty a -> NonEmpty a
nubOrdBy a -> a -> Ordering
forall a. Ord a => a -> a -> Ordering
compare
nubOrdBy :: (a -> a -> Ordering) -> NonEmpty a -> NonEmpty a
nubOrdBy :: (a -> a -> Ordering) -> NonEmpty a -> NonEmpty a
nubOrdBy a -> a -> Ordering
cmp = [a] -> NonEmpty a
forall a. [a] -> NonEmpty a
fromList ([a] -> NonEmpty a)
-> (NonEmpty a -> [a]) -> NonEmpty a -> NonEmpty a
forall b c a. (b -> c) -> (a -> b) -> a -> c
. (a -> a -> Ordering) -> [a] -> [a]
forall a. (a -> a -> Ordering) -> [a] -> [a]
List.nubOrdBy a -> a -> Ordering
cmp ([a] -> [a]) -> (NonEmpty a -> [a]) -> NonEmpty a -> [a]
forall b c a. (b -> c) -> (a -> b) -> a -> c
. NonEmpty a -> [a]
forall a. NonEmpty a -> [a]
toList
nubOrdOn :: Ord b => (a -> b) -> NonEmpty a -> NonEmpty a
nubOrdOn :: (a -> b) -> NonEmpty a -> NonEmpty a
nubOrdOn a -> b
f = [a] -> NonEmpty a
forall a. [a] -> NonEmpty a
fromList ([a] -> NonEmpty a)
-> (NonEmpty a -> [a]) -> NonEmpty a -> NonEmpty a
forall b c a. (b -> c) -> (a -> b) -> a -> c
. (a -> b) -> [a] -> [a]
forall b a. Ord b => (a -> b) -> [a] -> [a]
List.nubOrdOn a -> b
f ([a] -> [a]) -> (NonEmpty a -> [a]) -> NonEmpty a -> [a]
forall b c a. (b -> c) -> (a -> b) -> a -> c
. NonEmpty a -> [a]
forall a. NonEmpty a -> [a]
toList
unionBy :: (a -> a -> Bool) -> NonEmpty a -> NonEmpty a -> NonEmpty a
unionBy :: (a -> a -> Bool) -> NonEmpty a -> NonEmpty a -> NonEmpty a
unionBy a -> a -> Bool
eq NonEmpty a
xs NonEmpty a
ys = [a] -> NonEmpty a
forall a. [a] -> NonEmpty a
fromList ([a] -> NonEmpty a) -> [a] -> NonEmpty a
forall a b. (a -> b) -> a -> b
$ (a -> a -> Bool) -> [a] -> [a] -> [a]
forall a. (a -> a -> Bool) -> [a] -> [a] -> [a]
List.unionBy a -> a -> Bool
eq (NonEmpty a -> [a]
forall a. NonEmpty a -> [a]
toList NonEmpty a
xs) (NonEmpty a -> [a]
forall a. NonEmpty a -> [a]
toList NonEmpty a
ys)
maximum1 :: Ord a => NonEmpty a -> a
maximum1 :: NonEmpty a -> a
maximum1 = NonEmpty a -> a
forall (t :: * -> *) a. (Foldable t, Ord a) => t a -> a
List.maximum
minimum1 :: Ord a => NonEmpty a -> a
minimum1 :: NonEmpty a -> a
minimum1 = NonEmpty a -> a
forall (t :: * -> *) a. (Foldable t, Ord a) => t a -> a
List.minimum
maximumBy1 :: (a -> a -> Ordering) -> NonEmpty a -> a
maximumBy1 :: (a -> a -> Ordering) -> NonEmpty a -> a
maximumBy1 = (a -> a -> Ordering) -> NonEmpty a -> a
forall (t :: * -> *) a.
Foldable t =>
(a -> a -> Ordering) -> t a -> a
List.maximumBy
minimumBy1 :: (a -> a -> Ordering) -> NonEmpty a -> a
minimumBy1 :: (a -> a -> Ordering) -> NonEmpty a -> a
minimumBy1 = (a -> a -> Ordering) -> NonEmpty a -> a
forall (t :: * -> *) a.
Foldable t =>
(a -> a -> Ordering) -> t a -> a
List.minimumBy
maximumOn1 :: Ord b => (a -> b) -> NonEmpty a -> a
maximumOn1 :: (a -> b) -> NonEmpty a -> a
maximumOn1 a -> b
f = (a -> a -> Ordering) -> NonEmpty a -> a
forall a. (a -> a -> Ordering) -> NonEmpty a -> a
maximumBy1 (b -> b -> Ordering
forall a. Ord a => a -> a -> Ordering
compare (b -> b -> Ordering) -> (a -> b) -> a -> a -> Ordering
forall b c a. (b -> b -> c) -> (a -> b) -> a -> a -> c
`on` a -> b
f)
minimumOn1 :: Ord b => (a -> b) -> NonEmpty a -> a
minimumOn1 :: (a -> b) -> NonEmpty a -> a
minimumOn1 a -> b
f = (a -> a -> Ordering) -> NonEmpty a -> a
forall a. (a -> a -> Ordering) -> NonEmpty a -> a
minimumBy1 (b -> b -> Ordering
forall a. Ord a => a -> a -> Ordering
compare (b -> b -> Ordering) -> (a -> b) -> a -> a -> Ordering
forall b c a. (b -> b -> c) -> (a -> b) -> a -> a -> c
`on` a -> b
f)