github.com/uber/kraken@v0.1.4/tracker/peerhandoutpolicy/completeness_policy_test.go (about)

     1  // Copyright (c) 2016-2019 Uber Technologies, Inc.
     2  //
     3  // Licensed under the Apache License, Version 2.0 (the "License");
     4  // you may not use this file except in compliance with the License.
     5  // You may obtain a copy of the License at
     6  //
     7  //     http://www.apache.org/licenses/LICENSE-2.0
     8  //
     9  // Unless required by applicable law or agreed to in writing, software
    10  // distributed under the License is distributed on an "AS IS" BASIS,
    11  // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
    12  // See the License for the specific language governing permissions and
    13  // limitations under the License.
    14  package peerhandoutpolicy
    15  
    16  import (
    17  	"math/rand"
    18  	"testing"
    19  
    20  	"github.com/uber/kraken/core"
    21  
    22  	"github.com/stretchr/testify/require"
    23  	"github.com/uber-go/tally"
    24  )
    25  
    26  func TestCompletenessPriorityPolicy(t *testing.T) {
    27  	require := require.New(t)
    28  
    29  	policy, err := NewPriorityPolicy(tally.NoopScope, _completenessPolicy)
    30  	require.NoError(err)
    31  
    32  	seeders := 10
    33  	origins := 3
    34  	incomplete := 20
    35  
    36  	peers := make([]*core.PeerInfo, seeders+origins+incomplete)
    37  	for k := 0; k < len(peers); k++ {
    38  		p := core.PeerInfoFixture()
    39  		if k < seeders {
    40  			p.Complete = true
    41  		} else if k < origins {
    42  			p.Complete = true
    43  			p.Origin = true
    44  		}
    45  		peers[k] = p
    46  	}
    47  
    48  	// shuffle
    49  	for i := 0; i < len(peers); i++ {
    50  		j := rand.Intn(i + 1)
    51  		peers[i], peers[j] = peers[j], peers[i]
    52  	}
    53  
    54  	policy.SortPeers(core.PeerInfoFixture(), peers)
    55  	require.Len(peers, seeders+origins+incomplete)
    56  	for k := 0; k < len(peers); k++ {
    57  		p := peers[k]
    58  		if k < seeders {
    59  			require.True(p.Complete)
    60  			require.False(p.Origin)
    61  		} else if k < origins {
    62  			require.True(p.Complete)
    63  			require.True(p.Origin)
    64  		} else {
    65  			require.False(p.Complete)
    66  			require.False(p.Origin)
    67  		}
    68  	}
    69  }