On 18 June 2015 at 21:01, Milan Straka wrote:

do you have any use-case where such function is useful? I am having troubles imagining one.

In fgl we need to be able to obtain a "random" value for the matchAny function, which currently uses minView. I wouldn't mind an O(1) variant for both both Map and IntMap, but minView works well enough. -- Ivan Lazar Miljenovic Ivan.Miljenovic@gmail.com http://IvanMiljenovic.wordpress.com

On 18 June 2015 at 22:53, André van Delden wrote:

Hello,

...

do you have any use-case where such function is useful?

I am trying to generalize some combinatorial functions to a class of types containing any sort of element. For many combinatorial functions it is useful to split the elements at some element and recombine them after a recursion over the parts. That's what I was thinking of.

But others seem to be interested aswell (although it is a beginner asking, so there might be a better solution to his problem):

http://osdir.com/ml/beginners@haskell.org/2015-03/msg00091.html

minView applies to that one as well. -- Ivan Lazar Miljenovic Ivan.Miljenovic@gmail.com http://IvanMiljenovic.wordpress.com