( s1 , s2)
| 30 | //compute the length of the common prefix between two strings |
| 31 | // (copied from codebrowser.js) |
| 32 | var prefixLen = function( s1 , s2) { |
| 33 | var maxMatchLen = Math.min(s1.length, s2.length); |
| 34 | var res = -1; |
| 35 | while (++res < maxMatchLen) { |
| 36 | if (s1.charAt(res) != s2.charAt(res)) |
| 37 | break; |
| 38 | } |
| 39 | return res * 256 + 256 - s1.length; |
| 40 | } |
| 41 | |
| 42 | // Google text search (different than codebrowser.js) |
| 43 | var text_search = function(text) { |