Skip to content
Projects
Groups
Snippets
Help
Loading...
Help
Support
Keyboard shortcuts
?
Submit feedback
Contribute to GitLab
Sign in / Register
Toggle navigation
W
wendelin.core
Project overview
Project overview
Details
Activity
Releases
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Labels
Merge Requests
0
Merge Requests
0
Analytics
Analytics
Repository
Value Stream
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Commits
Open sidebar
Kirill Smelkov
wendelin.core
Commits
80bedde7
Commit
80bedde7
authored
May 15, 2020
by
Kirill Smelkov
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
.
parent
e52a3095
Changes
1
Show whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
31 additions
and
0 deletions
+31
-0
wcfs/internal/xbtree_test.py
wcfs/internal/xbtree_test.py
+31
-0
No files found.
wcfs/internal/xbtree_test.py
View file @
80bedde7
...
@@ -313,6 +313,37 @@ def test_allStructs():
...
@@ -313,6 +313,37 @@ def test_allStructs():
# nsplit=1,(1,1) -> ø
# nsplit=1,(1,1) -> ø
]
]
assert
Y
([
1
,
3
],
1
,
1
)
==
[
# T/
T
([],
B
(
1
,
3
)),
# nsplit=0
T
([],
# nsplit=0,0
T
([],
B
(
1
,
3
))),
T
([],
# nsplit=0,1
T
([
2
],
B
(
1
),
B
(
3
))),
T
([],
T
([
3
],
B
(
1
),
B
(
3
))),
# T0/
# nothing - leftmost bucket is always empty
# T1/
# nothing - leftmost bucket is always empty
# T2/
T
([
2
],
B
(
1
),
B
(
3
)),
# nsplit=1
T
([
2
],
# nsplit=1,(0,0)
T
([],
B
(
1
)),
T
([],
B
(
3
))),
# T3/
T
([
3
],
B
(
1
),
B
(
3
)),
# nsplit=1
T
([
3
],
# nsplit=1,(0,0)
T
([],
B
(
1
)),
T
([],
B
(
3
))),
# T4/
# nothing - rightmost bucket is always empty
]
# XXX tests for maxsplit=2 / maxdepth=2 ?
# XXX tests for maxsplit=2 / maxdepth=2 ?
# (if yes -> compare with set, not exact order, and use topoencoding on the right)
# (if yes -> compare with set, not exact order, and use topoencoding on the right)
...
...
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