or --> TEXT)\n if (morphedNodeType === ELEMENT_NODE) {\n if (toNodeType === ELEMENT_NODE) {\n if (!compareNodeNames(fromNode, toNode)) {\n onNodeDiscarded(fromNode);\n morphedNode = moveChildren(fromNode, createElementNS(toNode.nodeName, toNode.namespaceURI));\n }\n } else {\n // Going from an element node to a text node\n morphedNode = toNode;\n }\n } else if (morphedNodeType === TEXT_NODE || morphedNodeType === COMMENT_NODE) {\n // Text or comment node\n if (toNodeType === morphedNodeType) {\n if (morphedNode.nodeValue !== toNode.nodeValue) {\n morphedNode.nodeValue = toNode.nodeValue;\n }\n\n return morphedNode;\n } else {\n // Text node to something else\n morphedNode = toNode;\n }\n }\n }\n\n if (morphedNode === toNode) {\n // The \"to node\" was not compatible with the \"from node\" so we had to\n // toss out the \"from node\" and use the \"to node\"\n onNodeDiscarded(fromNode);\n } else {\n if (toNode.isSameNode && toNode.isSameNode(morphedNode)) {\n return;\n }\n\n morphEl(morphedNode, toNode, childrenOnly); // We now need to loop over any keyed nodes that might need to be\n // removed. We only do the removal if we know that the keyed node\n // never found a match. When a keyed node is matched up we remove\n // it out of fromNodesLookup and we use fromNodesLookup to determine\n // if a keyed node has been matched up or not\n\n if (keyedRemovalList) {\n for (var i = 0, len = keyedRemovalList.length; i < len; i++) {\n var elToRemove = fromNodesLookup[keyedRemovalList[i]];\n\n if (elToRemove) {\n removeNode(elToRemove, elToRemove.parentNode, false);\n }\n }\n }\n }\n\n if (!childrenOnly && morphedNode !== fromNode && fromNode.parentNode) {\n if (morphedNode.actualize) {\n morphedNode = morphedNode.actualize(fromNode.ownerDocument || doc);\n } // If we had to swap out the from node with a new node because the old\n // node was not compatible with the target node then we need to\n // replace the old DOM node in the original DOM tree. This is only\n // possible if the original DOM node was part of a DOM tree which\n // we know is the case if it has a parent node.\n\n\n fromNode.parentNode.replaceChild(morphedNode, fromNode);\n }\n\n return morphedNode;\n };\n}\n\nvar morphdom = morphdomFactory(morphAttrs);\nexport default morphdom;","module.exports = __webpack_public_path__ + \"media/fonts/OFN-v2-4da24923ee2464c6d7e8cf28ac1ef376.svg\";","module.exports = __webpack_public_path__ + \"media/fonts/fontawesome-webfont-2936772672cf45f34b310897010e78e5.svg\";","function _toConsumableArray(arr) { return _arrayWithoutHoles(arr) || _iterableToArray(arr) || _unsupportedIterableToArray(arr) || _nonIterableSpread(); }\n\nfunction _nonIterableSpread() { throw new TypeError(\"Invalid attempt to spread non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.\"); }\n\nfunction _iterableToArray(iter) { if (typeof Symbol !== \"undefined\" && iter[Symbol.iterator] != null || iter[\"@@iterator\"] != null) return Array.from(iter); }\n\nfunction _arrayWithoutHoles(arr) { if (Array.isArray(arr)) return _arrayLikeToArray(arr); }\n\nfunction _defineProperty(obj, key, value) { if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; }\n\nfunction _inherits(subClass, superClass) { if (typeof superClass !== \"function\" && superClass !== null) { throw new TypeError(\"Super expression must either be null or a function\"); } subClass.prototype = Object.create(superClass && superClass.prototype, { constructor: { value: subClass, writable: true, configurable: true } }); Object.defineProperty(subClass, \"prototype\", { writable: false }); if (superClass) _setPrototypeOf(subClass, superClass); }\n\nfunction _setPrototypeOf(o, p) { _setPrototypeOf = Object.setPrototypeOf || function _setPrototypeOf(o, p) { o.__proto__ = p; return o; }; return _setPrototypeOf(o, p); }\n\nfunction _createSuper(Derived) { var hasNativeReflectConstruct = _isNativeReflectConstruct(); return function _createSuperInternal() { var Super = _getPrototypeOf(Derived), result; if (hasNativeReflectConstruct) { var NewTarget = _getPrototypeOf(this).constructor; result = Reflect.construct(Super, arguments, NewTarget); } else { result = Super.apply(this, arguments); } return _possibleConstructorReturn(this, result); }; }\n\nfunction _possibleConstructorReturn(self, call) { if (call && (_typeof(call) === \"object\" || typeof call === \"function\")) { return call; } else if (call !== void 0) { throw new TypeError(\"Derived constructors may only return object or undefined\"); } return _assertThisInitialized(self); }\n\nfunction _assertThisInitialized(self) { if (self === void 0) { throw new ReferenceError(\"this hasn't been initialised - super() hasn't been called\"); } return self; }\n\nfunction _isNativeReflectConstruct() { if (typeof Reflect === \"undefined\" || !Reflect.construct) return false; if (Reflect.construct.sham) return false; if (typeof Proxy === \"function\") return true; try { Boolean.prototype.valueOf.call(Reflect.construct(Boolean, [], function () {})); return true; } catch (e) { return false; } }\n\nfunction _getPrototypeOf(o) { _getPrototypeOf = Object.setPrototypeOf ? Object.getPrototypeOf : function _getPrototypeOf(o) { return o.__proto__ || Object.getPrototypeOf(o); }; return _getPrototypeOf(o); }\n\nfunction _createForOfIteratorHelper(o, allowArrayLike) { var it = typeof Symbol !== \"undefined\" && o[Symbol.iterator] || o[\"@@iterator\"]; if (!it) { if (Array.isArray(o) || (it = _unsupportedIterableToArray(o)) || allowArrayLike && o && typeof o.length === \"number\") { if (it) o = it; var i = 0; var F = function F() {}; return { s: F, n: function n() { if (i >= o.length) return { done: true }; return { done: false, value: o[i++] }; }, e: function e(_e) { throw _e; }, f: F }; } throw new TypeError(\"Invalid attempt to iterate non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.\"); } var normalCompletion = true, didErr = false, err; return { s: function s() { it = it.call(o); }, n: function n() { var step = it.next(); normalCompletion = step.done; return step; }, e: function e(_e2) { didErr = true; err = _e2; }, f: function f() { try { if (!normalCompletion && it.return != null) it.return(); } finally { if (didErr) throw err; } } }; }\n\nfunction _unsupportedIterableToArray(o, minLen) { if (!o) return; if (typeof o === \"string\") return _arrayLikeToArray(o, minLen); var n = Object.prototype.toString.call(o).slice(8, -1); if (n === \"Object\" && o.constructor) n = o.constructor.name; if (n === \"Map\" || n === \"Set\") return Array.from(o); if (n === \"Arguments\" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen); }\n\nfunction _arrayLikeToArray(arr, len) { if (len == null || len > arr.length) len = arr.length; for (var i = 0, arr2 = new Array(len); i < len; i++) { arr2[i] = arr[i]; } return arr2; }\n\nfunction _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError(\"Cannot call a class as a function\"); } }\n\nfunction _defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if (\"value\" in descriptor) descriptor.writable = true; Object.defineProperty(target, descriptor.key, descriptor); } }\n\nfunction _createClass(Constructor, protoProps, staticProps) { if (protoProps) _defineProperties(Constructor.prototype, protoProps); if (staticProps) _defineProperties(Constructor, staticProps); Object.defineProperty(Constructor, \"prototype\", { writable: false }); return Constructor; }\n\nfunction _typeof(obj) { \"@babel/helpers - typeof\"; return _typeof = \"function\" == typeof Symbol && \"symbol\" == typeof Symbol.iterator ? function (obj) { return typeof obj; } : function (obj) { return obj && \"function\" == typeof Symbol && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }, _typeof(obj); }\n\n/**\n* Tom Select v2.1.0\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n*/\n(function (global, factory) {\n (typeof exports === \"undefined\" ? \"undefined\" : _typeof(exports)) === 'object' && typeof module !== 'undefined' ? module.exports = factory() : typeof define === 'function' && define.amd ? define(factory) : (global = typeof globalThis !== 'undefined' ? globalThis : global || self, global.TomSelect = factory());\n})(this, function () {\n 'use strict';\n /**\n * MicroEvent - to make any js object an event emitter\n *\n * - pure javascript - server compatible, browser compatible\n * - dont rely on the browser doms\n * - super simple - you get it immediatly, no mistery, no magic involved\n *\n * @author Jerome Etienne (https://github.com/jeromeetienne)\n */\n\n /**\n * Execute callback for each event in space separated list of event names\n *\n */\n\n function forEvents(events, callback) {\n events.split(/\\s+/).forEach(function (event) {\n callback(event);\n });\n }\n\n var MicroEvent = /*#__PURE__*/function () {\n function MicroEvent() {\n _classCallCheck(this, MicroEvent);\n\n this._events = void 0;\n this._events = {};\n }\n\n _createClass(MicroEvent, [{\n key: \"on\",\n value: function on(events, fct) {\n var _this = this;\n\n forEvents(events, function (event) {\n _this._events[event] = _this._events[event] || [];\n\n _this._events[event].push(fct);\n });\n }\n }, {\n key: \"off\",\n value: function off(events, fct) {\n var _this2 = this;\n\n var n = arguments.length;\n\n if (n === 0) {\n this._events = {};\n return;\n }\n\n forEvents(events, function (event) {\n if (n === 1) return delete _this2._events[event];\n if (event in _this2._events === false) return;\n\n _this2._events[event].splice(_this2._events[event].indexOf(fct), 1);\n });\n }\n }, {\n key: \"trigger\",\n value: function trigger(events) {\n for (var _len = arguments.length, args = new Array(_len > 1 ? _len - 1 : 0), _key = 1; _key < _len; _key++) {\n args[_key - 1] = arguments[_key];\n }\n\n var self = this;\n forEvents(events, function (event) {\n if (event in self._events === false) return;\n\n var _iterator = _createForOfIteratorHelper(self._events[event]),\n _step;\n\n try {\n for (_iterator.s(); !(_step = _iterator.n()).done;) {\n var fct = _step.value;\n fct.apply(self, args);\n }\n } catch (err) {\n _iterator.e(err);\n } finally {\n _iterator.f();\n }\n });\n }\n }]);\n\n return MicroEvent;\n }();\n /**\n * microplugin.js\n * Copyright (c) 2013 Brian Reavis & contributors\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\"); you may not use this\n * file except in compliance with the License. You may obtain a copy of the License at:\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software distributed under\n * the License is distributed on an \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF\n * ANY KIND, either express or implied. See the License for the specific language\n * governing permissions and limitations under the License.\n *\n * @author Brian Reavis \n */\n\n\n function MicroPlugin(Interface) {\n Interface.plugins = {};\n return /*#__PURE__*/function (_Interface) {\n _inherits(_class, _Interface);\n\n var _super = _createSuper(_class);\n\n function _class() {\n var _this3;\n\n _classCallCheck(this, _class);\n\n for (var _len2 = arguments.length, args = new Array(_len2), _key2 = 0; _key2 < _len2; _key2++) {\n args[_key2] = arguments[_key2];\n }\n\n _this3 = _super.call.apply(_super, [this].concat(args));\n _this3.plugins = {\n names: [],\n settings: {},\n requested: {},\n loaded: {}\n };\n return _this3;\n }\n /**\n * Registers a plugin.\n *\n * @param {function} fn\n */\n\n\n _createClass(_class, [{\n key: \"initializePlugins\",\n value:\n /**\n * Initializes the listed plugins (with options).\n * Acceptable formats:\n *\n * List (without options):\n * ['a', 'b', 'c']\n *\n * List (with options):\n * [{'name': 'a', options: {}}, {'name': 'b', options: {}}]\n *\n * Hash (with options):\n * {'a': { ... }, 'b': { ... }, 'c': { ... }}\n *\n * @param {array|object} plugins\n */\n function initializePlugins(plugins) {\n var key, name;\n var self = this;\n var queue = [];\n\n if (Array.isArray(plugins)) {\n plugins.forEach(function (plugin) {\n if (typeof plugin === 'string') {\n queue.push(plugin);\n } else {\n self.plugins.settings[plugin.name] = plugin.options;\n queue.push(plugin.name);\n }\n });\n } else if (plugins) {\n for (key in plugins) {\n if (plugins.hasOwnProperty(key)) {\n self.plugins.settings[key] = plugins[key];\n queue.push(key);\n }\n }\n }\n\n while (name = queue.shift()) {\n self.require(name);\n }\n }\n }, {\n key: \"loadPlugin\",\n value: function loadPlugin(name) {\n var self = this;\n var plugins = self.plugins;\n var plugin = Interface.plugins[name];\n\n if (!Interface.plugins.hasOwnProperty(name)) {\n throw new Error('Unable to find \"' + name + '\" plugin');\n }\n\n plugins.requested[name] = true;\n plugins.loaded[name] = plugin.fn.apply(self, [self.plugins.settings[name] || {}]);\n plugins.names.push(name);\n }\n /**\n * Initializes a plugin.\n *\n */\n\n }, {\n key: \"require\",\n value: function require(name) {\n var self = this;\n var plugins = self.plugins;\n\n if (!self.plugins.loaded.hasOwnProperty(name)) {\n if (plugins.requested[name]) {\n throw new Error('Plugin has circular dependency (\"' + name + '\")');\n }\n\n self.loadPlugin(name);\n }\n\n return plugins.loaded[name];\n }\n }], [{\n key: \"define\",\n value: function define(name, fn) {\n Interface.plugins[name] = {\n 'name': name,\n 'fn': fn\n };\n }\n }]);\n\n return _class;\n }(Interface);\n } // @ts-ignore TS2691 \"An import path cannot end with a '.ts' extension\"\n // https://github.com/andrewrk/node-diacritics/blob/master/index.js\n\n\n var latin_pat;\n var accent_pat = \"[\\u0300-\\u036F\\xB7\\u02BE]\"; // \\u{2bc}\n\n var accent_reg = new RegExp(accent_pat, 'gu');\n var diacritic_patterns;\n var latin_convert = {\n 'æ': 'ae',\n 'ⱥ': 'a',\n 'ø': 'o'\n };\n var convert_pat = new RegExp(Object.keys(latin_convert).join('|'), 'gu');\n var code_points = [[0, 65535]];\n /**\n * Remove accents\n * via https://github.com/krisk/Fuse/issues/133#issuecomment-318692703\n *\n */\n\n var asciifold = function asciifold(str) {\n return str.normalize('NFKD').replace(accent_reg, '').toLowerCase().replace(convert_pat, function (foreignletter) {\n return latin_convert[foreignletter];\n });\n };\n /**\n * Convert array of strings to a regular expression\n *\tex ['ab','a'] => (?:ab|a)\n * \tex ['a','b'] => [ab]\n *\n */\n\n\n var arrayToPattern = function arrayToPattern(chars) {\n var glue = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : '|';\n\n if (chars.length == 1) {\n return chars[0];\n }\n\n var longest = 1;\n chars.forEach(function (a) {\n longest = Math.max(longest, a.length);\n });\n\n if (longest == 1) {\n return '[' + chars.join('') + ']';\n }\n\n return '(?:' + chars.join(glue) + ')';\n };\n\n var escapeToPattern = function escapeToPattern(chars) {\n var escaped = chars.map(function (diacritic) {\n return escape_regex(diacritic);\n });\n return arrayToPattern(escaped);\n };\n /**\n * Get all possible combinations of substrings that add up to the given string\n * https://stackoverflow.com/questions/30169587/find-all-the-combination-of-substrings-that-add-up-to-the-given-string\n *\n */\n\n\n var allSubstrings = function allSubstrings(input) {\n if (input.length === 1) return [[input]];\n var result = [];\n allSubstrings(input.substring(1)).forEach(function (subresult) {\n var tmp = subresult.slice(0);\n tmp[0] = input.charAt(0) + tmp[0];\n result.push(tmp);\n tmp = subresult.slice(0);\n tmp.unshift(input.charAt(0));\n result.push(tmp);\n });\n return result;\n };\n /**\n * Generate a list of diacritics from the list of code points\n *\n */\n\n\n var generateDiacritics = function generateDiacritics(code_points) {\n var diacritics = {};\n code_points.forEach(function (code_range) {\n for (var i = code_range[0]; i <= code_range[1]; i++) {\n var diacritic = String.fromCharCode(i);\n var latin = asciifold(diacritic);\n\n if (latin == diacritic.toLowerCase()) {\n continue;\n } // skip when latin is a string longer than 3 characters long\n // bc the resulting regex patterns will be long\n // eg:\n // latin صلى الله عليه وسلم length 18 code point 65018\n // latin جل جلاله length 8 code point 65019\n\n\n if (latin.length > 3) {\n continue;\n }\n\n if (!(latin in diacritics)) {\n diacritics[latin] = [latin];\n }\n\n var patt = new RegExp(escapeToPattern(diacritics[latin]), 'iu');\n\n if (diacritic.match(patt)) {\n continue;\n }\n\n diacritics[latin].push(diacritic);\n }\n }); // filter out if there's only one character in the list\n\n var latin_chars = Object.keys(diacritics);\n\n for (var i = 0; i < latin_chars.length; i++) {\n var latin = latin_chars[i];\n\n if (diacritics[latin].length < 2) {\n delete diacritics[latin];\n }\n } // latin character pattern\n // match longer substrings first\n\n\n latin_chars = Object.keys(diacritics).sort(function (a, b) {\n return b.length - a.length;\n });\n latin_pat = new RegExp('(' + escapeToPattern(latin_chars) + accent_pat + '*)', 'gu'); // build diacritic patterns\n // ae needs:\n //\t(?:(?:ae|Æ|Ǽ|Ǣ)|(?:A|Ⓐ|Ａ...)(?:E|ɛ|Ⓔ...))\n\n var diacritic_patterns = {};\n latin_chars.sort(function (a, b) {\n return a.length - b.length;\n }).forEach(function (latin) {\n var substrings = allSubstrings(latin);\n var pattern = substrings.map(function (sub_pat) {\n sub_pat = sub_pat.map(function (l) {\n if (diacritics.hasOwnProperty(l)) {\n return escapeToPattern(diacritics[l]);\n }\n\n return l;\n });\n return arrayToPattern(sub_pat, '');\n });\n diacritic_patterns[latin] = arrayToPattern(pattern);\n });\n return diacritic_patterns;\n };\n /**\n * Expand a regular expression pattern to include diacritics\n * \teg /a/ becomes /aⓐａẚàáâầấẫẩãāăằắẵẳȧǡäǟảåǻǎȁȃạậặḁąⱥɐɑAⒶＡÀÁÂẦẤẪẨÃĀĂẰẮẴẲȦǠÄǞẢÅǺǍȀȂẠẬẶḀĄȺⱯ/\n *\n */\n\n\n var diacriticRegexPoints = function diacriticRegexPoints(regex) {\n if (diacritic_patterns === undefined) {\n diacritic_patterns = generateDiacritics(code_points);\n }\n\n var decomposed = regex.normalize('NFKD').toLowerCase();\n return decomposed.split(latin_pat).map(function (part) {\n // \"ffl\" or \"ffl\"\n var no_accent = asciifold(part);\n\n if (no_accent == '') {\n return '';\n }\n\n if (diacritic_patterns.hasOwnProperty(no_accent)) {\n return diacritic_patterns[no_accent];\n }\n\n return part;\n }).join('');\n }; // @ts-ignore TS2691 \"An import path cannot end with a '.ts' extension\"\n\n /**\n * A property getter resolving dot-notation\n * @param {Object} obj The root object to fetch property on\n * @param {String} name The optionally dotted property name to fetch\n * @return {Object} The resolved property value\n */\n\n\n var getAttr = function getAttr(obj, name) {\n if (!obj) return;\n return obj[name];\n };\n /**\n * A property getter resolving dot-notation\n * @param {Object} obj The root object to fetch property on\n * @param {String} name The optionally dotted property name to fetch\n * @return {Object} The resolved property value\n */\n\n\n var getAttrNesting = function getAttrNesting(obj, name) {\n if (!obj) return;\n var part,\n names = name.split(\".\");\n\n while ((part = names.shift()) && (obj = obj[part])) {\n ;\n }\n\n return obj;\n };\n /**\n * Calculates how close of a match the\n * given value is against a search token.\n *\n */\n\n\n var scoreValue = function scoreValue(value, token, weight) {\n var score, pos;\n if (!value) return 0;\n value = value + '';\n pos = value.search(token.regex);\n if (pos === -1) return 0;\n score = token.string.length / value.length;\n if (pos === 0) score += 0.5;\n return score * weight;\n };\n /**\n *\n * https://stackoverflow.com/questions/63006601/why-does-u-throw-an-invalid-escape-error\n */\n\n\n var escape_regex = function escape_regex(str) {\n return (str + '').replace(/([\\$\\(-\\+\\.\\?\\[-\\^\\{-\\}])/g, '\\\\$1');\n };\n /**\n * Cast object property to an array if it exists and has a value\n *\n */\n\n\n var propToArray = function propToArray(obj, key) {\n var value = obj[key];\n if (typeof value == 'function') return value;\n\n if (value && !Array.isArray(value)) {\n obj[key] = [value];\n }\n };\n /**\n * Iterates over arrays and hashes.\n *\n * ```\n * iterate(this.items, function(item, id) {\n * // invoked for each item\n * });\n * ```\n *\n */\n\n\n var iterate = function iterate(object, callback) {\n if (Array.isArray(object)) {\n object.forEach(callback);\n } else {\n for (var key in object) {\n if (object.hasOwnProperty(key)) {\n callback(object[key], key);\n }\n }\n }\n };\n\n var cmp = function cmp(a, b) {\n if (typeof a === 'number' && typeof b === 'number') {\n return a > b ? 1 : a < b ? -1 : 0;\n }\n\n a = asciifold(a + '').toLowerCase();\n b = asciifold(b + '').toLowerCase();\n if (a > b) return 1;\n if (b > a) return -1;\n return 0;\n };\n /**\n * sifter.js\n * Copyright (c) 2013–2020 Brian Reavis & contributors\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\"); you may not use this\n * file except in compliance with the License. You may obtain a copy of the License at:\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software distributed under\n * the License is distributed on an \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF\n * ANY KIND, either express or implied. See the License for the specific language\n * governing permissions and limitations under the License.\n *\n * @author Brian Reavis \n */\n\n\n var Sifter = /*#__PURE__*/function () {\n // []|{};\n\n /**\n * Textually searches arrays and hashes of objects\n * by property (or multiple properties). Designed\n * specifically for autocomplete.\n *\n */\n function Sifter(items, settings) {\n _classCallCheck(this, Sifter);\n\n this.items = void 0;\n this.settings = void 0;\n this.items = items;\n this.settings = settings || {\n diacritics: true\n };\n }\n /**\n * Splits a search string into an array of individual\n * regexps to be used to match results.\n *\n */\n\n\n _createClass(Sifter, [{\n key: \"tokenize\",\n value: function tokenize(query, respect_word_boundaries, weights) {\n var _this4 = this;\n\n if (!query || !query.length) return [];\n var tokens = [];\n var words = query.split(/\\s+/);\n var field_regex;\n\n if (weights) {\n field_regex = new RegExp('^(' + Object.keys(weights).map(escape_regex).join('|') + ')\\:(.*)$');\n }\n\n words.forEach(function (word) {\n var field_match;\n var field = null;\n var regex = null; // look for \"field:query\" tokens\n\n if (field_regex && (field_match = word.match(field_regex))) {\n field = field_match[1];\n word = field_match[2];\n }\n\n if (word.length > 0) {\n if (_this4.settings.diacritics) {\n regex = diacriticRegexPoints(word);\n } else {\n regex = escape_regex(word);\n }\n\n if (respect_word_boundaries) regex = \"\\\\b\" + regex;\n }\n\n tokens.push({\n string: word,\n regex: regex ? new RegExp(regex, 'iu') : null,\n field: field\n });\n });\n return tokens;\n }\n /**\n * Returns a function to be used to score individual results.\n *\n * Good matches will have a higher score than poor matches.\n * If an item is not a match, 0 will be returned by the function.\n *\n * @returns {function}\n */\n\n }, {\n key: \"getScoreFunction\",\n value: function getScoreFunction(query, options) {\n var search = this.prepareSearch(query, options);\n return this._getScoreFunction(search);\n }\n }, {\n key: \"_getScoreFunction\",\n value: function _getScoreFunction(search) {\n var tokens = search.tokens,\n token_count = tokens.length;\n\n if (!token_count) {\n return function () {\n return 0;\n };\n }\n\n var fields = search.options.fields,\n weights = search.weights,\n field_count = fields.length,\n getAttrFn = search.getAttrFn;\n\n if (!field_count) {\n return function () {\n return 1;\n };\n }\n /**\n * Calculates the score of an object\n * against the search query.\n *\n */\n\n\n var scoreObject = function () {\n if (field_count === 1) {\n return function (token, data) {\n var field = fields[0].field;\n return scoreValue(getAttrFn(data, field), token, weights[field]);\n };\n }\n\n return function (token, data) {\n var sum = 0; // is the token specific to a field?\n\n if (token.field) {\n var value = getAttrFn(data, token.field);\n\n if (!token.regex && value) {\n sum += 1 / field_count;\n } else {\n sum += scoreValue(value, token, 1);\n }\n } else {\n iterate(weights, function (weight, field) {\n sum += scoreValue(getAttrFn(data, field), token, weight);\n });\n }\n\n return sum / field_count;\n };\n }();\n\n if (token_count === 1) {\n return function (data) {\n return scoreObject(tokens[0], data);\n };\n }\n\n if (search.options.conjunction === 'and') {\n return function (data) {\n var i = 0,\n score,\n sum = 0;\n\n for (; i < token_count; i++) {\n score = scoreObject(tokens[i], data);\n if (score <= 0) return 0;\n sum += score;\n }\n\n return sum / token_count;\n };\n } else {\n return function (data) {\n var sum = 0;\n iterate(tokens, function (token) {\n sum += scoreObject(token, data);\n });\n return sum / token_count;\n };\n }\n }\n /**\n * Returns a function that can be used to compare two\n * results, for sorting purposes. If no sorting should\n * be performed, `null` will be returned.\n *\n * @return function(a,b)\n */\n\n }, {\n key: \"getSortFunction\",\n value: function getSortFunction(query, options) {\n var search = this.prepareSearch(query, options);\n return this._getSortFunction(search);\n }\n }, {\n key: \"_getSortFunction\",\n value: function _getSortFunction(search) {\n var i, n, implicit_score;\n var self = this,\n options = search.options,\n sort = !search.query && options.sort_empty ? options.sort_empty : options.sort,\n sort_flds = [],\n multipliers = [];\n\n if (typeof sort == 'function') {\n return sort.bind(this);\n }\n /**\n * Fetches the specified sort field value\n * from a search result item.\n *\n */\n\n\n var get_field = function get_field(name, result) {\n if (name === '$score') return result.score;\n return search.getAttrFn(self.items[result.id], name);\n }; // parse options\n\n\n if (sort) {\n for (i = 0, n = sort.length; i < n; i++) {\n if (search.query || sort[i].field !== '$score') {\n sort_flds.push(sort[i]);\n }\n }\n } // the \"$score\" field is implied to be the primary\n // sort field, unless it's manually specified\n\n\n if (search.query) {\n implicit_score = true;\n\n for (i = 0, n = sort_flds.length; i < n; i++) {\n if (sort_flds[i].field === '$score') {\n implicit_score = false;\n break;\n }\n }\n\n if (implicit_score) {\n sort_flds.unshift({\n field: '$score',\n direction: 'desc'\n });\n }\n } else {\n for (i = 0, n = sort_flds.length; i < n; i++) {\n if (sort_flds[i].field === '$score') {\n sort_flds.splice(i, 1);\n break;\n }\n }\n }\n\n for (i = 0, n = sort_flds.length; i < n; i++) {\n multipliers.push(sort_flds[i].direction === 'desc' ? -1 : 1);\n } // build function\n\n\n var sort_flds_count = sort_flds.length;\n\n if (!sort_flds_count) {\n return null;\n } else if (sort_flds_count === 1) {\n var sort_fld = sort_flds[0].field;\n var multiplier = multipliers[0];\n return function (a, b) {\n return multiplier * cmp(get_field(sort_fld, a), get_field(sort_fld, b));\n };\n } else {\n return function (a, b) {\n var i, result, field;\n\n for (i = 0; i < sort_flds_count; i++) {\n field = sort_flds[i].field;\n result = multipliers[i] * cmp(get_field(field, a), get_field(field, b));\n if (result) return result;\n }\n\n return 0;\n };\n }\n }\n /**\n * Parses a search query and returns an object\n * with tokens and fields ready to be populated\n * with results.\n *\n */\n\n }, {\n key: \"prepareSearch\",\n value: function prepareSearch(query, optsUser) {\n var weights = {};\n var options = Object.assign({}, optsUser);\n propToArray(options, 'sort');\n propToArray(options, 'sort_empty'); // convert fields to new format\n\n if (options.fields) {\n propToArray(options, 'fields');\n var fields = [];\n options.fields.forEach(function (field) {\n if (typeof field == 'string') {\n field = {\n field: field,\n weight: 1\n };\n }\n\n fields.push(field);\n weights[field.field] = 'weight' in field ? field.weight : 1;\n });\n options.fields = fields;\n }\n\n return {\n options: options,\n query: query.toLowerCase().trim(),\n tokens: this.tokenize(query, options.respect_word_boundaries, weights),\n total: 0,\n items: [],\n weights: weights,\n getAttrFn: options.nesting ? getAttrNesting : getAttr\n };\n }\n /**\n * Searches through all items and returns a sorted array of matches.\n *\n */\n\n }, {\n key: \"search\",\n value: function search(query, options) {\n var self = this,\n score,\n search;\n search = this.prepareSearch(query, options);\n options = search.options;\n query = search.query; // generate result scoring function\n\n var fn_score = options.score || self._getScoreFunction(search); // perform search and sort\n\n\n if (query.length) {\n iterate(self.items, function (item, id) {\n score = fn_score(item);\n\n if (options.filter === false || score > 0) {\n search.items.push({\n 'score': score,\n 'id': id\n });\n }\n });\n } else {\n iterate(self.items, function (_, id) {\n search.items.push({\n 'score': 1,\n 'id': id\n });\n });\n }\n\n var fn_sort = self._getSortFunction(search);\n\n if (fn_sort) search.items.sort(fn_sort); // apply limits\n\n search.total = search.items.length;\n\n if (typeof options.limit === 'number') {\n search.items = search.items.slice(0, options.limit);\n }\n\n return search;\n }\n }]);\n\n return Sifter;\n }();\n /**\n * Return a dom element from either a dom query string, jQuery object, a dom element or html string\n * https://stackoverflow.com/questions/494143/creating-a-new-dom-element-from-an-html-string-using-built-in-dom-methods-or-pro/35385518#35385518\n *\n * param query should be {}\n */\n\n\n var getDom = function getDom(query) {\n if (query.jquery) {\n return query[0];\n }\n\n if (query instanceof HTMLElement) {\n return query;\n }\n\n if (isHtmlString(query)) {\n var div = document.createElement('div');\n div.innerHTML = query.trim(); // Never return a text node of whitespace as the result\n\n return div.firstChild;\n }\n\n return document.querySelector(query);\n };\n\n var isHtmlString = function isHtmlString(arg) {\n if (typeof arg === 'string' && arg.indexOf('<') > -1) {\n return true;\n }\n\n return false;\n };\n\n var escapeQuery = function escapeQuery(query) {\n return query.replace(/['\"\\\\]/g, '\\\\$&');\n };\n /**\n * Dispatch an event\n *\n */\n\n\n var triggerEvent = function triggerEvent(dom_el, event_name) {\n var event = document.createEvent('HTMLEvents');\n event.initEvent(event_name, true, false);\n dom_el.dispatchEvent(event);\n };\n /**\n * Apply CSS rules to a dom element\n *\n */\n\n\n var applyCSS = function applyCSS(dom_el, css) {\n Object.assign(dom_el.style, css);\n };\n /**\n * Add css classes\n *\n */\n\n\n var addClasses = function addClasses(elmts) {\n for (var _len3 = arguments.length, classes = new Array(_len3 > 1 ? _len3 - 1 : 0), _key3 = 1; _key3 < _len3; _key3++) {\n classes[_key3 - 1] = arguments[_key3];\n }\n\n var norm_classes = classesArray(classes);\n elmts = castAsArray(elmts);\n elmts.map(function (el) {\n norm_classes.map(function (cls) {\n el.classList.add(cls);\n });\n });\n };\n /**\n * Remove css classes\n *\n */\n\n\n var removeClasses = function removeClasses(elmts) {\n for (var _len4 = arguments.length, classes = new Array(_len4 > 1 ? _len4 - 1 : 0), _key4 = 1; _key4 < _len4; _key4++) {\n classes[_key4 - 1] = arguments[_key4];\n }\n\n var norm_classes = classesArray(classes);\n elmts = castAsArray(elmts);\n elmts.map(function (el) {\n norm_classes.map(function (cls) {\n el.classList.remove(cls);\n });\n });\n };\n /**\n * Return arguments\n *\n */\n\n\n var classesArray = function classesArray(args) {\n var classes = [];\n iterate(args, function (_classes) {\n if (typeof _classes === 'string') {\n _classes = _classes.trim().split(/[\\11\\12\\14\\15\\40]/);\n }\n\n if (Array.isArray(_classes)) {\n classes = classes.concat(_classes);\n }\n });\n return classes.filter(Boolean);\n };\n /**\n * Create an array from arg if it's not already an array\n *\n */\n\n\n var castAsArray = function castAsArray(arg) {\n if (!Array.isArray(arg)) {\n arg = [arg];\n }\n\n return arg;\n };\n /**\n * Get the closest node to the evt.target matching the selector\n * Stops at wrapper\n *\n */\n\n\n var parentMatch = function parentMatch(target, selector, wrapper) {\n if (wrapper && !wrapper.contains(target)) {\n return;\n }\n\n while (target && target.matches) {\n if (target.matches(selector)) {\n return target;\n }\n\n target = target.parentNode;\n }\n };\n /**\n * Get the first or last item from an array\n *\n * > 0 - right (last)\n * <= 0 - left (first)\n *\n */\n\n\n var getTail = function getTail(list) {\n var direction = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 0;\n\n if (direction > 0) {\n return list[list.length - 1];\n }\n\n return list[0];\n };\n /**\n * Return true if an object is empty\n *\n */\n\n\n var isEmptyObject = function isEmptyObject(obj) {\n return Object.keys(obj).length === 0;\n };\n /**\n * Get the index of an element amongst sibling nodes of the same type\n *\n */\n\n\n var nodeIndex = function nodeIndex(el, amongst) {\n if (!el) return -1;\n amongst = amongst || el.nodeName;\n var i = 0;\n\n while (el = el.previousElementSibling) {\n if (el.matches(amongst)) {\n i++;\n }\n }\n\n return i;\n };\n /**\n * Set attributes of an element\n *\n */\n\n\n var setAttr = function setAttr(el, attrs) {\n iterate(attrs, function (val, attr) {\n if (val == null) {\n el.removeAttribute(attr);\n } else {\n el.setAttribute(attr, '' + val);\n }\n });\n };\n /**\n * Replace a node\n */\n\n\n var replaceNode = function replaceNode(existing, replacement) {\n if (existing.parentNode) existing.parentNode.replaceChild(replacement, existing);\n };\n /**\n * highlight v3 | MIT license | Johann Burkard \n * Highlights arbitrary terms in a node.\n *\n * - Modified by Marshal 2011-6-24 (added regex)\n * - Modified by Brian Reavis 2012-8-27 (cleanup)\n */\n\n\n var highlight = function highlight(element, regex) {\n if (regex === null) return; // convet string to regex\n\n if (typeof regex === 'string') {\n if (!regex.length) return;\n regex = new RegExp(regex, 'i');\n } // Wrap matching part of text node with highlighting , e.g.\n // Soccer -> Soccer for regex = /soc/i\n\n\n var highlightText = function highlightText(node) {\n var match = node.data.match(regex);\n\n if (match && node.data.length > 0) {\n var spannode = document.createElement('span');\n spannode.className = 'highlight';\n var middlebit = node.splitText(match.index);\n middlebit.splitText(match[0].length);\n var middleclone = middlebit.cloneNode(true);\n spannode.appendChild(middleclone);\n replaceNode(middlebit, spannode);\n return 1;\n }\n\n return 0;\n }; // Recurse element node, looking for child text nodes to highlight, unless element\n // is childless,