On 06/01/2012 10:39, Jon Fairbairn wrote:
groupBy is currently implemented using span. It strikes me that we
ought to specify some properties for what we want. Start by defining:
pairwiseInOrderBy p l = all (uncurry p) (l `zip` drop 1 l) giving all
(pairwiseInOrderBy p) (groupCut p l) and we would want concat
(groupCut p l) == l (all modulo nontermination side conditions).
Anything else?
To be honest, I've worked out what's going on in this case and I have an
implementation or two of what I'd want in case I need it, plus I've
posted it in case it was useful to the OP. There's nothing I really want
to persue any further.
_______________________________________________
Haskell-Cafe mailing list
[email protected]
http://www.haskell.org/mailman/listinfo/haskell-cafe
