f78ffc0545
* les: move execqueue into utilities package execqueue is a util for executing queued functions in a serial order which is used by both les server and les client. Move it to common package. * les: move randselect to utilities package weighted_random_selector is a helpful tool for randomly select items maintained in a set but based on the item weight. It's used anywhere is LES package, mainly by les client but will be used in les server with very high chance. So move it into a common package as the second step for les separation. * les: rename to utils
61 lines
1.6 KiB
Go
61 lines
1.6 KiB
Go
// Copyright 2017 The go-ethereum Authors
|
|
// This file is part of the go-ethereum library.
|
|
//
|
|
// The go-ethereum library is free software: you can redistribute it and/or modify
|
|
// it under the terms of the GNU Lesser General Public License as published by
|
|
// the Free Software Foundation, either version 3 of the License, or
|
|
// (at your option) any later version.
|
|
//
|
|
// The go-ethereum library is distributed in the hope that it will be useful,
|
|
// but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
// GNU Lesser General Public License for more details.
|
|
//
|
|
// You should have received a copy of the GNU Lesser General Public License
|
|
// along with the go-ethereum library. If not, see <http://www.gnu.org/licenses/>.
|
|
|
|
package utils
|
|
|
|
import "testing"
|
|
|
|
func TestExecQueue(t *testing.T) {
|
|
var (
|
|
N = 10000
|
|
q = NewExecQueue(N)
|
|
counter int
|
|
execd = make(chan int)
|
|
testexit = make(chan struct{})
|
|
)
|
|
defer q.Quit()
|
|
defer close(testexit)
|
|
|
|
check := func(state string, wantOK bool) {
|
|
c := counter
|
|
counter++
|
|
qf := func() {
|
|
select {
|
|
case execd <- c:
|
|
case <-testexit:
|
|
}
|
|
}
|
|
if q.CanQueue() != wantOK {
|
|
t.Fatalf("CanQueue() == %t for %s", !wantOK, state)
|
|
}
|
|
if q.Queue(qf) != wantOK {
|
|
t.Fatalf("Queue() == %t for %s", !wantOK, state)
|
|
}
|
|
}
|
|
|
|
for i := 0; i < N; i++ {
|
|
check("queue below cap", true)
|
|
}
|
|
check("full queue", false)
|
|
for i := 0; i < N; i++ {
|
|
if c := <-execd; c != i {
|
|
t.Fatal("execution out of order")
|
|
}
|
|
}
|
|
q.Quit()
|
|
check("closed queue", false)
|
|
}
|