unicode-org
diff --git a/‎utils/litemap/README.md
+1-1 b/‎utils/litemap/README.md
+1-1
diff --git a/‎utils/litemap/src/lib.rs
+1-1 b/‎utils/litemap/src/lib.rs
+1-1
@@ -27,7 +27,7 @@
 //! * Insertion is generally `O(n)`, but optimized to `O(1)` if the new item sorts greater than the current items. In `BTreeMap` it's `O(log(n))`.
 //! * Deletion is `O(n)` whereas `BTreeMap` is `O(log(n))`.
 //! * Bulk operations like `from_iter`, `extend` and deserialization have an optimized `O(n)` path
-//!    for inputs that are ordered and `O(n*log(n))` complexity otherwise.
+//!   for inputs that are ordered and `O(n*log(n))` complexity otherwise.
 //!
 //! ## Pluggable Backends
 //!