来自升序序列的连续子列表

given

xs = [1,2,3,4,6,7,9,10,11]

我的目标是回来

[[1,2,3,4],[6,7],[9,10,11]]

我想我可以这样做：

groupBy (\x y -> succ x == y) xs

但这会返回：

[[1,2],[3,4],[6,7],[9,10],[11]]

进行了一些搜索，从 Haskell Data.List 建议中返回了以下内容page http://www.haskell.org/haskellwiki/List_function_suggestions#Generalize_groupBy_and_friends.

groupBy                 :: (a -> a -> Bool) -> [a] -> [[a]]
 groupBy rel []          =  []
 groupBy rel (x:xs)      =  (x:ys) : groupBy rel zs
   where (ys,zs) = groupByAux x xs
         groupByAux x0 (x:xs) | rel x0 x = (x:ys, zs)
           where (ys,zs) = groupByAux x xs
         groupByAux y xs = ([], xs)

他们给出的例子之一正是我正在寻找的：

groupBy (\a b -> a+1 == b) [1,2,3,4,6]
[[1,2,3,4],[6]]

所以我的问题...是否有另一种方法来解决这个问题，而不是重新定义groupBy因为这看起来有点戏剧性？

EDIT...

我决定实施如下：

pattern :: (Enum a, Eq a) => (a -> a) -> [a] -> [[a]]
pattern f = foldr g []
  where g a [] = [[a]]
        g a xs | f a == head (head xs) = (a : head xs): tail xs
               | otherwise = [a]:xs

这允许这样的事情：

*Main Map> pattern succ "thisabcdeisxyz"
["t","hi","s","abcde","i","s","xyz"]
*Main Map> pattern (+ 3) [3,6,9,12,1,2,3,2,5,8,23,24,25]
[[3,6,9,12],[1],[2],[3],[2,5,8],[23],[24],[25]]

或功能完全相同group——并不是说有什么理由：

*Main Map> let xs = [1,1,1,2,3,4,5,6,6,6,5]
*Main Map> group xs == pattern id xs
True

有很多方法可以做到这一点。一种方法是使用foldr

f = foldr g []
  where g a [] = [[a]]
        g a xs@(x:xs') | a+1 == head x = (a : x): xs'
                       | otherwise = [a]:xs

现在正在尝试这个行动

*Main> f [1,2,3,4,6,7,9,10,11]
[[1,2,3,4],[6,7],[9,10,11]]