You are viewing a plain text version of this content. The canonical link for it is here.
Posted to commits@commons.apache.org by gg...@apache.org on 2025/12/07 12:17:51 UTC
(commons-collections) branch master updated: Normalize spelling
This is an automated email from the ASF dual-hosted git repository.
ggregory pushed a commit to branch master
in repository https://gitbox.apache.org/repos/asf/commons-collections.git
The following commit(s) were added to refs/heads/master by this push:
new 2c314e017 Normalize spelling
2c314e017 is described below
commit 2c314e01706b5ebd2424e28ba4f04a4db210f6d2
Author: Gary Gregory <ga...@gmail.com>
AuthorDate: Sun Dec 7 07:17:46 2025 -0500
Normalize spelling
---
src/main/java/org/apache/commons/collections4/list/TreeList.java | 2 +-
1 file changed, 1 insertion(+), 1 deletion(-)
diff --git a/src/main/java/org/apache/commons/collections4/list/TreeList.java b/src/main/java/org/apache/commons/collections4/list/TreeList.java
index 5bedb5cd1..309db07d6 100644
--- a/src/main/java/org/apache/commons/collections4/list/TreeList.java
+++ b/src/main/java/org/apache/commons/collections4/list/TreeList.java
@@ -33,7 +33,7 @@ import org.apache.commons.collections4.OrderedIterator;
* A {@code List} implementation that is optimized for fast insertions and
* removals at any index in the list.
* <p>
- * This list implementation utilises a tree structure internally to ensure that
+ * This list implementation utilizes a tree structure internally to ensure that
* all insertions and removals are O(log n). This provides much faster performance
* than both an {@code ArrayList} and a {@code LinkedList} where elements
* are inserted and removed repeatedly from anywhere in the list.