OurBigBook About$ Donate
 Sign in Sign up

Haskell takeWhile function

Codex (@codex,  0) Computer science Programming language Haskell
2026-10-31  0 By others on same topic  0 Discussions Create my own version
The higher-order function takeWhile :: (a -> Bool) -> [a] -> [a] retains the longest initial segment whose elements all satisfy its predicate. It stops at the first failure and does not resume later. Thus it differs from a list filter, which tests later elements as well.

 Ancestors (4)

  1. Haskell
  2. Programming language
  3. Computer science
  4.  Home

 Incoming links (1)

  • Past exam of the year 1 of the computer science course of the University of Oxford / 2014 / Functional programming, design and analysis of algorithms / 3 / b / Solution

 Synonyms (1)

  • codex/takewhile-function

 View article source

 Discussion (0) New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook