Grouping a list into lists of n elements in Haskell

by

A quick search on Hoogle showed that there is no such function. On the other hand, it was replied that there is one in the split package, called chunksOf.

However, you can do it on your own

group :: Int -> [a] -> [[a]]
group _ [] = []
group n l
  | n > 0 = (take n l) : (group n (drop n l))
  | otherwise = error "Negative or zero n"

Of course, some parentheses can be removed, I left there here for understanding what the code does:

The base case is simple: whenever the list is empty, simply return the empty list.

The recursive case tests first if n is positive. If n is 0 or lower we would enter an infinite loop and we don’t want that. Then we split the list into two parts using take and drop: take gives back the first n elements while drop returns the other ones. Then, we add the first n elements to the list obtained by applying our function to the other elements in the original list.

enter image description here

More Related Contents:

  1. Haskell finding mean of cubes of odd members Any ideas? [closed]
  2. Histogram in Haskell [closed]
  3. What is Haskell’s Stream Fusion
  4. Using return vs. not using return in the list monad
  5. Cartesian product of infinite lists in Haskell
  6. Decrementing ranges in Haskell
  7. Zip with default value instead of dropping values?
  8. Replace individual list elements in Haskell?
  9. Using Haskell’s map function to calculate the sum of a list
  10. Need to partition a list into lists based on breaks in ascending order of elements (Haskell)
  11. Merging two lists in Haskell
  12. Haskell Monad – How does Monad on list work?
  13. Is there a function to flatten a nested list of elements?
  14. Understanding a recursively defined list (fibs in terms of zipWith)
  15. Removing duplicates from a list in Haskell without elem
  16. Removing syntactic sugar: List comprehension in Haskell
  17. Counting unique elements in a list
  18. Unsequence Monad function within Haskell
  19. Concatenating two lists – difference between ‘+=’ and extend()
  20. How to check if all of the following items are in a list?
  21. Subsets in Prolog
  22. How do I split or chunk a list into equal parts, with Dart?
  23. How to count number of element occurrences in a list in Prolog
  24. Intersection and union of 2 lists
  25. Python: create a pandas data frame from a list
  26. How to extend a Scala list to enable slicing not by explicit position but by given predicate/condition
  27. Difference between a Seq and a List in Scala
  28. Iterate over pairs in a list (circular fashion) in Python
  29. Find empty or NaN entry in Pandas Dataframe
  30. Is there a safe way in Scala to transpose a List of unequal-length Lists?

Leave a Comment