Debian Codegraph @

gov/fnal/eag/healpix/test/BitManipulationTest.java

raw
1 /*
2 * Created on Mar 15, 2005
3 *
4 */
5 package gov.fnal.eag.healpix.test;
6
7 import gov.fnal.eag.healpix.BitManipulation;
8 import junit.framework.TestCase;
9
10 /**
11 * @author N Kuropatkin
12 *
13 */
14 public class BitManipulationTest extends TestCase {
15 /**
16 * tests bit manipulation methods
17 */
18 public void testBitManipulation() {
19 //
20 long mag1 = 178956970;
21 //
22 long a = 3;
23 long b = BitManipulation.swapLSBMSB(a);
24 assertEquals("swapLSBMSB=" + b, 1, a/b, 1e-10);
25 a = 8;
26 b = BitManipulation.swapLSBMSB(a);
27 assertEquals("swapLSBMSB=" + b, 2, a/b, 1e-10);
28 a = 3;
29 b = BitManipulation.invswapLSBMSB(a);
30 assertEquals("invswapLSBMSB=" + b, -4, b, 1e-10);
31 a = 8;
32 b = BitManipulation.invswapLSBMSB(a);
33 assertEquals("invswapLSBMSB=" + b, -5, b, 1e-10);
34
35 a = 3;
36 b = BitManipulation.invMSB(a);
37 assertEquals("invMSB=" + b, mag1-1, b, 1e-10);
38 a = 8;
39 b = BitManipulation.invMSB(a);
40 assertEquals("invMSB=" + b, mag1-8, b, 1e-10);
41 }
42 /**
43 * test Modulo
44 */
45 public void testMODULO() {
46 //
47 double a = 5.;
48 double b = 3.;
49 double mod = BitManipulation.MODULO(a,b);
50 System.out.println("a="+a+" b="+b+" mod="+mod);
51 a = -5.0;
52 b = 3.0;
53 mod = BitManipulation.MODULO(a,b);
54 System.out.println("a="+a+" b="+b+" mod="+mod);
55 a = 5.0;
56 b = -3.0;
57 mod = BitManipulation.MODULO(a,b);
58 System.out.println("a="+a+" b="+b+" mod="+mod);
59 a = -5.0;
60 b = -3.0;
61 mod = BitManipulation.MODULO(a,b);
62 System.out.println("a="+a+" b="+b+" mod="+mod);
63 a = 8.0;
64 b = 5.0;
65 mod = BitManipulation.MODULO(a,b);
66 System.out.println("a="+a+" b="+b+" mod="+mod);
67 a = -8.0;
68 b = 5.0;
69 mod = BitManipulation.MODULO(a,b);
70 System.out.println("a="+a+" b="+b+" mod="+mod);
71 a = 1.0;
72 b = 4.0;
73 mod = BitManipulation.MODULO(a,b);
74 System.out.println("a="+a+" b="+b+" mod="+mod);
75 }
76 }