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