Int -> [Int] -> Bool

elem :: Eq a => a -> [a] -> Bool
base Prelude, base Data.List
elem is the list membership predicate, usually written in infix form, e.g., x `elem` xs. For the result to be False, the list must be finite; True, however, results from an element equal to x found at a finite index of a finite or infinite list.
notElem :: Eq a => a -> [a] -> Bool
base Prelude, base Data.List
notElem is the negation of elem.
testBit :: Bits a => a -> Int -> Bool
base Data.Bits
geq :: Data a => a -> a -> Bool
syb Data.Generics.Twins
Generic equality: an alternative to "deriving Eq"
path :: Graph -> Vertex -> Vertex -> Bool
containers Data.Graph
Is the second vertex reachable from the first?
elem :: (Foldable t, Eq a) => a -> t a -> Bool
base Data.Foldable
Does the element occur in the structure?
notElem :: (Foldable t, Eq a) => a -> t a -> Bool
base Data.Foldable
notElem is the negation of elem.
isInfixOf :: Eq a => [a] -> [a] -> Bool
base Data.List
The isInfixOf function takes two lists and returns True iff the first list is contained, wholly and intact, anywhere within the second. Example: > isInfixOf "Haskell" "I really like Haskell." == True > isInfixOf "Ial" "I really like Haskell." == False
isPrefixOf :: Eq a => [a] -> [a] -> Bool
base Data.List
The isPrefixOf function takes two lists and returns True iff the first list is a prefix of the second.
isSuffixOf :: Eq a => [a] -> [a] -> Bool
base Data.List
The isSuffixOf function takes two lists and returns True iff the first list is a suffix of the second. Both lists must be finite.
(<) :: Ord a => a -> a -> Bool
base Prelude, base Data.Ord
(<=) :: Ord a => a -> a -> Bool
base Prelude, base Data.Ord
(>) :: Ord a => a -> a -> Bool
base Prelude, base Data.Ord
(>=) :: Ord a => a -> a -> Bool
base Prelude, base Data.Ord
(/=) :: Eq a => a -> a -> Bool
base Prelude, base Data.Eq
(==) :: Eq a => a -> a -> Bool
base Prelude, base Data.Eq
buf_isEmpty :: BufferOp a -> a -> Bool
HTTP Network.BufferType
buf_isLineTerm :: BufferOp a -> a -> Bool
HTTP Network.BufferType
withArrayLen0 :: Storable a => a -> [a] -> (Int -> Ptr a -> IO b) -> IO b
base Foreign.Marshal.Array
Like withArrayLen, but a terminator indicates ends
withArray0 :: Storable a => a -> [a] -> (Ptr a -> IO b) -> IO b
base Foreign.Marshal.Array
Like withArray, but a terminator indicates

Show more results