Package ca.nengo.math.impl

Examples of ca.nengo.math.impl.ConstantFunction.map()

22
23
24
25
26
27
28
29
30
31
32
  /*
   * Test method for 'ca.nengo.math.impl.ConstantFunction.map(float[])'
   */
  public void testMap() {
    ConstantFunction f = new ConstantFunction(1, 1f);
    assertClose(1f, f.map(new float[]{0f}), .00001f);
    assertClose(1f, f.map(new float[]{1f}), .00001f);
  }

  /*
   * Test method for 'ca.nengo.math.impl.ConstantFunction.multiMap(float[][])'
View Full Code Here
23
24
25
26
27
28
29
30
31
32
33
   * Test method for 'ca.nengo.math.impl.ConstantFunction.map(float[])'
   */
  public void testMap() {
    ConstantFunction f = new ConstantFunction(1, 1f);
    assertClose(1f, f.map(new float[]{0f}), .00001f);
    assertClose(1f, f.map(new float[]{1f}), .00001f);
  }

  /*
   * Test method for 'ca.nengo.math.impl.ConstantFunction.multiMap(float[][])'
   */
 
View Full Code Here
31
32
33
34
35
36
37
38
39
40
41
    } catch (RuntimeException e) { // failure after too many attempts
    }
   
    func = new FourierFunction(new float[]{1, 0.5f, 1}, new float[]{1, 1, 0.5f}, new float[]{0, -0.5f, 0.2f});
    root = nrf.findRoot(func, -5, 5, 0.0001f);
    TestUtil.assertClose(func.map(new float[]{root}), 0, 0.001f);
   
    func = new IdentityFunction(1, 0);
    root = nrf.findRoot(func, -5, 5, 0.0001f);
    TestUtil.assertClose(func.map(new float[]{root}), 0, 0.001f);
   
View Full Code Here
35
36
37
38
39
40
41
42
43
44
45
    root = nrf.findRoot(func, -5, 5, 0.0001f);
    TestUtil.assertClose(func.map(new float[]{root}), 0, 0.001f);
   
    func = new IdentityFunction(1, 0);
    root = nrf.findRoot(func, -5, 5, 0.0001f);
    TestUtil.assertClose(func.map(new float[]{root}), 0, 0.001f);
   
    func = new PiecewiseConstantFunction(new float[]{-1,1}, new float[]{2,0,-2});
    try {
      root = nrf.findRoot(func, -5, 15, 0.0001f);
    } catch (RuntimeException e) { // failure after too many attempts
View Full Code Here
45
46
47
48
49
50
51
52
53
54
55
    } catch (RuntimeException e) { // failure after too many attempts
    }
   
    func = new Polynomial(new float[]{4f, 2f, -3f, 1f});
    root = nrf.findRoot(func, -5, 15, 0.0001f);
    TestUtil.assertClose(func.map(new float[]{root}), 0, 0.001f);
   
    func = new SigmoidFunction(-1f, 0.3f, -0.5f, 1f);
    root = nrf.findRoot(func, -5, 5, 0.0001f);
    TestUtil.assertClose(func.map(new float[]{root}), 0, 0.001f);
   
View Full Code Here
49
50
51
52
53
54
55
56
57
58
59
    root = nrf.findRoot(func, -5, 15, 0.0001f);
    TestUtil.assertClose(func.map(new float[]{root}), 0, 0.001f);
   
    func = new SigmoidFunction(-1f, 0.3f, -0.5f, 1f);
    root = nrf.findRoot(func, -5, 5, 0.0001f);
    TestUtil.assertClose(func.map(new float[]{root}), 0, 0.001f);
   
    func = new SineFunction(0.5f);
    root = nrf.findRoot(func, -5, 5, 0.0001f);
    TestUtil.assertClose(func.map(new float[]{root}), 0, 0.001f);
  }
View Full Code Here
53
54
55
56
57
58
59
60
    root = nrf.findRoot(func, -5, 5, 0.0001f);
    TestUtil.assertClose(func.map(new float[]{root}), 0, 0.001f);
   
    func = new SineFunction(0.5f);
    root = nrf.findRoot(func, -5, 5, 0.0001f);
    TestUtil.assertClose(func.map(new float[]{root}), 0, 0.001f);
  }
}
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. All rights reserved.
All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.