github.com/aigarnetwork/aigar@v0.0.0-20191115204914-d59a6eb70f8e/core/bloombits/generator_test.go (about)

     1  //  Copyright 2018 The go-ethereum Authors
     2  //  Copyright 2019 The go-aigar Authors
     3  //  This file is part of the go-aigar library.
     4  //
     5  //  The go-aigar library is free software: you can redistribute it and/or modify
     6  //  it under the terms of the GNU Lesser General Public License as published by
     7  //  the Free Software Foundation, either version 3 of the License, or
     8  //  (at your option) any later version.
     9  //
    10  //  The go-aigar library is distributed in the hope that it will be useful,
    11  //  but WITHOUT ANY WARRANTY; without even the implied warranty of
    12  //  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
    13  //  GNU Lesser General Public License for more details.
    14  //
    15  //  You should have received a copy of the GNU Lesser General Public License
    16  //  along with the go-aigar library. If not, see <http://www.gnu.org/licenses/>.
    17  
    18  package bloombits
    19  
    20  import (
    21  	"bytes"
    22  	"math/rand"
    23  	"testing"
    24  
    25  	"github.com/AigarNetwork/aigar/core/types"
    26  )
    27  
    28  // Tests that batched bloom bits are correctly rotated from the input bloom
    29  // filters.
    30  func TestGenerator(t *testing.T) {
    31  	// Generate the input and the rotated output
    32  	var input, output [types.BloomBitLength][types.BloomByteLength]byte
    33  
    34  	for i := 0; i < types.BloomBitLength; i++ {
    35  		for j := 0; j < types.BloomBitLength; j++ {
    36  			bit := byte(rand.Int() % 2)
    37  
    38  			input[i][j/8] |= bit << byte(7-j%8)
    39  			output[types.BloomBitLength-1-j][i/8] |= bit << byte(7-i%8)
    40  		}
    41  	}
    42  	// Crunch the input through the generator and verify the result
    43  	gen, err := NewGenerator(types.BloomBitLength)
    44  	if err != nil {
    45  		t.Fatalf("failed to create bloombit generator: %v", err)
    46  	}
    47  	for i, bloom := range input {
    48  		if err := gen.AddBloom(uint(i), bloom); err != nil {
    49  			t.Fatalf("bloom %d: failed to add: %v", i, err)
    50  		}
    51  	}
    52  	for i, want := range output {
    53  		have, err := gen.Bitset(uint(i))
    54  		if err != nil {
    55  			t.Fatalf("output %d: failed to retrieve bits: %v", i, err)
    56  		}
    57  		if !bytes.Equal(have, want[:]) {
    58  			t.Errorf("output %d: bit vector mismatch have %x, want %x", i, have, want)
    59  		}
    60  	}
    61  }