Hide keyboard shortcuts

Hot-keys on this page

r m x p   toggle line displays

j k   next/prev highlighted chunk

0   (zero) top of page

1   (one) first highlighted chunk

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

35

36

37

38

39

40

41

42

43

44

45

46

47

48

49

50

51

52

53

54

55

56

57

58

59

60

61

62

63

64

65

66

67

68

69

70

71

72

73

74

75

76

77

78

79

80

81

82

83

84

85

86

87

88

89

90

91

92

93

94

95

96

97

98

99

100

101

102

103

104

105

106

107

# 

# LSST Data Management System 

# Copyright 2008, 2009, 2010 LSST Corporation. 

# 

# This product includes software developed by the 

# LSST Project (http://www.lsst.org/). 

# 

# This program is free software: you can redistribute it and/or modify 

# it under the terms of the GNU General Public License as published by 

# the Free Software Foundation, either version 3 of the License, or 

# (at your option) any later version. 

# 

# This program is distributed in the hope that it will be useful, 

# but WITHOUT ANY WARRANTY; without even the implied warranty of 

# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 

# GNU General Public License for more details. 

# 

# You should have received a copy of the LSST License Statement and 

# the GNU General Public License along with this program. If not, 

# see <http://www.lsstcorp.org/LegalNotices/>. 

# 

import unittest 

 

import lsst.utils.tests 

import lsst.pex.exceptions 

import lsst.meas.astrom.sip as sip 

 

 

class Lsf2dTestCase(unittest.TestCase): 

 

def testBadArgs1(self): 

"""Check that code fails when order is too low""" 

 

x = [630, 1000, 1205, 1427] 

y = [535, 929, 623, 602] 

s = [1, 1, 1, 1] 

 

order = 0 

 

with self.assertRaises(lsst.pex.exceptions.Exception): 

sip.LeastSqFitter1dPoly(x, y, s, order) 

 

def testBadArgs2(self): 

"""Check that code fails when not len(x) != len(y)""" 

 

x = [630, 1000, 1205, 1427] 

y = [535, 929, 623] 

s = [1, 1, 1, 1] 

 

order = 2 

 

with self.assertRaises(lsst.pex.exceptions.Exception): 

sip.LeastSqFitter1dPoly(x, y, s, order) 

 

def testBadArgs3(self): 

"""Check that code fails when not len(x) != len(s)""" 

 

x = [630, 1000, 1205, 1427] 

y = [535, 929, 623, 602] 

s = [1, 1, 1, 1, 1] 

 

order = 0 

 

with self.assertRaises(lsst.pex.exceptions.Exception): 

sip.LeastSqFitter1dPoly(x, y, s, order) 

 

def testBadArgs4(self): 

"""Check that code fails when not order > number data points""" 

 

x = [630, 1000, 1205, 1427] 

y = [535, 929, 623, 602] 

s = [1, 1, 1, 1] 

 

order = 5 

 

with self.assertRaises(lsst.pex.exceptions.Exception): 

sip.LeastSqFitter1dPoly(x, y, s, order) 

 

def testFitLinearXSurface2(self): 

"""Python equivalent of C++ test case""" 

 

x = [599.59899999999993, 1172.7726619709097, 512.51199999999994, 1083.6078436082901] 

y = [512.0, 539.77214401699996, 541.0, 562.09371856300004] 

z = [0.5989999999999327, 1.1716010609097793, 0.51199999999994361, 1.0825253182899814] 

s = [.1, .1, .1, .1] 

 

print(" ") 

lsf = sip.LeastSqFitter2dPoly(x, y, z, s, 2) 

print(lsf.getParams()) 

 

print("Output:") 

for i in range(len(x)): 

print(x[i], y[i], z[i], lsf.valueAt(x[i], y[i])) 

self.assertAlmostEqual(z[i], lsf.valueAt(x[i], y[i])) 

 

 

class MemoryTester(lsst.utils.tests.MemoryTestCase): 

pass 

 

 

def setup_module(module): 

lsst.utils.tests.init() 

 

 

105 ↛ 106line 105 didn't jump to line 106, because the condition on line 105 was never trueif __name__ == "__main__": 

lsst.utils.tests.init() 

unittest.main()