-
Notifications
You must be signed in to change notification settings - Fork 1.1k
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
Caplin: Fix aggregate quality #12583
Conversation
} | ||
var foundOverlap bool | ||
// check the overlap bit by bit | ||
for j := 0; j < 8; j++ { |
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.
So if we have two positions in both bytes where bits are 1s in both of them we return true
? that's the intention right?
@@ -160,16 +160,42 @@ func IsNonStrictSupersetBitlist(a, b []byte) bool { | |||
return true | |||
} | |||
|
|||
func IsOverlappingBitlist(a, b []byte) bool { | |||
// IsOverlappingSSZBitlist checks if bitlist 'a' and bitlist 'b' have any overlapping bits | |||
// However, it ignores the last bits in the last byte. |
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.
In the last byte we check all the 8 bits. Is this correct comment?
Basically we had wrong behaviour is overlapping bits. last bit on are length and shall not be counted. also decreased batched chunk size