|
53 | 53 | }; |
54 | 54 |
|
55 | 55 | const reset = function() { |
56 | | - var mainNode = rootSearchNode(); |
57 | | - var treeWalker = document.createTreeWalker(mainNode, NodeFilter.SHOW_ELEMENT, { |
| 56 | + const mainNode = rootSearchNode(); |
| 57 | + const treeWalker = document.createTreeWalker(mainNode, NodeFilter.SHOW_ELEMENT, { |
58 | 58 | acceptNode: function(node) { |
59 | 59 | if (node.hasAttribute(DATA_TEXTCONTENT)) { |
60 | 60 | return NodeFilter.FILTER_ACCEPT; |
61 | 61 | } |
62 | 62 | return NodeFilter.FILTER_SKIP; |
63 | 63 | }, |
64 | 64 | }); |
65 | | - var domMutations = []; |
| 65 | + const domMutations = []; |
66 | 66 | while (treeWalker.nextNode()) { |
67 | 67 | domMutations.push(restoreNodeTextContent(treeWalker.currentNode)); |
68 | 68 | } |
69 | 69 | return mutateDOM(domMutations); |
70 | 70 | }; |
71 | 71 |
|
72 | 72 | const search = function(term) { |
73 | | - var mainNode = rootSearchNode(); |
74 | | - var treeWalker = document.createTreeWalker(mainNode, NodeFilter.SHOW_TEXT, { |
| 73 | + const mainNode = rootSearchNode(); |
| 74 | + const treeWalker = document.createTreeWalker(mainNode, NodeFilter.SHOW_TEXT, { |
75 | 75 | acceptNode: function(node) { |
76 | 76 | var parent = node.parentNode; |
77 | 77 | if (parent.tagName === 'MARK') { |
|
87 | 87 | return NodeFilter.FILTER_SKIP; |
88 | 88 | }, |
89 | 89 | }); |
90 | | - var domMutations = []; |
| 90 | + const domMutations = []; |
91 | 91 | while (treeWalker.nextNode()) { |
92 | 92 | domMutations.push(highlightTermInNode(treeWalker.currentNode.parentNode, term)); |
93 | 93 | } |
|
0 commit comments