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

153

154

155

156

157

158

159

160

161

162

163

164

165

166

167

168

169

170

171

172

173

174

175

176

177

178

179

180

181

182

183

184

185

186

187

188

189

190

191

192

193

194

195

196

197

198

199

200

201

202

203

204

205

206

207

208

209

210

211

212

213

# This file is part of daf_butler. 

# 

# Developed for the LSST Data Management System. 

# This product includes software developed by the LSST Project 

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

# See the COPYRIGHT file at the top-level directory of this distribution 

# for details of code ownership. 

# 

# 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 GNU General Public License 

# along with this program. If not, see <http://www.gnu.org/licenses/>. 

 

import unittest 

import inspect 

import pickle 

from itertools import permutations 

from random import shuffle 

 

import lsst.utils.tests 

 

from lsst.daf.butler.core.utils import iterable, doImport, getFullTypeName, Singleton, TopologicalSet 

from lsst.daf.butler.core.formatter import Formatter 

from lsst.daf.butler import StorageClass 

 

 

class IterableTestCase(lsst.utils.tests.TestCase): 

"""Tests for `iterable` helper. 

""" 

 

def testNonIterable(self): 

self.assertEqual(list(iterable(0)), [0, ]) 

 

def testString(self): 

self.assertEqual(list(iterable("hello")), ["hello", ]) 

 

def testIterableNoString(self): 

self.assertEqual(list(iterable([0, 1, 2])), [0, 1, 2]) 

self.assertEqual(list(iterable(["hello", "world"])), ["hello", "world"]) 

 

 

class ImportTestCase(unittest.TestCase): 

"""Basic tests of doImport.""" 

 

def testDoImport(self): 

c = doImport("lsst.daf.butler.core.formatter.Formatter") 

self.assertEqual(c, Formatter) 

 

c = doImport("lsst.daf.butler.core.utils.doImport") 

self.assertEqual(type(c), type(doImport)) 

self.assertTrue(inspect.isfunction(c)) 

 

c = doImport("lsst.daf.butler") 

self.assertTrue(inspect.ismodule(c)) 

 

c = doImport("lsst.daf.butler.core.config.Config.ppprint") 

self.assertTrue(inspect.isfunction(c)) 

 

with self.assertRaises(ImportError): 

doImport("lsst.daf.butler.core.config.Config.xyprint") 

 

with self.assertRaises(ImportError): 

doImport("lsst.daf.butler.nothere") 

 

with self.assertRaises(ModuleNotFoundError): 

doImport("missing module") 

 

with self.assertRaises(ModuleNotFoundError): 

doImport("lsstdummy.import.fail") 

 

with self.assertRaises(ImportError): 

doImport("lsst.import.fail") 

 

with self.assertRaises(ImportError): 

doImport("lsst.daf.butler.x") 

 

with self.assertRaises(TypeError): 

doImport([]) 

 

 

class SingletonTestCase(lsst.utils.tests.TestCase): 

"""Tests of the Singleton metaclass""" 

 

class IsSingleton(metaclass=Singleton): 

def __init__(self): 

self.data = {} 

self.id = 0 

 

class IsBadSingleton(IsSingleton): 

def __init__(self, arg): 

"""A singleton can not accept any arguments.""" 

self.arg = arg 

 

class IsSingletonSubclass(IsSingleton): 

def __init__(self): 

super().__init__() 

 

def testSingleton(self): 

one = SingletonTestCase.IsSingleton() 

two = SingletonTestCase.IsSingleton() 

 

# Now update the first one and check the second 

one.data["test"] = 52 

self.assertEqual(one.data, two.data) 

two.id += 1 

self.assertEqual(one.id, two.id) 

 

three = SingletonTestCase.IsSingletonSubclass() 

self.assertNotEqual(one.id, three.id) 

 

with self.assertRaises(TypeError): 

SingletonTestCase.IsBadSingleton(52) 

 

 

class TopologicalSetTestCase(lsst.utils.tests.TestCase): 

"""Tests of the TopologicalSet class""" 

 

def testConstructor(self): 

elements = [1, 5, 7, 3, 10, 11] 

topologicalSet = TopologicalSet(elements) 

for e in elements: 

self.assertIn(e, topologicalSet) 

self.assertEqual(len(elements), len(topologicalSet)) 

 

def testConnect(self): 

elements = ["a", "d", "f"] 

topologicalSet = TopologicalSet(elements) 

# Adding connections should work 

topologicalSet.connect("a", "d") 

topologicalSet.connect("a", "f") 

# Even when adding cycles (unfortunately) 

topologicalSet.connect("f", "a") 

# Adding a connection from or to a non existing element should also fail 

with self.assertRaises(KeyError): 

topologicalSet.connect("a", "c") 

with self.assertRaises(KeyError): 

topologicalSet.connect("c", "a") 

with self.assertRaises(KeyError): 

topologicalSet.connect("c", "g") 

with self.assertRaises(ValueError): 

topologicalSet.connect("c", "c") 

 

def testTopologicalOrdering(self): 

"""Iterating over a TopologicalSet should visit the elements 

in the set in topologically sorted order. 

""" 

# First check a basic topological ordering 

elements = ["shoes", "belt", "trousers"] 

for p in permutations(elements): 

topologicalSet = TopologicalSet(p) 

topologicalSet.connect("belt", "shoes") 

topologicalSet.connect("trousers", "shoes") 

# Check valid orderings 

self.assertIn(list(topologicalSet), [["belt", "trousers", "shoes"], 

["trousers", "belt", "shoes"]]) 

# Check invalid orderings (probably redundant) 

self.assertNotIn(list(topologicalSet), [["shoes", "belt", "trousers"], 

["shoes", "trousers", "belt"]]) 

# Adding a cycle should cause iteration to fail 

topologicalSet.connect("shoes", "belt") 

with self.assertRaises(ValueError): 

ignore = list(topologicalSet) # noqa F841 

# Now check for a larger number of elements. 

# Here we can't possibly test all possible valid topological orderings, 

# so instead we connect all elements. 

# Thus the topological sort should be equivalent to a regular sort 

# (but less efficient). 

N = 100 

elements = list(range(N)) 

unorderedElements = elements.copy() 

shuffle(unorderedElements) 

topologicalSet2 = TopologicalSet(unorderedElements) 

for i in range(N-1): 

topologicalSet2.connect(i, i+1) 

self.assertEqual(list(topologicalSet2), elements) 

 

def testPickle(self): 

"""Should be possible to pickle. 

""" 

elements = ["a", "d", "f"] 

topologicalSet = TopologicalSet(elements) 

# Adding connections should work 

topologicalSet.connect("a", "d") 

topologicalSet.connect("a", "f") 

out = pickle.loads(pickle.dumps(topologicalSet)) 

self.assertEqual(out, topologicalSet) 

 

 

class TestButlerUtils(lsst.utils.tests.TestCase): 

"""Tests of the simple utilities.""" 

 

def testTypeNames(self): 

# Check types and also an object 

tests = [(Formatter, "lsst.daf.butler.core.formatter.Formatter"), 

(doImport, "lsst.daf.butler.core.utils.doImport"), 

(int, "builtins.int"), 

(StorageClass, "lsst.daf.butler.core.storageClass.StorageClass"), 

(StorageClass(None), "lsst.daf.butler.core.storageClass.StorageClass")] 

 

for item, typeName in tests: 

self.assertEqual(getFullTypeName(item), typeName) 

 

 

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

unittest.main()