module HaskellWorks.Data.BalancedParens.Internal.Broadword.FindUnmatchedCloseFar.Vector64
  ( findUnmatchedCloseFar
  ) where

import Data.Int
import Data.Word
import HaskellWorks.Data.AtIndex
import HaskellWorks.Data.Bits.BitLength
import HaskellWorks.Data.Int.Unsigned
import HaskellWorks.Data.Positioning

import qualified Data.Vector.Storable                                                             as DVS
import qualified HaskellWorks.Data.BalancedParens.Internal.Broadword.FindUnmatchedCloseFar.Word64 as BWW64
import qualified HaskellWorks.Data.Drop                                                           as HW
import qualified HaskellWorks.Data.Length                                                         as HW

findUnmatchedCloseCont :: Int64 -> Count -> DVS.Vector Word64 -> Count
findUnmatchedCloseCont :: Int64 -> Count -> Vector Count -> Count
findUnmatchedCloseCont Int64
i Count
c Vector Count
v = if Int64
i Int64 -> Int64 -> Bool
forall a. Ord a => a -> a -> Bool
< Vector Count -> Int64
forall v. Length v => v -> Int64
HW.end Vector Count
v
  then case Count -> Count -> Count -> Count
BWW64.findUnmatchedCloseFar Count
c Count
0 Count
w of
    Count
q -> if Count
q Count -> Count -> Bool
forall a. Ord a => a -> a -> Bool
>= Count -> Count
forall v. BitLength v => v -> Count
bitLength Count
w
      then Int64 -> Count -> Vector Count -> Count
findUnmatchedCloseCont (Int64
i Int64 -> Int64 -> Int64
forall a. Num a => a -> a -> a
+ Int64
1) (Count
q Count -> Count -> Count
forall a. Num a => a -> a -> a
- Count -> Count
forall v. BitLength v => v -> Count
bitLength Count
w) Vector Count
v
      else Count
b Count -> Count -> Count
forall a. Num a => a -> a -> a
+ Count
q
  else Count
b Count -> Count -> Count
forall a. Num a => a -> a -> a
+ Count
c
  where b :: Count
b  = Int64 -> UnsignedOf Int64
forall a. Unsigned a => a -> UnsignedOf a
unsigned Int64
i Count -> Count -> Count
forall a. Num a => a -> a -> a
* Count -> Count
forall v. BitLength v => v -> Count
bitLength Count
w -- base
        w :: Elem (Vector Count)
w  = Vector Count
v Vector Count -> Int64 -> Elem (Vector Count)
forall v. AtIndex v => v -> Int64 -> Elem v
!!! Int64 -> Int64
forall a b. (Integral a, Num b) => a -> b
fromIntegral Int64
i
{-# INLINE findUnmatchedCloseCont #-}

findUnmatchedClose' :: Word64 -> Word64 -> DVS.Vector Word64 -> Count
findUnmatchedClose' :: Count -> Count -> Vector Count -> Count
findUnmatchedClose' Count
c Count
p Vector Count
v = if Vector Count -> Int
forall a. Storable a => Vector a -> Int
DVS.length Vector Count
v Int -> Int -> Bool
forall a. Ord a => a -> a -> Bool
> Int
0
    then case Count -> Count -> Count -> Count
BWW64.findUnmatchedCloseFar Count
c Count
p Count
w of
        Count
q -> if Count
q Count -> Count -> Bool
forall a. Ord a => a -> a -> Bool
>= Count -> Count
forall v. BitLength v => v -> Count
bitLength Count
w
          then Int64 -> Count -> Vector Count -> Count
findUnmatchedCloseCont Int64
1 (Count
q Count -> Count -> Count
forall a. Num a => a -> a -> a
- Count -> Count
forall v. BitLength v => v -> Count
bitLength Count
w) Vector Count
v
          else Count
q
    else Count
p Count -> Count -> Count
forall a. Num a => a -> a -> a
* Count
2 Count -> Count -> Count
forall a. Num a => a -> a -> a
+ Count
c
  where w :: Elem (Vector Count)
w  = Vector Count
v Vector Count -> Int64 -> Elem (Vector Count)
forall v. AtIndex v => v -> Int64 -> Elem v
!!! Int64
0
{-# INLINE findUnmatchedClose' #-}

findUnmatchedCloseFar :: Word64 -> Word64 -> DVS.Vector Word64 -> Count
findUnmatchedCloseFar :: Count -> Count -> Vector Count -> Count
findUnmatchedCloseFar Count
c Count
p Vector Count
v = Count -> Count -> Vector Count -> Count
findUnmatchedClose' Count
c (Count
p Count -> Count -> Count
forall a. Num a => a -> a -> a
- Count
vd) (Count -> Vector Count -> Vector Count
forall v. Drop v => Count -> v -> v
HW.drop Count
vi Vector Count
v) Count -> Count -> Count
forall a. Num a => a -> a -> a
+ Count
vd
  where vi :: Count
vi = Count
p Count -> Count -> Count
forall a. Integral a => a -> a -> a
`div` Vector Count -> Count
forall v. (AtIndex v, BitLength (Elem v)) => v -> Count
elemBitLength Vector Count
v
        vd :: Count
vd = Count
vi Count -> Count -> Count
forall a. Num a => a -> a -> a
* Vector Count -> Count
forall v. (AtIndex v, BitLength (Elem v)) => v -> Count
elemBitLength Vector Count
v
{-# INLINE findUnmatchedCloseFar #-}