1 files changed, 0 insertions, 5 deletions
diff --git a/src/mongo/util/lru_cache_test.cpp b/src/mongo/util/lru_cache_test.cpp
index a8772bc5a93..b88e4297e46 100644
--- a/src/mongo/util/lru_cache_test.cpp
+++ b/src/mongo/util/lru_cache_test.cpp
@@ -277,7 +277,6 @@ TEST(LRUCacheTest, SizeOneCache) {
 // Test cache eviction when the cache is full and new elements are added.
 TEST(LRUCacheTest, EvictionTest) {
     runWithDifferentSizes([](int maxSize) {
-
         // Test eviction for any permutation of the original cache
         for (int i = 0; i < maxSize; i++) {
             LRUCache<int, int> cache(maxSize);
@@ -309,7 +308,6 @@ TEST(LRUCacheTest, EvictionTest) {
 // from any original position in the cache.
 TEST(LRUCacheTest, PromoteTest) {
     runWithDifferentSizes([](int maxSize) {
-
         // Test promotion for any position in the original cache
         // i <= maxSize here, so we test promotion of cache.end(),
         // and of a non-existent key.
@@ -354,7 +352,6 @@ TEST(LRUCacheTest, PromoteTest) {
 // the existing entry and gets promoted properly
 TEST(LRUCacheTest, ReplaceKeyTest) {
     runWithDifferentSizes([](int maxSize) {
-
         // Test replacement for any position in the original cache
         for (int i = 0; i < maxSize; i++) {
             LRUCache<int, int> cache(maxSize);
@@ -378,7 +375,6 @@ TEST(LRUCacheTest, ReplaceKeyTest) {
 // the existing entry and gets promoted properly
 TEST(LRUCacheTest, EraseByKey) {
     runWithDifferentSizes([](int maxSize) {
-
         // Test replacement for any position in the original cache
         // i <= maxSize so we erase a non-existent element
         for (int i = 0; i <= maxSize; i++) {
@@ -416,7 +412,6 @@ TEST(LRUCacheTest, EraseByKey) {
 // Test removal of elements by iterator from the cache
 TEST(LRUCacheTest, EraseByIterator) {
     runWithDifferentSizes([](int maxSize) {
-
         // Test replacement for any position in the original cache
         for (int i = 0; i < maxSize; i++) {
             LRUCache<int, int> cache(maxSize);