Debian Codegraph @

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

raw
1 package gov.fnal.eag.healpix.test;
2 import java.io.File;
3 import java.io.FileNotFoundException;
4 import java.io.OutputStream;
5 import java.io.PrintStream;
6 import java.util.ArrayList;
7 import java.util.Collections;
8 import java.util.HashSet;
9
10 import gov.fnal.eag.healpix.BitManipulation;
11 import gov.fnal.eag.healpix.PixTools;
12 import javax.vecmath.Vector3d;
13 import junit.framework.*;
14
15 public class QueryDiscTest extends TestCase {
16 public void testQueryDisc () {
17 long nside = 32;
18
19 int nest = 0;
20 int inclusive = 0;
21 double radius = Math.PI;
22 double radius1 = Math.PI/2.;
23 PixTools pt = new PixTools();
24 int npix = (int) pt.Nside2Npix(nside);
25 double res = pt.PixRes(nside); // pixel size in radians
26 System.out.println("res="+res);
27 double pixSize = Math.toRadians(res/3600.0); // pixel size in radians
28 System.out.println("pixSize="+pixSize+" rad");
29
30
31 ArrayList fullSky = pt.query_disc(nside, new Vector3d(0., 0., 1.), radius, nest, inclusive);
32 ArrayList firstHalfSky = pt.query_disc(nside, new Vector3d(0., 0., 1.), radius1, nest, inclusive);
33 ArrayList secondHalfSky = pt.query_disc(nside, new Vector3d(0., 0., -1.), radius1, nest, inclusive);
34 firstHalfSky.addAll(secondHalfSky);
35 HashSet pixHalfsUnique = new HashSet(firstHalfSky);
36 ArrayList pixHalfsList = new ArrayList(pixHalfsUnique);
37 Collections.sort(pixHalfsList);
38 Collections.sort(fullSky);
39
40 long listL = Math.min(fullSky.size(),pixHalfsList.size() );
41 assertEquals(npix,fullSky.size());
42 assertEquals(npix,listL);
43 for ( int i=0; i< listL; i++) {
44
45 assertEquals(fullSky.get(i),pixHalfsList.get(i));
46 }
47
48 double[] ang_tup = { 0., 0. };
49 Vector3d v = new Vector3d(1., 0., 0.);
50 Vector3d v1 = new Vector3d(-1., 0., 0.);
51 ang_tup = pt.Vect2Ang(v);
52
53 firstHalfSky = pt.query_disc(nside, new Vector3d(1., 0., 0.), radius1, nest, inclusive);
54 secondHalfSky = pt.query_disc(nside, new Vector3d(-1., 0., 0.),radius1, nest, inclusive);
55 firstHalfSky.addAll(secondHalfSky);
56 pixHalfsUnique = new HashSet(firstHalfSky);
57 pixHalfsList = new ArrayList(pixHalfsUnique);
58
59 Collections.sort(pixHalfsList);
60 // System.out.println("full size="+fullSky.size()+" half size="+pixHalfsList.size());
61 listL = Math.min(fullSky.size(),pixHalfsList.size() );
62 assertEquals(npix,fullSky.size());
63 assertEquals(npix,listL);
64 for ( int i=0; i< listL; i++) {
65 // System.out.println( "i="+i+" "+fullSky.get(i)+" "+pixHalfsList.get(i));
66 assertEquals(fullSky.get(i),pixHalfsList.get(i));
67 }
68
69
70 firstHalfSky = pt.query_disc(nside, new Vector3d(0., 1., 0.), radius1, nest, inclusive);
71 secondHalfSky = pt.query_disc(nside, new Vector3d(0., -1., 0.), radius1, nest, inclusive);
72 firstHalfSky.addAll(secondHalfSky);
73 pixHalfsUnique = new HashSet(firstHalfSky);
74 pixHalfsList = new ArrayList(pixHalfsUnique);
75 Collections.sort(pixHalfsList);
76 // System.out.println("full size="+fullSky.size()+" half size="+pixHalfsList.size());
77 listL = Math.min(fullSky.size(),pixHalfsList.size() );
78 assertEquals(npix,fullSky.size());
79
80 for ( int i=0; i< listL; i++) {
81
82 assertEquals(fullSky.get(i),pixHalfsList.get(i));
83 }
84
85 }
86
87 public void testQueryCircle(){
88 PixTools pt = new PixTools();
89
90 long nside = 512;
91
92 double angle = Math.toRadians(0.011451621372724687);
93 // double angle = Math.toRadians(0.11451621372724687);
94 Vector3d v = new Vector3d(0.8956388362603873,
95 -1.838600645782914E-4, 0.44478201534866);
96
97 //convert vector to IPIX
98 long ipix = pt.vect2pix_ring(nside, v);
99 //and query circle
100 ArrayList r = pt.query_disc(nside,v,angle,0,1);
101
102 //now make test that IPIX is in Circle, this will fail
103 System.out.println("ipix = "+ipix);
104 System.out.println("disc: "+r);
105 //ipix = 875520
106 //disc: [873471, 871424, 875519, 873472]
107
108 assertTrue("pixel not found in disc",r.contains(new Long(ipix)));
109 ArrayList r1 = pt.query_disc(nside,v,angle,0,0);
110 assertTrue("pixel not found in disc",r1.contains(new Long(ipix)));
111 }
112 /**
113 * additional tests of Query_Disc method
114 * @throws Exception
115 */
116 public void testQuery_Disc_1() throws Exception {
117 System.out.println(" Start test query_disc_1 !!!!!!!!!!!!!!!!!!!!!");
118 long[] case1 = {282, 271, 280, 269};
119 long[] case2 = { 295, 293, 292};
120 long[] case3 = {312, 301, 306, 305, 300, 295, 304, 294, 293, 282, 291, 292, 271, 289, 270, 269, 267};
121 long[] case4 = { 63, 127, 191, 255, 62, 61, 126, 125, 190, 189, 254, 253};
122
123 PixTools pt = new PixTools();
124 long nside = 8;
125 int nest = 1;
126 long ipix = 0;
127 System.out.println("case 1");
128 double pixres= Math.toRadians(pt.PixRes(nside)/3600.);
129 System.out.println("pix res="+pixres+" rad");
130
131 int inclusive = 1;
132 double radius = Math.toRadians(1.932);
133
134 double[] radec = new double[]{5.64001,-4.57566};
135 double[] polar = pt.RaDecToPolar(radec);
136 Vector3d v = pt.Ang2Vec(polar[0], polar[1]);
137 ArrayList pixlist;
138 pixlist = pt.query_disc(nside, v, radius, nest, inclusive);
139
140 int nlist = pixlist.size();
141 long pixel =pt.vect2pix_nest(nside,v);
142
143 System.out.println(" radius="+radius+" center pixel="+pixel);
144 for (int i = 0; i < nlist; i++) {
145 ipix = ((Long) pixlist.get(i)).longValue();
146 System.out.println("i="+i+" pixel="+ipix);
147 assertEquals("pixel = " + ipix, case1[i], ipix, 1e-10);
148 }
149 System.out.println("case 2");
150 radec = new double[]{351.04536,1.74210};
151 polar = pt.RaDecToPolar(radec);
152 v = pt.Ang2Vec(polar[0], polar[1]);
153 radius = Math.toRadians(1.932);
154
155 pixlist = pt.query_disc(nside, v, radius, nest, inclusive);
156
157 nlist = pixlist.size();
158 pixel =pt.vect2pix_nest(nside,v);
159 System.out.println(" radius="+radius+" center pixel="+pixel);
160 for (int i = 0; i < nlist; i++) {
161 ipix = ((Long) pixlist.get(i)).longValue();
162 System.out.println("i="+i+" pixel="+ipix);
163 assertEquals("pixel = " + ipix, case2[i], ipix, 1e-10);
164 }
165 System.out.println("case 3");
166 radius = Math.toRadians(10.68);
167 radec = new double[]{348.86174 ,-0.07390};
168 polar = pt.RaDecToPolar(radec);
169 v = pt.Ang2Vec(polar[0], polar[1]);
170 pixlist = pt.query_disc(nside, v, radius, nest, inclusive);
171
172 nlist = pixlist.size();
173 pixel =pt.vect2pix_nest(nside,v);
174 System.out.println(" radius="+radius+" center pixel="+pixel);
175 for (int i = 0; i < nlist; i++) {
176 ipix = ((Long) pixlist.get(i)).longValue();
177 System.out.println("i="+i+" pixel="+ipix);
178 assertEquals("pixel = " + ipix, case3[i], ipix, 1e-10);
179 }
180 //
181 System.out.println(" case 4");
182 radius = Math.toRadians(4.134);
183
184 radec = new double[]{182.95228, 89.43585};
185 polar = pt.RaDecToPolar(radec);
186 v = pt.Ang2Vec(polar[0], polar[1]);
187 pixlist = pt.query_disc(nside, v, radius, nest, inclusive);
188
189 nlist = pixlist.size();
190 pixel =pt.vect2pix_nest(nside,v);
191 System.out.println(" radius="+radius+" center pixel="+pixel);
192 for (int i = 0; i < nlist; i++) {
193 ipix = ((Long) pixlist.get(i)).longValue();
194 System.out.println("i="+i+" pixel="+ipix);
195 assertEquals("pixel = " + ipix, case4[i], ipix, 1e-10);
196 }
197
198
199 System.out.println(" End query_disk_1 test ______________________________");
200 }
201 }