hoodle-types-0.4: Data types for programs for hoodle file format

Copyright(c) 2011-2013,2015 Ian-Woo Kim
LicenseBSD3
MaintainerIan-Woo Kim <ianwookim@gmail.com>
Stabilityexperimental
PortabilityGHC
Safe HaskellNone
LanguageHaskell98

Data.Hoodle.Zipper

Description

representing selection of hoodle type

Synopsis

Documentation

type NonEmptyList a = (a, [a]) Source #

newtype SeqZipper a Source #

Constructors

SZ 

Fields

Instances

Functor SeqZipper Source # 

Methods

fmap :: (a -> b) -> SeqZipper a -> SeqZipper b #

(<$) :: a -> SeqZipper b -> SeqZipper a #

Applicative SeqZipper Source # 

Methods

pure :: a -> SeqZipper a #

(<*>) :: SeqZipper (a -> b) -> SeqZipper a -> SeqZipper b #

(*>) :: SeqZipper a -> SeqZipper b -> SeqZipper b #

(<*) :: SeqZipper a -> SeqZipper b -> SeqZipper a #

Foldable SeqZipper Source #

deriving instance Foldable SeqZipper

Methods

fold :: Monoid m => SeqZipper m -> m #

foldMap :: Monoid m => (a -> m) -> SeqZipper a -> m #

foldr :: (a -> b -> b) -> b -> SeqZipper a -> b #

foldr' :: (a -> b -> b) -> b -> SeqZipper a -> b #

foldl :: (b -> a -> b) -> b -> SeqZipper a -> b #

foldl' :: (b -> a -> b) -> b -> SeqZipper a -> b #

foldr1 :: (a -> a -> a) -> SeqZipper a -> a #

foldl1 :: (a -> a -> a) -> SeqZipper a -> a #

toList :: SeqZipper a -> [a] #

null :: SeqZipper a -> Bool #

length :: SeqZipper a -> Int #

elem :: Eq a => a -> SeqZipper a -> Bool #

maximum :: Ord a => SeqZipper a -> a #

minimum :: Ord a => SeqZipper a -> a #

sum :: Num a => SeqZipper a -> a #

product :: Num a => SeqZipper a -> a #

Traversable SeqZipper Source # 

Methods

traverse :: Applicative f => (a -> f b) -> SeqZipper a -> f (SeqZipper b) #

sequenceA :: Applicative f => SeqZipper (f a) -> f (SeqZipper a) #

mapM :: Monad m => (a -> m b) -> SeqZipper a -> m (SeqZipper b) #

sequence :: Monad m => SeqZipper (m a) -> m (SeqZipper a) #