Skip to content

Commit

Permalink
Update README.md
Browse files Browse the repository at this point in the history
  • Loading branch information
@tristanisham
tristanisham committed May 17, 2024
1 parent 788debc commit bb54036
Showing 1 changed file with 2 additions and 2 deletions.
4 changes: 2 additions & 2 deletions README.md
View file
Original file line number Diff line number Diff line change
Expand Up @@ -5,7 +5,7 @@
This package implements the [CVM](https://arxiv.org/abs/2301.10191) algoritm in
pure Go. CVM is an algorithm for the distinct elements problem. When you're
trying to find the unique elements in a slice, but the slice exceeds the amount
of available memory, use CVM to estimate the number of unique elements in said
of available memory, use f0 to estimate the number of unique elements in said
slice.

```go
Expand All @@ -19,7 +19,7 @@ f0.Estimate(mySlice, 0.01, 0.001) // 329.4221234
## Contributing

I **NEED** tests. The problem with this algorithm is that I need large sets of
comparable elements to test CVM on. Currently (below v1), there is no guarentee
comparable elements to test f0 on. Currently (below v1), there is no guarentee
the algorithm will work correctly. After we've developed a large and robust test
suite and can establish the algorithm is behaving as expected, this library will
be promoted to v1 and maintained.
Expand Down

0 comments on commit bb54036

Please sign in to comment.