-
Notifications
You must be signed in to change notification settings - Fork 224
Improved ZipValidity iterators #1284
Improved ZipValidity iterators #1284
Conversation
edde68d
to
51109e3
Compare
51109e3
to
03e981e
Compare
Codecov ReportBase: 83.07% // Head: 83.03% // Decreases project coverage by
Additional details and impacted files@@ Coverage Diff @@
## main #1284 +/- ##
==========================================
- Coverage 83.07% 83.03% -0.05%
==========================================
Files 363 364 +1
Lines 38499 39240 +741
==========================================
+ Hits 31982 32581 +599
- Misses 6517 6659 +142
Help us with your feedback. Take ten seconds to tell us how you rate us. Have a feature suggestion? Share it here. ☔ View full report at Codecov. |
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.
Thanks!
This hints that we should check unsets on slices so that we do not keep the ref count on empty validities.
Regardless, this is a good optimization. I left a comment with a small proposal
I have added a
branch can be done in a single place and is unlikely to be forgotten if we have designated constructor. |
a1cc908
to
e14cbe2
Compare
e14cbe2
to
d02e3a9
Compare
Due to slicing it is pretty common to have an array with a validity that has a null count of 0.
Given that we have cached the null count, we can use that information to determine if we need to take
Optional
branch inZipValidity
. This PR ensures that we can take theRequired
branch in case thenull_count/unset_bits
of a validity is 0.