From d524aca4c204321a97a1a1907a36673cc2120cb9 Mon Sep 17 00:00:00 2001
From: Damian Gryski <damian@gryski.com>
Date: Sun, 4 Mar 2018 10:52:51 -0800
Subject: [PATCH] mirror style for randomized cache insertion sentence

---
 performance.md | 3 +--
 1 file changed, 1 insertion(+), 2 deletions(-)

diff --git a/performance.md b/performance.md
index 7435d3f..caf14ed 100644
--- a/performance.md
+++ b/performance.md
@@ -586,8 +586,7 @@ Cache common cases:
   `time.Parse()` for significant speedup.
 * But beware cache invalidation, thread issues, etc.
 * Random cache eviction is fast and sufficiently effective.
-* Only put "some" items in cache (probabilistically) to limit cache size
-  to popular items with minimal logic.
+* Random cache insertion can limit cache to popular items with minimal logic.
 * Compare cost of cache logic to cost of refetching the data.
 * A large cache can increase GC pressure and keep blowing processor cache.