hw-fingertree-strict-0.1.2.1: Generic strict finger-tree structure
Safe HaskellSafe-Inferred
LanguageHaskell2010

HaskellWorks.Data.Item.Strict

Documentation

data Item k a Source #

Constructors

Item !k !a 

Instances

Instances details
Monoid k => Measured k (Item k a) Source # 
Instance details

Defined in HaskellWorks.Data.Item.Strict

Methods

measure :: Item k a -> k Source #

Functor (Item k) Source # 
Instance details

Defined in HaskellWorks.Data.Item.Strict

Methods

fmap :: (a -> b) -> Item k a -> Item k b #

(<$) :: a -> Item k b -> Item k a #

Foldable (Item k) Source # 
Instance details

Defined in HaskellWorks.Data.Item.Strict

Methods

fold :: Monoid m => Item k m -> m #

foldMap :: Monoid m => (a -> m) -> Item k a -> m #

foldMap' :: Monoid m => (a -> m) -> Item k a -> m #

foldr :: (a -> b -> b) -> b -> Item k a -> b #

foldr' :: (a -> b -> b) -> b -> Item k a -> b #

foldl :: (b -> a -> b) -> b -> Item k a -> b #

foldl' :: (b -> a -> b) -> b -> Item k a -> b #

foldr1 :: (a -> a -> a) -> Item k a -> a #

foldl1 :: (a -> a -> a) -> Item k a -> a #

toList :: Item k a -> [a] #

null :: Item k a -> Bool #

length :: Item k a -> Int #

elem :: Eq a => a -> Item k a -> Bool #

maximum :: Ord a => Item k a -> a #

minimum :: Ord a => Item k a -> a #

sum :: Num a => Item k a -> a #

product :: Num a => Item k a -> a #

Traversable (Item k) Source # 
Instance details

Defined in HaskellWorks.Data.Item.Strict

Methods

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

sequenceA :: Applicative f => Item k (f a) -> f (Item k a) #

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

sequence :: Monad m => Item k (m a) -> m (Item k a) #

(Eq k, Eq a) => Eq (Item k a) Source # 
Instance details

Defined in HaskellWorks.Data.Item.Strict

Methods

(==) :: Item k a -> Item k a -> Bool #

(/=) :: Item k a -> Item k a -> Bool #

(Show k, Show a) => Show (Item k a) Source # 
Instance details

Defined in HaskellWorks.Data.Item.Strict

Methods

showsPrec :: Int -> Item k a -> ShowS #

show :: Item k a -> String #

showList :: [Item k a] -> ShowS #

Generic (Item k a) Source # 
Instance details

Defined in HaskellWorks.Data.Item.Strict

Associated Types

type Rep (Item k a) :: Type -> Type #

Methods

from :: Item k a -> Rep (Item k a) x #

to :: Rep (Item k a) x -> Item k a #

(NFData k, NFData a) => NFData (Item k a) Source # 
Instance details

Defined in HaskellWorks.Data.Item.Strict

Methods

rnf :: Item k a -> () #

type Rep (Item k a) Source # 
Instance details

Defined in HaskellWorks.Data.Item.Strict

type Rep (Item k a) = D1 ('MetaData "Item" "HaskellWorks.Data.Item.Strict" "hw-fingertree-strict-0.1.2.1-C1YknkV63pgCyck4MB6Ci9" 'False) (C1 ('MetaCons "Item" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 k) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 a)))