summaryrefslogtreecommitdiff
path: root/search.html
blob: 2a12941f99e93b9825db3a43e04fc125b24fc3e2 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
<!DOCTYPE html>
<html lang="en">
    <head>
        <meta charset="utf-8">

        <style>
body { font-family: 'Cantarell', Helvetica, Arial, sans-serif; }

.twitter-typeahead { width: 87% ;}
.typeahead, .tt-query, .tt-hint {
    width: 100%; height: 30px;
    padding: 8px 12px; outline: none;
    font-size: 20px; line-height: 30px;
    border: 2px solid #ccc; border-radius: 8px;
    -webkit-border-radius: 8px;
    -moz-border-radius: 8px;    
}
.tt-menu {
    width: 100%; margin: 12px 0; padding: 8px 0;
    background-color: #fff;
    border: 1px solid #ccc; border-radius: 8px;
    -webkit-border-radius: 8px;
    -moz-border-radius: 8px;
    -webkit-box-shadow: 0 5px 10px rgba(0,0,0,.2);
    -moz-box-shadow: 0 5px 10px rgba(0,0,0,.2);
    box-shadow: 0 5px 10px rgba(0,0,0,.2);
}
.tt-suggestion { padding: 3px 20px; line-height: 24px; font-size: 18px; }
.tt-suggestion span { padding-left: 16px; font-size: 14px; color: #777; float: right; }
.tt-cursor { background: #ddd; }
.tt-highlight { font-weight: normal; color: #777; }
        </style>

        <!-- js labraries -->
        <script src="https://cdnjs.cloudflare.com/ajax/libs/jquery/3.2.1/jquery.min.js"></script>
        <script src="https://cdnjs.cloudflare.com/ajax/libs/corejs-typeahead/1.2.1/bloodhound.min.js"></script>
        <script src="https://cdnjs.cloudflare.com/ajax/libs/corejs-typeahead/1.2.1/typeahead.jquery.min.js"></script>
    </head>
    <body>

        <div id="the-basics">
            <input class="typeahead" id="tagsInput" type="text" placeholder="try me!">
        </div>

    </body>
    <script>

// arrays for kb-format (utf/EL-Gr to ascii translation)
var ORiGiN = 'ςερτυθιοπασδφγηξκλζχψωβνμΕΡΤΥΘΙΟΠΑΣΔΦΓΗΞΚΛΖΧΨΩΒΝΜάέήίόύώϊϋΆΈΉΊΌΎΏΪΫQWERTYUIOPASDFGHJKLZXCVBNM'.split('');
var kbKeyZ = 'sertyuiopasdfghjklzxcvbnmertyuiopasdfghjklzxcvbnmaehioyviyaehioyviyqwertyuiopasdfghjklzxcvbnm'.split('');

// convert string to kb-format
function kb_trans(s) {
    var charArr = s.split('')
    var i
    var out = ''
    charArr.forEach( el => {
        i = 0
        exist = -1
        ORiGiN.forEach( ori => {
            if (ori == el) {
                exist = i;
            }
            i++;
        })
        out += (exist == -1) ? el : kbKeyZ[exist];
    });
    return out;
}

// public data objects
var products;
var everyProduct;

function loadData() {
  const xhttp = new XMLHttpRequest();
  xhttp.onload = function() {
    products = JSON.parse(this.responseText);
  }
  xhttp.open("GET", "results/keywords-v3.json");
  xhttp.send();
}
loadData();

function loadData2() {
  const xhttp = new XMLHttpRequest();
  xhttp.onload = function() {
    everyProduct = JSON.parse(this.responseText);
  }
  xhttp.open("GET", "results/products.json");
  xhttp.send();
}
loadData2();

// bigram fuzzy match
// --- credit: https://dirask.com/posts/JavaScript-check-words-similarity-fuzzy-compare-with-bigrams-paola1
const createBigram = word => {
    const input = word.toLowerCase();
    const vector = [];
    for (let i = 0; i < input.length; ++i) {
      	vector.push(input.slice(i, i + 2));
    }
    return vector;
};
const checkSimilarity = (a, b) => {
    if (a.length > 0 && b.length > 0) {
        const aBigram = createBigram(a);
        const bBigram = createBigram(b);
        let hits = 0;
        for (let x = 0; x < aBigram.length; ++x) {
            for (let y = 0; y < bBigram.length; ++y) {
                if (aBigram[x] === bBigram[y]) {
                    hits += 1;
                }
          	}
        }
        if (hits > 0) {
          	const union = aBigram.length + bBigram.length;
        	return (2.0 * hits) / union;
        }
    }
    return 0;
};
var biMMS = .6;		// bigram minimum match score

// on document ready code /////////////////////////////////////////////////////
$(document).ready(function() { 

	// suggestions engine ////////////////////////////////////////////////////
    // ---
    var isuggest = function(qOrig, list) {
        var results = [];   // suggestions to respond
        var proList = [];   // list of products (for all suggestions)
        var commonL = [];   // list of common products (for multiple suggestions)
        var possibleNext = [];  // list of possible next suggestions

        var root, last;

        // clean q(uery) string from symbols and multiple spaces
        var q = qOrig.replace('+',' ').replace('.',' ')
                .replace('   ',' ')
                .replace('  ',' ');
        // split to words
        var qAr = q.split(' ');
        // console.log(qAr);

        if (qAr.length == 1) {      // suggest 1st word ////////////////////////
			var kbq = kb_trans(q)
            // regex match all possible suggestions; (in kb-format)
            substrRegex = new RegExp( kbq, 'i');    // match q anywhere
            products.forEach( it => {
                if ( (substrRegex.test(it.kb))
					|| (checkSimilarity(it.kb, kbq) > biMMS) ) {
					// console.log(it.kb, kbq, checkSimilarity(it.kb, kbq));
                    results.push(it);
                }
            });
        }

        if (qAr.length == 2) {	 // suggest 2nd word ///////////////////////////
            root = qAr[0].trim();
            kbroot = kb_trans(root);

            substrRegex = new RegExp( kb_trans(qAr[1]), 'i');

            products.forEach( it => { 	// loop through suggestions
                if (it.kb == kbroot ) {		// match 1st suggestion
                    it.c.forEach ( wo => {		// regex match linked words
                        if ( (substrRegex.test(wo.kb))
							|| (checkSimilarity(wo.kb, kbroot) > biMMS) ) {
                            results.push({
                                w: root +' '+ wo.w,
                                f: 100
                            });
                            proList = proList.concat(wo.p)
                        }
                    });  
                }
            });
        }

        if (qAr.length > 2) {
            root = qAr.shift();     // get out the first item of qAr
            last = qAr.pop();       // get out the lase item of qAr
                // now qAr includes only the items after root and before last;
                // so qAr includes all already selected suggestions (but root)
            
            var kbqAr = []; // array of selected suggestions in kb-format
            qAr.forEach( w => { kbqAr.push(kb_trans(w)); })

            // kb-translate the root/last keys
            kbroot = kb_trans(root);
            kblast = kb_trans(last);
            
            substrRegex = new RegExp( kblast, 'i'); // construct regex for mathing

            products.forEach( it => {
                if (it.kb == kbroot ) {     // find root

                    // calculate list of common items/products (commonL)
                    // for selected suggestions
                    // ---
                    is1stOcc = true;       // 1st occurance flag
                    it.c.forEach ( swo => {
                        if (kbqAr.includes( swo.kb )) {
                            // swo is one of the already selected suggestions
                            // so...
                            // update the commonL(ist)
                            if (is1stOcc) {
                                commonL = swo.p;
                                is1stOcc = false;
                            }
                            else {
                                // list ot common products
                                // = intersection of (so-far) commonL and swo.p
                                commonL = commonL.filter(value => swo.p.includes(value));
                            }
                        }
                        else {  // if swo is not already selected
                            // then it is a possible next suggestion
                            possibleNext.push(swo);
                        }
                    });
                    // console.log('commonL:', commonL)

                    possibleNext.forEach( poss => {     // for tthe possible next suggestions
                        // if word matches regex
                        // and list of word's products has commons with commonL
                        // then it is a valid next suggestion
                        if (substrRegex.test(poss.kb)) {
                            // check intersection of commonL and suggestion's product-lists
                            tempL = commonL.filter(value => poss.p.includes(value));
                            if (tempL.length) {
                                results.push({
                                    w: root +' '+ qAr.join(' ') +' '+ poss.w,
                                    f: 100
                                });
                                // update proList too
                                proList = proList.concat(tempL)
                            }
                        }
                    });
                }

            });
        }


        if ((qAr.length != 1) && (proList.length < 13)) {
            // get unique product ids
            let unique = proList.filter((item, i, ar) => ar.indexOf(item) === i);
                // credit: https://stackoverflow.com/questions/11246758/
            
            results = [];
            unique.forEach( pr => {
                everyProduct.forEach( pi => {
                    if (pi.id == pr)
                        results.push(pi);
                })         
            });
        }

        list(results);
    }

	// setup suggestions search/input control
	// ---
    const $tagsInput = $('#tagsInput')
    $tagsInput.typeahead(
        {
            hint: true,
            highlight: true,
            minLength: 0
        },
        {
            limit: 12,
            name: 'products',
            displayKey: 'w',
            source: isuggest,
			templates: {
				suggestion: function(data) {
					console.log(data.w);
					if (data.id)
						return '<div>'+ data.w + '<span>' + data.id + '</span></div>';
					return '<div>'+ data.w +'</div>';
				}
			}
        }
    )
    .bind("typeahead:selected", function(obj, datum, name) {
        $('.typeahead').typeahead('val','').trigger('blur');
        $('.typeahead').typeahead('val', datum.w +' ')
            .trigger("query");
		// give some time to the engine to calculate results
		// then fire focus again...
        setTimeout(() => {  $('.typeahead').focus(); }, 100);  
    })
    .bind("typeahead:cursorchange", function(obj, data) {
        // console.log(obj, data);
        // var dt = new Date();
        // console.log('triggered cursorchange /'+dt);
    });



});       
        </script>
</html>