Fix MinHash + Add Scalable BF #28 + Optimize Partitionned BF

[folkvir]

• Fix MinHash, comparison was wrong due to a unique lodash filter.
• Optimize the Partitionned Bloom Filter with a list of BitSet, import is still doable with the old structure to the new one.
  • Remove the length function
• Add Scalable Bloom Filter Implements Scalable Bloom Filter #28

A major bump is required.

[folkvir]

@Callidon Any idea to recover the length function from Partitionned Bloom Filter?
The PR is in draft until everything is ok, changelog, documentation, minor changes, etc...

[Callidon]

I have some comments and suggested changes, but otherwise it looks great. It will be a nice additions to the library, and fixes some impactful bugs. Good job 👏 👍

PS: I need to think a bit more about the length function, but IMO, it's not an issue it disappears right now. We always were borderline with this kind of helper functions, as they are not from the original algorithms. I'm not against removing them, unless there is a real use case from user feedback. However, since we are removing a feature, we will need to release a minor or a major version after the merge.

[Callidon]

Thank for the changes, all is good for me, we can merge it alongside #54 for the next release