Skip to content

Conversation

@AlexanderSaydakov
Copy link
Contributor

No description provided.

final int n = 50000;
for (int i = 0; i < n / 2; i++) {
qf1.insert(i);
qf1.insert(i + n / 2);

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

should this be qf2.insert(i + n/2)?
Otherwise there are not items in qf2 so we merge empty sketches as in the above test.

Copy link
Contributor Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

yes, that is a mistake

final long quotient = fifo.element();
final long fingerprint = other.getFingerprint(i);
final long hash = quotient << other.getFingerprintLength() | fingerprint;
System.out.println("q=" + quotient + ", fp=" + fingerprint + ", hash=" + hash);

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Should this print statement be removed?

Copy link
Contributor Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

yes

@AlexanderSaydakov AlexanderSaydakov merged commit 36a675d into quotient-filter-reviewed Jul 17, 2024
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

2 participants