From: iancoleman <coleman.ian@gmail.com>
Date: Tue, 3 Jan 2017 23:41:15 +0000 (+1100)
Subject: Merge pull request #48 from chrisrico/master
X-Git-Url: https://git.immae.eu/?a=commitdiff_plain;h=fef188cd1ed85b78e5f78d71e9c71f14e9e26448;hp=434caecd96740bbec488429026830b5ad24f628a;p=perso%2FImmae%2FProjets%2FCryptomonnaies%2FBIP39.git

Merge pull request #48 from chrisrico/master

Allow for better suggestion when a partial mnemonic word is entered
---

diff --git a/bip39-standalone.html b/bip39-standalone.html
index 2888d03..4a18657 100644
--- a/bip39-standalone.html
+++ b/bip39-standalone.html
@@ -18648,7 +18648,7 @@ window.Entropy = new (function() {
     // mnemonics is populated as required by getLanguage
     var mnemonics = { "english": new Mnemonic("english") };
     var mnemonic = mnemonics["english"];
-    var seed = null
+    var seed = null;
     var bip32RootKey = null;
     var bip32ExtendedKey = null;
     var network = bitcoin.networks.bitcoin;
@@ -19292,6 +19292,8 @@ window.Entropy = new (function() {
         var closestWord = words[0];
         for (var i=0; i<words.length; i++) {
             var comparedTo = words[i];
+            if (comparedTo.indexOf(word) == 0) return comparedTo;
+
             var distance = Levenshtein.get(word, comparedTo);
             if (distance < minDistance) {
                 closestWord = comparedTo;
diff --git a/src/js/index.js b/src/js/index.js
index 13c6178..af09606 100644
--- a/src/js/index.js
+++ b/src/js/index.js
@@ -3,7 +3,7 @@
     // mnemonics is populated as required by getLanguage
     var mnemonics = { "english": new Mnemonic("english") };
     var mnemonic = mnemonics["english"];
-    var seed = null
+    var seed = null;
     var bip32RootKey = null;
     var bip32ExtendedKey = null;
     var network = bitcoin.networks.bitcoin;
@@ -647,6 +647,8 @@
         var closestWord = words[0];
         for (var i=0; i<words.length; i++) {
             var comparedTo = words[i];
+            if (comparedTo.indexOf(word) == 0) return comparedTo;
+
             var distance = Levenshtein.get(word, comparedTo);
             if (distance < minDistance) {
                 closestWord = comparedTo;