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

generic: Use collect-by-key/sets to collect the labels for state graphs.

Browse source
This commit is contained in:
Sergiu Ivanov 2020-03-02 18:18:23 +01:00
parent 29d8e152d9
commit 141080d1c6
2 changed files with 9 additions and 9 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

2
generic.rkt
View file

@ -41,7 +41,7 @@
[labels empty]
[current-states states]
[visited-states states]
#:result (collect-by-key edges labels))
#:result (collect-by-key/sets edges labels))
([i step-range]
#:break (set-empty? current-states))
(for/fold ([new-edges empty]

16
networks-tests.rkt
View file

@ -186,25 +186,25 @@
(#hash((a . #f) (b . #t)) #hash((a . #t) (b . #t)))))
(check-equal? (edge-weight gr-complete-bool-ann
#hash((a . #f) (b . #f)) #hash((a . #t) (b . #f)))
(list (set 'a)))
(set (set 'a)))
(check-equal? (edge-weight gr-complete-bool-ann
#hash((a . #f) (b . #f)) #hash((a . #f) (b . #f)))
(list (set 'b)))
(set (set 'b)))
(check-equal? (edge-weight gr-complete-bool-ann
#hash((a . #t) (b . #f)) #hash((a . #t) (b . #f)))
(list (set 'b)))
(set (set 'b)))
(check-equal? (edge-weight gr-complete-bool-ann
#hash((a . #t) (b . #f)) #hash((a . #f) (b . #f)))
(list (set 'a)))
(set (set 'a)))
(check-equal? (edge-weight gr-complete-bool-ann
#hash((a . #t) (b . #t)) #hash((a . #f) (b . #t)))
(list (set 'a)))
(set (set 'a)))
(check-equal? (edge-weight gr-complete-bool-ann
#hash((a . #t) (b . #t)) #hash((a . #t) (b . #t)))
(list (set 'b)))
(set (set 'b)))
(check-equal? (edge-weight gr-complete-bool-ann
#hash((a . #f) (b . #t)) #hash((a . #f) (b . #t)))
(list (set 'b)))
(set (set 'b)))
(check-equal? (edge-weight gr-complete-bool-ann
#hash((a . #f) (b . #t)) #hash((a . #t) (b . #t)))
(list (set 'a)))))
(set (set 'a)))))