github.com/aquanetwork/aquachain@v1.7.8/core/bloombits/generator_test.go (about)

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