| Copyright | (c) 2021 Rudy Matela |
|---|---|
| License | 3-Clause BSD (see the file LICENSE) |
| Maintainer | Rudy Matela <rudy@matela.com.br> |
| Safe Haskell | None |
| Language | Haskell2010 |
Conjure.Utils
Description
Synopsis
- module Data.List
- module Data.Function
- module Data.Maybe
- module Data.Monoid
- module Data.Tuple
- module Data.Typeable
- count :: (a -> Bool) -> [a] -> Int
- nubOn :: Eq b => (a -> b) -> [a] -> [a]
- nubSort :: Ord a => [a] -> [a]
- iterateUntil :: (a -> a -> Bool) -> (a -> a) -> a -> a
- mzip :: Monoid a => [a] -> [a] -> [a]
- groupOn :: Eq b => (a -> b) -> [a] -> [[a]]
- takeUntil :: (a -> Bool) -> [a] -> [a]
- takeNextWhile :: (a -> a -> Bool) -> [a] -> [a]
- takeNextUntil :: (a -> a -> Bool) -> [a] -> [a]
- deconstructions :: (a -> Bool) -> (a -> a) -> a -> [a]
- isDeconstruction :: [a] -> (a -> Bool) -> (a -> a) -> Bool
- idIO :: (a -> IO ()) -> a -> a
- mapHead :: (a -> a) -> [a] -> [a]
- sets :: [a] -> [[a]]
- headOr :: a -> [a] -> a
- allEqual :: Eq a => [a] -> Bool
- choices :: [a] -> [(a, [a])]
- choicesThat :: (a -> [a] -> Bool) -> [a] -> [(a, [a])]
- filterAnd :: (a -> Bool) -> [a] -> ([a], Bool)
Documentation
module Data.List
module Data.Function
module Data.Maybe
module Data.Monoid
module Data.Tuple
module Data.Typeable
iterateUntil :: (a -> a -> Bool) -> (a -> a) -> a -> a Source #
takeNextWhile :: (a -> a -> Bool) -> [a] -> [a] Source #
takeNextUntil :: (a -> a -> Bool) -> [a] -> [a] Source #
deconstructions :: (a -> Bool) -> (a -> a) -> a -> [a] Source #
isDeconstruction :: [a] -> (a -> Bool) -> (a -> a) -> Bool Source #
The deconstruction is considered valid if it converges for more than half of the given values.
idIO :: (a -> IO ()) -> a -> a Source #
WARNING:
uses unsafePerformIO and should only be used for debugging!
> idIO print 10 10 10
choicesThat :: (a -> [a] -> Bool) -> [a] -> [(a, [a])] Source #