-

scribblings/lru-cache.scrbl

@@ -27,8 +27,7 @@ The cache stores @emph{items} (values) and uses a comparison function to decide
 whether an item is already present. Each item is associated with a last-access
 timestamp that drives recency; on insert or hit, the item is bubbled to the front.
 
-@bold{Thread-safety:} The implementation uses a @racket[box] internally and is
-@emph{not} intrinsically thread-safe. Use external synchronization for concurrent access.
+@bold{Thread-safety:} The implementation is thread-safe, but not reentrant. 
 
 @section{Data Types}
 
@@ -188,7 +187,7 @@ Invalid inputs raise contract violations with descriptive error messages.
 
 @section{Notes}
 @itemlist[
-  @item{The implementation is not thread-safe; use locks for concurrent access.}
+  @item{The implementation is thread-safe but not reentrant.}
   @item{Expiration cleanup is lazy. If you need stricter guarantees, trigger
         periodic queries (e.g., @racket[lru-count]) or add an explicit cleanup function.}
 ]