ClassyPrelude.Classes

Synopsis

• class CanMap ci co i o | ci -> i, co -> o, ci o -> co, co i -> ci where
  • map :: (i -> o) -> ci -> co
• class CanConcatMap ci co i o | ci -> i, co -> o, ci o -> co, co i -> ci where
  • concatMap :: (i -> o) -> ci -> co
• class CanFilter c i | c -> i where
  • filter :: (i -> Bool) -> c -> c
• class CanFilterM c i | c -> i where
  • filterM :: Monad m => (i -> m Bool) -> c -> m c
• class CanLength c len | c -> len where
  • length :: c -> len
• class CanSingleton c i | c -> i where
  • singleton :: i -> c
• class CanNull c where
  • null :: c -> Bool
• class CanPack c i | c -> i where
  • pack :: [i] -> c
  • unpack :: c -> [i]
  • subsequences :: c -> [c]
  • permutations :: c -> [c]
• class CanIntersperse c i | c -> i where
  • intersperse :: i -> c -> c
• class Monad m => CanMapM ci mco m i o | ci -> i, mco -> m o, ci o m -> mco, mco i -> ci where
  • mapM :: (i -> m o) -> ci -> mco
• class CanMapM_ ci i | ci -> i where
  • mapM_ :: Monad m => (i -> m o) -> ci -> m ()
• class CanReplicateM c i len | c -> i len where
  • replicateM :: Monad m => len -> m i -> m c
• class CanLookup c k v | c -> k v where
  • lookup :: k -> c -> Maybe v
• class CanInsert f where
  • insert :: f
• class CanInsertVal c k v | c -> k v where
  • insertVal :: k -> v -> c -> c
• class CanDelete f where
  • delete :: f
• class CanDeleteVal c k | c -> k where
  • deleteVal :: k -> c -> c
• class CanMember c k | c -> k where
  • member :: k -> c -> Bool
  • notMember :: k -> c -> Bool
• class CanReadFile a where
  • readFile :: MonadIO m => FilePath -> m a
• class CanWriteFile a where
  • writeFile :: MonadIO m => FilePath -> a -> m ()
• class CanStripPrefix a where
  • stripPrefix :: a -> a -> Maybe a
  • isPrefixOf :: a -> a -> Bool
• class CanBreak c i | c -> i where
  • break :: (i -> Bool) -> c -> (c, c)
  • span :: (i -> Bool) -> c -> (c, c)
  • dropWhile :: (i -> Bool) -> c -> c
  • takeWhile :: (i -> Bool) -> c -> c
• class CanAny c i | c -> i where
  • any :: (i -> Bool) -> c -> Bool
  • all :: (i -> Bool) -> c -> Bool
• class CanSplitAt c i | c -> i where
  • splitAt :: i -> c -> (c, c)
• class CanFold c i accum | c -> i where
  • fold :: (accum -> i -> accum) -> accum -> c -> accum
• class CanWords t where
  • words :: t -> [t]
  • unwords :: [t] -> t
• class CanLines t where
  • lines :: t -> [t]
• class CanUnlines t where
  • unlines :: [t] -> t
• class CanSplit c i | c -> i where
  • split :: (i -> Bool) -> c -> [c]
• class CanStripSuffix a where
  • stripSuffix :: a -> a -> Maybe a
  • isSuffixOf :: a -> a -> Bool
• class CanIsInfixOf a where
  • isInfixOf :: a -> a -> Bool
• class CanReverse a where
  • reverse :: a -> a
• class CanReplicate a i len | a -> i len where
  • replicate :: len -> i -> a
• class CanToChunks c i | c -> i, i -> c where
  • toChunks :: c -> [i]
  • fromChunks :: [i] -> c
• class CanEncodeUtf8 ci co | co -> ci, ci -> co where
  • encodeUtf8 :: ci -> co
• class CanDecodeUtf8 ci co | co -> ci, ci -> co where
  • decodeUtf8 :: ci -> co
• class CanToStrict a b where
  • toStrict :: a -> b
  • fromStrict :: b -> a
• class CanGetLine a where
  • getLine :: a
• class CanToLower a where
  • toLower :: a -> a
• class CanToUpper a where
  • toUpper :: a -> a
• class CanToCaseFold a where
  • toCaseFold :: a -> a
• class CanFind c i | c -> i where
  • find :: (i -> Bool) -> c -> Maybe i
• class CanConcat c i | c -> i where
  • concat :: c -> i
• class CanPartition c i | c -> i where
  • partition :: (i -> Bool) -> c -> (c, c)
• class CanNubBy c i | c -> i where
  • nubBy :: (i -> i -> Bool) -> c -> c
  • nub :: (Ord i, CanNubBy c i) => c -> c
• class CanUnion c where
  • union :: c -> c -> c
• class CanDifference c where
  • difference :: c -> c -> c
• class CanIntersection c where
  • intersection :: c -> c -> c
• class CanSortBy c a | c -> a where
  • sortBy :: (a -> a -> Ordering) -> c -> c
• class Ord a => CanSort c a | c -> a where
  • sort :: c -> c
• class CanCons c a where
  • cons :: a -> c -> c
• class CanUncons c a where
  • uncons :: c -> Maybe (a, c)
• class CanCompareLength c where
  • compareLength :: Integral l => c -> l -> Ordering
• class CanGroupBy c a | c -> a where
  • groupBy :: (a -> a -> Bool) -> c -> [c]
• class CanGroupBy' c a | c -> a where
  • groupBy' :: (a -> a -> Bool) -> c -> [c]
• class CanGroup c a | c -> a where
  • group :: c -> [c]
• class CanGroup' c a | c -> a where
  • group' :: c -> [c]
• class CanRepeat c a | c -> a where
  • repeat :: a -> c
• class CanZipWith c1 i1 c2 i2 c3 i3 | c1 -> i1, c2 -> i2, c3 -> i3 where
  • zipWith :: (i1 -> i2 -> i3) -> c1 -> c2 -> c3
• class CanZipWith3 c1 i1 c2 i2 c3 i3 c4 i4 | c1 -> i1, c2 -> i2, c3 -> i3, c4 -> i4 where
  • zipWith3 :: (i1 -> i2 -> i3 -> i4) -> c1 -> c2 -> c3 -> c4
• class CanZipWith4 c1 i1 c2 i2 c3 i3 c4 i4 c5 i5 | c1 -> i1, c2 -> i2, c3 -> i3, c4 -> i4, c5 -> i5 where
  • zipWith4 :: (i1 -> i2 -> i3 -> i4 -> i5) -> c1 -> c2 -> c3 -> c4 -> c5
• class CanZipWith5 c1 i1 c2 i2 c3 i3 c4 i4 c5 i5 c6 i6 | c1 -> i1, c2 -> i2, c3 -> i3, c4 -> i4, c5 -> i5, c6 -> i6 where
  • zipWith5 :: (i1 -> i2 -> i3 -> i4 -> i5 -> i6) -> c1 -> c2 -> c3 -> c4 -> c5 -> c6
• class CanZipWith6 c1 i1 c2 i2 c3 i3 c4 i4 c5 i5 c6 i6 c7 i7 | c1 -> i1, c2 -> i2, c3 -> i3, c4 -> i4, c5 -> i5, c6 -> i6, c7 -> i7 where
  • zipWith6 :: (i1 -> i2 -> i3 -> i4 -> i5 -> i6 -> i7) -> c1 -> c2 -> c3 -> c4 -> c5 -> c6 -> c7
• class CanZipWith7 c1 i1 c2 i2 c3 i3 c4 i4 c5 i5 c6 i6 c7 i7 c8 i8 | c1 -> i1, c2 -> i2, c3 -> i3, c4 -> i4, c5 -> i5, c6 -> i6, c7 -> i7, c8 -> i8 where
  • zipWith7 :: (i1 -> i2 -> i3 -> i4 -> i5 -> i6 -> i7 -> i8) -> c1 -> c2 -> c3 -> c4 -> c5 -> c6 -> c7 -> c8
• class CanZip c1 i1 c2 i2 t | c1 -> i1, c2 -> i2 where
  • zip :: c1 -> c2 -> t (i1, i2)
• class CanZip3 c1 i1 c2 i2 c3 i3 t | c1 -> i1, c2 -> i2, c3 -> i3 where
  • zip3 :: c1 -> c2 -> c3 -> t (i1, i2, i3)
• class CanZip4 c1 i1 c2 i2 c3 i3 c4 i4 t | c1 -> i1, c2 -> i2, c3 -> i3, c4 -> i4 where
  • zip4 :: c1 -> c2 -> c3 -> c4 -> t (i1, i2, i3, i4)
• class CanZip5 c1 i1 c2 i2 c3 i3 c4 i4 c5 i5 t | c1 -> i1, c2 -> i2, c3 -> i3, c4 -> i4, c5 -> i5 where
  • zip5 :: c1 -> c2 -> c3 -> c4 -> c5 -> t (i1, i2, i3, i4, i5)
• class CanZip6 c1 i1 c2 i2 c3 i3 c4 i4 c5 i5 c6 i6 t | c1 -> i1, c2 -> i2, c3 -> i3, c4 -> i4, c5 -> i5, c6 -> i6 where
  • zip6 :: c1 -> c2 -> c3 -> c4 -> c5 -> c6 -> t (i1, i2, i3, i4, i5, i6)
• class CanZip7 c1 i1 c2 i2 c3 i3 c4 i4 c5 i5 c6 i6 c7 i7 t | c1 -> i1, c2 -> i2, c3 -> i3, c4 -> i4, c5 -> i5, c6 -> i6, c7 -> i7 where
  • zip7 :: c1 -> c2 -> c3 -> c4 -> c5 -> c6 -> c7 -> t (i1, i2, i3, i4, i5, i6, i7)
• class CanUnzip c1 i1 c2 i2 t | c1 -> i1, c2 -> i2 where
  • unzip :: t (i1, i2) -> (c1, c2)
• class CanUnzip3 c1 i1 c2 i2 c3 i3 t | c1 -> i1, c2 -> i2, c3 -> i3 where
  • unzip3 :: t (i1, i2, i3) -> (c1, c2, c3)
• class CanUnzip4 c1 i1 c2 i2 c3 i3 c4 i4 t | c1 -> i1, c2 -> i2, c3 -> i3, c4 -> i4 where
  • unzip4 :: t (i1, i2, i3, i4) -> (c1, c2, c3, c4)
• class CanUnzip5 c1 i1 c2 i2 c3 i3 c4 i4 c5 i5 t | c1 -> i1, c2 -> i2, c3 -> i3, c4 -> i4, c5 -> i5 where
  • unzip5 :: t (i1, i2, i3, i4, i5) -> (c1, c2, c3, c4, c5)
• class CanUnzip6 c1 i1 c2 i2 c3 i3 c4 i4 c5 i5 c6 i6 t | c1 -> i1, c2 -> i2, c3 -> i3, c4 -> i4, c5 -> i5, c6 -> i6 where
  • unzip6 :: t (i1, i2, i3, i4, i5, i6) -> (c1, c2, c3, c4, c5, c6)
• class CanUnzip7 c1 i1 c2 i2 c3 i3 c4 i4 c5 i5 c6 i6 c7 i7 t | c1 -> i1, c2 -> i2, c3 -> i3, c4 -> i4, c5 -> i5, c6 -> i6, c7 -> i7 where
  • unzip7 :: t (i1, i2, i3, i4, i5, i6, i7) -> (c1, c2, c3, c4, c5, c6, c7)
• class CanEmpty a where
  • empty :: a

Documentation