/usr/share/pyshared/zope/index/field/tests.py is in python-zope.index 3.6.4-0ubuntu1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 | ##############################################################################
#
# Copyright (c) 2002 Zope Foundation and Contributors.
# All Rights Reserved.
#
# This software is subject to the provisions of the Zope Public License,
# Version 2.1 (ZPL). A copy of the ZPL should accompany this distribution.
# THIS SOFTWARE IS PROVIDED "AS IS" AND ANY AND ALL EXPRESS OR IMPLIED
# WARRANTIES ARE DISCLAIMED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
# WARRANTIES OF TITLE, MERCHANTABILITY, AGAINST INFRINGEMENT, AND FITNESS
# FOR A PARTICULAR PURPOSE.
#
##############################################################################
"""Test field index
"""
import unittest
import doctest
_marker = object()
class FieldIndexTests(unittest.TestCase):
def _getTargetClass(self):
from zope.index.field import FieldIndex
return FieldIndex
def _makeOne(self, family=_marker):
if family is _marker:
return self._getTargetClass()()
return self._getTargetClass()(family)
def _populateIndex(self, index):
index.index_doc(5, 1) # docid, obj
index.index_doc(2, 2)
index.index_doc(1, 3)
index.index_doc(3, 4)
index.index_doc(4, 5)
index.index_doc(8, 6)
index.index_doc(9, 7)
index.index_doc(7, 8)
index.index_doc(6, 9)
index.index_doc(11, 10)
index.index_doc(10, 11)
def test_class_conforms_to_IInjection(self):
from zope.interface.verify import verifyClass
from zope.index.interfaces import IInjection
verifyClass(IInjection, self._getTargetClass())
def test_instance_conforms_to_IInjection(self):
from zope.interface.verify import verifyObject
from zope.index.interfaces import IInjection
verifyObject(IInjection, self._makeOne())
def test_class_conforms_to_IIndexSearch(self):
from zope.interface.verify import verifyClass
from zope.index.interfaces import IIndexSearch
verifyClass(IIndexSearch, self._getTargetClass())
def test_instance_conforms_to_IIndexSearch(self):
from zope.interface.verify import verifyObject
from zope.index.interfaces import IIndexSearch
verifyObject(IIndexSearch, self._makeOne())
def test_class_conforms_to_IStatistics(self):
from zope.interface.verify import verifyClass
from zope.index.interfaces import IStatistics
verifyClass(IStatistics, self._getTargetClass())
def test_instance_conforms_to_IStatistics(self):
from zope.interface.verify import verifyObject
from zope.index.interfaces import IStatistics
verifyObject(IStatistics, self._makeOne())
def test_ctor_defaults(self):
import BTrees
index = self._makeOne()
self.failUnless(index.family is BTrees.family32)
self.assertEqual(index.documentCount(), 0)
self.assertEqual(index.wordCount(), 0)
def test_ctor_explicit_family(self):
import BTrees
index = self._makeOne(BTrees.family64)
self.failUnless(index.family is BTrees.family64)
def test_index_doc_new(self):
index = self._makeOne()
index.index_doc(1, 'value')
self.assertEqual(index.documentCount(), 1)
self.assertEqual(index.wordCount(), 1)
self.failUnless(1 in index._rev_index)
self.failUnless('value' in index._fwd_index)
def test_index_doc_existing_same_value(self):
index = self._makeOne()
index.index_doc(1, 'value')
index.index_doc(1, 'value')
self.assertEqual(index.documentCount(), 1)
self.assertEqual(index.wordCount(), 1)
self.failUnless(1 in index._rev_index)
self.failUnless('value' in index._fwd_index)
self.assertEqual(list(index._fwd_index['value']), [1])
def test_index_doc_existing_new_value(self):
index = self._makeOne()
index.index_doc(1, 'value')
index.index_doc(1, 'new_value')
self.assertEqual(index.documentCount(), 1)
self.assertEqual(index.wordCount(), 1)
self.failUnless(1 in index._rev_index)
self.failIf('value' in index._fwd_index)
self.failUnless('new_value' in index._fwd_index)
self.assertEqual(list(index._fwd_index['new_value']), [1])
def test_unindex_doc_nonesuch(self):
index = self._makeOne()
index.unindex_doc(1) # doesn't raise
def test_unindex_doc_no_residual_fwd_values(self):
index = self._makeOne()
index.index_doc(1, 'value')
index.unindex_doc(1) # doesn't raise
self.assertEqual(index.documentCount(), 0)
self.assertEqual(index.wordCount(), 0)
self.failIf(1 in index._rev_index)
self.failIf('value' in index._fwd_index)
def test_unindex_doc_w_residual_fwd_values(self):
index = self._makeOne()
index.index_doc(1, 'value')
index.index_doc(2, 'value')
index.unindex_doc(1) # doesn't raise
self.assertEqual(index.documentCount(), 1)
self.assertEqual(index.wordCount(), 1)
self.failIf(1 in index._rev_index)
self.failUnless(2 in index._rev_index)
self.failUnless('value' in index._fwd_index)
self.assertEqual(list(index._fwd_index['value']), [2])
def test_apply_non_tuple_raises(self):
index = self._makeOne()
self.assertRaises(TypeError, index.apply, ['a', 'b'])
def test_apply_empty_tuple_raises(self):
index = self._makeOne()
self.assertRaises(TypeError, index.apply, ('a',))
def test_apply_one_tuple_raises(self):
index = self._makeOne()
self.assertRaises(TypeError, index.apply, ('a',))
def test_apply_three_tuple_raises(self):
index = self._makeOne()
self.assertRaises(TypeError, index.apply, ('a', 'b', 'c'))
def test_apply_two_tuple_miss(self):
index = self._makeOne()
self.assertEqual(list(index.apply(('a', 'b'))), [])
def test_apply_two_tuple_hit(self):
index = self._makeOne()
index.index_doc(1, 'albatross')
self.assertEqual(list(index.apply(('a', 'b'))), [1])
def test_sort_w_limit_lt_1(self):
index = self._makeOne()
self.assertRaises(ValueError,
lambda: list(index.sort([1, 2, 3], limit=0)))
def test_sort_w_empty_index(self):
index = self._makeOne()
self.assertEqual(list(index.sort([1, 2, 3])), [])
def test_sort_w_empty_docids(self):
index = self._makeOne()
index.index_doc(1, 'albatross')
self.assertEqual(list(index.sort([])), [])
def test_sort_w_missing_docids(self):
index = self._makeOne()
index.index_doc(1, 'albatross')
self.assertEqual(list(index.sort([2, 3])), [])
def test_sort_force_nbest_w_missing_docids(self):
index = self._makeOne()
index._use_nbest = True
index.index_doc(1, 'albatross')
self.assertEqual(list(index.sort([2, 3])), [])
def test_sort_force_lazy_w_missing_docids(self):
index = self._makeOne()
index._use_lazy = True
index.index_doc(1, 'albatross')
self.assertEqual(list(index.sort([2, 3])), [])
def test_sort_lazy_nolimit(self):
from BTrees.IFBTree import IFSet
index = self._makeOne()
index._use_lazy = True
self._populateIndex(index)
c1 = IFSet([1, 2, 3, 4, 5])
result = index.sort(c1)
self.assertEqual(list(result), [5, 2, 1, 3, 4])
def test_sort_lazy_withlimit(self):
from BTrees.IFBTree import IFSet
index = self._makeOne()
index._use_lazy = True
self._populateIndex(index)
c1 = IFSet([1, 2, 3, 4, 5])
result = index.sort(c1, limit=3)
self.assertEqual(list(result), [5, 2, 1])
def test_sort_nonlazy_nolimit(self):
from BTrees.IFBTree import IFSet
index = self._makeOne()
self._populateIndex(index)
c1 = IFSet([1, 2, 3, 4, 5])
result = index.sort(c1)
self.assertEqual(list(result), [5, 2, 1, 3, 4])
def test_sort_nonlazy_missingdocid(self):
from BTrees.IFBTree import IFSet
index = self._makeOne()
self._populateIndex(index)
c1 = IFSet([1, 2, 3, 4, 5, 99])
result = index.sort(c1)
self.assertEqual(list(result), [5, 2, 1, 3, 4]) # 99 not present
def test_sort_nonlazy_withlimit(self):
from BTrees.IFBTree import IFSet
index = self._makeOne()
self._populateIndex(index)
c1 = IFSet([1, 2, 3, 4, 5])
result = index.sort(c1, limit=3)
self.assertEqual(list(result), [5, 2, 1])
def test_sort_nonlazy_reverse_nolimit(self):
from BTrees.IFBTree import IFSet
index = self._makeOne()
self._populateIndex(index)
c1 = IFSet([1, 2, 3, 4, 5])
result = index.sort(c1, reverse=True)
self.assertEqual(list(result), [4, 3, 1, 2, 5])
def test_sort_nonlazy_reverse_withlimit(self):
from BTrees.IFBTree import IFSet
index = self._makeOne()
self._populateIndex(index)
c1 = IFSet([1, 2, 3, 4, 5])
result = index.sort(c1, reverse=True, limit=3)
self.assertEqual(list(result), [4, 3, 1])
def test_sort_nbest(self):
from BTrees.IFBTree import IFSet
index = self._makeOne()
index._use_nbest = True
self._populateIndex(index)
c1 = IFSet([1, 2, 3, 4, 5])
result = index.sort(c1, limit=3)
self.assertEqual(list(result), [5, 2, 1])
def test_sort_nbest_reverse(self):
from BTrees.IFBTree import IFSet
index = self._makeOne()
index._use_nbest = True
self._populateIndex(index)
c1 = IFSet([1, 2, 3, 4, 5])
result = index.sort(c1, reverse=True, limit=3)
self.assertEqual(list(result), [4, 3, 1])
def test_sort_nbest_missing(self):
from BTrees.IFBTree import IFSet
index = self._makeOne()
index._use_nbest = True
self._populateIndex(index)
c1 = IFSet([1, 2, 3, 4, 5, 99])
result = index.sort(c1, limit=3)
self.assertEqual(list(result), [5, 2, 1])
def test_sort_nbest_missing_reverse(self):
from BTrees.IFBTree import IFSet
index = self._makeOne()
index._use_nbest = True
self._populateIndex(index)
c1 = IFSet([1, 2, 3, 4, 5, 99])
result = index.sort(c1, reverse=True, limit=3)
self.assertEqual(list(result), [4, 3, 1])
def test_sort_nodocs(self):
from BTrees.IFBTree import IFSet
index = self._makeOne()
c1 = IFSet([1, 2, 3, 4, 5])
result = index.sort(c1)
self.assertEqual(list(result), [])
def test_sort_nodocids(self):
from BTrees.IFBTree import IFSet
index = self._makeOne()
self._populateIndex(index)
c1 = IFSet()
result = index.sort(c1)
self.assertEqual(list(result), [])
def test_sort_badlimit(self):
from BTrees.IFBTree import IFSet
index = self._makeOne()
self._populateIndex(index)
c1 = IFSet([1, 2, 3, 4, 5])
result = index.sort(c1, limit=0)
self.assertRaises(ValueError, list, result)
def test_suite():
return unittest.TestSuite((
doctest.DocFileSuite('README.txt', optionflags=doctest.ELLIPSIS),
unittest.makeSuite(FieldIndexTests),
))
if __name__=='__main__':
unittest.main(defaultTest='test_suite')
|