From 2f3d5b383b0ce1fcc44d06dd72509f4fe260dbbf Mon Sep 17 00:00:00 2001 From: Scott Kay Date: Thu, 24 Sep 2020 13:04:30 -0400 Subject: [PATCH] Updated Comments --- openrtb_ext/bidders_test.go | 8 ++++---- 1 file changed, 4 insertions(+), 4 deletions(-) diff --git a/openrtb_ext/bidders_test.go b/openrtb_ext/bidders_test.go index dd6f7f010cf..7b6a03b4de1 100644 --- a/openrtb_ext/bidders_test.go +++ b/openrtb_ext/bidders_test.go @@ -72,7 +72,7 @@ func TestBidderListDoesNotDefineContext(t *testing.T) { // current uniqueness threshold, or else start a discussion in the PR. func TestBidderUniquenessGatekeeping(t *testing.T) { // Get List Of Bidders - // - Exclude duplicates of adapters for the same bidder, as it's unlikely the publisher will use both. + // - Exclude duplicates of adapters for the same bidder, as it's unlikely a publisher will use both. var bidders []string for _, bidder := range BidderMap { if bidder != BidderTripleliftNative && bidder != BidderAdkernelAdn && bidder != BidderSmartadserver { @@ -83,12 +83,12 @@ func TestBidderUniquenessGatekeeping(t *testing.T) { currentThreshold := 6 measuredThreshold := minUniquePrefixLength(bidders) - assert.NotZero(t, measuredThreshold, "BidderMap contains duoplicate bidder name values.") + assert.NotZero(t, measuredThreshold, "BidderMap contains duplicate bidder name values.") assert.LessOrEqual(t, measuredThreshold, currentThreshold) } -// minUniquePrefixLength measures the minimun amount of characters needed to ensure uniqueness -// of the strings, or returns 0 if there are duplicates. +// minUniquePrefixLength measures the minimun amount of characters needed to uniquely identify +// one of the strings, or returns 0 if there are duplicates. func minUniquePrefixLength(b []string) int { targetingKeyMaxLength := 20 for prefixLength := 1; prefixLength <= targetingKeyMaxLength; prefixLength++ {