Skip to content
Projects
Groups
Snippets
Help
Loading...
Help
Support
Keyboard shortcuts
?
Submit feedback
Contribute to GitLab
Sign in / Register
Toggle navigation
B
BTrees
Project overview
Project overview
Details
Activity
Releases
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Issues
0
Issues
0
List
Boards
Labels
Milestones
Merge Requests
0
Merge Requests
0
Analytics
Analytics
Repository
Value Stream
Wiki
Wiki
Snippets
Snippets
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Create a new issue
Commits
Issue Boards
Open sidebar
Kirill Smelkov
BTrees
Commits
a9213699
Commit
a9213699
authored
Dec 27, 2014
by
Tres Seaver
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
Tests for OLBTree just-fixed value coercion bug.
parent
315037fc
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
14 additions
and
0 deletions
+14
-0
BTrees/tests/test_OLBTree.py
BTrees/tests/test_OLBTree.py
+14
-0
No files found.
BTrees/tests/test_OLBTree.py
View file @
a9213699
...
...
@@ -108,6 +108,20 @@ class OLBTreeTest(BTreeTests, TestLongIntValues, unittest.TestCase):
def
getTwoKeys
(
self
):
return
"abc"
,
"def"
def
test_extremes
(
self
):
from
BTrees.tests.common
import
SMALLEST_64_BITS
from
BTrees.tests.common
import
SMALLEST_POSITIVE_65_BITS
from
BTrees.tests.common
import
LARGEST_64_BITS
from
BTrees.tests.common
import
LARGEST_NEGATIVE_65_BITS
btree
=
self
.
_makeOne
()
btree
[
'ZERO'
]
=
0
btree
[
'SMALLEST_64_BITS'
]
=
SMALLEST_64_BITS
btree
[
'LARGEST_64_BITS'
]
=
LARGEST_64_BITS
self
.
assertRaises
((
ValueError
,
OverflowError
),
btree
.
__setitem__
,
'SMALLEST_POSITIVE_65_BITS'
,
SMALLEST_POSITIVE_65_BITS
)
self
.
assertRaises
((
ValueError
,
OverflowError
),
btree
.
__setitem__
,
'LARGEST_NEGATIVE_65_BITS'
,
LARGEST_NEGATIVE_65_BITS
)
class
OLBTreePyTest
(
BTreeTests
,
TestLongIntValues
,
unittest
.
TestCase
):
...
...
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment