From 6fa816f50a91e55150a7755336c8e319a8dc49cc Mon Sep 17 00:00:00 2001 From: Isaac Whitfield Date: Fri, 5 Jan 2024 22:27:47 +0000 Subject: [PATCH] Update outdated naming references --- README.md | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) diff --git a/README.md b/README.md index 0cdded7..df8b29b 100644 --- a/README.md +++ b/README.md @@ -55,9 +55,9 @@ For examples of the programmatic API, please see [the examples](./examples/basic Runiq comes with several "filters", which control exactly how uniqueness is verified. Each of these filters has different use cases, and excels in different ways. * `quick` - * The `quick` filter works the same way as the `naive` filter, except values are pre-hashed. - * This results in much lower memory overhead than `naive`, with comparably throughput. - * Depending on your input lengths, throughput can actually be faster than `naive`. + * The `quick` filter works the same way as the `simple` filter, except values are pre-hashed. + * This results in much lower memory overhead than `simple`, with comparably throughput. + * Depending on your input lengths, throughput can actually be faster than `simple`. * `simple` * The `simple` filter uses basic `Set` implementations to determine uniqueness. * Offers a fairly good throughput, while still effectively guaranteeing accuracy.