⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 negateliststest.groovy

📁 大名鼎鼎的java动态脚本语言。已经通过了sun的认证
💻 GROOVY
字号:
/**  * Test to negate lists in Classic Groovy. * Test to check whether a given function is even/odd on a given domain. *  * @author Pilho Kim * @version $Revision: 1.3 $ */class NegateListsTest extends GroovyTestCase {    void testNegateList() {        assert -[1, 2, 3] == [-1, -2, -3]        def x = [1, 2, 3]        assert -x == [-1, -2, -3]        assert x == -[-1, -2, -3]        assert -(-x) == x        def y = [-1, -2, -3]        assert -x == y        assert x == -y    }    void testBitwiseNegateList() {        assert ~[1, 2, 3] == [-2, -3, -4]        def x = [1, 2, 3]        assert ~x == [-2, -3, -4]        assert x == ~[-2, -3, -4]        assert ~~x == x        assert ~(~x) == x        def y = [-2, -3, -4]        assert ~x == [-2, -3, -4]        assert x == ~y    }    void testEvenFunction() {        def PI = Math.PI        /////////////////////////////////////////////////////////////////////        // A case of partition having 10 subintervals.        // x = [0.0*PI/2, 0.1*PI/2, 0.2*PI/2, 0.3*PI/2, 0.4*PI/2, 0.5*PI/2,         //               0.6*PI/2, 0.7*PI/2, 0.8*PI/2, 0.9*PI/2, 1.0*PI/2]        /////////////////////////////////////////////////////////////////////        // Generate a domain of function used om testing.        def n = 1000    // the number of partitions for the interval 0..2/PI        def x = []        for (i in 0..n) {            x << i*PI/n        }        // println x        def cos = { Math.cos(it) }        assertTrue(isEvenFn(cos, x))        def sin = { Math.sin(it) }        assertTrue(isOddFn(sin, x))        def tan = { Math.tan(it) }        assertTrue(isOddFn(tan, x))    }    boolean isEvenFn(f, domain) {        // println domain.collect(f)        // println( (-domain).collect(f) )        println( (domain.collect(f)) == ((-domain).collect(f)) )        return (domain.collect(f)) == ((-domain).collect(f))    }    boolean isOddFn(f, domain) {        // println domain.collect(f)        // println(  (-domain).collect(f) )        println( domain.collect(f) == -((-domain).collect(f)) )        return domain.collect(f) == -((-domain).collect(f))    }}

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -