mirror of
https://github.com/OneKeyHQ/bip39.git
synced 2026-04-18 08:22:16 +00:00
When completing a mnemonic word, return immediately if one is found in the wordlist that starts with the given word
This commit is contained in:
@@ -18648,7 +18648,7 @@ window.Entropy = new (function() {
|
|||||||
// mnemonics is populated as required by getLanguage
|
// mnemonics is populated as required by getLanguage
|
||||||
var mnemonics = { "english": new Mnemonic("english") };
|
var mnemonics = { "english": new Mnemonic("english") };
|
||||||
var mnemonic = mnemonics["english"];
|
var mnemonic = mnemonics["english"];
|
||||||
var seed = null
|
var seed = null;
|
||||||
var bip32RootKey = null;
|
var bip32RootKey = null;
|
||||||
var bip32ExtendedKey = null;
|
var bip32ExtendedKey = null;
|
||||||
var network = bitcoin.networks.bitcoin;
|
var network = bitcoin.networks.bitcoin;
|
||||||
@@ -19292,6 +19292,8 @@ window.Entropy = new (function() {
|
|||||||
var closestWord = words[0];
|
var closestWord = words[0];
|
||||||
for (var i=0; i<words.length; i++) {
|
for (var i=0; i<words.length; i++) {
|
||||||
var comparedTo = words[i];
|
var comparedTo = words[i];
|
||||||
|
if (comparedTo.indexOf(word) == 0) return comparedTo;
|
||||||
|
|
||||||
var distance = Levenshtein.get(word, comparedTo);
|
var distance = Levenshtein.get(word, comparedTo);
|
||||||
if (distance < minDistance) {
|
if (distance < minDistance) {
|
||||||
closestWord = comparedTo;
|
closestWord = comparedTo;
|
||||||
|
|||||||
@@ -3,7 +3,7 @@
|
|||||||
// mnemonics is populated as required by getLanguage
|
// mnemonics is populated as required by getLanguage
|
||||||
var mnemonics = { "english": new Mnemonic("english") };
|
var mnemonics = { "english": new Mnemonic("english") };
|
||||||
var mnemonic = mnemonics["english"];
|
var mnemonic = mnemonics["english"];
|
||||||
var seed = null
|
var seed = null;
|
||||||
var bip32RootKey = null;
|
var bip32RootKey = null;
|
||||||
var bip32ExtendedKey = null;
|
var bip32ExtendedKey = null;
|
||||||
var network = bitcoin.networks.bitcoin;
|
var network = bitcoin.networks.bitcoin;
|
||||||
@@ -647,6 +647,8 @@
|
|||||||
var closestWord = words[0];
|
var closestWord = words[0];
|
||||||
for (var i=0; i<words.length; i++) {
|
for (var i=0; i<words.length; i++) {
|
||||||
var comparedTo = words[i];
|
var comparedTo = words[i];
|
||||||
|
if (comparedTo.indexOf(word) == 0) return comparedTo;
|
||||||
|
|
||||||
var distance = Levenshtein.get(word, comparedTo);
|
var distance = Levenshtein.get(word, comparedTo);
|
||||||
if (distance < minDistance) {
|
if (distance < minDistance) {
|
||||||
closestWord = comparedTo;
|
closestWord = comparedTo;
|
||||||
|
|||||||
Reference in New Issue
Block a user