F# Split list into sublists based on comparison of adjacent elements

Question

I\'ve found this question on hubFS, but that handles a splitting criteria based on individual elements. I\'d like to split based on a comparison of adjacent elements, so the

Answer 1

"adjacent" immediately makes me think of Seq.pairwise.

let splitAt pred xs =
    if Seq.isEmpty xs then
        []
    else
        xs
        |> Seq.pairwise
        |> Seq.fold (fun (curr :: rest as lists) (i, j) -> if pred i j then [j] :: lists else (j :: curr) :: rest) [[Seq.head xs]]
        |> List.rev
        |> List.map List.rev

Example:

[1;1;2;3;3;3;2;1;2;2]
|> splitAt (>)

Gives:

[[1; 1; 2; 3; 3; 3]; [2]; [1; 2; 2]]