Adjust README & cargo update

modelflat · Jan 23, 2024 · 0394330 · 0394330
1 parent d8f1d69
commit 0394330
Show file tree

Hide file tree

Showing 2 changed files with 7 additions and 7 deletions.
diff --git a/Cargo.lock b/Cargo.lock
diff --git a/README.md b/README.md
@@ -4,4 +4,4 @@
 
 `hloo` implements the algorithm described in [this paper by Google](https://static.googleusercontent.com/media/research.google.com/en//pubs/archive/33026.pdf).
 
-`hloo` can perform exceptionally well, achieving roughly O(1) time to search on perfectly uniformly distributed hash data. However, in the real world data is often skewed, and in the worst cases (i.e. huge chunks of hashes are the same value) `hloo` will perform worse than a naive full scan of data. Always check the quality of your hashes!
+`hloo` can perform exceptionally well, achieving roughly O(1) time to search on perfectly uniformly distributed hash data. However, in the real world data is often skewed, and in the worst cases (i.e. huge chunks of hashes are the same value) `hloo` will perform on par or slightly worse than a naive full scan of data. Always check the quality of your hashes!
Original file line number	Diff line number	Diff line change
Expand Up		@@ -4,4 +4,4 @@

		`hloo` implements the algorithm described in [this paper by Google](https://static.googleusercontent.com/media/research.google.com/en//pubs/archive/33026.pdf).

		`hloo` can perform exceptionally well, achieving roughly O(1) time to search on perfectly uniformly distributed hash data. However, in the real world data is often skewed, and in the worst cases (i.e. huge chunks of hashes are the same value) `hloo` will perform worse than a naive full scan of data. Always check the quality of your hashes!
		`hloo` can perform exceptionally well, achieving roughly O(1) time to search on perfectly uniformly distributed hash data. However, in the real world data is often skewed, and in the worst cases (i.e. huge chunks of hashes are the same value) `hloo` will perform on par or slightly worse than a naive full scan of data. Always check the quality of your hashes!