scolobb/dds
1
0
Fork 0
Code Issues Pull requests Releases Wiki Activity

Add tabulate-state*+headers, tabulate-state*+headers/boolean.

Browse source
This commit is contained in:
Sergiu Ivanov 2022-11-11 11:52:27 +01:00
parent da368d2574
commit 53e4981845
2 changed files with 71 additions and 0 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

43
networks.rkt
View file

@ -40,6 +40,7 @@
pretty-print-state-graph ppsg pretty-print-state-graph/01 ppsg01
tabulate-state* tabulate-state*/boolean
tabulate-state*+headers tabulate-state*+headers/boolean
)
(define-type (State a) (VariableMapping a))
@ -755,6 +756,31 @@
(2 2 4 0)
(2 3 5 -1)))))
(: tabulate-state*+headers
(All (a) (-> (Listof (-> (State a) a)) (DomainMapping a)
(Pairof (Listof Symbol) (Listof (Listof a))))))
(define (tabulate-state*+headers funcs domains)
(define var-names : (Listof Symbol)
(hash-map domains (λ ([x : Symbol] _) x) #t))
(define func-names : (Listof Symbol)
(for/list ([_ funcs]
[i (in-naturals 1)])
(string->symbol (~a 'f i))))
(cons (append var-names func-names)
(tabulate-state* funcs domains)))
(module+ test
(test-case "tabulate-state*+headers"
(define/: f1 (State Integer) (+ :a :b))
(define/: f2 (State Integer) (- :a :b))
(check-equal?
(tabulate-state*+headers (list f1 f2) (hash 'a '(1 2) 'b '(2 3)))
'((a b f1 f2)
(1 2 3 -1)
(1 3 4 -2)
(2 2 4 0)
(2 3 5 -1)))))
(: tabulate-state*/boolean
(-> (Listof (-> (State Boolean) Boolean)) (Listof Variable)
(Listof (Listof Boolean))))
@ -770,6 +796,23 @@
(#f #t #f #t)
(#t #f #f #t)
(#t #t #t #t)))))
(: tabulate-state*+headers/boolean
(-> (Listof (-> (State Boolean) Boolean)) (Listof Variable)
(Pairof (Listof Symbol) (Listof (Listof Boolean)))))
(define (tabulate-state*+headers/boolean funcs args)
(tabulate-state*+headers funcs (make-boolean-domains args)))
(module+ test
(test-case "tabulate-state*+headers/boolean"
(define/: f1 (State Boolean) (and :a :b))
(define/: f2 (State Boolean) (or :a :b))
(check-equal? (tabulate-state*+headers/boolean (list f1 f2) '(a b))
'((a b f1 f2)
(#f #f #f #f)
(#f #t #f #t)
(#t #f #f #t)
(#t #t #t #t)))))
)
(require 'typed)

28
scribblings/networks.scrbl
View file

@ -733,6 +733,19 @@ the states.
(hash 'a '(1 2) 'b '(2 3)))
]}
@defproc[(tabulate-state*+headers [funcs (Listof (-> (State a) a))]
[domains (DomainMapping a)])
(Pairof (Listof Symbol) (Listof (Listof a)))]{
Like @racket[tabulate-state*], but the first line of the result lists the names
of the variables and the functions.
@ex[
(tabulate-state*+headers (list (λ/: (State Integer) (+ :a :b))
(λ/: (State Integer) (- :a :b)))
(hash 'a '(1 2) 'b '(2 3)))
]}
@defproc[(tabulate-state*/boolean [funcs (Listof (-> State Boolean) Boolean)]
[args (Listof Variable)])
(Listof (Listof Boolean))]{
@ -747,6 +760,21 @@ containing the variables appearing on this list.
'(a b))
]}
@defproc[(tabulate-state*+headers/boolean
[funcs (Listof (-> State Boolean) Boolean)]
[args (Listof Variable)])
(Pairof (Listof Symbol) (Listof (Listof Boolean)))]{
Like @racket[tabulate-state*+headers], but the functions operate on Boolean
states, like @racket[tabulate-state*].
@ex[
(tabulate-state*+headers/boolean
(list (λ/: (State Boolean) (and :a :b))
(λ/: (State Boolean) (or :a :b)))
'(a b))
]}
@section{Constructing functions and networks}
@section{Random functions and networks}