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

108

109

110

111

112

113

114

115

116

117

118

119

120

121

122

123

124

125

126

127

128

129

130

131

132

133

134

135

136

137

138

139

140

141

142

143

144

145

146

147

148

149

150

151

152

# 

# 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 Lsf1dTestCase(unittest.TestCase): 

 

def testBadArgs1(self): 

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

 

x = [630, 1000, 1205, 1427] 

y = [.622, 1.109, 1.198, 1.429] 

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 = [.622, 1.109, 1.198] 

s = [1, 1, 1, 1] 

 

order = 0 

 

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 = [.622, 1.109, 1.198, 1.429] 

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 = [.622, 1.109, 1.198, 1.429] 

s = [1, 1, 1, 1] 

 

order = 5 

 

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

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

 

def testConst1(self): 

"""Check that code fits a dc offset correctly (1)""" 

 

x = [630, 1000, 1205, 1427] 

y = [.622, 1.109, 1.198, 1.429] 

s = [1, 1, 1, 1] 

 

order = 1 

 

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

 

for i in range(1, len(x)): 

self.assertAlmostEqual(lsf.valueAt(x[0]), lsf.valueAt(x[i]), 4) 

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

 

def testCompareToCpp1(self): 

"""Confirm that I get the same behaviour in Python as I 

do in the C++ test fitLinear3 

""" 

 

# This test arises because I was having trouble using Eigen's 

# svd inversion. fitLinear3 in C++ worked fine, but this test 

# behaved differently, and I tracked the result down to 

# the svd routines. 

 

x = [689.301136505, 1112.8573687, 1386.67168477] 

y = [0.66911456573, 1.1147439759, 1.39597284177] 

s = [1, 1, 1] 

 

order = 2 

print() 

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

 

self.assertAlmostEqual(lsf.valueAt(x[0]), 0.670187891961, 4) 

self.assertAlmostEqual(lsf.valueAt(x[1]), 1.11201034929, 4) 

self.assertAlmostEqual(lsf.valueAt(x[2]), 1.39763314215, 4) 

 

def testCompareToCpp2(self): 

"""Confirm that I get the same behaviour in Python as I do in the C++ test fitLinear3 

""" 

 

# This test arises because I was having trouble using Eigen's 

# svd inversion. fitLinear3 in C++ worked fine, but this test 

# behaved differently, and I tracked the result down to 

# the svd routines. 

 

x = [628.857680996, 995.008255088, 1203.39412154, 1425.1404727] 

y = [0.616728229875, 1.01887634344, 1.19679830465, 1.42873084062] 

s = [1, 1, 1, 1] 

 

order = 3 

print() 

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

 

for i in range(len(x)): 

f = lsf.valueAt(x[i]) 

print("%.1f %.3f %.3f" % (x[i], y[i], f)) 

 

self.assertAlmostEqual(lsf.valueAt(x[0]), y[0], 1) 

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

self.assertAlmostEqual(lsf.valueAt(x[2]), y[2], 1) 

 

 

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

pass 

 

 

def setup_module(module): 

lsst.utils.tests.init() 

 

 

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

lsst.utils.tests.init() 

unittest.main()