-
Notifications
You must be signed in to change notification settings - Fork 24
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Support to recursively create partitioned index #86
Conversation
711975c
to
8fe3505
Compare
6aa9326
to
71af087
Compare
3d164e2
to
f644f45
Compare
71af087
to
762281d
Compare
I rewrote this to just always recurse because it makes the code infinitely cleaner. I still think there are some edge cases to consider, though. Like currently, we I'm still working through these edge cases and writing tests, so this PR can be considered a draft for now. Update: I think these concerns are resolved by #94 |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
I'm wondering if we want to have a test or two that shows the the invalid indexes left behind in certain error cases.
fea29ca
to
5d6789d
Compare
2f48365
to
531ca35
Compare
4557043
to
1993cce
Compare
1993cce
to
ffeaa47
Compare
ffeaa47
to
41292e5
Compare
41292e5
to
cd6df2f
Compare
Recurse through sub-partitions when creating a partitioned index
Relies on #94