hw-balancedparens-0.2.0.2: Balanced parentheses

Safe HaskellNone
LanguageHaskell2010

HaskellWorks.Data.BalancedParens.FindOpen

Documentation

class FindOpen v where Source #

Minimal complete definition

findOpen

Methods

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

Instances
FindOpen Word8 Source # 
Instance details

Defined in HaskellWorks.Data.BalancedParens.FindOpen

FindOpen Word16 Source # 
Instance details

Defined in HaskellWorks.Data.BalancedParens.FindOpen

FindOpen Word32 Source # 
Instance details

Defined in HaskellWorks.Data.BalancedParens.FindOpen

FindOpen Word64 Source # 
Instance details

Defined in HaskellWorks.Data.BalancedParens.FindOpen

FindOpen [Bool] Source # 
Instance details

Defined in HaskellWorks.Data.BalancedParens.FindOpen

Methods

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

FindOpen a => FindOpen (BitShown a) Source # 
Instance details

Defined in HaskellWorks.Data.BalancedParens.FindOpen

FindOpen (Naive Word64) Source # 
Instance details

Defined in HaskellWorks.Data.BalancedParens.FindOpen

FindOpen (Vector Word8) Source # 
Instance details

Defined in HaskellWorks.Data.BalancedParens.FindOpen

FindOpen (Vector Word16) Source # 
Instance details

Defined in HaskellWorks.Data.BalancedParens.FindOpen

FindOpen (Vector Word32) Source # 
Instance details

Defined in HaskellWorks.Data.BalancedParens.FindOpen

FindOpen (Vector Word64) Source # 
Instance details

Defined in HaskellWorks.Data.BalancedParens.FindOpen

(OpenAt a, FindOpenN a) => FindOpen (RangeMinMax a) Source # 
Instance details

Defined in HaskellWorks.Data.BalancedParens.RangeMinMax

(OpenAt a, FindOpenN a) => FindOpen (RangeMinMax2 a) Source # 
Instance details

Defined in HaskellWorks.Data.BalancedParens.RangeMinMax2

FindOpen a => FindOpen (SimpleBalancedParens a) Source # 
Instance details

Defined in HaskellWorks.Data.BalancedParens.Simple