-
-
Save adriendumont/9268fed0482ce351b79a to your computer and use it in GitHub Desktop.
Revisions
-
kristopolous revised this gist
Aug 6, 2015 . 1 changed file with 1 addition and 1 deletion.There are no files selected for viewing
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters. Learn more about bidirectional Unicode charactersOriginal file line number Diff line number Diff line change @@ -1,7 +1,7 @@ function query() { var total = 0, shown = 0, job_list = Array.prototype.slice.call(document.querySelectorAll('.c00,.cdd')), query_list = Array.prototype.slice.call(arguments); // turn them all off -
kristopolous renamed this gist
Aug 4, 2015 . 1 changed file with 0 additions and 0 deletions.There are no files selected for viewing
File renamed without changes. -
kristopolous created this gist
Aug 4, 2015 .There are no files selected for viewing
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters. Learn more about bidirectional Unicode charactersOriginal file line number Diff line number Diff line change @@ -0,0 +1,39 @@ function query() { var total = 0, shown = 0, job_list = Array.prototype.slice.call(document.querySelectorAll('.c00')), query_list = Array.prototype.slice.call(arguments); // turn them all off job_list.forEach(function(node) { node.parentNode.parentNode.parentNode.style.display = 'none'; total ++; }); query_list.forEach(function(query) { if (query.forEach) { var and_query_list = query.map(function(what) { return what.toLowerCase(); }); job_list.forEach(function(node) { var doesMatch = true, toTest = node.innerHTML.toLowerCase(); and_query_list.forEach(function(query) { doesMatch &= (toTest.search(query) > -1); }) if(doesMatch) { node.parentNode.parentNode.parentNode.style.display = 'block'; shown ++; } }); } else { query = query.toLowerCase(); job_list.forEach(function(node) { if(node.innerHTML.toLowerCase().search(query) !== -1) { node.parentNode.parentNode.parentNode.style.display = 'block'; shown ++; } }); } }); return {shown: shown, total: total} }