racket/pkgs/plot-pkgs/plot-lib/plot/private/common/sample.rkt
Neil Toronto a7eba53efc Removed all flonum speed hacks; plots are usually no slower and are sometimes faster now
In an ultimately vain attempt to make plotting fast but still allow
plots with bounds that have very few flonums in them, Plot used to try
to detect when each axis's bounds had enough flonums in it and switch to
flonum-only math. There are two problems with this:

 * It was trying to determine whether *future computations* would have
   enough precision, which is very difficult to know for sure, so it
   only *usually* worked. (Example fail: contour-intervals3d with 0 and
   +max.0 endpoints. Half the isobands weren't drawn.)

 * It caused extra conversions between flonums and exact rationals,
   which are very slow.

Here's the new approach:

 1. Always send exact rationals to user functions (e.g. the lambda
    arguments to `function' and `contour-intervals3d').

 2. Immediately convert user-given plot coordinates to exact
    rationals (if rational; e.g. not +nan.0)

 3. Always represent normalized coordinates (e.g. in [0,1]^2 for 2D
    plots and [-1/2,1/2]^3 for 3D plots) using flonums.

 4. Reduce the number of exact operations as much as possible.

IOW, plot coordinates, which can be incredibly huge or tiny and don't
always fit in flonums, are always exact internally. Normalized, view,
and device coordinates, which are used only internally, always have
bounds with plenty of flonums in them, so Plot uses flonums.

Doing #4 accounts for most of the changes; e.g. to the marching
squares and marching cubes implementations, and axial plane clipping.

Most plots' speeds seem to be unaffected by the changes. Surfaces and
contour intervals are sometimes faster. Isosurfaces are a tad slower
in some cases and faster in others. Points are about 50% slower,
partly undoing the speedup from a recent commit. Plots with axis
transforms can be much slower (4x), when long, straight lines are
subdivided many times. Plots with bounds outside flonum range seem
to be about 3x faster.
2014-04-04 12:04:49 -06:00

271 lines
13 KiB
Racket

#lang racket/base
;; Functions that sample from functions, and functions that create memoized samplers.
(require racket/match racket/flonum racket/math racket/contract racket/list racket/vector
unstable/latent-contract/defthing
"math.rkt"
"axis-transform.rkt")
(provide (all-defined-out))
(defproc (build-linear-seq [start real?] [step real?]
[num exact-nonnegative-integer?]
[min-val real? start]
[max-val real? (+ start (* (- num 1) step))]
) (listof real?)
(define n-start (max 0 (inexact->exact (floor (/ (- min-val start) step)))))
(define n-end (min num (+ (inexact->exact (ceiling (/ (- max-val start) step))) 1)))
(for*/list ([n (in-range n-start n-end)]
[x (in-value (+ start (* n step)))]
#:when (<= min-val x max-val))
x))
(defproc (linear-seq [start real?] [end real?] [num exact-nonnegative-integer?]
[#:start? start? boolean? #t]
[#:end? end? boolean? #t]) (listof real?)
(cond
[(zero? num) empty]
; ambiguous request: arbitrarily return start
[(and start? end? (= 1 num)) (list start)]
[(end . < . start) (reverse (linear-seq end start num #:start? end? #:end? start?))]
[(end . = . start) (build-list num (λ _ start))]
[else
(define size (- end start))
(define step (/ size (cond [(and start? end?) (- num 1)]
[(or start? end?) (- num 1/2)]
[else num])))
(define real-start
(cond [start? start]
[else (+ start (* 1/2 step))]))
(build-linear-seq real-start step num)]))
(defproc (linear-seq* [points (listof real?)] [num exact-nonnegative-integer?]
[#:start? start? boolean? #t]
[#:end? end? boolean? #t]) (listof real?)
(let/ec return
(when (empty? points) (raise-type-error 'linear-seq* "nonempty (listof real?)" points))
(define pts (list->vector points))
(define len (vector-length pts))
(define indexes (linear-seq 0 (sub1 len) num #:start? start? #:end? end?))
(define int-parts (map floor indexes))
(define frac-parts (map - indexes int-parts))
(map (λ (i f)
(if (= i (sub1 len))
(vector-ref pts i)
(blend (vector-ref pts (add1 i)) (vector-ref pts i) f)))
int-parts frac-parts)))
(defproc (nonlinear-seq [start real?] [end real?] [num exact-nonnegative-integer?]
[transform axis-transform/c]
[#:start? start? boolean? #t]
[#:end? end? boolean? #t]) (listof real?)
(match-define (invertible-function _ finv) (apply-axis-transform transform start end))
(map finv (linear-seq start end num #:start? start? #:end? end?)))
;; ===================================================================================================
(define (ensure-endpoints xs i-min i-max)
(cond [(empty? xs) (cond [(i-min . = . i-max) (list i-min)]
[else (list i-min i-max)])]
[else
(define xs-min (first xs))
(define xs-max (last xs))
(let* ([xs (if (xs-min . <= . i-min) xs (cons i-min xs))]
[xs (if (xs-max . >= . i-max) xs (append xs (list i-max)))])
xs)]))
(defproc (sample-points [outer-ivl rational-ivl?] [inner-ivl ivl?]
[num exact-nonnegative-integer?]
[transform axis-transform/c id-transform]) (listof real?)
(let* ([inner-ivl (ivl-meet inner-ivl outer-ivl)]
[inner-ivl (ivl-inexact->exact inner-ivl)]
[outer-ivl (ivl-inexact->exact outer-ivl)])
(match-define (ivl o-min o-max) outer-ivl)
(match-define (ivl i-min i-max) inner-ivl)
(match-define (invertible-function f finv) (apply-axis-transform transform o-min o-max))
(cond
[(ivl-empty? inner-ivl) empty]
[(= num 0) empty]
[(or (= o-min o-max) (= num 1))
(cond [(<= i-min o-min i-max) (build-list num (λ _ o-min))]
[else empty])]
[else
(define step (/ (- o-max o-min) (- num 1)))
(let* ([xs (map finv (build-linear-seq o-min step num (f i-min) (f i-max)))]
[xs (remove-duplicates (map (λ (x) (clamp-real x inner-ivl)) xs))])
(ensure-endpoints xs i-min i-max))])))
;; ===================================================================================================
(struct mapped-function (f fmap) #:transparent
#:property prop:procedure
(λ (g x) ((mapped-function-f g) x)))
(define (map* f xs)
(match f
#;; gives obviously wrong chaperone error (tries to apply a hash?):
[(mapped-function _ fmap) (fmap xs)]
[(? mapped-function?) ((mapped-function-fmap f) xs)]
[_ (map f xs)]))
;; ===================================================================================================
;; Making memoized samplers
(struct sample (xs ys y-min y-max) #:transparent)
(struct 2d-sample (xs ys zss z-min z-max) #:transparent)
(struct 3d-sample (xs ys zs dsss d-min d-max) #:transparent)
(defcontract sampler/c
(-> rational-ivl? exact-nonnegative-integer? sample?))
(defcontract 2d-sampler/c
(-> (vector/c rational-ivl? rational-ivl?)
(vector/c exact-nonnegative-integer? exact-nonnegative-integer?)
2d-sample?))
(defcontract 3d-sampler/c
(-> (vector/c rational-ivl? rational-ivl? rational-ivl?)
(vector/c exact-nonnegative-integer? exact-nonnegative-integer? exact-nonnegative-integer?)
3d-sample?))
(defproc (make-function->sampler [transform-thnk (-> axis-transform/c)]
) (-> (real? . -> . real?) ivl? sampler/c)
(λ (g inner-ivl)
(define f (λ (x) (with-handlers ([exn:fail? (λ (_) +nan.0)]) (g x))))
(define memo (make-hash))
(λ (outer-ivl num)
(define tx (transform-thnk))
(hash-ref! memo (vector outer-ivl num tx)
(λ ()
(define xs (sample-points outer-ivl inner-ivl num tx))
(define y-min #f)
(define y-max #f)
(define ys (for/list ([x (in-list xs)])
(define y (f x))
(cond [(rational? y)
(unless (and y-min (y . >= . y-min)) (set! y-min y))
(unless (and y-max (y . <= . y-max)) (set! y-max y))
(inexact->exact y)]
[else y])))
(sample xs ys
(maybe-inexact->exact y-min)
(maybe-inexact->exact y-max)))))))
(defproc (make-2d-function->sampler [transform-x-thnk (-> axis-transform/c)]
[transform-y-thnk (-> axis-transform/c)]
) (-> (real? real? . -> . real?)
(vector/c ivl? ivl?)
2d-sampler/c)
(λ (g inner-rect)
(define f (λ (x y) (with-handlers ([exn:fail? (λ (_) +nan.0)]) (g x y))))
(define memo (make-hash))
(λ (outer-rect nums)
(define tx (transform-x-thnk))
(define ty (transform-y-thnk))
(hash-ref! memo (vector outer-rect nums tx ty)
(λ ()
(match-define (vector outer-x-ivl outer-y-ivl) outer-rect)
(match-define (vector inner-x-ivl inner-y-ivl) inner-rect)
(match-define (vector x-num y-num) nums)
(define xs (sample-points outer-x-ivl inner-x-ivl x-num tx))
(define ys (sample-points outer-y-ivl inner-y-ivl y-num ty))
(define z-min #f)
(define z-max #f)
(define zss (for/vector #:length (length ys) ([y (in-list ys)])
(for/vector #:length (length xs) ([x (in-list xs)])
(define z (f x y))
(cond [(rational? z)
(unless (and z-min (z . >= . z-min)) (set! z-min z))
(unless (and z-max (z . <= . z-max)) (set! z-max z))
(inexact->exact z)]
[else z]))))
(2d-sample xs ys zss
(maybe-inexact->exact z-min)
(maybe-inexact->exact z-max)))))))
(defproc (make-3d-function->sampler [transform-x-thnk (-> axis-transform/c)]
[transform-y-thnk (-> axis-transform/c)]
[transform-z-thnk (-> axis-transform/c)]
) (-> (real? real? real? . -> . real?)
(vector/c ivl? ivl? ivl?)
3d-sampler/c)
(λ (g inner-rect)
(define f (λ (x y z) (with-handlers ([exn:fail? (λ (_) +nan.0)]) (g x y z))))
(define memo (make-hash))
(λ (outer-rect nums)
(define tx (transform-x-thnk))
(define ty (transform-y-thnk))
(define tz (transform-z-thnk))
(hash-ref! memo (vector outer-rect nums tx ty tz)
(λ ()
(match-define (vector outer-x-ivl outer-y-ivl outer-z-ivl) outer-rect)
(match-define (vector inner-x-ivl inner-y-ivl inner-z-ivl) inner-rect)
(match-define (vector x-num y-num z-num) nums)
(define xs (sample-points outer-x-ivl inner-x-ivl x-num tx))
(define ys (sample-points outer-y-ivl inner-y-ivl y-num ty))
(define zs (sample-points outer-z-ivl inner-z-ivl z-num tz))
(define d-min #f)
(define d-max #f)
(define dsss (for/vector #:length (length zs) ([z (in-list zs)])
(for/vector #:length (length ys) ([y (in-list ys)])
(for/vector #:length (length xs) ([x (in-list xs)])
(define d (f x y z))
(cond [(rational? d)
(unless (and d-min (d . >= . d-min)) (set! d-min d))
(unless (and d-max (d . <= . d-max)) (set! d-max d))
(inexact->exact d)]
[else d])))))
(3d-sample xs ys zs dsss
(maybe-inexact->exact d-min)
(maybe-inexact->exact d-max)))))))
(define-syntax-rule (for-2d-sample (xa xb ya yb z1 z2 z3 z4) sample expr ...)
(let ()
(match-define (2d-sample xs ys zss fz-min fz-max) sample)
(define ya (first ys))
(define zs0 (vector-ref zss 0))
(for/fold ([ya ya] [zs0 zs0]) ([yb (in-list (rest ys))]
[zs1 (in-vector zss 1)])
(define xa (first xs))
(define z1 (vector-ref zs0 0))
(define z4 (vector-ref zs1 0))
(for/fold ([xa xa] [z1 z1] [z4 z4]) ([xb (in-list (rest xs))]
[z2 (in-vector zs0 1)]
[z3 (in-vector zs1 1)])
expr ...
(values xb z2 z3))
(values yb zs1))))
(define-syntax-rule (for-3d-sample (xa xb ya yb za zb d1 d2 d3 d4 d5 d6 d7 d8) sample expr ...)
(let ()
(match-define (3d-sample xs ys zs dsss fd-min fd-max) sample)
(define za (first zs))
(define dss0 (vector-ref dsss 0))
(for/fold ([za za] [dss0 dss0]) ([zb (in-list (rest zs))]
[dss1 (in-vector dsss 1)])
(define ya (first ys))
(define ds00 (vector-ref dss0 0))
(define ds10 (vector-ref dss1 0))
(for/fold ([ya ya] [ds00 ds00] [ds10 ds10]) ([yb (in-list (rest ys))]
[ds01 (in-vector dss0 1)]
[ds11 (in-vector dss1 1)])
(define xa (first xs))
(define d1 (vector-ref ds00 0))
(define d4 (vector-ref ds01 0))
(define d5 (vector-ref ds10 0))
(define d8 (vector-ref ds11 0))
(for/fold ([xa xa] [d1 d1] [d4 d4] [d5 d5] [d8 d8]) ([xb (in-list (rest xs))]
[d2 (in-vector ds00 1)]
[d3 (in-vector ds01 1)]
[d6 (in-vector ds10 1)]
[d7 (in-vector ds11 1)])
expr ...
(values xb d2 d3 d6 d7))
(values yb ds01 ds11))
(values zb dss1))))