Make string.index() use a linear KMP search

builtin/string.v

@@ -349,23 +349,36 @@ pub fn (s string) substr(start, end int) string {
 	return res
 }
 
+// KMP search
 pub fn (s string) index(p string) int {
 	if p.len > s.len {
 		return -1
 	}
-	mut i := 0
+	mut prefix := [0]
-	for i < s.len {
 	mut j := 0
-		mut ii := i
+	for i := 1; i < p.len; i++ {
-		for j < p.len && s[ii] == p[j] {
+		for p[j] != p[i] && j > 0 {
+			j = prefix[j - 1]
+		}
+		if p[j] == p[i] {
+			j++
+		}
+		prefix << j
+	}
+	j = 0
+	for i := 0; i < s.len; i++ {
+		for p[j] != s[i] && j > 0 {
+			j = prefix[j - 1]
+		}
+		if p[j] == s[i] {
 			j++
-			ii++
 		}
 		if j == p.len {
-			return i
+			prefix.free()
+			return i - p.len + 1
 		}
-		i++
 	}
+	prefix.free()
 	return -1
 }