-- |
-- Module      :  String.Languages.UniquenessPeriods.VectorG
-- Copyright   :  (c) OleksandrZhabenko 2020
-- License     :  MIT
-- Stability   :  Experimental
-- Maintainer  :  olexandr543@yahoo.com
--
-- Generalization of the uniqueness-periods and uniqueness-periods-general 
-- packages functionality.
-- 

{-# LANGUAGE BangPatterns, FlexibleInstances, MultiParamTypeClasses #-}

module String.Languages.UniquenessPeriods.VectorG where

import GHC.Int
import qualified Data.Vector as VB

data UniquenessGeneral1 a b = UG1 a [b] (VB.Vector b) | UG2 a [b] (VB.Vector b) | UG3 [b] (VB.Vector b) deriving UniquenessGeneral1 a b -> UniquenessGeneral1 a b -> Bool
(UniquenessGeneral1 a b -> UniquenessGeneral1 a b -> Bool)
-> (UniquenessGeneral1 a b -> UniquenessGeneral1 a b -> Bool)
-> Eq (UniquenessGeneral1 a b)
forall a. (a -> a -> Bool) -> (a -> a -> Bool) -> Eq a
forall a b.
(Eq a, Eq b) =>
UniquenessGeneral1 a b -> UniquenessGeneral1 a b -> Bool
/= :: UniquenessGeneral1 a b -> UniquenessGeneral1 a b -> Bool
$c/= :: forall a b.
(Eq a, Eq b) =>
UniquenessGeneral1 a b -> UniquenessGeneral1 a b -> Bool
== :: UniquenessGeneral1 a b -> UniquenessGeneral1 a b -> Bool
$c== :: forall a b.
(Eq a, Eq b) =>
UniquenessGeneral1 a b -> UniquenessGeneral1 a b -> Bool
Eq

class UniquenessGeneral a b where
  get :: a -> b

type UniquenessGeneral2 a = VB.Vector ([Int16], a)  
  
instance (Eq a) => UniquenessGeneral (UniquenessGeneral1 Bool a) (UniquenessGeneral2 a) where
  get :: UniquenessGeneral1 Bool a -> UniquenessGeneral2 a
get (UG1 Bool
y [a]
whspss Vector a
v) = Bool -> [a] -> Vector a -> UniquenessGeneral2 a
forall a. Eq a => Bool -> [a] -> Vector a -> UniquenessGeneral2 a
uniquenessPeriodsVector1 Bool
y [a]
whspss Vector a
v
  get (UG2 Bool
y [a]
whspss Vector a
v) = Bool -> [a] -> Vector a -> UniquenessGeneral2 a
forall a. Eq a => Bool -> [a] -> Vector a -> UniquenessGeneral2 a
uniquenessPeriodsVector2 Bool
y [a]
whspss Vector a
v 
  get (UG3 [a]
whspss Vector a
v) = [a] -> Vector a -> UniquenessGeneral2 a
forall a. Eq a => [a] -> Vector a -> UniquenessGeneral2 a
uniquenessPeriodsVector3 [a]
whspss Vector a
v 

-- | List of 'Int16' in the result is a list of indexes for the occurrences of the value of the @a@ (usually, @a@ is a sound representation or its duration). 
-- The first 'Bool' argument defines whether to apply the filtering for not informative (possibly) \"whitespace symbols\" given as the 
-- second argument list. The resulting 'VB.Vector' is sorted in the order of the first occurrence of each of the @a@ (usually, @a@ is the sound 
-- representation, or its duration, or some other its characteristics) in the given third argument.
uniquenessPeriodsVector1 :: Eq a => Bool -> [a] -> VB.Vector a -> UniquenessGeneral2 a
uniquenessPeriodsVector1 :: Bool -> [a] -> Vector a -> UniquenessGeneral2 a
uniquenessPeriodsVector1 Bool
y [a]
whspss Vector a
v 
 | Vector a -> Bool
forall a. Vector a -> Bool
VB.null Vector a
v = UniquenessGeneral2 a
forall a. Vector a
VB.empty
 | Bool
otherwise = let !v1 :: Vector (Int, a)
v1 = Vector a -> Vector (Int, a)
forall a. Vector a -> Vector (Int, a)
VB.indexed Vector a
v in 
    let f :: Vector (a, b) -> Maybe (([a], b), Vector (a, b))
f !Vector (a, b)
x = if Vector (a, b) -> Bool
forall a. Vector a -> Bool
VB.null Vector (a, b)
x then Maybe (([a], b), Vector (a, b))
forall a. Maybe a
Nothing 
                else (([a], b), Vector (a, b)) -> Maybe (([a], b), Vector (a, b))
forall a. a -> Maybe a
Just ((([a], b), Vector (a, b)) -> Maybe (([a], b), Vector (a, b)))
-> (Vector (a, b) -> (([a], b), Vector (a, b)))
-> Vector (a, b)
-> Maybe (([a], b), Vector (a, b))
forall b c a. (b -> c) -> (a -> b) -> a -> c
. (\(Vector (a, b)
v2,Vector (a, b)
v3) -> ((Vector a -> [a]
forall a. Vector a -> [a]
VB.toList (Vector a -> [a])
-> (Vector (a, b) -> Vector a) -> Vector (a, b) -> [a]
forall b c a. (b -> c) -> (a -> b) -> a -> c
. ((a, b) -> a) -> Vector (a, b) -> Vector a
forall a b. (a -> b) -> Vector a -> Vector b
VB.map (a, b) -> a
forall a b. (a, b) -> a
fst (Vector (a, b) -> [a]) -> Vector (a, b) -> [a]
forall a b. (a -> b) -> a -> b
$ Vector (a, b)
v2,(a, b) -> b
forall a b. (a, b) -> b
snd ((a, b) -> b) -> (Int -> (a, b)) -> Int -> b
forall b c a. (b -> c) -> (a -> b) -> a -> c
. Vector (a, b) -> Int -> (a, b)
forall a. Vector a -> Int -> a
VB.unsafeIndex Vector (a, b)
v2 (Int -> b) -> Int -> b
forall a b. (a -> b) -> a -> b
$ Int
0),Vector (a, b)
v3)) ((Vector (a, b), Vector (a, b)) -> (([a], b), Vector (a, b)))
-> (Vector (a, b) -> (Vector (a, b), Vector (a, b)))
-> Vector (a, b)
-> (([a], b), Vector (a, b))
forall b c a. (b -> c) -> (a -> b) -> a -> c
. 
                  ((a, b) -> Bool) -> Vector (a, b) -> (Vector (a, b), Vector (a, b))
forall a. (a -> Bool) -> Vector a -> (Vector a, Vector a)
VB.partition (\(a
_,b
xs) -> b
xs b -> b -> Bool
forall a. Eq a => a -> a -> Bool
== ((a, b) -> b
forall a b. (a, b) -> b
snd ((a, b) -> b) -> (Int -> (a, b)) -> Int -> b
forall b c a. (b -> c) -> (a -> b) -> a -> c
. Vector (a, b) -> Int -> (a, b)
forall a. Vector a -> Int -> a
VB.unsafeIndex Vector (a, b)
x (Int -> b) -> Int -> b
forall a b. (a -> b) -> a -> b
$ Int
0)) (Vector (a, b) -> Maybe (([a], b), Vector (a, b)))
-> Vector (a, b) -> Maybe (([a], b), Vector (a, b))
forall a b. (a -> b) -> a -> b
$ Vector (a, b)
x in 
                   (if Bool
y then (([Int], a) -> ([Int16], a))
-> Vector ([Int], a) -> UniquenessGeneral2 a
forall a b. (a -> b) -> Vector a -> Vector b
VB.map (\([Int]
js,a
t) -> ((Int -> Int16) -> [Int] -> [Int16]
forall a b. (a -> b) -> [a] -> [b]
map Int -> Int16
forall a. Enum a => Int -> a
toEnum [Int]
js,a
t)) (Vector ([Int], a) -> UniquenessGeneral2 a)
-> (Vector ([Int], a) -> Vector ([Int], a))
-> Vector ([Int], a)
-> UniquenessGeneral2 a
forall b c a. (b -> c) -> (a -> b) -> a -> c
. (([Int], a) -> Bool) -> Vector ([Int], a) -> Vector ([Int], a)
forall a. (a -> Bool) -> Vector a -> Vector a
VB.filter (\([Int]
_,!a
zs) -> a
zs a -> [a] -> Bool
forall (t :: * -> *) a. (Foldable t, Eq a) => a -> t a -> Bool
`notElem` [a]
whspss) else (([Int], a) -> ([Int16], a))
-> Vector ([Int], a) -> UniquenessGeneral2 a
forall a b. (a -> b) -> Vector a -> Vector b
VB.map (\([Int]
js,a
t) -> ((Int -> Int16) -> [Int] -> [Int16]
forall a b. (a -> b) -> [a] -> [b]
map Int -> Int16
forall a. Enum a => Int -> a
toEnum [Int]
js,a
t))) (Vector ([Int], a) -> UniquenessGeneral2 a)
-> (Vector (Int, a) -> Vector ([Int], a))
-> Vector (Int, a)
-> UniquenessGeneral2 a
forall b c a. (b -> c) -> (a -> b) -> a -> c
. (Vector (Int, a) -> Maybe (([Int], a), Vector (Int, a)))
-> Vector (Int, a) -> Vector ([Int], a)
forall b a. (b -> Maybe (a, b)) -> b -> Vector a
VB.unfoldr Vector (Int, a) -> Maybe (([Int], a), Vector (Int, a))
forall b a.
Eq b =>
Vector (a, b) -> Maybe (([a], b), Vector (a, b))
f (Vector (Int, a) -> UniquenessGeneral2 a)
-> Vector (Int, a) -> UniquenessGeneral2 a
forall a b. (a -> b) -> a -> b
$ Vector (Int, a)
v1 

-- | List of 'Int16' in the result is a list of distances between the consequential occurrences of the @a@ (usually, @a@ is a sound representation or its duration)
-- in the given 'VB.Vector'. The first 'Bool' argument defines whether to apply the filtering for not informative
-- (possibly) \"whitespace symbols\" given as the second argument list. The resulting 'VB.Vector' is sorted in the order of the first occurrence of each of 
-- the @a@ (usually, @a@ is the sound representation or its duration, or some other its characteristics) in the given third argument.
uniquenessPeriodsVector2 :: Eq a => Bool -> [a] -> VB.Vector a -> UniquenessGeneral2 a
uniquenessPeriodsVector2 :: Bool -> [a] -> Vector a -> UniquenessGeneral2 a
uniquenessPeriodsVector2 Bool
y [a]
whspss Vector a
v 
 | Vector a -> Bool
forall a. Vector a -> Bool
VB.null Vector a
v = UniquenessGeneral2 a
forall a. Vector a
VB.empty
 | Bool
otherwise = let !v1 :: Vector (Int, a)
v1 = Vector a -> Vector (Int, a)
forall a. Vector a -> Vector (Int, a)
VB.indexed Vector a
v in 
    let f :: Vector (a, b) -> Maybe (([a], b), Vector (a, b))
f !Vector (a, b)
x = if Vector (a, b) -> Bool
forall a. Vector a -> Bool
VB.null Vector (a, b)
x then Maybe (([a], b), Vector (a, b))
forall a. Maybe a
Nothing 
                else (([a], b), Vector (a, b)) -> Maybe (([a], b), Vector (a, b))
forall a. a -> Maybe a
Just ((([a], b), Vector (a, b)) -> Maybe (([a], b), Vector (a, b)))
-> (Vector (a, b) -> (([a], b), Vector (a, b)))
-> Vector (a, b)
-> Maybe (([a], b), Vector (a, b))
forall b c a. (b -> c) -> (a -> b) -> a -> c
. (\(Vector (a, b)
v2,Vector (a, b)
v3) -> ((Vector a -> [a]
forall a. Vector a -> [a]
VB.toList (Vector a -> [a])
-> (Vector (a, b) -> Vector a) -> Vector (a, b) -> [a]
forall b c a. (b -> c) -> (a -> b) -> a -> c
. (\Vector a
v4 -> (a -> a -> a) -> Vector a -> Vector a -> Vector a
forall a b c. (a -> b -> c) -> Vector a -> Vector b -> Vector c
VB.zipWith a -> a -> a
forall a. Num a => a -> a -> a
subtract Vector a
v4 (Int -> Int -> Vector a -> Vector a
forall a. Int -> Int -> Vector a -> Vector a
VB.unsafeSlice Int
1 (Vector a -> Int
forall a. Vector a -> Int
VB.length Vector a
v4 Int -> Int -> Int
forall a. Num a => a -> a -> a
-Int
1) Vector a
v4)) (Vector a -> Vector a)
-> (Vector (a, b) -> Vector a) -> Vector (a, b) -> Vector a
forall b c a. (b -> c) -> (a -> b) -> a -> c
. ((a, b) -> a) -> Vector (a, b) -> Vector a
forall a b. (a -> b) -> Vector a -> Vector b
VB.map (a, b) -> a
forall a b. (a, b) -> a
fst (Vector (a, b) -> [a]) -> Vector (a, b) -> [a]
forall a b. (a -> b) -> a -> b
$ Vector (a, b)
v2,(a, b) -> b
forall a b. (a, b) -> b
snd ((a, b) -> b) -> (Int -> (a, b)) -> Int -> b
forall b c a. (b -> c) -> (a -> b) -> a -> c
. 
                  Vector (a, b) -> Int -> (a, b)
forall a. Vector a -> Int -> a
VB.unsafeIndex Vector (a, b)
v2 (Int -> b) -> Int -> b
forall a b. (a -> b) -> a -> b
$ Int
0),Vector (a, b)
v3)) ((Vector (a, b), Vector (a, b)) -> (([a], b), Vector (a, b)))
-> (Vector (a, b) -> (Vector (a, b), Vector (a, b)))
-> Vector (a, b)
-> (([a], b), Vector (a, b))
forall b c a. (b -> c) -> (a -> b) -> a -> c
. ((a, b) -> Bool) -> Vector (a, b) -> (Vector (a, b), Vector (a, b))
forall a. (a -> Bool) -> Vector a -> (Vector a, Vector a)
VB.partition (\(a
_,b
xs) -> b
xs b -> b -> Bool
forall a. Eq a => a -> a -> Bool
== ((a, b) -> b
forall a b. (a, b) -> b
snd ((a, b) -> b) -> (Int -> (a, b)) -> Int -> b
forall b c a. (b -> c) -> (a -> b) -> a -> c
. Vector (a, b) -> Int -> (a, b)
forall a. Vector a -> Int -> a
VB.unsafeIndex Vector (a, b)
x (Int -> b) -> Int -> b
forall a b. (a -> b) -> a -> b
$ Int
0)) (Vector (a, b) -> Maybe (([a], b), Vector (a, b)))
-> Vector (a, b) -> Maybe (([a], b), Vector (a, b))
forall a b. (a -> b) -> a -> b
$ Vector (a, b)
x in 
                    (if Bool
y then (([Int], a) -> ([Int16], a))
-> Vector ([Int], a) -> UniquenessGeneral2 a
forall a b. (a -> b) -> Vector a -> Vector b
VB.map (\([Int]
js,a
t) -> ((Int -> Int16) -> [Int] -> [Int16]
forall a b. (a -> b) -> [a] -> [b]
map Int -> Int16
forall a. Enum a => Int -> a
toEnum [Int]
js,a
t)) (Vector ([Int], a) -> UniquenessGeneral2 a)
-> (Vector ([Int], a) -> Vector ([Int], a))
-> Vector ([Int], a)
-> UniquenessGeneral2 a
forall b c a. (b -> c) -> (a -> b) -> a -> c
. (([Int], a) -> Bool) -> Vector ([Int], a) -> Vector ([Int], a)
forall a. (a -> Bool) -> Vector a -> Vector a
VB.filter (\([Int]
ys,!a
zs) -> Bool -> Bool
not ([Int] -> Bool
forall (t :: * -> *) a. Foldable t => t a -> Bool
null [Int]
ys) Bool -> Bool -> Bool
&& a
zs a -> [a] -> Bool
forall (t :: * -> *) a. (Foldable t, Eq a) => a -> t a -> Bool
`notElem` [a]
whspss) else (([Int], a) -> ([Int16], a))
-> Vector ([Int], a) -> UniquenessGeneral2 a
forall a b. (a -> b) -> Vector a -> Vector b
VB.map (\([Int]
js,a
t) -> ((Int -> Int16) -> [Int] -> [Int16]
forall a b. (a -> b) -> [a] -> [b]
map Int -> Int16
forall a. Enum a => Int -> a
toEnum [Int]
js,a
t))) (Vector ([Int], a) -> UniquenessGeneral2 a)
-> (Vector (Int, a) -> Vector ([Int], a))
-> Vector (Int, a)
-> UniquenessGeneral2 a
forall b c a. (b -> c) -> (a -> b) -> a -> c
. (Vector (Int, a) -> Maybe (([Int], a), Vector (Int, a)))
-> Vector (Int, a) -> Vector ([Int], a)
forall b a. (b -> Maybe (a, b)) -> b -> Vector a
VB.unfoldr Vector (Int, a) -> Maybe (([Int], a), Vector (Int, a))
forall a b.
(Num a, Eq b) =>
Vector (a, b) -> Maybe (([a], b), Vector (a, b))
f (Vector (Int, a) -> UniquenessGeneral2 a)
-> Vector (Int, a) -> UniquenessGeneral2 a
forall a b. (a -> b) -> a -> b
$ Vector (Int, a)
v1

-- | List of 'Int16' in the result is a list of distances between the consequential occurrences of the @a@ (usually, @a@ is a sound representation or its duration)
-- in the given 'VB.Vector'. But unlikely the 'uniquenessPeriodsVector2' function it finds out only the distances for the repeated not \"whitespece symbols\" 
-- occurring in different sublists separated with these \"whitespace symbols\". Therefore, it is much more perceptable for the words order than the former one. 
-- The resulting 'VB.Vector' is sorted in the order of the first occurrence of each of 
-- the @a@ (usually, @a@ is the sound representation or its duration, or some other its characteristics) in the given second argument.
uniquenessPeriodsVector3 :: Eq a => [a] -> VB.Vector a -> UniquenessGeneral2 a
uniquenessPeriodsVector3 :: [a] -> Vector a -> UniquenessGeneral2 a
uniquenessPeriodsVector3 [a]
whspss Vector a
v 
 | Vector a -> Bool
forall a. Vector a -> Bool
VB.null Vector a
v = UniquenessGeneral2 a
forall a. Vector a
VB.empty
 | Bool
otherwise = let !v1 :: Vector (Int, a)
v1 = Vector a -> Vector (Int, a)
forall a. Vector a -> Vector (Int, a)
VB.indexed Vector a
v in let !vs :: [Int16]
vs = Vector Int16 -> [Int16]
forall a. Vector a -> [a]
VB.toList (Vector Int16 -> [Int16])
-> (Vector a -> Vector Int16) -> Vector a -> [Int16]
forall b c a. (b -> c) -> (a -> b) -> a -> c
. (Int -> Int16) -> Vector Int -> Vector Int16
forall a b. (a -> b) -> Vector a -> Vector b
VB.map Int -> Int16
forall a. Enum a => Int -> a
toEnum (Vector Int -> Vector Int16)
-> (Vector a -> Vector Int) -> Vector a -> Vector Int16
forall b c a. (b -> c) -> (a -> b) -> a -> c
. (a -> Bool) -> Vector a -> Vector Int
forall a. (a -> Bool) -> Vector a -> Vector Int
VB.findIndices (a -> [a] -> Bool
forall (t :: * -> *) a. (Foldable t, Eq a) => a -> t a -> Bool
`elem` [a]
whspss) (Vector a -> [Int16]) -> Vector a -> [Int16]
forall a b. (a -> b) -> a -> b
$ Vector a
v in 
    let f :: Vector (Int16, b) -> Maybe (([Int16], b), Vector (Int16, b))
f !Vector (Int16, b)
x = if Vector (Int16, b) -> Bool
forall a. Vector a -> Bool
VB.null Vector (Int16, b)
x then Maybe (([Int16], b), Vector (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) -> (Int -> (Int16, b)) -> Int -> b
forall b c a. (b -> c) -> (a -> b) -> a -> c
. Vector (Int16, b) -> Int -> (Int16, b)
forall a. Vector a -> Int -> a
VB.unsafeIndex Vector (Int16, b)
x (Int -> b) -> Int -> b
forall a b. (a -> b) -> a -> b
$ Int
0 in (([Int16], b), Vector (Int16, b))
-> Maybe (([Int16], b), Vector (Int16, b))
forall a. a -> Maybe a
Just ((([Int16], b), Vector (Int16, b))
 -> Maybe (([Int16], b), Vector (Int16, b)))
-> (Vector (Int16, b) -> (([Int16], b), Vector (Int16, b)))
-> Vector (Int16, b)
-> Maybe (([Int16], b), Vector (Int16, b))
forall b c a. (b -> c) -> (a -> b) -> a -> c
. (\[Int16]
vws (Vector (Int16, b)
v2,Vector (Int16, b)
v3) -> (([Int16] -> [Int16] -> [Int16] -> [Int16]
helpUPV3 [Int16]
vws [] ([Int16] -> [Int16])
-> (Vector (Int16, b) -> [Int16]) -> Vector (Int16, b) -> [Int16]
forall b c a. (b -> c) -> (a -> b) -> a -> c
. Vector Int16 -> [Int16]
forall a. Vector a -> [a]
VB.toList (Vector Int16 -> [Int16])
-> (Vector (Int16, b) -> Vector Int16)
-> Vector (Int16, b)
-> [Int16]
forall b c a. (b -> c) -> (a -> b) -> a -> c
. ((Int16, b) -> Int16) -> Vector (Int16, b) -> Vector Int16
forall a b. (a -> b) -> Vector a -> Vector b
VB.map (Int16, b) -> Int16
forall a b. (a, b) -> a
fst (Vector (Int16, b) -> [Int16]) -> Vector (Int16, b) -> [Int16]
forall a b. (a -> b) -> a -> b
$ Vector (Int16, b)
v2,(Int16, b) -> b
forall a b. (a, b) -> b
snd ((Int16, b) -> b) -> (Int -> (Int16, b)) -> Int -> b
forall b c a. (b -> c) -> (a -> b) -> a -> c
. 
                  Vector (Int16, b) -> Int -> (Int16, b)
forall a. Vector a -> Int -> a
VB.unsafeIndex Vector (Int16, b)
v2 (Int -> b) -> Int -> b
forall a b. (a -> b) -> a -> b
$ Int
0),Vector (Int16, b)
v3)) [Int16]
vs ((Vector (Int16, b), Vector (Int16, b))
 -> (([Int16], b), Vector (Int16, b)))
-> (Vector (Int16, b) -> (Vector (Int16, b), Vector (Int16, b)))
-> Vector (Int16, b)
-> (([Int16], b), Vector (Int16, b))
forall b c a. (b -> c) -> (a -> b) -> a -> c
. ((Int16, b) -> Bool)
-> Vector (Int16, b) -> (Vector (Int16, b), Vector (Int16, b))
forall a. (a -> Bool) -> Vector a -> (Vector a, Vector a)
VB.partition (\(Int16
_,b
xs) -> b
xs b -> b -> Bool
forall a. Eq a => a -> a -> Bool
== b
idX0) (Vector (Int16, b) -> Maybe (([Int16], b), Vector (Int16, b)))
-> Vector (Int16, b) -> Maybe (([Int16], b), Vector (Int16, b))
forall a b. (a -> b) -> a -> b
$ Vector (Int16, b)
x in 
                    (([Int16], a) -> Bool)
-> UniquenessGeneral2 a -> UniquenessGeneral2 a
forall a. (a -> Bool) -> Vector a -> Vector a
VB.filter (\([Int16]
ys,!a
zs) -> Bool -> Bool
not ([Int16] -> Bool
forall (t :: * -> *) a. Foldable t => t a -> Bool
null [Int16]
ys) Bool -> Bool -> Bool
&& (a
zs a -> [a] -> Bool
forall (t :: * -> *) a. (Foldable t, Eq a) => a -> t a -> Bool
`notElem` [a]
whspss)) (UniquenessGeneral2 a -> UniquenessGeneral2 a)
-> (Vector (Int, a) -> UniquenessGeneral2 a)
-> Vector (Int, a)
-> UniquenessGeneral2 a
forall b c a. (b -> c) -> (a -> b) -> a -> c
. (Vector (Int16, a) -> Maybe (([Int16], a), Vector (Int16, a)))
-> Vector (Int16, a) -> UniquenessGeneral2 a
forall b a. (b -> Maybe (a, b)) -> b -> Vector a
VB.unfoldr Vector (Int16, a) -> Maybe (([Int16], a), Vector (Int16, a))
forall b.
Eq b =>
Vector (Int16, b) -> Maybe (([Int16], b), Vector (Int16, b))
f (Vector (Int16, a) -> UniquenessGeneral2 a)
-> (Vector (Int, a) -> Vector (Int16, a))
-> Vector (Int, a)
-> UniquenessGeneral2 a
forall b c a. (b -> c) -> (a -> b) -> a -> c
. ((Int, a) -> (Int16, a)) -> Vector (Int, a) -> Vector (Int16, a)
forall a b. (a -> b) -> Vector a -> Vector b
VB.map (\(Int
j,a
t) -> (Int -> Int16
forall a. Enum a => Int -> a
toEnum Int
j,a
t)) (Vector (Int, a) -> UniquenessGeneral2 a)
-> Vector (Int, a) -> UniquenessGeneral2 a
forall a b. (a -> b) -> a -> b
$ Vector (Int, a)
v1

-- | Is used inside the 'uniquenessPeriodsVector3'. The first and the third list arguments of non-negative 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