A crate for estimating the cardinality of distinct elements in a stream or dataset.
-
Updated
Dec 5, 2024 - Rust
#
distinct-elements
Here are 6 public repositories matching this topic...
Comparison of Hashing Algorithms - Double Hashing, Robin Hood Hashing Cuckoo Hashing with Java's inbuilt HashMap/ HastSet over million of add(), contains() and remove() operations.
hashing hash-functions hashcode hashmap hashset hashing-algorithm remove hashtable add hopscotch-hashing contains probing open-addressing cuckoo-hashing-algorithm distinct-elements double-hashing robin-hood-hashing
-
Updated
Jan 18, 2019 - Java
Solidity 30 day challenge with codedamn.com
smart-contracts solidity exponential palindrome prime-numbers struct hcf average simple-algorithms reverse-array digit-sum remainder array-sum distinct-elements nth-term search-array solidity-by-example array-to-even
-
Updated
Jun 21, 2022 - Solidity
Flajolet Martine algorithm to estimate distinct elements.
-
Updated
May 16, 2022 - Python
MySQL Tutorials from Beginners to intermediate
-
Updated
Jun 12, 2024 - Shell
A Rust implementation of the CVM algorithm for counting distinct elements in a stream
-
Updated
Jun 29, 2024 - Rust
Improve this page
Add a description, image, and links to the distinct-elements topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the distinct-elements topic, visit your repo's landing page and select "manage topics."