suzanne.soy/typed-struct-props
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Skip some tests in racket < 6.3 as the type inference is not good enough to make them work there. There are alternative versions of these tests which don't rely so much on inference and are included.

Browse Source
This commit is contained in:
Georges Dupéron 2016-09-05 00:04:04 +02:00
parent d7d8651efe
commit 8d3aac092a
2 changed files with 42 additions and 32 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
info.rkt
View File

@ -14,5 +14,5 @@
" in Typed/Racket. The API should hopefully stay"
" backward-compatible when Typed/Racket officially supports"
" (or rejects) structure type properties."))
(define version "0.0")
(define version "1.0")
(define pkg-authors '("Georges Dupéron"))

72
test/test-poly.rkt
View File

@ -1,40 +1,50 @@
#lang typed/racket
(define-syntax (skip<6.3 stx)
(syntax-case stx ()
[(_ . rest)
(if (or (regexp-match #px"^6(\\.[012](\\..*|)|)$" (version))
(regexp-match #px"^[123245]\\..*$" (version)))
#'(begin)
#'(begin . rest))]))
(require typed-struct-props
typed/rackunit)
(struct/props (A) foo1 ([f : A] [g : A]) #:transparent
#:property prop:custom-write
(λ (this out mode)
(write (ann (list (foo1-f this)
(foo1-g this))
(Listof A))
out)))
(skip<6.3
(struct/props (A) foo1 ([f : A] [g : A]) #:transparent
#:property prop:custom-write
(λ (this out mode)
(write (ann (list (foo1-f this)
(foo1-g this))
(Listof A))
out))))
(struct/props (A) foo2 ([f : A] [g : A]) #:transparent
#:property prop:equal+hash
(list (λ (a b rec)
;; We can access the A ... here, but not the A' ...
(ann (list (foo2-f a)
(foo2-g a))
(Listof A))
#f)
(λ (a rec)
;; Type inference works, despite the lambda being in a
;; list, because we detect the special case where a list
;; is immediately constructed.
(ann (list (foo2-f a)
(foo2-g a))
(Listof A))
42)
(λ (a rec)
;; Type inference works, despite the lambda being in a
;; list, because we detect the special case where a list
;; is immediately constructed.
(ann (list (foo2-f a)
(foo2-g a))
(Listof A))
43)))
(skip<6.3
(struct/props (A) foo2 ([f : A] [g : A]) #:transparent
#:property prop:equal+hash
(list (λ (a b rec)
;; We can access the A ... here, but not the A' ...
(ann (list (foo2-f a)
(foo2-g a))
(Listof A))
#f)
(λ (a rec)
;; Type inference works, despite the lambda being in a
;; list, because we detect the special case where a list
;; is immediately constructed.
(ann (list (foo2-f a)
(foo2-g a))
(Listof A))
42)
(λ (a rec)
;; Type inference works, despite the lambda being in a
;; list, because we detect the special case where a list
;; is immediately constructed.
(ann (list (foo2-f a)
(foo2-g a))
(Listof A))
43))))
(struct/props (A) foo3 ([f : A] [g : A]) #:transparent
#:property prop:custom-write