Methods
empty :: Array i e #
singleton :: e -> Array i e #
cons :: e -> Array i e -> Array i e #
snoc :: Array i e -> e -> Array i e #
append :: Array i e -> Array i e -> Array i e #
head :: Array i e -> e #
uncons :: Array i e -> Maybe (e, Array i e) #
last :: Array i e -> e #
tail :: Array i e -> Array i e #
init :: Array i e -> Array i e #
null :: Array i e -> Bool #
length :: Array i e -> Int #
map :: ListLike full' item' => (e -> item') -> Array i e -> full' #
rigidMap :: (e -> e) -> Array i e -> Array i e #
reverse :: Array i e -> Array i e #
intersperse :: e -> Array i e -> Array i e #
concat :: (ListLike full' (Array i e), Monoid (Array i e)) => full' -> Array i e #
concatMap :: ListLike full' item' => (e -> full') -> Array i e -> full' #
rigidConcatMap :: (e -> Array i e) -> Array i e -> Array i e #
any :: (e -> Bool) -> Array i e -> Bool #
all :: (e -> Bool) -> Array i e -> Bool #
maximum :: Array i e -> e #
minimum :: Array i e -> e #
replicate :: Int -> e -> Array i e #
take :: Int -> Array i e -> Array i e #
drop :: Int -> Array i e -> Array i e #
splitAt :: Int -> Array i e -> (Array i e, Array i e) #
takeWhile :: (e -> Bool) -> Array i e -> Array i e #
dropWhile :: (e -> Bool) -> Array i e -> Array i e #
dropWhileEnd :: (e -> Bool) -> Array i e -> Array i e #
span :: (e -> Bool) -> Array i e -> (Array i e, Array i e) #
break :: (e -> Bool) -> Array i e -> (Array i e, Array i e) #
group :: (ListLike full' (Array i e), Eq e) => Array i e -> full' #
inits :: ListLike full' (Array i e) => Array i e -> full' #
tails :: ListLike full' (Array i e) => Array i e -> full' #
isPrefixOf :: Array i e -> Array i e -> Bool #
isSuffixOf :: Array i e -> Array i e -> Bool #
isInfixOf :: Array i e -> Array i e -> Bool #
stripPrefix :: Array i e -> Array i e -> Maybe (Array i e) #
stripSuffix :: Array i e -> Array i e -> Maybe (Array i e) #
elem :: e -> Array i e -> Bool #
notElem :: e -> Array i e -> Bool #
find :: (e -> Bool) -> Array i e -> Maybe e #
filter :: (e -> Bool) -> Array i e -> Array i e #
partition :: (e -> Bool) -> Array i e -> (Array i e, Array i e) #
index :: Array i e -> Int -> e #
elemIndex :: e -> Array i e -> Maybe Int #
elemIndices :: (Eq e, ListLike result Int) => e -> Array i e -> result #
findIndex :: (e -> Bool) -> Array i e -> Maybe Int #
findIndices :: ListLike result Int => (e -> Bool) -> Array i e -> result #
sequence :: (Monad m, ListLike fullinp (m e)) => fullinp -> m (Array i e) #
mapM :: (Monad m, ListLike full' item') => (e -> m item') -> Array i e -> m full' #
rigidMapM :: Monad m => (e -> m e) -> Array i e -> m (Array i e) #
nub :: Array i e -> Array i e #
delete :: e -> Array i e -> Array i e #
deleteFirsts :: Array i e -> Array i e -> Array i e #
union :: Array i e -> Array i e -> Array i e #
intersect :: Array i e -> Array i e -> Array i e #
sort :: Array i e -> Array i e #
insert :: e -> Array i e -> Array i e #
toList :: Array i e -> [e] #
fromList :: [e] -> Array i e #
fromListLike :: ListLike full' e => Array i e -> full' #
nubBy :: (e -> e -> Bool) -> Array i e -> Array i e #
deleteBy :: (e -> e -> Bool) -> e -> Array i e -> Array i e #
deleteFirstsBy :: (e -> e -> Bool) -> Array i e -> Array i e -> Array i e #
unionBy :: (e -> e -> Bool) -> Array i e -> Array i e -> Array i e #
intersectBy :: (e -> e -> Bool) -> Array i e -> Array i e -> Array i e #
groupBy :: (ListLike full' (Array i e), Eq e) => (e -> e -> Bool) -> Array i e -> full' #
sortBy :: (e -> e -> Ordering) -> Array i e -> Array i e #
insertBy :: (e -> e -> Ordering) -> e -> Array i e -> Array i e #
genericLength :: Num a => Array i e -> a #
genericTake :: Integral a => a -> Array i e -> Array i e #
genericDrop :: Integral a => a -> Array i e -> Array i e #
genericSplitAt :: Integral a => a -> Array i e -> (Array i e, Array i e) #
genericReplicate :: Integral a => a -> e -> Array i e #