Contents Index

Org.Org.Semantic.HBase.Basic.List

Synopsis

class HasNothing a => Concatenatable a where concatenate :: a -> a -> a concatenateList :: [a] -> a (++) :: Concatenatable a => a -> a -> a class (Concatenatable list, HasSize Int list) => List elem list | list -> elem where fromList :: [elem] -> list toList :: list -> [elem] splitFirst :: list -> Maybe (elem, list) last :: list -> Maybe elem fetchElement :: Int -> list -> elem take :: Int -> list -> list drop :: Int -> list -> list splitAt :: Int -> list -> (list, list) any :: (elem -> Bool) -> list -> Bool all :: (elem -> Bool) -> list -> Bool nubBy :: ?comp :: Equivalence elem => list -> list deleteBy :: ?comp :: Equivalence elem => elem -> list -> list unionBy :: ?comp :: Equivalence elem => list -> list -> list intersectBy :: ?comp :: Equivalence elem => list -> list -> list nub :: (List elem list, Eq elem) => list -> list delete :: (List elem list, Eq elem) => elem -> list -> list (!!) :: List elem list => list -> Int -> elem first :: List elem list => list -> Maybe elem rest :: List elem list => list -> Maybe list hasElement :: Eq elem => elem -> [elem] -> Bool

Documentation

class HasNothing a => Concatenatable a where

Methods concatenate :: a -> a -> a This must be associative. concatenateList :: [a] -> a Instances Concatenatable (a -> a) Concatenatable [a] Monad m => Concatenatable (a -> m a) Concatenatable (ArrayList a)

(++) :: Concatenatable a => a -> a -> a

same as concatenate

class (Concatenatable list, HasSize Int list) => List elem list | list -> elem where

Methods fromList :: [elem] -> list toList :: list -> [elem] splitFirst :: list -> Maybe (elem, list) Return Just first and rest for a non-empty list, and Nothing for an empty list. last :: list -> Maybe elem Return Just last for a non-empty list, and Nothing for an empty list. fetchElement :: Int -> list -> elem Fetch an element by count, zero is the first element. take :: Int -> list -> list Get the first n elements of a list. drop :: Int -> list -> list Get all but the first n elements of a list. splitAt :: Int -> list -> (list, list) Much like take and drop together. any :: (elem -> Bool) -> list -> Bool Does any element match a test? all :: (elem -> Bool) -> list -> Bool Do all elements match a test? nubBy :: ?comp :: Equivalence elem => list -> list deleteBy :: ?comp :: Equivalence elem => elem -> list -> list unionBy :: ?comp :: Equivalence elem => list -> list -> list intersectBy :: ?comp :: Equivalence elem => list -> list -> list Instances List a [a] List a (ArrayList a)

nub :: (List elem list, Eq elem) => list -> list

delete :: (List elem list, Eq elem) => elem -> list -> list

(!!) :: List elem list => list -> Int -> elem

first :: List elem list => list -> Maybe elem

rest :: List elem list => list -> Maybe list

hasElement :: Eq elem => elem -> [elem] -> Bool

should probablly be generalised

Produced by Haddock version 0.6