@hackage rangemin1.1.1

Linear range-min algorithms.

Rapidly and lazily preprocesses an array or list so that the smallest element in an arbitrary subrange can be found in constant time.