Revert "factor: rename [ ] [ ] unit-test -> { } [ ] unit-test using a refactoring...

[factor.git] / basis / math / primes / erato / erato-tests.factor

diff --git a/basis/math/primes/erato/erato-tests.factor b/basis/math/primes/erato/erato-tests.factor
index 96a2cfdb20da961f5132234efa13e168042cee0c..1996ec2659339965d544bfcffcf1cfbf1efa61b5 100644 (file)
--- a/basis/math/primes/erato/erato-tests.factor
+++ b/basis/math/primes/erato/erato-tests.factor
@@ -1,19 +1,19 @@
 USING: fry kernel math math.bitwise math.primes.erato
 math.ranges sequences tools.test ;
 
-{ B{ 255 251 247 126 } } [ 100 sieve ] unit-test
+[ B{ 255 251 247 126 } ] [ 100 sieve ] unit-test
 [ 1 100 sieve marked-prime? ] [ bounds-error? ] must-fail-with
 [ 120 100 sieve marked-prime? ] [ bounds-error? ] must-fail-with
-{ f } [ 119 100 sieve marked-prime? ] unit-test
-{ t } [ 113 100 sieve marked-prime? ] unit-test
+[ f ] [ 119 100 sieve marked-prime? ] unit-test
+[ t ] [ 113 100 sieve marked-prime? ] unit-test
 
 ! There are 25997 primes below 300000. 1 must be removed and 3 5 7 added.
-{ 25997 } [ 299999 sieve [ bit-count ] map-sum 2 + ] unit-test
+[ 25997 ] [ 299999 sieve [ bit-count ] map-sum 2 + ] unit-test
 
 ! Check sieve array length logic by making sure we get the right
 ! end-point for numbers with all possibilities mod 30. If something
 ! were to go wrong, we'd get a bounds-error.
-{ } [ 2 100 [a,b] [ dup sieve marked-prime? drop ] each ] unit-test
+[ ] [ 2 100 [a,b] [ dup sieve marked-prime? drop ] each ] unit-test
 
 { t } [
     { 2 3 5 7 11 13 } 100 sieve '[ _ marked-prime? ] all?