From 54e42d230ca0ef346329a822c5107e24a1286160 Mon Sep 17 00:00:00 2001
From: Nathan Button <nbutton@ancestry.com>
Date: Fri, 29 Jan 2016 14:53:09 -0700
Subject: [PATCH] passwords now passing through the 1337 matcher. Not sure if
 scoring is correct.

---
 entropy/entropyCalculator.go | 27 ++++++++++++-
 matching/matching.go         | 76 +++++++++---------------------------
 matching/matching_test.go    | 10 ++++-
 zxcvbn_test.go               |  2 +-
 4 files changed, 54 insertions(+), 61 deletions(-)

diff --git a/entropy/entropyCalculator.go b/entropy/entropyCalculator.go
index a4cee2a..788a836 100644
--- a/entropy/entropyCalculator.go
+++ b/entropy/entropyCalculator.go
@@ -156,7 +156,7 @@ func SequenceEntropy(match match.Match, dictionaryLength int, ascending bool) fl
 		baseEntropy = float64(0)
 	} else {
 		baseEntropy = math.Log2(float64(dictionaryLength))
-		//TODO: should this be just the first or any char
+		//TODO: should this be just the first or any char?
 		if unicode.IsUpper(rune(firstChar)) {
 			baseEntropy++
 		}
@@ -167,3 +167,28 @@ func SequenceEntropy(match match.Match, dictionaryLength int, ascending bool) fl
 	}
 	return baseEntropy + math.Log2(float64(len(match.Token)))
 }
+
+func ExtraLeetEntropy(match match.Match, password string) float64 {
+	var subsitutions float64
+	var unsub float64
+	subPassword := password[match.I:match.J]
+	for index, char := range subPassword {
+		if string(char) != string(match.Token[index]) {
+			subsitutions++
+		} else {
+			//TODO: Make this only true for 1337 chars that are not subs?
+			unsub++
+		}
+	}
+
+	var possibilities float64
+
+	for i := float64(0); i <= math.Min(subsitutions, unsub)+1; i++ {
+		possibilities += zxcvbn_math.NChoseK(subsitutions+unsub, i)
+	}
+
+	if possibilities <= 1 {
+		return float64(1)
+	}
+	return math.Log2(possibilities)
+}
diff --git a/matching/matching.go b/matching/matching.go
index ca4db2e..0c571cc 100644
--- a/matching/matching.go
+++ b/matching/matching.go
@@ -83,6 +83,7 @@ func loadFrequencyList() {
 	MATCHERS = append(MATCHERS, SpatialMatch)
 	MATCHERS = append(MATCHERS, RepeatMatch)
 	MATCHERS = append(MATCHERS, SequenceMatch)
+	MATCHERS = append(MATCHERS, l33tMatch)
 
 }
 
@@ -322,9 +323,25 @@ func spatialMatchHelper(password string, graph adjacency.AdjacencyGraph) (matche
 
 func l33tMatch(password string) []match.Match {
 
+	subsitutions := relevantL33tSubtable(password)
 
+	permutations := getAllPermutationsOfLeetSubstitutions(password, subsitutions)
 
-	return nil
+	var matches []match.Match
+
+	for _, permutation := range permutations {
+		for _, mather := range DICTIONARY_MATCHERS {
+			matches = append(matches,mather(permutation)...)
+		}
+	}
+
+	for _, match := range matches {
+		println(match.Entropy)
+		match.Entropy += entropy.ExtraLeetEntropy(match, password)
+		println(match.Entropy)
+	}
+
+	return matches
 }
 
 func getAllPermutationsOfLeetSubstitutions(password string, substitutionsMap map[string][]string) []string {
@@ -353,63 +370,6 @@ func getAllPermutationsOfLeetSubstitutions(password string, substitutionsMap map
 
 	return permutations
 }
-//TODO: what is the return value of this?
-//func enumerateL33tSubs(table map[string]string) []string {
-//
-//	//subs = [[]]
-//	var subs [][]string
-//    /*
-//    def dedup(subs):
-//        deduped = []
-//        members = set()
-//        for sub in subs:
-//            key = str(sorted(sub))
-//            if key not in members:
-//                deduped.append(sub)
-//        return deduped
-//        */
-//	dedup := func(subsSlice []string){
-//		var deduped []string
-//
-//		for _, sub := range subsSlice {
-//
-//		}
-//	}
-//	/*
-//    keys = table.keys()
-//    while len(keys) > 0:
-//        first_key = keys[0]
-//        rest_keys = keys[1:]
-//        next_subs = []
-//        for l33t_chr in table[first_key]:
-//            for sub in subs:
-//                dup_l33t_index = -1
-//                for i in range(0, len(sub)):
-//                    if sub[i][0] == l33t_chr:
-//                        dup_l33t_index = i
-//                        break
-//                if dup_l33t_index == -1:
-//                    sub_extension = list(sub)
-//                    sub_extension.append((l33t_chr, first_key))
-//                    next_subs.append(sub_extension)
-//                else:
-//                    sub_alternative = list(sub)
-//                    sub_alternative.pop(dup_l33t_index)
-//                    sub_alternative.append((l33t_chr, first_key))
-//                    next_subs.append(sub)
-//                    next_subs.append(sub_alternative)
-//        subs = dedup(next_subs)
-//        keys = rest_keys
-//    return map(dict, subs)
-//
-//	 */
-//
-//
-//
-//
-//	//TODO: Remove
-//	return nil
-//}
 
 func relevantL33tSubtable(password string) map[string][]string {
 	relevantSubs := make(map[string][]string)
diff --git a/matching/matching_test.go b/matching/matching_test.go
index 6f88b51..e10f18f 100644
--- a/matching/matching_test.go
+++ b/matching/matching_test.go
@@ -5,6 +5,7 @@ import (
 	"github.com/nbutton23/zxcvbn-go/match"
 	"strings"
 	"testing"
+	"fmt"
 )
 
 //DateSepMatch("1991-09-11jibjab11.9.1991")
@@ -167,4 +168,11 @@ func TestPermutationsOfLeetSubstitutions(t *testing.T){
 	possibleSubs = relevantL33tSubtable(password)
 	permutations = getAllPermutationsOfLeetSubstitutions(password, possibleSubs)
 	assert.Len(t, permutations, 35, "check my math 3*2*2*3 -1 ")
-}
\ No newline at end of file
+}
+
+func TestLeet(t *testing.T){
+	password := "p4ssw0rd"
+	matches := l33tMatch(password)
+
+	fmt.Println(matches[0].J)
+}
diff --git a/zxcvbn_test.go b/zxcvbn_test.go
index 42077a6..04ca049 100644
--- a/zxcvbn_test.go
+++ b/zxcvbn_test.go
@@ -13,7 +13,7 @@ Use these test to see how close to feature parity the library is.
 */
 
 const (
-	allowableError = float64(0.01)
+	allowableError = float64(0.05)
 )
 
 type failedTest struct {