Skip to content

Conversation

DengYiping
Copy link
Contributor

Changes:

  • add helper data structure bitmap implementation
  • implement the bloomfilter using the bitmap.
  • necessary unit test for the bloomfilter
    Note:
    Bloom filter is completely probabilistic. There is a chance that the test case will fail, but it not likely to happen since the threshold I set in the test case is quite high

@DengYiping DengYiping changed the title [feature] Add probablistic data structure bloomfilter [feature] add probablistic data structure bloomfilter Mar 9, 2019
Copy link
Owner

@mgechev mgechev left a comment

Choose a reason for hiding this comment

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

Great job! The implementation looks technically correct to me, and I love how you've cited the original source of the hash function.

Few general comments about the style of the comments (mostly personal preference based on the projects I've worked on):

  • Start with a capital letter
  • After // add a space
  • Move the single-line comments above the lines they address

@DengYiping
Copy link
Contributor Author

@mgechev Thanks for the feedback. I will fix the implementation accordingly.

@mgechev mgechev merged commit 2db78a4 into mgechev:master Mar 11, 2019
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