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
|
#!/usr/bin/env python
#
# Public Domain 2014-present MongoDB, Inc.
# Public Domain 2008-2014 WiredTiger, Inc.
#
# This is free and unencumbered software released into the public domain.
#
# Anyone is free to copy, modify, publish, use, compile, sell, or
# distribute this software, either in source code form or as a compiled
# binary, for any purpose, commercial or non-commercial, and by any
# means.
#
# In jurisdictions that recognize copyright laws, the author or authors
# of this software dedicate any and all copyright interest in the
# software to the public domain. We make this dedication for the benefit
# of the public at large and to the detriment of our heirs and
# successors. We intend this dedication to be an overt act of
# relinquishment in perpetuity of all present and future rights to this
# software under copyright law.
#
# THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
# EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
# MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
# IN NO EVENT SHALL THE AUTHORS BE LIABLE FOR ANY CLAIM, DAMAGES OR
# OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,
# ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
# OTHER DEALINGS IN THE SOFTWARE.
#
import wttest
from wtscenario import make_scenarios
from wtbound import set_prefix_bound
# test_cursor_bound13.py
# This test checks that a search_near call with the prefix key
# configuration will correctly find a key even in cases where the key
# range is split across multiple pages.
# This test has been migrated to use cursor bounds logic.
class test_cursor_bound13(wttest.WiredTigerTestCase):
key_format_values = [
('var_string', dict(key_format='S')),
('byte_array', dict(key_format='u')),
]
scenarios = make_scenarios(key_format_values)
def check_key(self, key):
if self.key_format == 'u':
return key.encode()
else:
return key
def test_search_near(self):
uri = 'table:test_search_near'
self.session.create(uri, 'key_format={},value_format=S'.format(self.key_format))
# Make the keys big enough to span over multiple pages.
# key_size can be set to a lower value so only one page is used and search_near works.
key_size = 200
cursor = self.session.open_cursor(uri)
cursor2 = self.session.open_cursor(uri, None, "debug=(release_evict=true)")
# Basic character array.
l = "abcdefghijklmnopqrstuvwxyz"
# Insert keys aaa -> aaz with timestamp 200.
prefix = "aa"
self.session.begin_transaction()
for k in range (0, 25):
key = prefix + l[k]
cursor[key * key_size] = key * key_size
self.session.commit_transaction('commit_timestamp=' + self.timestamp_str(200))
# Insert key aaz with timestamp 50.
self.session.begin_transaction()
key = prefix + "z"
cursor[key * key_size] = key * key_size
self.session.commit_transaction('commit_timestamp=' + self.timestamp_str(50))
# Evict the whole range.
# If eviction is not performed, things stay in memory and it works fine.
for k in range (0, 26):
cursor2.set_key((prefix + l[k]) * key_size)
self.assertEqual(cursor2.search(), 0)
self.assertEqual(cursor2.reset(), 0)
# Start a transaction at timestamp 100, aaz should be the only key that is visible.
self.session.begin_transaction('read_timestamp=' + self.timestamp_str(100))
cursor3 = self.session.open_cursor(uri)
# Prefix search is disabled by default.
# Search near should always return the only visible key.
expected_key = "aaz" * key_size
cursor3.set_key("aa")
self.assertEqual(cursor3.search_near(), 1)
self.assertEqual(cursor3.get_key(), self.check_key(expected_key))
cursor3.set_key("az")
self.assertEqual(cursor3.search_near(), -1)
self.assertEqual(cursor3.get_key(), self.check_key(expected_key))
cursor3.set_key("aaz" * key_size)
self.assertEqual(cursor3.search_near(), 0)
self.assertEqual(cursor3.get_key(), self.check_key(expected_key))
cursor3.set_key("aazab")
self.assertEqual(cursor3.search_near(), -1)
self.assertEqual(cursor3.get_key(), self.check_key(expected_key))
# The only visible key is aaz.
# If we try to do a search_near() with the prefixes "a" or "aa" without the changes
# introduced in WT-7912, we fail to find the key aaz although it is a valid result.
# This is because we traverse off the page and early exit before seeing the visible
# key that is on another page. However, if we specify "aaz" as a prefix, we are
# able to find that as we are traversing on the same page.
# All three of the prefixes "a", "aa" and "aaz" should lead us to find "aaz".
set_prefix_bound(self, cursor2, "a")
cursor3.set_key("a")
self.assertEqual(cursor3.search_near(), 1)
self.assertEqual(cursor3.get_key(), self.check_key(expected_key))
set_prefix_bound(self, cursor2, "aa")
cursor3.set_key("aa")
self.assertEqual(cursor3.search_near(), 1)
self.assertEqual(cursor3.get_key(), self.check_key(expected_key))
set_prefix_bound(self, cursor2, "aaz")
cursor3.set_key("aaz")
self.assertEqual(cursor3.search_near(), 1)
self.assertEqual(cursor3.get_key(), self.check_key(expected_key))
set_prefix_bound(self, cursor2, "aaz" * key_size)
cursor3.set_key("aaz" * key_size)
self.assertEqual(cursor3.search_near(), 0)
self.assertEqual(cursor3.get_key(), self.check_key(expected_key))
cursor3.close()
self.session.commit_transaction()
|
