HaskellWorks.Data.BalancedParens.FindClose

Documentation

class FindClose v where

Methods

findClose :: v -> Count -> Maybe Count

Find the closing parenthesis that machines the open parenthesis at the current position.

If the parenthesis at the current position is an close parenthesis, then return the current position.

Indexes are 1-based. 1 corresponds to open and 0 corresponds to close.

If we run out of bits in the supplied bit-string, the implementation my either return Nothing, or assume all the bits that follow are zeros.

>>> :set -XTypeApplications
>>> import Data.Maybe
>>> import HaskellWorks.Data.Bits.BitRead
>>> findClose (fromJust (bitRead @Word64 "00000000")) 1
Just 1
>>> findClose (fromJust (bitRead @Word64 "10101010")) 1
Just 2
>>> findClose (fromJust (bitRead @Word64 "10101010")) 2
Just 2
>>> findClose (fromJust (bitRead @Word64 "10101010")) 3
Just 4
>>> findClose (fromJust (bitRead @Word64 "11010010")) 1
Just 6
>>> findClose (fromJust (bitRead @Word64 "11110000")) 1
Just 8

Instances

FindClose Word16

Defined in HaskellWorks.Data.BalancedParens.FindClose

Methods

findClose :: Word16 -> Count -> Maybe Count

FindClose Word32

Defined in HaskellWorks.Data.BalancedParens.FindClose

Methods

findClose :: Word32 -> Count -> Maybe Count

FindClose Word64

Defined in HaskellWorks.Data.BalancedParens.FindClose

Methods

findClose :: Word64 -> Count -> Maybe Count

FindClose Word8

Defined in HaskellWorks.Data.BalancedParens.FindClose

Methods

findClose :: Word8 -> Count -> Maybe Count

(BitLength a, CloseAt a, NewCloseAt a, FindCloseN a) => FindClose (RangeMin a)

Defined in HaskellWorks.Data.BalancedParens.RangeMin

Methods

findClose :: RangeMin a -> Count -> Maybe Count

(BitLength a, NewCloseAt a, CloseAt a, FindCloseN a) => FindClose (RangeMin2 a)

Defined in HaskellWorks.Data.BalancedParens.RangeMin2

Methods

findClose :: RangeMin2 a -> Count -> Maybe Count

FindClose a => FindClose (SimpleBalancedParens a)

Defined in HaskellWorks.Data.BalancedParens.Simple

Methods

findClose :: SimpleBalancedParens a -> Count -> Maybe Count

FindClose a => FindClose (BitShown a)

Defined in HaskellWorks.Data.BalancedParens.FindClose

Methods

findClose :: BitShown a -> Count -> Maybe Count

FindClose (Broadword Word64)

Defined in HaskellWorks.Data.BalancedParens.FindClose

Methods

findClose :: Broadword Word64 -> Count -> Maybe Count

FindClose (Naive Word64)

Defined in HaskellWorks.Data.BalancedParens.FindClose

Methods

findClose :: Naive Word64 -> Count -> Maybe Count

FindClose (Naive (Vector Word16))

Defined in HaskellWorks.Data.BalancedParens.FindClose

Methods

findClose :: Naive (Vector Word16) -> Count -> Maybe Count

FindClose (Naive (Vector Word32))

Defined in HaskellWorks.Data.BalancedParens.FindClose

Methods

findClose :: Naive (Vector Word32) -> Count -> Maybe Count

FindClose (Naive (Vector Word64))

Defined in HaskellWorks.Data.BalancedParens.FindClose

Methods

findClose :: Naive (Vector Word64) -> Count -> Maybe Count

FindClose (Naive (Vector Word8))

Defined in HaskellWorks.Data.BalancedParens.FindClose

Methods

findClose :: Naive (Vector Word8) -> Count -> Maybe Count

FindClose (Vector Word16)

Defined in HaskellWorks.Data.BalancedParens.FindClose

Methods

findClose :: Vector Word16 -> Count -> Maybe Count

FindClose (Vector Word32)

Defined in HaskellWorks.Data.BalancedParens.FindClose

Methods

findClose :: Vector Word32 -> Count -> Maybe Count

FindClose (Vector Word64)

Defined in HaskellWorks.Data.BalancedParens.FindClose

Methods

findClose :: Vector Word64 -> Count -> Maybe Count

FindClose (Vector Word8)

Defined in HaskellWorks.Data.BalancedParens.FindClose

Methods

findClose :: Vector Word8 -> Count -> Maybe Count

FindClose [Bool]

Defined in HaskellWorks.Data.BalancedParens.FindClose

Methods

findClose :: [Bool] -> Count -> Maybe Count