nexus/bip39
2
0
Fork 0
mirror of https://github.com/OneKeyHQ/bip39.git synced 2026-04-18 08:22:16 +00:00
Code Issues Packages Projects Releases Wiki Activity

Add test for Pull Request 279 split phrase cards

Browse Source
This commit is contained in:
Ian Coleman
2019-11-11 10:53:20 +11:00
parent 700294714c
commit a04946e23e
2 changed files with 32 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

3
src/js/index.js
View File

@@ -264,6 +264,7 @@
calcForDerivationPath(); calcForDerivationPath();
// Show the word indexes // Show the word indexes
showWordIndexes(); showWordIndexes();
writeSplitPhrase(phrase);
} }
function tabChanged() { function tabChanged() {
@@ -432,7 +433,6 @@
if (DOM.phrase.val().length > 0) { if (DOM.phrase.val().length > 0) {
var newPhrase = convertPhraseToNewLanguage(); var newPhrase = convertPhraseToNewLanguage();
DOM.phrase.val(newPhrase); DOM.phrase.val(newPhrase);
writeSplitPhrase(newPhrase);
phraseChanged(); phraseChanged();
} }
else { else {
@@ -493,7 +493,6 @@
// show the words // show the words
var words = mnemonic.toMnemonic(data); var words = mnemonic.toMnemonic(data);
DOM.phrase.val(words); DOM.phrase.val(words);
writeSplitPhrase(words);
// show the entropy // show the entropy
var entropyHex = uint8ArrayToHex(data); var entropyHex = uint8ArrayToHex(data);
DOM.entropy.val(entropyHex); DOM.entropy.val(entropyHex);

31
tests/spec/tests.js
View File

@@ -4140,4 +4140,35 @@ fit('Converts mnemonics into raw entropy', function(done) {
}); });
}); });
// Pull Request 279
// Added Split Phrase Card Output
fit('Shows split prase cards', function(done) {
var originalPhrase = "ugly charge strong giant once anchor capable october thumb inject dwarf legal alley mixture shoot";
var originalWords = originalPhrase.split(' ');
driver.findElement(By.css('.phrase'))
.sendKeys(originalPhrase);
driver.sleep(generateDelay).then(function() {
driver.findElement(By.css('.phraseSplit'))
.getAttribute("value")
.then(function(cardsStr) {
var cards = cardsStr.split("\n");
expect(cards.length).toBe(3);
// test all 2-of-3 combos can be used to form full phrase
var combos = [[0,1],[0,2],[1,2]];
for (var i=0; i<combos.length; i++) {
var combo = combos[i];
var a = combo[0];
var b = combo[1];
var phrase = cards[a] + " " + cards[b];
// check all original words are present
for (var j=0; j<originalWords.length; j++) {
var originalWord = originalWords[j];
expect(phrase).toContain(originalWord);
}
}
done();
});
});
});
}); });