-USING: tools.test random sorting sequences sets hashtables assocs
+USING: tools.test random sorting sequences hashtables assocs
kernel fry arrays splitting namespaces math accessors vectors locals
math.order grouping strings strings.private classes layouts
cpu.architecture
USING: accessors arrays compiler.cfg compiler.cfg.debugger
compiler.cfg.ssa.construction.tdmsc compiler.cfg.utilities
-kernel namespaces sequences sets tools.test ;
+kernel namespaces sequences tools.test ;
+QUALIFIED: sets
IN: compiler.cfg.ssa.construction.tdmsc.tests
: test-tdmsc ( -- )
{ t } [
2 get 3 get 2array merge-set
- 4 get 6 get 2array set=
+ 4 get 6 get 2array sets:set=
] unit-test
V{ } 0 test-bb
USING: accessors alien alien.accessors alien.c-types alien.libraries
alien.syntax arrays byte-arrays continuations fry kernel kernel.private
-layouts libc math namespaces prettyprint sequences sets system tools.memory
+layouts libc math namespaces prettyprint sequences system tools.memory
tools.test ;
+QUALIFIED: sets
IN: alien.tests
{ t } [ -1 <alien> alien-address 0 > ] unit-test
{ 7575 } [ initialize-test [ 7575 ] initialize-alien ] unit-test
-{ { BAD-ALIEN } } [ { BAD-ALIEN BAD-ALIEN BAD-ALIEN } members ] unit-test
+{ { BAD-ALIEN } } [ { BAD-ALIEN BAD-ALIEN BAD-ALIEN } sets:members ] unit-test
! Generate callbacks until the whole callback-heap is full, then free
! them. Do it ten times in a row for good measure.
-USING: assocs graphs kernel namespaces sets sorting tools.test ;
+USING: assocs graphs kernel namespaces sorting tools.test ;
+QUALIFIED: sets
H{ } "g" set
{ 1 2 3 } "v" set
{ } [ "v" dup get "g" get add-vertex ] unit-test
-{ { "v" } } [ 1 "g" get at members ] unit-test
+{ { "v" } } [ 1 "g" get at sets:members ] unit-test
H{
{ 1 HS{ 1 2 } }
} "g" set
{ { 2 3 4 5 } } [
- 2 [ "g" get at members ] closure members natural-sort
+ 2 [ "g" get at sets:members ] closure sets:members natural-sort
] unit-test