From c87e830c66d1a3cd9cd0595388e5b1b0248f42b8 Mon Sep 17 00:00:00 2001
From: John DeRegnaucourt <jdereg@gmail.com>
Date: Sun, 23 Jun 2024 20:30:28 -0400
Subject: [PATCH] minor javadoc updates

---
 src/main/java/com/cedarsoftware/util/LRUCache.java   | 12 ++++++------
 .../util/cache/LockingLRUCacheStrategy.java          |  4 ++--
 .../util/cache/ThreadedLRUCacheStrategy.java         |  4 ++--
 3 files changed, 10 insertions(+), 10 deletions(-)

diff --git a/src/main/java/com/cedarsoftware/util/LRUCache.java b/src/main/java/com/cedarsoftware/util/LRUCache.java
index c733f083..34734222 100644
--- a/src/main/java/com/cedarsoftware/util/LRUCache.java
+++ b/src/main/java/com/cedarsoftware/util/LRUCache.java
@@ -9,16 +9,16 @@
 import com.cedarsoftware.util.cache.ThreadedLRUCacheStrategy;
 
 /**
- * This class provides a thread-safe Least Recently Used (LRU) cache API that will evict the least recently used items,
- * once a threshold is met. It implements the <code>Map</code> interface for convenience.
+ * This class provides a thread-safe Least Recently Used (LRU) cache API that evicts the least recently used items once
+ * a threshold is met. It implements the <code>Map</code> interface for convenience.
  * <p>
- * This class provides two implementation strategies: a locking approach and a threaded approach.
+ * This class offers two implementation strategies: a locking approach and a threaded approach.
  * <ul>
  *   <li>The Locking strategy can be selected by using the constructor that takes only an int for capacity, or by using
  *       the constructor that takes an int and a StrategyType enum (StrategyType.LOCKING).</li>
  *   <li>The Threaded strategy can be selected by using the constructor that takes an int and a StrategyType enum
- *       (StrategyType.THREADED). Additionally, there is a constructor that takes a capacity, a cleanup delay time, a
- *       ScheduledExecutorService, and a ForkJoinPool, which also selects the threaded strategy.</li>
+ *       (StrategyType.THREADED). Additionally, there is a constructor that takes a capacity, a cleanup delay time,
+ *       and a ScheduledExecutorService.</li>
  * </ul>
  * <p>
  * The Locking strategy allows for O(1) access for get(), put(), and remove(). For put(), remove(), and many other
@@ -31,7 +31,7 @@
  * with cleaning up items above the capacity threshold. This means that the cache may temporarily exceed its capacity, but
  * it will soon be trimmed back to the capacity limit by the scheduled thread.
  * <p>
- * LRUCache supports <code>null</code> for both <b>key</b> or <b>value</b>.
+ * LRUCache supports <code>null</code> for both <b>key</b> and <b>value</b>.
  * <p>
  * <b>Special Thanks:</b> This implementation was inspired by insights and suggestions from Ben Manes.
  * @see LockingLRUCacheStrategy
diff --git a/src/main/java/com/cedarsoftware/util/cache/LockingLRUCacheStrategy.java b/src/main/java/com/cedarsoftware/util/cache/LockingLRUCacheStrategy.java
index 90ef2002..a4aca999 100644
--- a/src/main/java/com/cedarsoftware/util/cache/LockingLRUCacheStrategy.java
+++ b/src/main/java/com/cedarsoftware/util/cache/LockingLRUCacheStrategy.java
@@ -9,7 +9,7 @@
 import java.util.concurrent.locks.ReentrantLock;
 
 /**
- * This class provides a thread-safe Least Recently Used (LRU) cache API that will evict the least recently used items,
+ * This class provides a thread-safe Least Recently Used (LRU) cache API that evicts the least recently used items
  * once a threshold is met. It implements the <code>Map</code> interface for convenience.
  * <p>
  * The Locking strategy allows for O(1) access for get(), put(), and remove(). For put(), remove(), and many other
@@ -17,7 +17,7 @@
  * This 'try-lock' approach ensures that the get() API is never blocking, but it also means that the LRU order is not
  * perfectly maintained under heavy load.
  * <p>
- * LRUCache supports <code>null</code> for both key or value.
+ * LRUCache supports <code>null</code> for both key and value.
  * @author John DeRegnaucourt (jdereg@gmail.com)
  *         <br>
  *         Copyright (c) Cedar Software LLC
diff --git a/src/main/java/com/cedarsoftware/util/cache/ThreadedLRUCacheStrategy.java b/src/main/java/com/cedarsoftware/util/cache/ThreadedLRUCacheStrategy.java
index 4d4ef1a1..30b83273 100644
--- a/src/main/java/com/cedarsoftware/util/cache/ThreadedLRUCacheStrategy.java
+++ b/src/main/java/com/cedarsoftware/util/cache/ThreadedLRUCacheStrategy.java
@@ -16,7 +16,7 @@
 import java.util.concurrent.atomic.AtomicBoolean;
 
 /**
- * This class provides a thread-safe Least Recently Used (LRU) cache API that will evict the least recently used items,
+ * This class provides a thread-safe Least Recently Used (LRU) cache API that evicts the least recently used items
  * once a threshold is met. It implements the <code>Map</code> interface for convenience.
  * <p>
  * The Threaded strategy allows for O(1) access for get(), put(), and remove() without blocking. It uses a <code>ConcurrentHashMap</code>
@@ -24,7 +24,7 @@
  * with cleaning up items above the capacity threshold. This means that the cache may temporarily exceed its capacity, but
  * it will soon be trimmed back to the capacity limit by the scheduled thread.
  * <p>
- * LRUCache supports <code>null</code> for both key or value.
+ * LRUCache supports <code>null</code> for both key and value.
  * <p>
  * @author John DeRegnaucourt (jdereg@gmail.com)
  *         <br>