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

# 

# Developed for the LSST Data Management System. 

# This product includes software developed by the LSST Project 

# (https://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 <https://www.gnu.org/licenses/>. 

# 

 

import unittest 

 

import lsst.utils.tests 

from _cache import NumbersCache 

 

 

def numberToWords(value): 

"""Convert a number in the range [0, 1000) to words""" 

assert value >= 0 and isinstance(value, int), "Only non-negative integers" 

if value < 20: 

return { 

0: "zero", 

1: "one", 

2: "two", 

3: "three", 

4: "four", 

5: "five", 

6: "six", 

7: "seven", 

8: "eight", 

9: "nine", 

10: "ten", 

11: "eleven", 

12: "twelve", 

13: "thirteen", 

14: "fourteen", 

15: "fifteen", 

16: "sixteen", 

17: "seventeen", 

18: "eighteen", 

19: "nineteen", 

}[value] 

if value < 100: 

tens = value//10 

ones = value % 10 

return { 

2: "twenty", 

3: "thirty", 

4: "forty", 

5: "fifty", 

6: "sixty", 

7: "seventy", 

8: "eighty", 

9: "ninety", 

}[tens] + (("-" + numberToWords(ones)) if ones > 0 else "") 

assert value < 1000, "Value exceeds limit of 999" 

hundreds = value//100 

rest = value % 100 

return numberToWords(hundreds) + " hundred" + ((" " + numberToWords(rest)) if rest > 0 else "") 

 

 

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

"""Tests of lsst.utils.Cache""" 

def check(self, addFunction): 

"""Exercise the Cache 

 

The `addFunction` should take a cache and number, 

and add the number (and its corresponding string) 

into the cache. 

""" 

capacity = 10 

cache = NumbersCache(capacity) 

self.assertEqual(cache.size(), 0, "Starts empty") 

self.assertEqual(cache.capacity(), capacity, "Capacity as requested") 

maximum = 20 

for ii in range(maximum): 

addFunction(cache, ii) 

self.assertEqual(cache.size(), capacity, "Filled to capacity") 

self.assertEqual(cache.capacity(), capacity, "Capacity unchanged") 

for ii in range(maximum - capacity): 

self.assertNotIn(ii, cache, "Should have been expunged") 

expectedContents = list(range(maximum - 1, maximum - capacity - 1, -1)) # Last in, first out 

actualContents = cache.keys() 

for ii in expectedContents: 

self.assertIn(ii, cache, "Should be present") 

self.assertEqual(cache[ii], numberToWords(ii), "Value accessible and as expected") 

self.assertListEqual(actualContents, expectedContents, "Contents are as expected") 

with self.assertRaises(LookupError): 

cache[maximum - capacity - 1] 

newCapacity = 5 

cache.reserve(newCapacity) 

# The new list of contents is smaller, but also reversed because we've gone through the cache 

# touching items. 

newExpectedContents = list(reversed(expectedContents))[:newCapacity] 

self.assertEqual(cache.capacity(), newCapacity, "Capacity changed") 

self.assertEqual(cache.size(), newCapacity, "Size changed to correspond to new capacity") 

self.assertListEqual(cache.keys(), newExpectedContents, "Most recent kept") 

cache.flush() 

self.assertEqual(cache.size(), 0, "Flushed everything out") 

self.assertEqual(cache.capacity(), newCapacity, "Capacity unchanged") 

return cache 

 

def testDirect(self): 

"""Directly add key,value pairs into the cache with Cache.add""" 

self.check(lambda cache, index: cache.add(index, numberToWords(index))) 

 

def testLazy(self): 

"""Exercise the lazy function call in Cache.operator()""" 

def addFunction(cache, index): 

value = cache(index, lambda ii: numberToWords(ii)) 

self.assertEqual(value, numberToWords(index)) 

 

cache = self.check(addFunction) 

 

# Check that the function call doesn't fire when we pull out something that's in there already 

def trap(key): 

raise AssertionError("Failed") 

 

for index in cache.keys(): 

value = cache(index, trap) 

self.assertEqual(value, numberToWords(index)) 

 

# Check that this checking technique actually works... 

with self.assertRaises(AssertionError): 

cache(999, trap) 

 

 

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

pass 

 

 

def setup_module(module): 

lsst.utils.tests.init() 

 

 

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

import sys 

setup_module(sys.modules[__name__]) 

unittest.main()