From b4eb57b8f3d773bc0603cd7d10a9163ee4e3b272 Mon Sep 17 00:00:00 2001
From: Matt Dale <9760375+matthewdale@users.noreply.github.com>
Date: Wed, 16 Nov 2022 13:33:15 -0800
Subject: [PATCH] Use sequential IDs for the SingleFindOneByID benchmark.

---
 benchmark/single.go | 12 ++++++------
 1 file changed, 6 insertions(+), 6 deletions(-)

diff --git a/benchmark/single.go b/benchmark/single.go
index fc77c2d98b..b2a26a5c52 100644
--- a/benchmark/single.go
+++ b/benchmark/single.go
@@ -94,24 +94,24 @@ func SingleFindOneByID(ctx context.Context, tm TimerManager, iters int) error {
 	}
 	coll := db.Collection("corpus")
 
-	ids := make([]interface{}, iters)
 	for i := 0; i < iters; i++ {
-		res, err := coll.InsertOne(ctx, doc)
+		idDoc := make(bson.D, 0, len(doc)+1)
+		idDoc = append(idDoc, bson.E{"_id", i})
+		idDoc = append(idDoc, doc...)
+		res, err := coll.InsertOne(ctx, idDoc)
 		if err != nil {
 			return err
 		}
 		if res.InsertedID == nil {
 			return errors.New("no inserted ID returned")
 		}
-
-		ids[i] = res.InsertedID
 	}
 
 	tm.ResetTimer()
 
-	for _, id := range ids {
+	for i := 0; i < iters; i++ {
 		var res bson.D
-		err := coll.FindOne(ctx, bson.D{{"_id", id}}).Decode(&res)
+		err := coll.FindOne(ctx, bson.D{{"_id", i}}).Decode(&res)
 		if err != nil {
 			return err
 		}