LSST Applications 27.0.0,g0265f82a02+469cd937ee,g02d81e74bb+21ad69e7e1,g1470d8bcf6+cbe83ee85a,g2079a07aa2+e67c6346a6,g212a7c68fe+04a9158687,g2305ad1205+94392ce272,g295015adf3+81dd352a9d,g2bbee38e9b+469cd937ee,g337abbeb29+469cd937ee,g3939d97d7f+72a9f7b576,g487adcacf7+71499e7cba,g50ff169b8f+5929b3527e,g52b1c1532d+a6fc98d2e7,g591dd9f2cf+df404f777f,g5a732f18d5+be83d3ecdb,g64a986408d+21ad69e7e1,g858d7b2824+21ad69e7e1,g8a8a8dda67+a6fc98d2e7,g99cad8db69+f62e5b0af5,g9ddcbc5298+d4bad12328,ga1e77700b3+9c366c4306,ga8c6da7877+71e4819109,gb0e22166c9+25ba2f69a1,gb6a65358fc+469cd937ee,gbb8dafda3b+69d3c0e320,gc07e1c2157+a98bf949bb,gc120e1dc64+615ec43309,gc28159a63d+469cd937ee,gcf0d15dbbd+72a9f7b576,gdaeeff99f8+a38ce5ea23,ge6526c86ff+3a7c1ac5f1,ge79ae78c31+469cd937ee,gee10cc3b42+a6fc98d2e7,gf1cff7945b+21ad69e7e1,gfbcc870c63+9a11dc8c8f
LSST Data Management Base Package
Loading...
Searching...
No Matches
Classes | Functions
astshim.test Namespace Reference

Classes

class  MappingTestCase
 
class  ObjectTestCase
 

Functions

 makePolyMapCoeffs (nIn, nOut)
 
 makeTwoWayPolyMap (nIn, nOut)
 
 makeForwardPolyMap (nIn, nOut)
 

Function Documentation

◆ makeForwardPolyMap()

astshim.test.makeForwardPolyMap ( nIn,
nOut )
Make an astshim.PolyMap suitable for testing

The forward transform is the same as for `makeTwoWayPolyMap`.
This map does not have a reverse transform.

The equation is chosen for the following reasons:
- It is well defined for any positive value of nIn, nOut.
- It stays small for small x, to avoid wraparound of angles for
  SpherePoint endpoints.

Definition at line 309 of file test.py.

309def makeForwardPolyMap(nIn, nOut):
310 """Make an astshim.PolyMap suitable for testing
311
312 The forward transform is the same as for `makeTwoWayPolyMap`.
313 This map does not have a reverse transform.
314
315 The equation is chosen for the following reasons:
316 - It is well defined for any positive value of nIn, nOut.
317 - It stays small for small x, to avoid wraparound of angles for
318 SpherePoint endpoints.
319 """
320 forwardCoeffs = makePolyMapCoeffs(nIn, nOut)
321 polyMap = PolyMap(forwardCoeffs, nOut, "IterInverse=0")
322 assert polyMap.nIn == nIn
323 assert polyMap.nOut == nOut
324 assert polyMap.hasForward
325 assert not polyMap.hasInverse
326 return polyMap

◆ makePolyMapCoeffs()

astshim.test.makePolyMapCoeffs ( nIn,
nOut )
Make an array of coefficients for astshim.PolyMap for the following
equation:

fj(x) = C0j x0^2 + C1j x1^2 + C2j x2^2 + ... + CNj xN^2
where:
* i ranges from 0 to N=nIn-1
* j ranges from 0 to nOut-1,
* Cij = 0.001 (i+j+1)

Definition at line 262 of file test.py.

262def makePolyMapCoeffs(nIn, nOut):
263 """Make an array of coefficients for astshim.PolyMap for the following
264 equation:
265
266 fj(x) = C0j x0^2 + C1j x1^2 + C2j x2^2 + ... + CNj xN^2
267 where:
268 * i ranges from 0 to N=nIn-1
269 * j ranges from 0 to nOut-1,
270 * Cij = 0.001 (i+j+1)
271 """
272 baseCoeff = 0.001
273 forwardCoeffs = []
274 for out_ind in range(nOut):
275 coeffOffset = baseCoeff * out_ind
276 for in_ind in range(nIn):
277 coeff = baseCoeff * (in_ind + 1) + coeffOffset
278 coeffArr = [coeff, out_ind + 1] + [2 if i == in_ind else 0 for i in range(nIn)]
279 forwardCoeffs.append(coeffArr)
280 return np.array(forwardCoeffs, dtype=float)
281
282

◆ makeTwoWayPolyMap()

astshim.test.makeTwoWayPolyMap ( nIn,
nOut )
Make an astshim.PolyMap suitable for testing

The forward transform is as follows:
fj(x) = C0j x0^2 + C1j x1^2 + C2j x2^2 + ...
        + CNj xN^2 where Cij = 0.001 (i+j+1)

The reverse transform is the same equation with i and j reversed
thus it is NOT the inverse of the forward direction,
but is something that can be easily evaluated.

The equation is chosen for the following reasons:
- It is well defined for any positive value of nIn, nOut.
- It stays small for small x, to avoid wraparound of angles for
  SpherePoint endpoints.

Definition at line 283 of file test.py.

283def makeTwoWayPolyMap(nIn, nOut):
284 """Make an astshim.PolyMap suitable for testing
285
286 The forward transform is as follows:
287 fj(x) = C0j x0^2 + C1j x1^2 + C2j x2^2 + ...
288 + CNj xN^2 where Cij = 0.001 (i+j+1)
289
290 The reverse transform is the same equation with i and j reversed
291 thus it is NOT the inverse of the forward direction,
292 but is something that can be easily evaluated.
293
294 The equation is chosen for the following reasons:
295 - It is well defined for any positive value of nIn, nOut.
296 - It stays small for small x, to avoid wraparound of angles for
297 SpherePoint endpoints.
298 """
299 forwardCoeffs = makePolyMapCoeffs(nIn, nOut)
300 reverseCoeffs = makePolyMapCoeffs(nOut, nIn)
301 polyMap = PolyMap(forwardCoeffs, reverseCoeffs)
302 assert polyMap.nIn == nIn
303 assert polyMap.nOut == nOut
304 assert polyMap.hasForward
305 assert polyMap.hasInverse
306 return polyMap
307
308