From d7d81f45c714e0700b2e6e8a7c99f8c51743d2d5 Mon Sep 17 00:00:00 2001 From: Ughur Alakbarov Date: Tue, 13 Aug 2024 19:44:38 +0200 Subject: [PATCH] typo --- src/lib.rs | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/src/lib.rs b/src/lib.rs index 24d4b77..6377645 100644 --- a/src/lib.rs +++ b/src/lib.rs @@ -207,7 +207,7 @@ //! `BinEntry::Tree` bins use a special form of comparison for search and related operations (which //! is the main reason we cannot use existing collections such as tree maps). The contained tree //! is primarily ordered by hash value, then by [`cmp`](std::cmp::Ord::cmp) order on keys. The -//! red-black balancing code is updated from pre-jdk colelctions (http://gee.cs.oswego.edu/dl/classes/collections/RBCell.java) +//! red-black balancing code is updated from pre-jdk collections (http://gee.cs.oswego.edu/dl/classes/collections/RBCell.java) //! based in turn on Cormen, Leiserson, and Rivest "Introduction to Algorithms" (CLR). //! //! `BinEntry::Tree` bins also require an additional locking mechanism. While list traversal is