/usr/share/pyshared/zope/index/keyword/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 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 | ##############################################################################
#
# 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.
#
##############################################################################
import unittest
class _KeywordIndexTestsBase:
def _getTargetClass(self):
from zope.index.keyword.index import KeywordIndex
return KeywordIndex
def _populate(self, index):
index.index_doc(1, ('zope', 'CMF', 'Zope3'))
index.index_doc(2, ('the', 'quick', 'brown', 'FOX'))
index.index_doc(3, ('Zope',))
index.index_doc(4, ())
index.index_doc(5, ('cmf',))
_populated_doc_count = 4
_populated_word_count = 9
def test_normalize(self):
index = self._makeOne()
self.assertEqual(index.normalize(['Foo']), ['Foo'])
def test_simplesearch(self):
index = self._makeOne()
self._populate(index)
self._search(index, [''], self.IFSet())
self._search(index, 'cmf', self.IFSet([5]))
self._search(index, ['cmf'], self.IFSet([5]))
self._search(index, ['Zope'], self.IFSet([3]))
self._search(index, ['Zope3'], self.IFSet([1]))
self._search(index, ['foo'], self.IFSet())
def test_search_and(self):
index = self._makeOne()
self._populate(index)
self._search_and(index, ('CMF', 'Zope3'), self.IFSet([1]))
self._search_and(index, ('CMF', 'zope'), self.IFSet([1]))
self._search_and(index, ('cmf', 'zope4'), self.IFSet())
self._search_and(index, ('quick', 'FOX'), self.IFSet([2]))
def test_search_or(self):
index = self._makeOne()
self._populate(index)
self._search_or(index, ('cmf', 'Zope3'), self.IFSet([1, 5]))
self._search_or(index, ('cmf', 'zope'), self.IFSet([1, 5]))
self._search_or(index, ('cmf', 'zope4'), self.IFSet([5]))
self._search_or(index, ('zope', 'Zope'), self.IFSet([1,3]))
def test_apply(self):
index = self._makeOne()
self._populate(index)
self._apply(index, ('CMF', 'Zope3'), self.IFSet([1]))
self._apply(index, ('CMF', 'zope'), self.IFSet([1]))
self._apply(index, ('cmf', 'zope4'), self.IFSet())
self._apply(index, ('quick', 'FOX'), self.IFSet([2]))
def test_apply_and(self):
index = self._makeOne()
self._populate(index)
self._apply_and(index, ('CMF', 'Zope3'), self.IFSet([1]))
self._apply_and(index, ('CMF', 'zope'), self.IFSet([1]))
self._apply_and(index, ('cmf', 'zope4'), self.IFSet())
self._apply_and(index, ('quick', 'FOX'), self.IFSet([2]))
def test_apply_or(self):
index = self._makeOne()
self._populate(index)
self._apply_or(index, ('cmf', 'Zope3'), self.IFSet([1, 5]))
self._apply_or(index, ('cmf', 'zope'), self.IFSet([1, 5]))
self._apply_or(index, ('cmf', 'zope4'), self.IFSet([5]))
self._apply_or(index, ('zope', 'Zope'), self.IFSet([1,3]))
def test_apply_with_only_tree_set(self):
index = self._makeOne()
index.tree_threshold = 0
self._populate(index)
self.assertEqual(type(index._fwd_index['zope']),
type(self.IFTreeSet()))
self._apply_and(index, ('CMF', 'Zope3'), self.IFSet([1]))
self._apply_and(index, ('CMF', 'zope'), self.IFSet([1]))
self._apply_and(index, ('cmf', 'zope4'), self.IFSet())
self._apply_and(index, ('quick', 'FOX'), self.IFSet([2]))
def test_apply_with_mix_of_tree_set_and_simple_set(self):
index = self._makeOne()
index.tree_threshold = 2
self._populate(index)
self.assertEqual(type(index._fwd_index['zope']),
type(self.IFSet()))
self._apply_and(index, ('CMF', 'Zope3'), self.IFSet([1]))
self._apply_and(index, ('CMF', 'zope'), self.IFSet([1]))
self._apply_and(index, ('cmf', 'zope4'), self.IFSet())
self._apply_and(index, ('quick', 'FOX'), self.IFSet([2]))
def test_optimize_converts_to_tree_set(self):
index = self._makeOne()
self._populate(index)
self.assertEqual(type(index._fwd_index['zope']),
type(self.IFSet()))
index.tree_threshold = 0
index.optimize()
self.assertEqual(type(index._fwd_index['zope']),
type(self.IFTreeSet()))
def test_optimize_converts_to_simple_set(self):
index = self._makeOne()
index.tree_threshold = 0
self._populate(index)
self.assertEqual(type(index._fwd_index['zope']),
type(self.IFTreeSet()))
index.tree_threshold = 99
index.optimize()
self.assertEqual(type(index._fwd_index['zope']),
type(self.IFSet()))
def test_optimize_leaves_words_alone(self):
index = self._makeOne()
self._populate(index)
self.assertEqual(type(index._fwd_index['zope']),
type(self.IFSet()))
index.tree_threshold = 99
index.optimize()
self.assertEqual(type(index._fwd_index['zope']),
type(self.IFSet()))
def test_index_with_empty_sequence_unindexes(self):
index = self._makeOne()
self._populate(index)
self._search(index, 'cmf', self.IFSet([5]))
index.index_doc(5, ())
self._search(index, 'cmf', self.IFSet([]))
class CaseInsensitiveKeywordIndexTestsBase:
def _getTargetClass(self):
from zope.index.keyword.index import CaseInsensitiveKeywordIndex
return CaseInsensitiveKeywordIndex
def _populate(self, index):
index.index_doc(1, ('zope', 'CMF', 'zope3', 'Zope3'))
index.index_doc(2, ('the', 'quick', 'brown', 'FOX'))
index.index_doc(3, ('Zope', 'zope'))
index.index_doc(4, ())
index.index_doc(5, ('cmf',))
_populated_doc_count = 4
_populated_word_count = 7
def test_normalize(self):
index = self._makeOne()
self.assertEqual(index.normalize(['Foo']), ['foo'])
def test_simplesearch(self):
index = self._makeOne()
self._populate(index)
self._search(index, [''], self.IFSet())
self._search(index, 'cmf', self.IFSet([1, 5]))
self._search(index, ['cmf'], self.IFSet([1, 5]))
self._search(index, ['zope'], self.IFSet([1, 3]))
self._search(index, ['zope3'], self.IFSet([1]))
self._search(index, ['foo'], self.IFSet())
def test_search_and(self):
index = self._makeOne()
self._populate(index)
self._search_and(index, ('cmf', 'zope3'), self.IFSet([1]))
self._search_and(index, ('cmf', 'zope'), self.IFSet([1]))
self._search_and(index, ('cmf', 'zope4'), self.IFSet())
self._search_and(index, ('zope', 'ZOPE'), self.IFSet([1, 3]))
def test_search_or(self):
index = self._makeOne()
self._populate(index)
self._search_or(index, ('cmf', 'zope3'), self.IFSet([1, 5]))
self._search_or(index, ('cmf', 'zope'), self.IFSet([1, 3, 5]))
self._search_or(index, ('cmf', 'zope4'), self.IFSet([1, 5]))
self._search_or(index, ('zope', 'ZOPE'), self.IFSet([1,3]))
def test_apply(self):
index = self._makeOne()
self._populate(index)
self._apply(index, ('cmf', 'zope3'), self.IFSet([1]))
self._apply(index, ('cmf', 'zope'), self.IFSet([1]))
self._apply(index, ('cmf', 'zope4'), self.IFSet())
self._apply(index, ('zope', 'ZOPE'), self.IFSet([1, 3]))
def test_apply_and(self):
index = self._makeOne()
self._populate(index)
self._apply_and(index, ('cmf', 'zope3'), self.IFSet([1]))
self._apply_and(index, ('cmf', 'zope'), self.IFSet([1]))
self._apply_and(index, ('cmf', 'zope4'), self.IFSet())
self._apply_and(index, ('zope', 'ZOPE'), self.IFSet([1, 3]))
def test_apply_or(self):
index = self._makeOne()
self._populate(index)
self._apply_or(index, ('cmf', 'zope3'), self.IFSet([1, 5]))
self._apply_or(index, ('cmf', 'zope'), self.IFSet([1, 3, 5]))
self._apply_or(index, ('cmf', 'zope4'), self.IFSet([1, 5]))
self._apply_or(index, ('zope', 'ZOPE'), self.IFSet([1,3]))
class _ThirtyTwoBitBase:
def _get_family(self):
import BTrees
return BTrees.family32
def IFSet(self, *args, **kw):
from BTrees.IFBTree import IFSet
return IFSet(*args, **kw)
def IFTreeSet(self, *args, **kw):
from BTrees.IFBTree import IFTreeSet
return IFTreeSet(*args, **kw)
class _SixtyFourBitBase:
def _get_family(self):
import BTrees
return BTrees.family64
def IFSet(self, *args, **kw):
from BTrees.LFBTree import LFSet
return LFSet(*args, **kw)
def IFTreeSet(self, *args, **kw):
from BTrees.LFBTree import LFTreeSet
return LFTreeSet(*args, **kw)
_marker = object()
class _TestCaseBase:
def _makeOne(self, family=_marker):
if family is _marker:
return self._getTargetClass()(self._get_family())
return self._getTargetClass()(family)
def _search(self, index, query, expected, mode='and'):
results = index.search(query, mode)
# results and expected are IFSets() but we can not
# compare them directly since __eq__() does not seem
# to be implemented for BTrees
self.assertEqual(results.keys(), expected.keys())
def _search_and(self, index, query, expected):
return self._search(index, query, expected, 'and')
def _search_or(self, index, query, expected):
return self._search(index, query, expected, 'or')
def _apply(self, index, query, expected, mode='and'):
results = index.apply(query)
self.assertEqual(results.keys(), expected.keys())
def _apply_and(self, index, query, expected):
results = index.apply({'operator': 'and', 'query': query})
self.assertEqual(results.keys(), expected.keys())
def _apply_or(self, index, query, expected):
results = index.apply({'operator': 'or', 'query': query})
self.assertEqual(results.keys(), expected.keys())
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_class_conforms_to_IKeywordQuerying(self):
from zope.interface.verify import verifyClass
from zope.index.keyword.interfaces import IKeywordQuerying
verifyClass(IKeywordQuerying, self._getTargetClass())
def test_instance_conforms_to_IKeywordQuerying(self):
from zope.interface.verify import verifyObject
from zope.index.keyword.interfaces import IKeywordQuerying
verifyObject(IKeywordQuerying, self._makeOne())
def test_ctor_defaults(self):
index = self._makeOne()
self.failUnless(index.family is self._get_family())
def test_ctor_explicit_family(self):
import BTrees
index = self._makeOne(family=BTrees.family64)
self.failUnless(index.family is BTrees.family64)
def test_empty_index(self):
index = self._makeOne()
self.assertEqual(index.documentCount(), 0)
self.assertEqual(index.wordCount(), 0)
self.failIf(index.has_doc(1))
def test_index_doc_string_value_raises(self):
index = self._makeOne()
self.assertRaises(TypeError, index.index_doc, 1, 'albatross')
def test_index_doc_single(self):
index = self._makeOne()
index.index_doc(1, ('albatross', 'cormorant'))
self.assertEqual(index.documentCount(), 1)
self.assertEqual(index.wordCount(), 2)
self.failUnless(index.has_doc(1))
self.failUnless('albatross' in index._fwd_index)
self.failUnless('cormorant' in index._fwd_index)
def test_index_doc_existing(self):
index = self._makeOne()
index.index_doc(1, ('albatross', 'cormorant'))
index.index_doc(1, ('buzzard', 'cormorant'))
self.assertEqual(index.documentCount(), 1)
self.assertEqual(index.wordCount(), 2)
self.failUnless(index.has_doc(1))
self.failIf('albatross' in index._fwd_index)
self.failUnless('buzzard' in index._fwd_index)
self.failUnless('cormorant' in index._fwd_index)
def test_index_doc_many(self):
index = self._makeOne()
self._populate(index)
self.assertEqual(index.documentCount(), self._populated_doc_count)
self.assertEqual(index.wordCount(), self._populated_word_count)
for docid in range(1, 6):
if docid == 4:
self.failIf(index.has_doc(docid))
else:
self.failUnless(index.has_doc(docid))
def test_clear(self):
index = self._makeOne()
self._populate(index)
index.clear()
self.assertEqual(index.documentCount(), 0)
self.assertEqual(index.wordCount(), 0)
for docid in range(1, 6):
self.failIf(index.has_doc(docid))
def test_unindex_doc_missing(self):
index = self._makeOne()
index.unindex_doc(1) # doesn't raise
def test_unindex_no_residue(self):
index = self._makeOne()
index.index_doc(1, ('albatross', ))
index.unindex_doc(1)
self.assertEqual(index.documentCount(), 0)
self.assertEqual(index.wordCount(), 0)
self.failIf(index.has_doc(1))
def test_unindex_w_residue(self):
index = self._makeOne()
index.index_doc(1, ('albatross', ))
index.index_doc(2, ('albatross', 'cormorant'))
index.unindex_doc(1)
self.assertEqual(index.documentCount(), 1)
self.assertEqual(index.wordCount(), 2)
self.failIf(index.has_doc(1))
def test_hasdoc(self):
index = self._makeOne()
self._populate(index)
self.assertEqual(index.has_doc(1), 1)
self.assertEqual(index.has_doc(2), 1)
self.assertEqual(index.has_doc(3), 1)
self.assertEqual(index.has_doc(4), 0)
self.assertEqual(index.has_doc(5), 1)
self.assertEqual(index.has_doc(6), 0)
def test_search_bad_operator(self):
index = self._makeOne()
self.assertRaises(TypeError, index.search, 'whatever', 'maybe')
class KeywordIndexTests32(_KeywordIndexTestsBase,
_ThirtyTwoBitBase,
_TestCaseBase,
unittest.TestCase):
pass
class CaseInsensitiveKeywordIndexTests32(CaseInsensitiveKeywordIndexTestsBase,
_ThirtyTwoBitBase,
_TestCaseBase,
unittest.TestCase):
pass
class KeywordIndexTests64(_KeywordIndexTestsBase,
_SixtyFourBitBase,
_TestCaseBase,
unittest.TestCase):
pass
class CaseInsensitiveKeywordIndexTests64(CaseInsensitiveKeywordIndexTestsBase,
_SixtyFourBitBase,
_TestCaseBase,
unittest.TestCase):
pass
def test_suite():
return unittest.TestSuite((
unittest.makeSuite(KeywordIndexTests32),
unittest.makeSuite(KeywordIndexTests64),
unittest.makeSuite(CaseInsensitiveKeywordIndexTests32),
unittest.makeSuite(CaseInsensitiveKeywordIndexTests64),
))
|