hw-fingertree-strict-0.1.0.0: Generic strict finger-tree structure
HaskellWorks.Data.Item.Strict
data Item k a Source #
Constructors
Instances
Methods
measure :: Item k a -> k Source #
fmap :: (a -> b) -> Item k a -> Item k b #
(<$) :: a -> Item k b -> Item k a #
fold :: Monoid m => Item k m -> 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 #
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) #
(==) :: Item k a -> Item k a -> Bool #
(/=) :: Item k a -> Item k a -> Bool #
showsPrec :: Int -> Item k a -> ShowS #
show :: Item k a -> String #
showList :: [Item k a] -> ShowS #