From 8133f118e011291b352390029a2bcae713cc1072 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Stephan=20H=C3=BCgel?= <shugel@tcd.ie>
Date: Tue, 25 Jun 2024 21:19:36 +0100
Subject: [PATCH] Rename again

---
 Cargo.toml     | 6 +++---
 README.md      | 4 ++--
 pyproject.toml | 2 +-
 3 files changed, 6 insertions(+), 6 deletions(-)

diff --git a/Cargo.toml b/Cargo.toml
index d50f918..d42d24b 100644
--- a/Cargo.toml
+++ b/Cargo.toml
@@ -1,10 +1,10 @@
 [package]
-name = "distinct"
-version = "0.1.10"
+name = "count_distinct"
+version = "0.1.11"
 edition = "2021"
 
 [lib]
-name = "distinct"
+name = "count_distinct"
 # "cdylib" is necessary to produce a shared library for Python to import from.
 crate-type = ["cdylib"]
 
diff --git a/README.md b/README.md
index 1b16992..06f8ce6 100644
--- a/README.md
+++ b/README.md
@@ -23,11 +23,11 @@ Don Knuth has written about the algorithm (he refers to it as **Algorithm D**) a
 where _s_ >= 1. Our implementation doesn't use a treap as a buffer; it uses a fast HashSet with the [FxHash](https://docs.rs/fxhash/latest/fxhash/) algorithm: we pay the hash cost when inserting, but search in step **D4** is `O(1)`. The library may switch to a treap implementation eventually.
 
 # Installation
-`pip install distinct`
+`pip install count_distinct`
 
 # Usage
 ```python
-from distinct import CVM
+from count_distinct import CVM
 
 # values for epsilon, delta, and stream size are described in the docstring.
 counter = CVM(0.8, 0.1, 1000)
diff --git a/pyproject.toml b/pyproject.toml
index f8030cf..b51827d 100644
--- a/pyproject.toml
+++ b/pyproject.toml
@@ -12,7 +12,7 @@ testpaths = [
 ]
 
 [project]
-name = "distinct"
+name = "count_distinct"
 description = "Use the CVM algorithm to quickly estimate the number of distinct elements in a stream"
 authors = [{ name = "Stephan Hügel", email = "urschrei@gmail.com" }]
 license = {file = "license.txt"}