hw-balancedparens-0.2.0.1: Balanced parentheses

Safe Haskell	None
Language	Haskell2010

HaskellWorks.Data.BalancedParens.FindOpenN

Documentation

class FindOpenN v where Source #

Minimal complete definition

Methods

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

Instances

FindOpenN Word8 Source #
Methods findOpenN :: Word8 -> Count -> Count -> Maybe Count Source #
FindOpenN Word16 Source #
Methods findOpenN :: Word16 -> Count -> Count -> Maybe Count Source #
FindOpenN Word32 Source #
Methods findOpenN :: Word32 -> Count -> Count -> Maybe Count Source #
FindOpenN Word64 Source #
Methods findOpenN :: Word64 -> Count -> Count -> Maybe Count Source #
FindOpenN [Bool] Source #
Methods findOpenN :: [Bool] -> Count -> Count -> Maybe Count Source #
(BitLength a, OpenAt a, TestBit a) => FindOpenN (BitShown a) Source #
Methods findOpenN :: BitShown a -> Count -> Count -> Maybe Count Source #
FindOpenN (Naive Word64) Source #
Methods findOpenN :: Naive Word64 -> Count -> Count -> Maybe Count Source #
FindOpenN (Vector Word8) Source #
Methods findOpenN :: Vector Word8 -> Count -> Count -> Maybe Count Source #
FindOpenN (Vector Word16) Source #
Methods findOpenN :: Vector Word16 -> Count -> Count -> Maybe Count Source #
FindOpenN (Vector Word32) Source #
Methods findOpenN :: Vector Word32 -> Count -> Count -> Maybe Count Source #
FindOpenN (Vector Word64) Source #
Methods findOpenN :: Vector Word64 -> Count -> Count -> Maybe Count Source #
FindOpenN a => FindOpenN (RangeMinMax a) Source #
Methods findOpenN :: RangeMinMax a -> Count -> Count -> Maybe Count Source #
FindOpenN a => FindOpenN (RangeMinMax2 a) Source #
Methods findOpenN :: RangeMinMax2 a -> Count -> Count -> Maybe Count Source #