suzanne.soy/racket
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Use the thread-cell strategy for recursive-contracts that are list contracts

Browse Source
This commit is contained in:
Daniel Feltey 2018-01-23 15:23:53 -06:00 committed by Robby Findler
parent 670f89a85b
commit 26ed4b246c
1 changed files with 4 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

5
racket/collects/racket/contract/private/base.rkt
View File

@ -210,13 +210,16 @@
(define r-ctc (force-recursive-contract ctc))
(define f (get/build-late-neg-projection r-ctc))
(define blame-known (blame-add-context blame #f))
(define f-blame-known (make-thread-cell #f))
(λ (val neg-party)
(unless (list? val)
(raise-blame-error blame-known #:missing-party neg-party
val
'(expected: "list?" given: "~e")
val))
((f blame-known) val neg-party)))]
(unless (thread-cell-ref f-blame-known)
(thread-cell-set! f-blame-known (f blame-known)))
((thread-cell-ref f-blame-known) val neg-party)))]
[else
(λ (blame)
(define r-ctc (force-recursive-contract ctc))