Splitting a sequence into equal segments

I need to split up a sequence into equal segments of a given size (yes, the last one may be shorter), and I'm trying to find an efficient and idiomatic way to do it.

I have two versions of the function; segment is the F# version of an awkward and probably quite inefficient old C# extension method that I wrote, while chop is an attempt to do it in a more intelligent manner, but is still rather imperative. I would have liked to have a solution that doesn't need to use reference cells, but could not come up with one.

module Seq =
let segment segmentSize source =
seq {
let segmentCount = ref 0
while !segmentCount * segmentSize < Seq.length source
do
let segment = source |> Seq.skip (!segmentCount * segmentSize) |> Seq.truncate segmentSize
segmentCount := !segmentCount + 1
yield segment
}

let chop segmentSize source =
seq {
let chopSource = ref source
while not <| Seq.isEmpty !chopSource
do
let segment = !chopSource |> Seq.truncate segmentSize
chopSource := !chopSource |> Seq.skip (Seq.length segment)
yield segment
}


As I said, I think segment, while it gets the job done, is far from good F#; how efficient and idiomatic is chop? What could have been done better?

As for naming, is chop or segment the better name for a function like this, or would something else be more fitting? Also, the argument name segmentSize seems a bit off for F#; would just size be better, or something else?

-
link from SO for the same problem: stackoverflow.com/questions/3999584/… (The accepted answer is from a MS F# dev) –  John Palmer Mar 29 at 1:48

Functional-first style tends to prefer immutability over mutability, so the fact that you're using ref can sometimes signify that the code could be more idiomatic.

Recursive Solution

But how do you keep track of the state of your program without mutation? The traditional functional solution is to use recursion so that each step of the algorithm is isolated in its own call context. Here is a fairly direct translation of your second example into a recursive function:

let rec chop segmentSize source =
seq {
if Seq.isEmpty source then () else
let segment = source |> Seq.truncate segmentSize
let rest = source |> Seq.skip (Seq.length segment)
yield segment
yield! chop segmentSize rest
}


Don't be intimidated by my if ... then () else pattern - it's a trick I adopted to avoid needing to indent the rest of function when a precondition is used (I've seen it elsewhere, and it is nice since there's no early return from functions in F#).

Note how I'm using yield! to flatten the sequence from the recursive call into the outer sequence. Also notice that there is no chopSource in this version, because what was chopSource in your example is simply source in the recursive call.

One possible problem with the above solution is that it is not (as far as I know) tail-recursive. I'm not 100% sure how seq works behind the scenes, but I'm assuming that it is not in this case. This may not matter for your problem, but it's still something to consider. It could always be rewritten to use an accumulator argument so that it is tail-recursive and won't overflow the stack.

Another option is to ditch the sequence expression altogether (note that this is still not tail-recursive):

let rec chop segmentSize source =
if Seq.isEmpty source then Seq.empty else
let segment = source |> Seq.truncate segmentSize
let rest = source |> Seq.skip (Seq.length segment)
Seq.append [segment] (chop segmentSize rest)


Seq.unfold Solution

Although it's nice in this particular case, I'm not a huge fan of recursion because it can sometimes be hard to read and easy to get wrong. I normally use sequence functions as an alternative, as they handle those types of details behind the scenes, and I can worry about the problem at hand. Fortunately, the Seq module provides a nice function, unfold, which does exactly what we are trying to do here - it produces a sequence of values from an evolving state!

The function is called unfold because it is the inverse of fold, which is the equivalent of Enumerable.Aggregate from C#. Here is the documentation:

// Signature:
Seq.unfold : ('State -> 'T * 'State option) -> 'State -> seq<'T>

// Usage:
Seq.unfold generator state


The second argument, state, is the initial value that is going to be used to "seed" the operation (it may seem weird to have this as the second argument, but it is in that order to allow partial application / piping). That initial state value is going to be the first value passed in to our generator function. The generator function optionally returns a tuple containing the current value in the sequence along with the next state value that will be passed back in to generate the next value in the sequence. When the sequence is done, it returns None.

Enough commentary, here is the implementation:

let chop segmentSize source =
source
|> Seq.unfold(fun chopSource ->
if Seq.isEmpty chopSource then None else
let segment = chopSource |> Seq.truncate segmentSize
let rest = chopSource |> Seq.skip (Seq.length segment)
Some(segment, rest)
)


So as you can see, we're basically allowing Seq.unfold to call our generator repetitively as an alternative to recursion. Each iteration returns the segment and the rest of the sequence, which becomes the next state / chopSoure. I'm not actually sure if that is clearer than the recursive version, but it at least won't ever overflow the stack.

As for your naming questions, I think it's somewhat arbitrary. I probably would have called the function segment[ed] (indeed, I think I have). The size argument could go either way. For what it's worth, here's a similar function defined in the Seq module, though it's dealing with a sliding window rather than fixed segments.

All these solutions are assuming that it is fine to re-enumerate the sequence, i.e. by truncating once and then skipping. That might be an OK assumption for small, in-memory data-sets, but an IEnumerable doesn't have to allow multiple enumeration, and it can be expensive. As pointed out by Tomas Petricek on that other question, due to the forward-only nature of sequences, whenever you "back up" over a sequence like this it actually has to enumerate the entire thing from the beginning.

But perhaps a sequence isn't the best choice of data types for input into this function. If the data is already in memory, you have a choice of turning it into a list or an array. Arrays are especially nice for this problem due to their support for slicing. Here's a solution that uses arrays instead of sequences:

let segmented (size:int) (source:'t[]) =
let maxPos = source.Length - 1
[| for pos in 0 .. size .. maxPos ->
source.[pos .. min (pos + size - 1) maxPos] |]

-
I updated my array solution. –  luksan Apr 5 at 18:23

If in doubt, use fold.

let split n  = let one, append, empty = Seq.singleton, Seq.append, Seq.empty
Seq.fold (fun (m, cur, acc) x ->
if m = n then (1, one x, append acc (one cur))
else (m+1, append cur (one x), acc))
(0, empty, empty)
>> fun (_, cur, acc) -> append acc (one cur)


This has the advantage over the other proposed solution that it does not force the re-evaluation of IEnumerables: each element in the input sequence is touched only once(*).

If you're not used to fold, this is arguably less readable than the solutions proposed in the other answer. However, using fold to solve problems like this one is highly idiomatic F#, so I think it's worth considering anyway.

It works like this. We use Seq.fold to thread an accumulator through the sequence. fold applies a function to each element of a sequence. However, for each element, the function gets both the element and an accumulator, and must produce a new accumulator. That function is the anonymous one:

                      fun (m, cur, acc) x ->
if m = n then (1, one x, append acc (one cur))
else (m+1, append cur (one x), acc)


The accumulator contains a "current segment" cur, how many elements is in that segment m, and the segments we have already built acc. It has to produce a new accumulator. There are two cases: either we have enough elements to finalise the current segment (m=n), or we don't. If we do, we move the current segment to the complete segments (append acc (one cur)) and start a new segment with the current element (1 and one x). If we don't, we add the current element to the current segment (m+1 and append cur (one x)).

The end-user of course doesn't care for our accumulator, so once the fold completes, we compact it by the line:

               >> fun (_, cur, acc) -> append acc (one cur)


That is, we lose the counter _, and add the current (likely of length < n) segment cur to our accumulated result segments acc.

This is idiomatic in two ways: First, fold is just very handy in so many cases. Second, if you think about how you'd implement this in an old-fashioned imperative language without native support for sequences, you'd have some kind of loop over the elements (m), a segment you're currently building (cur), and a collection of completed segments (acc). What we do in F# is make all this state explicit in one place: it all lives in the arguments to the anonymous function.

You'll note that the first line

let split n = ...


doesn't actually mention the sequence s. We're exploiting here that functions are values, so instead of writing, say

let split n s = ... s


we can just write

let split n = ...


This is called points-free programming. It's idiomatic, but it's debated whether it is a "good" idiom. I like it, though.

(*) I'm assuming that Seq.append has O(1) running time. I should certainly hope so, but I wasn't able to verify it.

-

This question has been asked several times on StackOverflow, and I'm always amazed at the convoluted answers offered up (and the votes for them!). Brian (a member of the F# team) provided a simple solution back in 2010. It doesn't seem to be too popular, presumably because it uses (local) mutation (as do the built-in collections modules). But Brian's solution

• is concise and easy to understand
• outperforms (by a wide margin) solutions using skip/take or yield!

His solution, for reference:

let split size source =
seq {
let r = ResizeArray()
for x in source do
if r.Count = size then
yield r.ToArray()
r.Clear()
if r.Count > 0 then
yield r.ToArray()
}

-
On the one hand, you're right: I tried out this solution vs my suggested one on lists of 100000 elements. Then this one is 2 orders of magnitude faster. On the other hand, I think people ask this question (and many like it) because they're looking to pick up "idiomatic f#". That's usually something with combinators, even if they are slower, because they're usually much clearer. With lists of 100 elements, speedup is only 30%, or a few hundredths of a millisecond. –  Søren Debois Mar 31 at 20:16
... that said, yeah, Brian's solution is beautiful. –  Søren Debois Mar 31 at 20:16
I understand, but the solutions I've seen either depend on anti-patterns like multiple calls to skip/take or are virtually unreadable. If you're going for "functional beauty" take a look at Tomas' solution. –  Daniel Mar 31 at 21:02

Another solution using recursion and the classic accumulator pattern.

let Seqment segmentSize source =
let rec seqment size acc src =
seq {
match Seq.isEmpty src, size with
|   true, _     ->  yield (List.rev acc |> List.toSeq)
|   _, 0        ->  yield (List.rev acc |> List.toSeq)
yield! seqment segmentSize [] src
|   _           ->  yield! seqment (size - 1) (Seq.head src :: acc) (Seq.skip 1 src)
}
seqment segmentSize [] source

-