-
Notifications
You must be signed in to change notification settings - Fork 85
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
allow node bound to include 0 [*0..4] #2041
Conversation
AEsir777
commented
Sep 15, 2023
•
edited
Loading
edited
- add feature that allows range literal to include 0 (except SHORTEST/ ALL SHORTEST)
- add test for bound node 0[*0..4]
728272c
to
022978f
Compare
Codecov ReportPatch coverage:
Additional details and impacted files@@ Coverage Diff @@
## master #2041 +/- ##
==========================================
+ Coverage 90.15% 90.21% +0.05%
==========================================
Files 938 945 +7
Lines 33364 33561 +197
==========================================
+ Hits 30080 30277 +197
Misses 3284 3284
☔ View full report in Codecov by Sentry. |
3d560ff
to
eabd9b9
Compare
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.
Don't forget to add some PR description.
@@ -99,7 +107,7 @@ void PathScanner::initDfs(const frontier::node_rel_id_t& nodeAndRelID, size_t cu | |||
void PathScanner::writePathToVector(RecursiveJoinVectors* vectors, sel_t& vectorPos, | |||
sel_t& nodeIDDataVectorPos, sel_t& relIDDataVectorPos) { | |||
assert(vectorPos < DEFAULT_VECTOR_CAPACITY); | |||
auto nodeEntry = ListVector::addList(vectors->pathNodesVector, k - 1); | |||
auto nodeEntry = ListVector::addList(vectors->pathNodesVector, k ? k - 1 : 0); |
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.
either say k > 0 ? k - 1 : 0
or std::min(k-1, 0)
fa01791
to
3657433
Compare
3657433
to
9d38e1f
Compare