hw-balancedparens-0.2.0.2: Balanced parentheses

Safe HaskellNone
LanguageHaskell2010

HaskellWorks.Data.BalancedParens.FindOpenN

Documentation

class FindOpenN v where Source #

Minimal complete definition

findOpenN

Methods

findOpenN :: v -> Count -> Count -> Maybe Count Source #

Instances
FindOpenN Word8 Source # 
Instance details

Defined in HaskellWorks.Data.BalancedParens.FindOpenN

FindOpenN Word16 Source # 
Instance details

Defined in HaskellWorks.Data.BalancedParens.FindOpenN

FindOpenN Word32 Source # 
Instance details

Defined in HaskellWorks.Data.BalancedParens.FindOpenN

FindOpenN Word64 Source # 
Instance details

Defined in HaskellWorks.Data.BalancedParens.FindOpenN

FindOpenN [Bool] Source # 
Instance details

Defined in HaskellWorks.Data.BalancedParens.FindOpenN

Methods

findOpenN :: [Bool] -> Count -> Count -> Maybe Count Source #

(BitLength a, OpenAt a, TestBit a) => FindOpenN (BitShown a) Source # 
Instance details

Defined in HaskellWorks.Data.BalancedParens.FindOpenN

FindOpenN (Naive Word64) Source # 
Instance details

Defined in HaskellWorks.Data.BalancedParens.FindOpenN

FindOpenN (Vector Word8) Source # 
Instance details

Defined in HaskellWorks.Data.BalancedParens.FindOpenN

FindOpenN (Vector Word16) Source # 
Instance details

Defined in HaskellWorks.Data.BalancedParens.FindOpenN

FindOpenN (Vector Word32) Source # 
Instance details

Defined in HaskellWorks.Data.BalancedParens.FindOpenN

FindOpenN (Vector Word64) Source # 
Instance details

Defined in HaskellWorks.Data.BalancedParens.FindOpenN

FindOpenN a => FindOpenN (RangeMinMax a) Source # 
Instance details

Defined in HaskellWorks.Data.BalancedParens.RangeMinMax

FindOpenN a => FindOpenN (RangeMinMax2 a) Source # 
Instance details

Defined in HaskellWorks.Data.BalancedParens.RangeMinMax2