The science collection already has such a function (minimum-maximum
a-sequence) that works for any sequence - e.g., lists or vectors. For
example:
#lang racket
(require (planet williams/science/science))
(minimum-maximum
(for/list ((i (in-range 10)))
(random-unit-gaussian)))
(minimum-ma
It might be useful to add to the language a combined function such as
(argminmax proc lst) that returned both the minimum and maximum values
of applying proc to lst. So that for very large lists (or for very
large numbers of lists where you need to know the min and max values
in the lists) instea
2 matches
Mail list logo
