{-# OPTIONS_HADDOCK show-extensions #-}

-- |
-- Module      :  Phonetic.Languages.Simplified.Lists.UniquenessPeriodsG.Base
-- Copyright   :  (c) OleksandrZhabenko 2020
-- License     :  MIT
-- Stability   :  Experimental
-- Maintainer  :  olexandr543@yahoo.com
--
-- Generalization of the uniqueness-periods and uniqueness-periods-general
-- packages functionality. Uses less dependencies.
--

{-# LANGUAGE BangPatterns #-}

module Phonetic.Languages.Simplified.Lists.UniquenessPeriodsG.Base (
  -- * List functions
  uniquenessPeriodsG
  , diverse2GL
)where

import GHC.Int
import Data.List
import Data.Maybe (mapMaybe)

-- | A lists variant of the diverse2 metrics from the @phonetic-languages-properties@ package.
diverse2GL :: Foldable t => String -> t Char -> Int16
diverse2GL :: String -> t Char -> Int16
diverse2GL String
whspss = [Int16] -> Int16
forall (t :: * -> *) a. (Foldable t, Num a) => t a -> a
sum ([Int16] -> Int16) -> (t Char -> [Int16]) -> t Char -> Int16
forall b c a. (b -> c) -> (a -> b) -> a -> c
. String -> t Char -> [Int16]
forall (t :: * -> *). Foldable t => String -> t Char -> [Int16]
uniquenessPeriodsG String
whspss
{-# INLINE diverse2GL #-}
 
-- | A generalization of the uniquenessPeriods function of the @uniqueness-periods@ package.
uniquenessPeriodsG :: Foldable t => String -> t Char -> [Int16]
uniquenessPeriodsG :: String -> t Char -> [Int16]
uniquenessPeriodsG String
whspss t Char
ws
 | t Char -> Bool
forall (t :: * -> *) a. Foldable t => t a -> Bool
null t Char
ws = []
 | Bool
otherwise = (([Int16], Char) -> Maybe Int16) -> [([Int16], Char)] -> [Int16]
forall a b. (a -> Maybe b) -> [a] -> [b]
mapMaybe (([Int16] -> Int16) -> String -> ([Int16], Char) -> Maybe Int16
forall a b. Eq a => ([b] -> b) -> [a] -> ([b], a) -> Maybe b
helpG [Int16] -> Int16
forall (t :: * -> *) a. (Foldable t, Num a) => t a -> a
sum String
whspss) ([([Int16], Char)] -> [Int16])
-> ([(Int16, Char)] -> [([Int16], Char)])
-> [(Int16, Char)]
-> [Int16]
forall b c a. (b -> c) -> (a -> b) -> a -> c
. ([(Int16, Char)] -> Maybe (([Int16], Char), [(Int16, Char)]))
-> [(Int16, Char)] -> [([Int16], Char)]
forall b a. (b -> Maybe (a, b)) -> b -> [a]
unfoldr [(Int16, Char)] -> Maybe (([Int16], Char), [(Int16, Char)])
forall b.
Eq b =>
[(Int16, b)] -> Maybe (([Int16], b), [(Int16, b)])
f ([(Int16, Char)] -> [Int16]) -> [(Int16, Char)] -> [Int16]
forall a b. (a -> b) -> a -> b
$ [(Int16, Char)]
ks
     where !ks :: [(Int16, Char)]
ks = Char -> t Char -> [(Int16, Char)]
forall (t :: * -> *) b. Foldable t => b -> t b -> [(Int16, b)]
indexedL Char
'\00' t Char
ws
           !vs :: [Int16]
vs = ((Int16, Char) -> Maybe Int16) -> [(Int16, Char)] -> [Int16]
forall a b. (a -> Maybe b) -> [a] -> [b]
mapMaybe (Int16, Char) -> Maybe Int16
forall a. (a, Char) -> Maybe a
g [(Int16, Char)]
ks
           g :: (a, Char) -> Maybe a
g (a, Char)
x
            | (Char -> String -> Bool
forall (t :: * -> *) a. (Foldable t, Eq a) => a -> t a -> Bool
`elem` String
whspss) (Char -> Bool) -> ((a, Char) -> Char) -> (a, Char) -> Bool
forall b c a. (b -> c) -> (a -> b) -> a -> c
. (a, Char) -> Char
forall a b. (a, b) -> b
snd ((a, Char) -> Bool) -> (a, Char) -> Bool
forall a b. (a -> b) -> a -> b
$ (a, Char)
x = a -> Maybe a
forall a. a -> Maybe a
Just ((a, Char) -> a
forall a b. (a, b) -> a
fst (a, Char)
x)
            | Bool
otherwise = Maybe a
forall a. Maybe a
Nothing
           {-# INLINE g #-}
           f :: [(Int16, b)] -> Maybe (([Int16], b), [(Int16, b)])
f ![(Int16, b)]
x = if [(Int16, b)] -> Bool
forall (t :: * -> *) a. Foldable t => t a -> Bool
null [(Int16, b)]
x then Maybe (([Int16], b), [(Int16, b)])
forall a. Maybe a
Nothing else let !idX0 :: b
idX0 = (Int16, b) -> b
forall a b. (a, b) -> b
snd ((Int16, b) -> b)
-> ([(Int16, b)] -> (Int16, b)) -> [(Int16, b)] -> b
forall b c a. (b -> c) -> (a -> b) -> a -> c
. [(Int16, b)] -> (Int16, b)
forall a. [a] -> a
head ([(Int16, b)] -> b) -> [(Int16, b)] -> b
forall a b. (a -> b) -> a -> b
$ [(Int16, b)]
x in (([Int16], b), [(Int16, b)]) -> Maybe (([Int16], b), [(Int16, b)])
forall a. a -> Maybe a
Just ((([Int16], b), [(Int16, b)])
 -> Maybe (([Int16], b), [(Int16, b)]))
-> ([(Int16, b)] -> (([Int16], b), [(Int16, b)]))
-> [(Int16, b)]
-> Maybe (([Int16], b), [(Int16, b)])
forall b c a. (b -> c) -> (a -> b) -> a -> c
. (\[Int16]
vws ([(Int16, b)]
v2,[(Int16, b)]
v3) -> (([Int16] -> [Int16] -> [Int16] -> [Int16]
helpUPV3 [Int16]
vws [] ([Int16] -> [Int16])
-> ([(Int16, b)] -> [Int16]) -> [(Int16, b)] -> [Int16]
forall b c a. (b -> c) -> (a -> b) -> a -> c
.
                    ((Int16, b) -> Int16) -> [(Int16, b)] -> [Int16]
forall a b. (a -> b) -> [a] -> [b]
map (Int16, b) -> Int16
forall a b. (a, b) -> a
fst ([(Int16, b)] -> [Int16]) -> [(Int16, b)] -> [Int16]
forall a b. (a -> b) -> a -> b
$ [(Int16, b)]
v2,(Int16, b) -> b
forall a b. (a, b) -> b
snd ((Int16, b) -> b)
-> ([(Int16, b)] -> (Int16, b)) -> [(Int16, b)] -> b
forall b c a. (b -> c) -> (a -> b) -> a -> c
. [(Int16, b)] -> (Int16, b)
forall a. [a] -> a
head ([(Int16, b)] -> b) -> [(Int16, b)] -> b
forall a b. (a -> b) -> a -> b
$ [(Int16, b)]
v2),[(Int16, b)]
v3)) [Int16]
vs (([(Int16, b)], [(Int16, b)]) -> (([Int16], b), [(Int16, b)]))
-> ([(Int16, b)] -> ([(Int16, b)], [(Int16, b)]))
-> [(Int16, b)]
-> (([Int16], b), [(Int16, b)])
forall b c a. (b -> c) -> (a -> b) -> a -> c
. ((Int16, b) -> Bool)
-> [(Int16, b)] -> ([(Int16, b)], [(Int16, b)])
forall a. (a -> Bool) -> [a] -> ([a], [a])
partition (\(Int16
_,b
xs) -> b
xs b -> b -> Bool
forall a. Eq a => a -> a -> Bool
== b
idX0) ([(Int16, b)] -> Maybe (([Int16], b), [(Int16, b)]))
-> [(Int16, b)] -> Maybe (([Int16], b), [(Int16, b)])
forall a b. (a -> b) -> a -> b
$ [(Int16, b)]
x                    

-- | The first and the third list arguments of numbers (if not empty) must be sorted in the ascending order.
helpUPV3 :: [Int16] -> [Int16] -> [Int16] -> [Int16]
helpUPV3 :: [Int16] -> [Int16] -> [Int16] -> [Int16]
helpUPV3 (Int16
z:[Int16]
zs) ![Int16]
acc (Int16
x:Int16
y:[Int16]
xs)
 | Int16 -> Int16 -> Ordering
forall a. Ord a => a -> a -> Ordering
compare ((Int16
x Int16 -> Int16 -> Int16
forall a. Num a => a -> a -> a
- Int16
z) Int16 -> Int16 -> Int16
forall a. Num a => a -> a -> a
* (Int16
y Int16 -> Int16 -> Int16
forall a. Num a => a -> a -> a
- Int16
z)) Int16
0 Ordering -> Ordering -> Bool
forall a. Eq a => a -> a -> Bool
== Ordering
LT = [Int16] -> [Int16] -> [Int16] -> [Int16]
helpUPV3 [Int16]
zs ((Int16
y Int16 -> Int16 -> Int16
forall a. Num a => a -> a -> a
- Int16
x)Int16 -> [Int16] -> [Int16]
forall a. a -> [a] -> [a]
:[Int16]
acc) (Int16
yInt16 -> [Int16] -> [Int16]
forall a. a -> [a] -> [a]
:[Int16]
xs)
 | Int16 -> Int16 -> Ordering
forall a. Ord a => a -> a -> Ordering
compare Int16
y Int16
z Ordering -> Ordering -> Bool
forall a. Eq a => a -> a -> Bool
== Ordering
GT = [Int16] -> [Int16] -> [Int16] -> [Int16]
helpUPV3 [Int16]
zs [Int16]
acc (Int16
xInt16 -> [Int16] -> [Int16]
forall a. a -> [a] -> [a]
:Int16
yInt16 -> [Int16] -> [Int16]
forall a. a -> [a] -> [a]
:[Int16]
xs)
 | Bool
otherwise = [Int16] -> [Int16] -> [Int16] -> [Int16]
helpUPV3 (Int16
zInt16 -> [Int16] -> [Int16]
forall a. a -> [a] -> [a]
:[Int16]
zs) [Int16]
acc (Int16
yInt16 -> [Int16] -> [Int16]
forall a. a -> [a] -> [a]
:[Int16]
xs)
helpUPV3 [Int16]
_ ![Int16]
acc [Int16]
_ = [Int16]
acc

indexedL :: Foldable t => b -> t b -> [(Int16, b)]
indexedL :: b -> t b -> [(Int16, b)]
indexedL b
y = (b -> [(Int16, b)] -> [(Int16, b)])
-> [(Int16, b)] -> t b -> [(Int16, b)]
forall (t :: * -> *) a b.
Foldable t =>
(a -> b -> b) -> b -> t a -> b
foldr b -> [(Int16, b)] -> [(Int16, b)]
forall a b. Num a => b -> [(a, b)] -> [(a, b)]
f [(Int16, b)]
v
  where v :: [(Int16, b)]
v = [(Int16
1::Int16,b
y)]
        f :: b -> [(a, b)] -> [(a, b)]
f b
x ((a
j,b
z):[(a, b)]
ys) = (a
ja -> a -> a
forall a. Num a => a -> a -> a
-a
1,b
x)(a, b) -> [(a, b)] -> [(a, b)]
forall a. a -> [a] -> [a]
:(a
j,b
z)(a, b) -> [(a, b)] -> [(a, b)]
forall a. a -> [a] -> [a]
:[(a, b)]
ys

helpG :: (Eq a) => ([b] -> b) -> [a] -> ([b], a) -> Maybe b
helpG :: ([b] -> b) -> [a] -> ([b], a) -> Maybe b
helpG [b] -> b
h [a]
xs ([b]
ts, a
x)
  | [b] -> Bool
forall (t :: * -> *) a. Foldable t => t a -> Bool
null [b]
ts = Maybe b
forall a. Maybe a
Nothing
  | a
x a -> [a] -> Bool
forall (t :: * -> *) a. (Foldable t, Eq a) => a -> t a -> Bool
`elem` [a]
xs = Maybe b
forall a. Maybe a
Nothing
  | Bool
otherwise = b -> Maybe b
forall a. a -> Maybe a
Just ([b] -> b
h [b]
ts)
{-# INLINE helpG #-}