Browse Source

remove test from travis

patch-2
Ryan X. Charles 11 years ago
parent
commit
8f5890fc03
  1. 31
      test/test.BIP39.js

31
test/test.BIP39.js

@ -145,21 +145,24 @@ describe('BIP39', function() {
var phrase = BIP39.mnemonic(BIP39WordlistEn, 128);
});
//do not run these slow tests on TRAVIS which often fails
var vectors = bip39_vectors['english'];
for (var v = 0 ; v < vectors.length ; v++) {
(function(v){
it('should pass test vector ' + v, function() {
var vector = vectors[v];
var code = vector[0];
var mnemonic = vector[1];
var seed = vector[2];
var mnemonic1 = BIP39.entropy2mnemonic(BIP39WordlistEn, new Buffer(code, 'hex'));
var seed1 = BIP39.mnemonic2seed(mnemonic, 'TREZOR');
BIP39.check(BIP39WordlistEn, mnemonic).should.be.true;
mnemonic1.should.equal(mnemonic);
seed1.toString('hex').should.equal(seed)
});
})(v);
if (!process.env.TRAVIS && !process.env.CI) {
for (var v = 0 ; v < vectors.length ; v++) {
(function(v){
it('should pass test vector ' + v, function() {
var vector = vectors[v];
var code = vector[0];
var mnemonic = vector[1];
var seed = vector[2];
var mnemonic1 = BIP39.entropy2mnemonic(BIP39WordlistEn, new Buffer(code, 'hex'));
var seed1 = BIP39.mnemonic2seed(mnemonic, 'TREZOR');
BIP39.check(BIP39WordlistEn, mnemonic).should.be.true;
mnemonic1.should.equal(mnemonic);
seed1.toString('hex').should.equal(seed)
});
})(v);
}
}
});

Loading…
Cancel
Save