RubyGems - tom-select-rails - Versions diffs - 2.2.1 → 2.3.1 - Mend

tom-select-rails 2.2.1 → 2.3.1

Files changed (131) hide show

data/vendor/assets/javascripts/tom-select-rails/js/plugins/clear_button.js.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"file":"clear_button.js","sources":["../../../node_modules/@orchidjs/unicode-variants/dist/esm/index.js","../../../src/vanilla.ts","../../../src/plugins/clear_button/plugin.ts"],"sourcesContent":["/! @orchidjs/unicode-variants \| https://github.com/orchidjs/unicode-variants \| Apache License (v2) /\nimport { toArray, setToPattern, escape_regex, arrayToPattern, sequencePattern } from './regex.js';\nexport { escape_regex } from './regex.js';\nimport { allSubstrings } from './strings.js';\n\n/*\n @typedef {{[key:string]:string}} TUnicodeMap\n * @typedef {{[key:string]:Set<string>}} TUnicodeSets\n * @typedef {[[number,number]]} TCodePoints\n * @typedef {{folded:string,composed:string,code_point:number}} TCodePointObj\n * @typedef {{start:number,end:number,length:number,substr:string}} TSequencePart\n /\n/* @type {TCodePoints} /\n\nconst code_points = [[0, 65535]];\nconst accent_pat = '[\\u0300-\\u036F\\u{b7}\\u{2be}]'; // \\u{2bc}\n\n/* @type {TUnicodeMap} /\n\nlet unicode_map;\n/* @type {RegExp} /\n\nlet multi_char_reg;\nconst max_char_length = 3;\n/* @type {TUnicodeMap} /\n\nconst latin_convert = {\n 'æ': 'ae',\n 'ⱥ': 'a',\n 'ø': 'o',\n '⁄': '/',\n '∕': '/'\n};\nconst convert_pat = new RegExp(Object.keys(latin_convert).join('\|') + '\|' + accent_pat, 'gu');\n/\n Initialize the unicode_map from the give code point ranges\n \n @param {TCodePoints=} _code_points\n /\n\nconst initialize = _code_points => {\n if (unicode_map !== undefined) return;\n unicode_map = generateMap(_code_points \|\| code_points);\n};\n/\n Helper method for normalize a string\n * https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/normalize\n * @param {string} str\n * @param {string} form\n /\n\nconst normalize = (str, form = 'NFKD') => str.normalize(form);\n/\n Compatibility Decomposition without reordering string\n * calling str.normalize('NFKD') on \\u{594}\\u{595}\\u{596} becomes \\u{596}\\u{594}\\u{595}\n * @param {string} str\n /\n\nconst decompose = str => {\n if (str.match(/[\\u0f71-\\u0f81]/)) {\n return toArray(str).reduce(\n /\n @param {string} result\n * @param {string} char\n /\n (result, char) => {\n return result + normalize(char);\n }, '');\n }\n\n return normalize(str);\n};\n/\n Remove accents\n * via https://github.com/krisk/Fuse/issues/133#issuecomment-318692703\n * @param {string} str\n * @return {string}\n /\n\nconst asciifold = str => {\n return decompose(str).toLowerCase().replace(convert_pat, (\n /* @type {string} /\n char) => {\n return latin_convert[char] \|\| '';\n });\n};\n/\n Generate a list of unicode variants from the list of code points\n * @param {TCodePoints} code_points\n * @yield {TCodePointObj}\n /\n\nfunction generator(code_points) {\n for (const [code_point_min, code_point_max] of code_points) {\n for (let i = code_point_min; i <= code_point_max; i++) {\n let composed = String.fromCharCode(i);\n let folded = asciifold(composed);\n\n if (folded == composed.toLowerCase()) {\n continue;\n } // skip when folded is a string longer than 3 characters long\n // bc the resulting regex patterns will be long\n // eg:\n // folded صلى الله عليه وسلم length 18 code point 65018\n // folded جل جلاله length 8 code point 65019\n\n\n if (folded.length > max_char_length) {\n continue;\n }\n\n if (folded.length == 0) {\n continue;\n }\n\n let decomposed = normalize(composed);\n let recomposed = normalize(decomposed, 'NFC');\n\n if (recomposed === composed && folded === decomposed) {\n continue;\n }\n\n yield {\n folded: folded,\n composed: composed,\n code_point: i\n };\n }\n }\n}\n/*\n Generate a unicode map from the list of code points\n * @param {TCodePoints} code_points\n * @return {TUnicodeSets}\n /\n\nconst generateSets = code_points => {\n /* @type {{[key:string]:Set<string>}} /\n const unicode_sets = {};\n /\n @param {string} folded\n * @param {string} to_add\n /\n\n const addMatching = (folded, to_add) => {\n /* @type {Set<string>} /\n const folded_set = unicode_sets[folded] \|\| new Set();\n const patt = new RegExp('^' + setToPattern(folded_set) + '$', 'iu');\n\n if (to_add.match(patt)) {\n return;\n }\n\n folded_set.add(escape_regex(to_add));\n unicode_sets[folded] = folded_set;\n };\n\n for (let value of generator(code_points)) {\n addMatching(value.folded, value.folded);\n addMatching(value.folded, value.composed);\n }\n\n return unicode_sets;\n};\n/\n Generate a unicode map from the list of code points\n * ae => (?:(?:ae\|Æ\|Ǽ\|Ǣ)\|(?:A\|Ⓐ\|Ａ...)(?:E\|ɛ\|Ⓔ...))\n \n @param {TCodePoints} code_points\n * @return {TUnicodeMap}\n /\n\nconst generateMap = code_points => {\n /* @type {TUnicodeSets} /\n const unicode_sets = generateSets(code_points);\n /* @type {TUnicodeMap} /\n\n const unicode_map = {};\n /* @type {string[]} /\n\n let multi_char = [];\n\n for (let folded in unicode_sets) {\n let set = unicode_sets[folded];\n\n if (set) {\n unicode_map[folded] = setToPattern(set);\n }\n\n if (folded.length > 1) {\n multi_char.push(escape_regex(folded));\n }\n }\n\n multi_char.sort((a, b) => b.length - a.length);\n const multi_char_patt = arrayToPattern(multi_char);\n multi_char_reg = new RegExp('^' + multi_char_patt, 'u');\n return unicode_map;\n};\n/\n Map each element of an array from it's folded value to all possible unicode matches\n * @param {string[]} strings\n * @param {number} min_replacement\n * @return {string}\n /\n\nconst mapSequence = (strings, min_replacement = 1) => {\n let chars_replaced = 0;\n strings = strings.map(str => {\n if (unicode_map[str]) {\n chars_replaced += str.length;\n }\n\n return unicode_map[str] \|\| str;\n });\n\n if (chars_replaced >= min_replacement) {\n return sequencePattern(strings);\n }\n\n return '';\n};\n/\n Convert a short string and split it into all possible patterns\n * Keep a pattern only if min_replacement is met\n \n 'abc'\n * \t\t=> [['abc'],['ab','c'],['a','bc'],['a','b','c']]\n \t\t=> ['abc-pattern','ab-c-pattern'...]\n \n \n @param {string} str\n * @param {number} min_replacement\n * @return {string}\n /\n\nconst substringsToPattern = (str, min_replacement = 1) => {\n min_replacement = Math.max(min_replacement, str.length - 1);\n return arrayToPattern(allSubstrings(str).map(sub_pat => {\n return mapSequence(sub_pat, min_replacement);\n }));\n};\n/\n Convert an array of sequences into a pattern\n * [{start:0,end:3,length:3,substr:'iii'}...] => (?:iii...)\n \n @param {Sequence[]} sequences\n * @param {boolean} all\n /\n\nconst sequencesToPattern = (sequences, all = true) => {\n let min_replacement = sequences.length > 1 ? 1 : 0;\n return arrayToPattern(sequences.map(sequence => {\n let seq = [];\n const len = all ? sequence.length() : sequence.length() - 1;\n\n for (let j = 0; j < len; j++) {\n seq.push(substringsToPattern(sequence.substrs[j] \|\| '', min_replacement));\n }\n\n return sequencePattern(seq);\n }));\n};\n/\n Return true if the sequence is already in the sequences\n * @param {Sequence} needle_seq\n * @param {Sequence[]} sequences\n /\n\n\nconst inSequences = (needle_seq, sequences) => {\n for (const seq of sequences) {\n if (seq.start != needle_seq.start \|\| seq.end != needle_seq.end) {\n continue;\n }\n\n if (seq.substrs.join('') !== needle_seq.substrs.join('')) {\n continue;\n }\n\n let needle_parts = needle_seq.parts;\n /\n @param {TSequencePart} part\n /\n\n const filter = part => {\n for (const needle_part of needle_parts) {\n if (needle_part.start === part.start && needle_part.substr === part.substr) {\n return false;\n }\n\n if (part.length == 1 \|\| needle_part.length == 1) {\n continue;\n } // check for overlapping parts\n // a = ['::=','==']\n // b = ['::','===']\n // a = ['r','sm']\n // b = ['rs','m']\n\n\n if (part.start < needle_part.start && part.end > needle_part.start) {\n return true;\n }\n\n if (needle_part.start < part.start && needle_part.end > part.start) {\n return true;\n }\n }\n\n return false;\n };\n\n let filtered = seq.parts.filter(filter);\n\n if (filtered.length > 0) {\n continue;\n }\n\n return true;\n }\n\n return false;\n};\n\nclass Sequence {\n constructor() {\n /* @type {TSequencePart[]} /\n this.parts = [];\n /* @type {string[]} /\n\n this.substrs = [];\n this.start = 0;\n this.end = 0;\n }\n /\n @param {TSequencePart\|undefined} part\n /\n\n\n add(part) {\n if (part) {\n this.parts.push(part);\n this.substrs.push(part.substr);\n this.start = Math.min(part.start, this.start);\n this.end = Math.max(part.end, this.end);\n }\n }\n\n last() {\n return this.parts[this.parts.length - 1];\n }\n\n length() {\n return this.parts.length;\n }\n /\n @param {number} position\n * @param {TSequencePart} last_piece\n /\n\n\n clone(position, last_piece) {\n let clone = new Sequence();\n let parts = JSON.parse(JSON.stringify(this.parts));\n let last_part = parts.pop();\n\n for (const part of parts) {\n clone.add(part);\n }\n\n let last_substr = last_piece.substr.substring(0, position - last_part.start);\n let clone_last_len = last_substr.length;\n clone.add({\n start: last_part.start,\n end: last_part.start + clone_last_len,\n length: clone_last_len,\n substr: last_substr\n });\n return clone;\n }\n\n}\n/\n Expand a regular expression pattern to include unicode variants\n * \teg /a/ becomes /aⓐａẚàáâầấẫẩãāăằắẵẳȧǡäǟảåǻǎȁȃạậặḁąⱥɐɑAⒶＡÀÁÂẦẤẪẨÃĀĂẰẮẴẲȦǠÄǞẢÅǺǍȀȂẠẬẶḀĄȺⱯ/\n \n Issue:\n * ﺊﺋ [ 'ﺊ = \\\\u{fe8a}', 'ﺋ = \\\\u{fe8b}' ]\n \tbecomes:\tئئ [ 'ي = \\\\u{64a}', 'ٔ = \\\\u{654}', 'ي = \\\\u{64a}', 'ٔ = \\\\u{654}' ]\n \n \tİĲ = IIJ = ⅡJ\n \n * \t1/2/4\n \n @param {string} str\n * @return {string\|undefined}\n /\n\n\nconst getPattern = str => {\n initialize();\n str = asciifold(str);\n let pattern = '';\n let sequences = [new Sequence()];\n\n for (let i = 0; i < str.length; i++) {\n let substr = str.substring(i);\n let match = substr.match(multi_char_reg);\n const char = str.substring(i, i + 1);\n const match_str = match ? match[0] : null; // loop through sequences\n // add either the char or multi_match\n\n let overlapping = [];\n let added_types = new Set();\n\n for (const sequence of sequences) {\n const last_piece = sequence.last();\n\n if (!last_piece \|\| last_piece.length == 1 \|\| last_piece.end <= i) {\n // if we have a multi match\n if (match_str) {\n const len = match_str.length;\n sequence.add({\n start: i,\n end: i + len,\n length: len,\n substr: match_str\n });\n added_types.add('1');\n } else {\n sequence.add({\n start: i,\n end: i + 1,\n length: 1,\n substr: char\n });\n added_types.add('2');\n }\n } else if (match_str) {\n let clone = sequence.clone(i, last_piece);\n const len = match_str.length;\n clone.add({\n start: i,\n end: i + len,\n length: len,\n substr: match_str\n });\n overlapping.push(clone);\n } else {\n // don't add char\n // adding would create invalid patterns: 234 => [2,34,4]\n added_types.add('3');\n }\n } // if we have overlapping\n\n\n if (overlapping.length > 0) {\n // ['ii','iii'] before ['i','i','iii']\n overlapping = overlapping.sort((a, b) => {\n return a.length() - b.length();\n });\n\n for (let clone of overlapping) {\n // don't add if we already have an equivalent sequence\n if (inSequences(clone, sequences)) {\n continue;\n }\n\n sequences.push(clone);\n }\n\n continue;\n } // if we haven't done anything unique\n // clean up the patterns\n // helps keep patterns smaller\n // if str = 'r₨㎧aarss', pattern will be 446 instead of 655\n\n\n if (i > 0 && added_types.size == 1 && !added_types.has('3')) {\n pattern += sequencesToPattern(sequences, false);\n let new_seq = new Sequence();\n const old_seq = sequences[0];\n\n if (old_seq) {\n new_seq.add(old_seq.last());\n }\n\n sequences = [new_seq];\n }\n }\n\n pattern += sequencesToPattern(sequences, true);\n return pattern;\n};\n\nexport { asciifold, code_points, decompose, generateMap, generateSets, generator, getPattern, initialize, mapSequence, normalize, substringsToPattern, unicode_map };\n//# sourceMappingURL=index.js.map\n","\nimport { iterate } from '@orchidjs/sifter/lib/utils';\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 /\nexport const getDom = ( query:any ):HTMLElement => {\n\n\tif( query.jquery ){\n\t\treturn query[0];\n\t}\n\n\tif( query instanceof HTMLElement ){\n\t\treturn query;\n\t}\n\n\tif( isHtmlString(query) ){\n\t\tvar tpl = document.createElement('template');\n\t\ttpl.innerHTML = query.trim(); // Never return a text node of whitespace as the result\n\t\treturn tpl.content.firstChild as HTMLElement;\n\t}\n\n\treturn document.querySelector(query);\n};\n\nexport const isHtmlString = (arg:any): boolean => {\n\tif( typeof arg === 'string' && arg.indexOf('<') > -1 ){\n\t\treturn true;\n\t}\n\treturn false;\n}\n\nexport const escapeQuery = (query:string):string => {\n\treturn query.replace(/['\"\\\\]/g, '\\\\$&');\n}\n\n/\n Dispatch an event\n \n /\nexport const triggerEvent = ( dom_el:HTMLElement, event_name:string ):void => {\n\tvar event = document.createEvent('HTMLEvents');\n\tevent.initEvent(event_name, true, false);\n\tdom_el.dispatchEvent(event)\n};\n\n/*\n Apply CSS rules to a dom element\n \n /\nexport const applyCSS = ( dom_el:HTMLElement, css:{ [key: string]: string\|number }):void => {\n\tObject.assign(dom_el.style, css);\n}\n\n\n/*\n Add css classes\n \n /\nexport const addClasses = ( elmts:HTMLElement\|HTMLElement[], ...classes:string[]\|string[][] ) => {\n\n\tvar norm_classes \t= classesArray(classes);\n\telmts\t\t\t\t= castAsArray(elmts);\n\n\telmts.map( el => {\n\t\tnorm_classes.map( cls => {\n\t\t\tel.classList.add( cls );\n\t\t});\n\t});\n}\n\n/*\n Remove css classes\n \n /\n export const removeClasses = ( elmts:HTMLElement\|HTMLElement[], ...classes:string[]\|string[][] ) => {\n\n \tvar norm_classes \t= classesArray(classes);\n\telmts\t\t\t\t= castAsArray(elmts);\n\n\telmts.map( el => {\n\t\tnorm_classes.map(cls => {\n\t \t\tel.classList.remove( cls );\n\t\t});\n \t});\n }\n\n\n/*\n Return arguments\n \n /\nexport const classesArray = (args:string[]\|string[][]):string[] => {\n\tvar classes:string[] = [];\n\titerate( args, (_classes) =>{\n\t\tif( typeof _classes === 'string' ){\n\t\t\t_classes = _classes.trim().split(/[\\11\\12\\14\\15\\40]/);\n\t\t}\n\t\tif( Array.isArray(_classes) ){\n\t\t\tclasses = classes.concat(_classes);\n\t\t}\n\t});\n\n\treturn classes.filter(Boolean);\n}\n\n\n/*\n Create an array from arg if it's not already an array\n \n /\nexport const castAsArray = (arg:any):Array<any> => {\n\tif( !Array.isArray(arg) ){\n \t\targ = [arg];\n \t}\n\treturn arg;\n}\n\n\n/*\n Get the closest node to the evt.target matching the selector\n * Stops at wrapper\n \n /\nexport const parentMatch = ( target:null\|HTMLElement, selector:string, wrapper?:HTMLElement ):HTMLElement\|void => {\n\n\tif( wrapper && !wrapper.contains(target) ){\n\t\treturn;\n\t}\n\n\twhile( target && target.matches ){\n\n\t\tif( target.matches(selector) ){\n\t\t\treturn target;\n\t\t}\n\n\t\ttarget = target.parentNode as HTMLElement;\n\t}\n}\n\n\n/*\n Get the first or last item from an array\n \n > 0 - right (last)\n * <= 0 - left (first)\n \n /\nexport const getTail = ( list:Array<any>\|NodeList, direction:number=0 ):any => {\n\n\tif( direction > 0 ){\n\t\treturn list[list.length-1];\n\t}\n\n\treturn list[0];\n}\n\n/*\n Return true if an object is empty\n \n /\nexport const isEmptyObject = (obj:object):boolean => {\n\treturn (Object.keys(obj).length === 0);\n}\n\n\n/*\n Get the index of an element amongst sibling nodes of the same type\n \n /\nexport const nodeIndex = ( el:null\|Element, amongst?:string ):number => {\n\tif (!el) return -1;\n\n\tamongst = amongst \|\| el.nodeName;\n\n\tvar i = 0;\n\twhile( el = el.previousElementSibling ){\n\n\t\tif( el.matches(amongst) ){\n\t\t\ti++;\n\t\t}\n\t}\n\treturn i;\n}\n\n\n/*\n Set attributes of an element\n \n /\nexport const setAttr = (el:Element,attrs:{ [key: string]: null\|string\|number }) => {\n\titerate( attrs,(val,attr) => {\n\t\tif( val == null ){\n\t\t\tel.removeAttribute(attr as string);\n\t\t}else{\n\t\t\tel.setAttribute(attr as string, ''+val);\n\t\t}\n\t});\n}\n\n\n/*\n Replace a node\n /\nexport const replaceNode = ( existing:Node, replacement:Node ) => {\n\tif( existing.parentNode ) existing.parentNode.replaceChild(replacement, existing);\n}\n","/\n Plugin: \"dropdown_header\" (Tom Select)\n * Copyright (c) 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 /\n\nimport TomSelect from '../../tom-select';\nimport { getDom } from '../../vanilla';\nimport { CBOptions } from './types';\n\nexport default function(this:TomSelect, userOptions:CBOptions) {\n\tconst self = this;\n\n\tconst options = Object.assign({\n\t\tclassName: 'clear-button',\n\t\ttitle: 'Clear All',\n\t\thtml: (data:CBOptions) => {\n\t\t\treturn `<div class=\"${data.className}\" title=\"${data.title}\">⨯</div>`;\n\t\t}\n\t}, userOptions);\n\n\tself.on('initialize',()=>{\n\t\tvar button = getDom(options.html(options));\n\t\tbutton.addEventListener('click',(evt)=>{\n\n\t\t\tif( self.isDisabled ){\n\t\t\t\treturn;\n\t\t\t}\n\n\t\t\tself.clear();\n\n\t\t\tif( self.settings.mode === 'single' && self.settings.allowEmptyOption ){\n\t\t\t\tself.addItem('');\n\t\t\t}\n\n\t\t\tevt.preventDefault();\n\t\t\tevt.stopPropagation();\n\t\t});\n\t\tself.control.appendChild(button);\n\t});\n\n};\n"],"names":["getDom","query","jquery","HTMLElement","isHtmlString","tpl","document","createElement","innerHTML","trim","content","firstChild","querySelector","arg","indexOf","userOptions","self","options","Object","assign","className","title","html","data","on","button","addEventListener","evt","isDisabled","clear","settings","mode","allowEmptyOption","addItem","preventDefault","stopPropagation","control","appendChild"],"mappings":";;;;;;;;;;;EAAA;EAeA,MAAM,UAAU,GAAG,8BAA8B,CAAC;EASlD;AACA;EACA,MAAM,aAAa,GAAG;EACtB,EAAE,GAAG,EAAE,IAAI;EACX,EAAE,GAAG,EAAE,GAAG;EACV,EAAE,GAAG,EAAE,GAAG;EACV,EAAE,GAAG,EAAE,GAAG;EACV,EAAE,GAAG,EAAE,GAAG;EACV,CAAC,CAAC;EACkB,IAAI,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,GAAG,UAAU,EAAE,IAAI;;EC9B5F;EACA;EACA;EACA;EACA;EACA;;EACO,MAAMA,MAAM,GAAKC,KAAF,IAA6B;EAElD,EAAIA,IAAAA,KAAK,CAACC,MAAV,EAAkB;EACjB,IAAOD,OAAAA,KAAK,CAAC,CAAD,CAAZ,CAAA;EACA,GAAA;;EAED,EAAIA,IAAAA,KAAK,YAAYE,WAArB,EAAkC;EACjC,IAAA,OAAOF,KAAP,CAAA;EACA,GAAA;;EAED,EAAA,IAAIG,YAAY,CAACH,KAAD,CAAhB,EAAyB;EACxB,IAAA,IAAII,GAAG,GAAGC,QAAQ,CAACC,aAAT,CAAuB,UAAvB,CAAV,CAAA;EACAF,IAAAA,GAAG,CAACG,SAAJ,GAAgBP,KAAK,CAACQ,IAAN,EAAhB,CAFwB;;EAGxB,IAAA,OAAOJ,GAAG,CAACK,OAAJ,CAAYC,UAAnB,CAAA;EACA,GAAA;;EAED,EAAA,OAAOL,QAAQ,CAACM,aAAT,CAAuBX,KAAvB,CAAP,CAAA;EACA,CAjBM,CAAA;EAmBA,MAAMG,YAAY,GAAIS,GAAD,IAAsB;EACjD,EAAA,IAAI,OAAOA,GAAP,KAAe,QAAf,IAA2BA,GAAG,CAACC,OAAJ,CAAY,GAAZ,CAAmB,GAAA,CAAC,CAAnD,EAAsD;EACrD,IAAA,OAAO,IAAP,CAAA;EACA,GAAA;;EACD,EAAA,OAAO,KAAP,CAAA;EACA,CALM;;EC5BP;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EAMe,eAAA,EAAyBC,WAAzB,EAAgD;EAC9D,EAAMC,MAAAA,IAAI,GAAG,IAAb,CAAA;EAEA,EAAA,MAAMC,OAAO,GAAGC,MAAM,CAACC,MAAP,CAAc;EAC7BC,IAAAA,SAAS,EAAE,cADkB;EAE7BC,IAAAA,KAAK,EAAE,WAFsB;EAG7BC,IAAAA,IAAI,EAAGC,IAAD,IAAoB;EACzB,MAAQ,OAAA,CAAA,YAAA,EAAcA,IAAI,CAACH,SAAU,YAAWG,IAAI,CAACF,KAAM,CAA3D,gBAAA,CAAA,CAAA;EACA,KAAA;EAL4B,GAAd,EAMbN,WANa,CAAhB,CAAA;EAQAC,EAAAA,IAAI,CAACQ,EAAL,CAAQ,YAAR,EAAqB,MAAI;EACxB,IAAIC,IAAAA,MAAM,GAAGzB,MAAM,CAACiB,OAAO,CAACK,IAAR,CAAaL,OAAb,CAAD,CAAnB,CAAA;EACAQ,IAAAA,MAAM,CAACC,gBAAP,CAAwB,OAAxB,EAAiCC,GAAD,IAAO;EAEtC,MAAIX,IAAAA,IAAI,CAACY,UAAT,EAAqB;EACpB,QAAA,OAAA;EACA,OAAA;;EAEDZ,MAAAA,IAAI,CAACa,KAAL,EAAA,CAAA;;EAEA,MAAA,IAAIb,IAAI,CAACc,QAAL,CAAcC,IAAd,KAAuB,QAAvB,IAAmCf,IAAI,CAACc,QAAL,CAAcE,gBAArD,EAAuE;EACtEhB,QAAAA,IAAI,CAACiB,OAAL,CAAa,EAAb,CAAA,CAAA;EACA,OAAA;;EAEDN,MAAAA,GAAG,CAACO,cAAJ,EAAA,CAAA;EACAP,MAAAA,GAAG,CAACQ,eAAJ,EAAA,CAAA;EACA,KAdD,CAAA,CAAA;EAeAnB,IAAAA,IAAI,CAACoB,OAAL,CAAaC,WAAb,CAAyBZ,MAAzB,CAAA,CAAA;EACA,GAlBD,CAAA,CAAA;EAoBA;;;;;;;;"}
1	+ {"version":3,"file":"clear_button.js","sources":["../../../node_modules/@orchidjs/unicode-variants/dist/esm/index.js","../../../src/vanilla.ts","../../../src/plugins/clear_button/plugin.ts"],"sourcesContent":["/! @orchidjs/unicode-variants \| https://github.com/orchidjs/unicode-variants \| Apache License (v2) /\nimport { toArray, setToPattern, escape_regex, arrayToPattern, sequencePattern } from './regex.js';\nexport { escape_regex } from './regex.js';\nimport { allSubstrings } from './strings.js';\n\n/*\n @typedef {{[key:string]:string}} TUnicodeMap\n * @typedef {{[key:string]:Set<string>}} TUnicodeSets\n * @typedef {[[number,number]]} TCodePoints\n * @typedef {{folded:string,composed:string,code_point:number}} TCodePointObj\n * @typedef {{start:number,end:number,length:number,substr:string}} TSequencePart\n /\n/* @type {TCodePoints} /\n\nconst code_points = [[0, 65535]];\nconst accent_pat = '[\\u0300-\\u036F\\u{b7}\\u{2be}\\u{2bc}]';\n/* @type {TUnicodeMap} /\n\nlet unicode_map;\n/* @type {RegExp} /\n\nlet multi_char_reg;\nconst max_char_length = 3;\n/* @type {TUnicodeMap} /\n\nconst latin_convert = {};\n/* @type {TUnicodeMap} /\n\nconst latin_condensed = {\n '/': '⁄∕',\n '0': '߀',\n \"a\": \"ⱥɐɑ\",\n \"aa\": \"ꜳ\",\n \"ae\": \"æǽǣ\",\n \"ao\": \"ꜵ\",\n \"au\": \"ꜷ\",\n \"av\": \"ꜹꜻ\",\n \"ay\": \"ꜽ\",\n \"b\": \"ƀɓƃ\",\n \"c\": \"ꜿƈȼↄ\",\n \"d\": \"đɗɖᴅƌꮷԁɦ\",\n \"e\": \"ɛǝᴇɇ\",\n \"f\": \"ꝼƒ\",\n \"g\": \"ǥɠꞡᵹꝿɢ\",\n \"h\": \"ħⱨⱶɥ\",\n \"i\": \"ɨı\",\n \"j\": \"ɉȷ\",\n \"k\": \"ƙⱪꝁꝃꝅꞣ\",\n \"l\": \"łƚɫⱡꝉꝇꞁɭ\",\n \"m\": \"ɱɯϻ\",\n \"n\": \"ꞥƞɲꞑᴎлԉ\",\n \"o\": \"øǿɔɵꝋꝍᴑ\",\n \"oe\": \"œ\",\n \"oi\": \"ƣ\",\n \"oo\": \"ꝏ\",\n \"ou\": \"ȣ\",\n \"p\": \"ƥᵽꝑꝓꝕρ\",\n \"q\": \"ꝗꝙɋ\",\n \"r\": \"ɍɽꝛꞧꞃ\",\n \"s\": \"ßȿꞩꞅʂ\",\n \"t\": \"ŧƭʈⱦꞇ\",\n \"th\": \"þ\",\n \"tz\": \"ꜩ\",\n \"u\": \"ʉ\",\n \"v\": \"ʋꝟʌ\",\n \"vy\": \"ꝡ\",\n \"w\": \"ⱳ\",\n \"y\": \"ƴɏỿ\",\n \"z\": \"ƶȥɀⱬꝣ\",\n \"hv\": \"ƕ\"\n};\n\nfor (let latin in latin_condensed) {\n let unicode = latin_condensed[latin] \|\| '';\n\n for (let i = 0; i < unicode.length; i++) {\n let char = unicode.substring(i, i + 1);\n latin_convert[char] = latin;\n }\n}\n\nconst convert_pat = new RegExp(Object.keys(latin_convert).join('\|') + '\|' + accent_pat, 'gu');\n/\n Initialize the unicode_map from the give code point ranges\n \n @param {TCodePoints=} _code_points\n /\n\nconst initialize = _code_points => {\n if (unicode_map !== undefined) return;\n unicode_map = generateMap(_code_points \|\| code_points);\n};\n/\n Helper method for normalize a string\n * https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/normalize\n * @param {string} str\n * @param {string} form\n /\n\nconst normalize = (str, form = 'NFKD') => str.normalize(form);\n/\n Remove accents without reordering string\n * calling str.normalize('NFKD') on \\u{594}\\u{595}\\u{596} becomes \\u{596}\\u{594}\\u{595}\n * via https://github.com/krisk/Fuse/issues/133#issuecomment-318692703\n * @param {string} str\n * @return {string}\n /\n\nconst asciifold = str => {\n return toArray(str).reduce(\n /\n @param {string} result\n * @param {string} char\n /\n (result, char) => {\n return result + _asciifold(char);\n }, '');\n};\n/\n @param {string} str\n * @return {string}\n /\n\nconst _asciifold = str => {\n str = normalize(str).toLowerCase().replace(convert_pat, (\n /* @type {string} /\n char) => {\n return latin_convert[char] \|\| '';\n }); //return str;\n\n return normalize(str, 'NFC');\n};\n/\n Generate a list of unicode variants from the list of code points\n * @param {TCodePoints} code_points\n * @yield {TCodePointObj}\n /\n\nfunction generator(code_points) {\n for (const [code_point_min, code_point_max] of code_points) {\n for (let i = code_point_min; i <= code_point_max; i++) {\n let composed = String.fromCharCode(i);\n let folded = asciifold(composed);\n\n if (folded == composed.toLowerCase()) {\n continue;\n } // skip when folded is a string longer than 3 characters long\n // bc the resulting regex patterns will be long\n // eg:\n // folded صلى الله عليه وسلم length 18 code point 65018\n // folded جل جلاله length 8 code point 65019\n\n\n if (folded.length > max_char_length) {\n continue;\n }\n\n if (folded.length == 0) {\n continue;\n }\n\n yield {\n folded: folded,\n composed: composed,\n code_point: i\n };\n }\n }\n}\n/*\n Generate a unicode map from the list of code points\n * @param {TCodePoints} code_points\n * @return {TUnicodeSets}\n /\n\nconst generateSets = code_points => {\n /* @type {{[key:string]:Set<string>}} /\n const unicode_sets = {};\n /\n @param {string} folded\n * @param {string} to_add\n /\n\n const addMatching = (folded, to_add) => {\n /* @type {Set<string>} /\n const folded_set = unicode_sets[folded] \|\| new Set();\n const patt = new RegExp('^' + setToPattern(folded_set) + '$', 'iu');\n\n if (to_add.match(patt)) {\n return;\n }\n\n folded_set.add(escape_regex(to_add));\n unicode_sets[folded] = folded_set;\n };\n\n for (let value of generator(code_points)) {\n addMatching(value.folded, value.folded);\n addMatching(value.folded, value.composed);\n }\n\n return unicode_sets;\n};\n/\n Generate a unicode map from the list of code points\n * ae => (?:(?:ae\|Æ\|Ǽ\|Ǣ)\|(?:A\|Ⓐ\|Ａ...)(?:E\|ɛ\|Ⓔ...))\n \n @param {TCodePoints} code_points\n * @return {TUnicodeMap}\n /\n\nconst generateMap = code_points => {\n /* @type {TUnicodeSets} /\n const unicode_sets = generateSets(code_points);\n /* @type {TUnicodeMap} /\n\n const unicode_map = {};\n /* @type {string[]} /\n\n let multi_char = [];\n\n for (let folded in unicode_sets) {\n let set = unicode_sets[folded];\n\n if (set) {\n unicode_map[folded] = setToPattern(set);\n }\n\n if (folded.length > 1) {\n multi_char.push(escape_regex(folded));\n }\n }\n\n multi_char.sort((a, b) => b.length - a.length);\n const multi_char_patt = arrayToPattern(multi_char);\n multi_char_reg = new RegExp('^' + multi_char_patt, 'u');\n return unicode_map;\n};\n/\n Map each element of an array from it's folded value to all possible unicode matches\n * @param {string[]} strings\n * @param {number} min_replacement\n * @return {string}\n /\n\nconst mapSequence = (strings, min_replacement = 1) => {\n let chars_replaced = 0;\n strings = strings.map(str => {\n if (unicode_map[str]) {\n chars_replaced += str.length;\n }\n\n return unicode_map[str] \|\| str;\n });\n\n if (chars_replaced >= min_replacement) {\n return sequencePattern(strings);\n }\n\n return '';\n};\n/\n Convert a short string and split it into all possible patterns\n * Keep a pattern only if min_replacement is met\n \n 'abc'\n * \t\t=> [['abc'],['ab','c'],['a','bc'],['a','b','c']]\n \t\t=> ['abc-pattern','ab-c-pattern'...]\n \n \n @param {string} str\n * @param {number} min_replacement\n * @return {string}\n /\n\nconst substringsToPattern = (str, min_replacement = 1) => {\n min_replacement = Math.max(min_replacement, str.length - 1);\n return arrayToPattern(allSubstrings(str).map(sub_pat => {\n return mapSequence(sub_pat, min_replacement);\n }));\n};\n/\n Convert an array of sequences into a pattern\n * [{start:0,end:3,length:3,substr:'iii'}...] => (?:iii...)\n \n @param {Sequence[]} sequences\n * @param {boolean} all\n /\n\nconst sequencesToPattern = (sequences, all = true) => {\n let min_replacement = sequences.length > 1 ? 1 : 0;\n return arrayToPattern(sequences.map(sequence => {\n let seq = [];\n const len = all ? sequence.length() : sequence.length() - 1;\n\n for (let j = 0; j < len; j++) {\n seq.push(substringsToPattern(sequence.substrs[j] \|\| '', min_replacement));\n }\n\n return sequencePattern(seq);\n }));\n};\n/\n Return true if the sequence is already in the sequences\n * @param {Sequence} needle_seq\n * @param {Sequence[]} sequences\n /\n\n\nconst inSequences = (needle_seq, sequences) => {\n for (const seq of sequences) {\n if (seq.start != needle_seq.start \|\| seq.end != needle_seq.end) {\n continue;\n }\n\n if (seq.substrs.join('') !== needle_seq.substrs.join('')) {\n continue;\n }\n\n let needle_parts = needle_seq.parts;\n /\n @param {TSequencePart} part\n /\n\n const filter = part => {\n for (const needle_part of needle_parts) {\n if (needle_part.start === part.start && needle_part.substr === part.substr) {\n return false;\n }\n\n if (part.length == 1 \|\| needle_part.length == 1) {\n continue;\n } // check for overlapping parts\n // a = ['::=','==']\n // b = ['::','===']\n // a = ['r','sm']\n // b = ['rs','m']\n\n\n if (part.start < needle_part.start && part.end > needle_part.start) {\n return true;\n }\n\n if (needle_part.start < part.start && needle_part.end > part.start) {\n return true;\n }\n }\n\n return false;\n };\n\n let filtered = seq.parts.filter(filter);\n\n if (filtered.length > 0) {\n continue;\n }\n\n return true;\n }\n\n return false;\n};\n\nclass Sequence {\n constructor() {\n /* @type {TSequencePart[]} /\n this.parts = [];\n /* @type {string[]} /\n\n this.substrs = [];\n this.start = 0;\n this.end = 0;\n }\n /\n @param {TSequencePart\|undefined} part\n /\n\n\n add(part) {\n if (part) {\n this.parts.push(part);\n this.substrs.push(part.substr);\n this.start = Math.min(part.start, this.start);\n this.end = Math.max(part.end, this.end);\n }\n }\n\n last() {\n return this.parts[this.parts.length - 1];\n }\n\n length() {\n return this.parts.length;\n }\n /\n @param {number} position\n * @param {TSequencePart} last_piece\n /\n\n\n clone(position, last_piece) {\n let clone = new Sequence();\n let parts = JSON.parse(JSON.stringify(this.parts));\n let last_part = parts.pop();\n\n for (const part of parts) {\n clone.add(part);\n }\n\n let last_substr = last_piece.substr.substring(0, position - last_part.start);\n let clone_last_len = last_substr.length;\n clone.add({\n start: last_part.start,\n end: last_part.start + clone_last_len,\n length: clone_last_len,\n substr: last_substr\n });\n return clone;\n }\n\n}\n/\n Expand a regular expression pattern to include unicode variants\n * \teg /a/ becomes /aⓐａẚàáâầấẫẩãāăằắẵẳȧǡäǟảåǻǎȁȃạậặḁąⱥɐɑAⒶＡÀÁÂẦẤẪẨÃĀĂẰẮẴẲȦǠÄǞẢÅǺǍȀȂẠẬẶḀĄȺⱯ/\n \n Issue:\n * ﺊﺋ [ 'ﺊ = \\\\u{fe8a}', 'ﺋ = \\\\u{fe8b}' ]\n \tbecomes:\tئئ [ 'ي = \\\\u{64a}', 'ٔ = \\\\u{654}', 'ي = \\\\u{64a}', 'ٔ = \\\\u{654}' ]\n \n \tİĲ = IIJ = ⅡJ\n \n * \t1/2/4\n \n @param {string} str\n * @return {string\|undefined}\n /\n\n\nconst getPattern = str => {\n initialize();\n str = asciifold(str);\n let pattern = '';\n let sequences = [new Sequence()];\n\n for (let i = 0; i < str.length; i++) {\n let substr = str.substring(i);\n let match = substr.match(multi_char_reg);\n const char = str.substring(i, i + 1);\n const match_str = match ? match[0] : null; // loop through sequences\n // add either the char or multi_match\n\n let overlapping = [];\n let added_types = new Set();\n\n for (const sequence of sequences) {\n const last_piece = sequence.last();\n\n if (!last_piece \|\| last_piece.length == 1 \|\| last_piece.end <= i) {\n // if we have a multi match\n if (match_str) {\n const len = match_str.length;\n sequence.add({\n start: i,\n end: i + len,\n length: len,\n substr: match_str\n });\n added_types.add('1');\n } else {\n sequence.add({\n start: i,\n end: i + 1,\n length: 1,\n substr: char\n });\n added_types.add('2');\n }\n } else if (match_str) {\n let clone = sequence.clone(i, last_piece);\n const len = match_str.length;\n clone.add({\n start: i,\n end: i + len,\n length: len,\n substr: match_str\n });\n overlapping.push(clone);\n } else {\n // don't add char\n // adding would create invalid patterns: 234 => [2,34,4]\n added_types.add('3');\n }\n } // if we have overlapping\n\n\n if (overlapping.length > 0) {\n // ['ii','iii'] before ['i','i','iii']\n overlapping = overlapping.sort((a, b) => {\n return a.length() - b.length();\n });\n\n for (let clone of overlapping) {\n // don't add if we already have an equivalent sequence\n if (inSequences(clone, sequences)) {\n continue;\n }\n\n sequences.push(clone);\n }\n\n continue;\n } // if we haven't done anything unique\n // clean up the patterns\n // helps keep patterns smaller\n // if str = 'r₨㎧aarss', pattern will be 446 instead of 655\n\n\n if (i > 0 && added_types.size == 1 && !added_types.has('3')) {\n pattern += sequencesToPattern(sequences, false);\n let new_seq = new Sequence();\n const old_seq = sequences[0];\n\n if (old_seq) {\n new_seq.add(old_seq.last());\n }\n\n sequences = [new_seq];\n }\n }\n\n pattern += sequencesToPattern(sequences, true);\n return pattern;\n};\n\nexport { _asciifold, asciifold, code_points, generateMap, generateSets, generator, getPattern, initialize, mapSequence, normalize, substringsToPattern, unicode_map };\n//# sourceMappingURL=index.js.map\n","\nimport { iterate } from '@orchidjs/sifter/lib/utils';\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 /\nexport const getDom = ( query:any ):HTMLElement => {\n\n\tif( query.jquery ){\n\t\treturn query[0];\n\t}\n\n\tif( query instanceof HTMLElement ){\n\t\treturn query;\n\t}\n\n\tif( isHtmlString(query) ){\n\t\tvar tpl = document.createElement('template');\n\t\ttpl.innerHTML = query.trim(); // Never return a text node of whitespace as the result\n\t\treturn tpl.content.firstChild as HTMLElement;\n\t}\n\n\treturn document.querySelector(query);\n};\n\nexport const isHtmlString = (arg:any): boolean => {\n\tif( typeof arg === 'string' && arg.indexOf('<') > -1 ){\n\t\treturn true;\n\t}\n\treturn false;\n}\n\nexport const escapeQuery = (query:string):string => {\n\treturn query.replace(/['\"\\\\]/g, '\\\\$&');\n}\n\n/\n Dispatch an event\n \n /\nexport const triggerEvent = ( dom_el:HTMLElement, event_name:string ):void => {\n\tvar event = document.createEvent('HTMLEvents');\n\tevent.initEvent(event_name, true, false);\n\tdom_el.dispatchEvent(event)\n};\n\n/*\n Apply CSS rules to a dom element\n \n /\nexport const applyCSS = ( dom_el:HTMLElement, css:{ [key: string]: string\|number }):void => {\n\tObject.assign(dom_el.style, css);\n}\n\n\n/*\n Add css classes\n \n /\nexport const addClasses = ( elmts:HTMLElement\|HTMLElement[], ...classes:string[]\|string[][] ) => {\n\n\tvar norm_classes \t= classesArray(classes);\n\telmts\t\t\t\t= castAsArray(elmts);\n\n\telmts.map( el => {\n\t\tnorm_classes.map( cls => {\n\t\t\tel.classList.add( cls );\n\t\t});\n\t});\n}\n\n/*\n Remove css classes\n \n /\n export const removeClasses = ( elmts:HTMLElement\|HTMLElement[], ...classes:string[]\|string[][] ) => {\n\n \tvar norm_classes \t= classesArray(classes);\n\telmts\t\t\t\t= castAsArray(elmts);\n\n\telmts.map( el => {\n\t\tnorm_classes.map(cls => {\n\t \t\tel.classList.remove( cls );\n\t\t});\n \t});\n }\n\n\n/*\n Return arguments\n \n /\nexport const classesArray = (args:string[]\|string[][]):string[] => {\n\tvar classes:string[] = [];\n\titerate( args, (_classes) =>{\n\t\tif( typeof _classes === 'string' ){\n\t\t\t_classes = _classes.trim().split(/[\\11\\12\\14\\15\\40]/);\n\t\t}\n\t\tif( Array.isArray(_classes) ){\n\t\t\tclasses = classes.concat(_classes);\n\t\t}\n\t});\n\n\treturn classes.filter(Boolean);\n}\n\n\n/*\n Create an array from arg if it's not already an array\n \n /\nexport const castAsArray = (arg:any):Array<any> => {\n\tif( !Array.isArray(arg) ){\n \t\targ = [arg];\n \t}\n\treturn arg;\n}\n\n\n/*\n Get the closest node to the evt.target matching the selector\n * Stops at wrapper\n \n /\nexport const parentMatch = ( target:null\|HTMLElement, selector:string, wrapper?:HTMLElement ):HTMLElement\|void => {\n\n\tif( wrapper && !wrapper.contains(target) ){\n\t\treturn;\n\t}\n\n\twhile( target && target.matches ){\n\n\t\tif( target.matches(selector) ){\n\t\t\treturn target;\n\t\t}\n\n\t\ttarget = target.parentNode as HTMLElement;\n\t}\n}\n\n\n/*\n Get the first or last item from an array\n \n > 0 - right (last)\n * <= 0 - left (first)\n \n /\nexport const getTail = ( list:Array<any>\|NodeList, direction:number=0 ):any => {\n\n\tif( direction > 0 ){\n\t\treturn list[list.length-1];\n\t}\n\n\treturn list[0];\n}\n\n/*\n Return true if an object is empty\n \n /\nexport const isEmptyObject = (obj:object):boolean => {\n\treturn (Object.keys(obj).length === 0);\n}\n\n\n/*\n Get the index of an element amongst sibling nodes of the same type\n \n /\nexport const nodeIndex = ( el:null\|Element, amongst?:string ):number => {\n\tif (!el) return -1;\n\n\tamongst = amongst \|\| el.nodeName;\n\n\tvar i = 0;\n\twhile( el = el.previousElementSibling ){\n\n\t\tif( el.matches(amongst) ){\n\t\t\ti++;\n\t\t}\n\t}\n\treturn i;\n}\n\n\n/*\n Set attributes of an element\n \n /\nexport const setAttr = (el:Element,attrs:{ [key: string]: null\|string\|number }) => {\n\titerate( attrs,(val,attr) => {\n\t\tif( val == null ){\n\t\t\tel.removeAttribute(attr as string);\n\t\t}else{\n\t\t\tel.setAttribute(attr as string, ''+val);\n\t\t}\n\t});\n}\n\n\n/*\n Replace a node\n /\nexport const replaceNode = ( existing:Node, replacement:Node ) => {\n\tif( existing.parentNode ) existing.parentNode.replaceChild(replacement, existing);\n}\n","/\n Plugin: \"dropdown_header\" (Tom Select)\n * Copyright (c) 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 /\n\nimport TomSelect from '../../tom-select';\nimport { getDom } from '../../vanilla';\nimport { CBOptions } from './types';\n\nexport default function(this:TomSelect, userOptions:CBOptions) {\n\tconst self = this;\n\n\tconst options = Object.assign({\n\t\tclassName: 'clear-button',\n\t\ttitle: 'Clear All',\n\t\thtml: (data:CBOptions) => {\n\t\t\treturn `<div class=\"${data.className}\" title=\"${data.title}\">⨯</div>`;\n\t\t}\n\t}, userOptions);\n\n\tself.on('initialize',()=>{\n\t\tvar button = getDom(options.html(options));\n\t\tbutton.addEventListener('click',(evt)=>{\n\n\t\t\tif( self.isLocked ) return;\n\n\t\t\tself.clear();\n\n\t\t\tif( self.settings.mode === 'single' && self.settings.allowEmptyOption ){\n\t\t\t\tself.addItem('');\n\t\t\t}\n\n\t\t\tevt.preventDefault();\n\t\t\tevt.stopPropagation();\n\t\t});\n\t\tself.control.appendChild(button);\n\t});\n\n};\n"],"names":["getDom","query","jquery","HTMLElement","isHtmlString","tpl","document","createElement","innerHTML","trim","content","firstChild","querySelector","arg","indexOf","userOptions","self","options","Object","assign","className","title","html","data","on","button","addEventListener","evt","isLocked","clear","settings","mode","allowEmptyOption","addItem","preventDefault","stopPropagation","control","appendChild"],"mappings":";;;;;;;;;;;EAAA;EAeA,MAAM,UAAU,GAAG,qCAAqC,CAAC;EAQzD;AACA;EACA,MAAM,aAAa,GAAG,EAAE,CAAC;EACzB;AACA;EACA,MAAM,eAAe,GAAG;EACxB,EAAE,GAAG,EAAE,IAAI;EACX,EAAE,GAAG,EAAE,GAAG;EACV,EAAE,GAAG,EAAE,KAAK;EACZ,EAAE,IAAI,EAAE,GAAG;EACX,EAAE,IAAI,EAAE,KAAK;EACb,EAAE,IAAI,EAAE,GAAG;EACX,EAAE,IAAI,EAAE,GAAG;EACX,EAAE,IAAI,EAAE,IAAI;EACZ,EAAE,IAAI,EAAE,GAAG;EACX,EAAE,GAAG,EAAE,KAAK;EACZ,EAAE,GAAG,EAAE,MAAM;EACb,EAAE,GAAG,EAAE,UAAU;EACjB,EAAE,GAAG,EAAE,MAAM;EACb,EAAE,GAAG,EAAE,IAAI;EACX,EAAE,GAAG,EAAE,QAAQ;EACf,EAAE,GAAG,EAAE,MAAM;EACb,EAAE,GAAG,EAAE,IAAI;EACX,EAAE,GAAG,EAAE,IAAI;EACX,EAAE,GAAG,EAAE,QAAQ;EACf,EAAE,GAAG,EAAE,UAAU;EACjB,EAAE,GAAG,EAAE,KAAK;EACZ,EAAE,GAAG,EAAE,SAAS;EAChB,EAAE,GAAG,EAAE,SAAS;EAChB,EAAE,IAAI,EAAE,GAAG;EACX,EAAE,IAAI,EAAE,GAAG;EACX,EAAE,IAAI,EAAE,GAAG;EACX,EAAE,IAAI,EAAE,GAAG;EACX,EAAE,GAAG,EAAE,QAAQ;EACf,EAAE,GAAG,EAAE,KAAK;EACZ,EAAE,GAAG,EAAE,OAAO;EACd,EAAE,GAAG,EAAE,OAAO;EACd,EAAE,GAAG,EAAE,OAAO;EACd,EAAE,IAAI,EAAE,GAAG;EACX,EAAE,IAAI,EAAE,GAAG;EACX,EAAE,GAAG,EAAE,GAAG;EACV,EAAE,GAAG,EAAE,KAAK;EACZ,EAAE,IAAI,EAAE,GAAG;EACX,EAAE,GAAG,EAAE,GAAG;EACV,EAAE,GAAG,EAAE,KAAK;EACZ,EAAE,GAAG,EAAE,OAAO;EACd,EAAE,IAAI,EAAE,GAAG;EACX,CAAC,CAAC;AACF;EACA,KAAK,IAAI,KAAK,IAAI,eAAe,EAAE;EACnC,EAAE,IAAI,OAAO,GAAG,eAAe,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC;AAC7C;EACA,EAAE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;EAC3C,IAAI,IAAI,IAAI,GAAG,OAAO,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;EAC3C,IAAI,aAAa,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC;EAChC,GAAG;EACH,CAAC;AACD;EACoB,IAAI,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,GAAG,UAAU,EAAE,IAAI;;EC9E5F;EACA;EACA;EACA;EACA;EACA;EACO,MAAMA,MAAM,GAAKC,KAAS,IAAkB;IAElD,IAAIA,KAAK,CAACC,MAAM,EAAE;MACjB,OAAOD,KAAK,CAAC,CAAC,CAAC,CAAA;EAChB,GAAA;IAEA,IAAIA,KAAK,YAAYE,WAAW,EAAE;EACjC,IAAA,OAAOF,KAAK,CAAA;EACb,GAAA;EAEA,EAAA,IAAIG,YAAY,CAACH,KAAK,CAAC,EAAE;EACxB,IAAA,IAAII,GAAG,GAAGC,QAAQ,CAACC,aAAa,CAAC,UAAU,CAAC,CAAA;MAC5CF,GAAG,CAACG,SAAS,GAAGP,KAAK,CAACQ,IAAI,EAAE,CAAC;EAC7B,IAAA,OAAOJ,GAAG,CAACK,OAAO,CAACC,UAAU,CAAA;EAC9B,GAAA;EAEA,EAAA,OAAOL,QAAQ,CAACM,aAAa,CAACX,KAAK,CAAC,CAAA;EACrC,CAAC,CAAA;EAEM,MAAMG,YAAY,GAAIS,GAAO,IAAc;EACjD,EAAA,IAAI,OAAOA,GAAG,KAAK,QAAQ,IAAIA,GAAG,CAACC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE;EACrD,IAAA,OAAO,IAAI,CAAA;EACZ,GAAA;EACA,EAAA,OAAO,KAAK,CAAA;EACb,CAAC;;ECjCD;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;;EAMe,eAAA,EAAyBC,WAAqB,EAAE;IAC9D,MAAMC,IAAI,GAAG,IAAI,CAAA;EAEjB,EAAA,MAAMC,OAAO,GAAGC,MAAM,CAACC,MAAM,CAAC;EAC7BC,IAAAA,SAAS,EAAE,cAAc;EACzBC,IAAAA,KAAK,EAAE,WAAW;MAClBC,IAAI,EAAGC,IAAc,IAAK;QACzB,OAAQ,CAAA,YAAA,EAAcA,IAAI,CAACH,SAAU,YAAWG,IAAI,CAACF,KAAM,CAAiB,gBAAA,CAAA,CAAA;EAC7E,KAAA;KACA,EAAEN,WAAW,CAAC,CAAA;EAEfC,EAAAA,IAAI,CAACQ,EAAE,CAAC,YAAY,EAAC,MAAI;MACxB,IAAIC,MAAM,GAAGzB,MAAM,CAACiB,OAAO,CAACK,IAAI,CAACL,OAAO,CAAC,CAAC,CAAA;EAC1CQ,IAAAA,MAAM,CAACC,gBAAgB,CAAC,OAAO,EAAEC,GAAG,IAAG;QAEtC,IAAIX,IAAI,CAACY,QAAQ,EAAG,OAAA;QAEpBZ,IAAI,CAACa,KAAK,EAAE,CAAA;EAEZ,MAAA,IAAIb,IAAI,CAACc,QAAQ,CAACC,IAAI,KAAK,QAAQ,IAAIf,IAAI,CAACc,QAAQ,CAACE,gBAAgB,EAAE;EACtEhB,QAAAA,IAAI,CAACiB,OAAO,CAAC,EAAE,CAAC,CAAA;EACjB,OAAA;QAEAN,GAAG,CAACO,cAAc,EAAE,CAAA;QACpBP,GAAG,CAACQ,eAAe,EAAE,CAAA;EACtB,KAAC,CAAC,CAAA;EACFnB,IAAAA,IAAI,CAACoB,OAAO,CAACC,WAAW,CAACZ,MAAM,CAAC,CAAA;EACjC,GAAC,CAAC,CAAA;EAEH;;;;;;;;","x_google_ignoreList":[0]}

data/vendor/assets/javascripts/tom-select-rails/js/plugins/drag_drop.js CHANGED Viewed

@@ -1,5 +1,5 @@
 /**
-* Tom Select v2.2.1
+* Tom Select v2.3.1
 * Licensed under the Apache License, Version 2.0 (the "License");
 */
@@ -9,6 +9,167 @@
 	(global = typeof globalThis !== 'undefined' ? globalThis : global || self, global.drag_drop = factory());
 })(this, (function () { 'use strict';
+	/**
+	 * Converts a scalar to its best string representation
+	 * for hash keys and HTML attribute values.
+	 *
+	 * Transformations:
+	 *   'str'     -> 'str'
+	 *   null      -> ''
+	 *   undefined -> ''
+	 *   true      -> '1'
+	 *   false     -> '0'
+	 *   0         -> '0'
+	 *   1         -> '1'
+	 *
+	 */
+	/**
+	 * Prevent default
+	 *
+	 */
+	const preventDefault = (evt, stop = false) => {
+	  if (evt) {
+	    evt.preventDefault();
+	    if (stop) {
+	      evt.stopPropagation();
+	    }
+	  }
+	};
+	/**
+	 * Add event helper
+	 *
+	 */
+	const addEvent = (target, type, callback, options) => {
+	  target.addEventListener(type, callback, options);
+	};
+	/*! @orchidjs/unicode-variants | https://github.com/orchidjs/unicode-variants | Apache License (v2) */
+	const accent_pat = '[\u0300-\u036F\u{b7}\u{2be}\u{2bc}]';
+	/** @type {TUnicodeMap} */
+	const latin_convert = {};
+	/** @type {TUnicodeMap} */
+	const latin_condensed = {
+	  '/': '⁄∕',
+	  '0': '߀',
+	  "a": "ⱥɐɑ",
+	  "aa": "ꜳ",
+	  "ae": "æǽǣ",
+	  "ao": "ꜵ",
+	  "au": "ꜷ",
+	  "av": "ꜹꜻ",
+	  "ay": "ꜽ",
+	  "b": "ƀɓƃ",
+	  "c": "ꜿƈȼↄ",
+	  "d": "đɗɖᴅƌꮷԁɦ",
+	  "e": "ɛǝᴇɇ",
+	  "f": "ꝼƒ",
+	  "g": "ǥɠꞡᵹꝿɢ",
+	  "h": "ħⱨⱶɥ",
+	  "i": "ɨı",
+	  "j": "ɉȷ",
+	  "k": "ƙⱪꝁꝃꝅꞣ",
+	  "l": "łƚɫⱡꝉꝇꞁɭ",
+	  "m": "ɱɯϻ",
+	  "n": "ꞥƞɲꞑᴎлԉ",
+	  "o": "øǿɔɵꝋꝍᴑ",
+	  "oe": "œ",
+	  "oi": "ƣ",
+	  "oo": "ꝏ",
+	  "ou": "ȣ",
+	  "p": "ƥᵽꝑꝓꝕρ",
+	  "q": "ꝗꝙɋ",
+	  "r": "ɍɽꝛꞧꞃ",
+	  "s": "ßȿꞩꞅʂ",
+	  "t": "ŧƭʈⱦꞇ",
+	  "th": "þ",
+	  "tz": "ꜩ",
+	  "u": "ʉ",
+	  "v": "ʋꝟʌ",
+	  "vy": "ꝡ",
+	  "w": "ⱳ",
+	  "y": "ƴɏỿ",
+	  "z": "ƶȥɀⱬꝣ",
+	  "hv": "ƕ"
+	};
+	for (let latin in latin_condensed) {
+	  let unicode = latin_condensed[latin] || '';
+	  for (let i = 0; i < unicode.length; i++) {
+	    let char = unicode.substring(i, i + 1);
+	    latin_convert[char] = latin;
+	  }
+	}
+	new RegExp(Object.keys(latin_convert).join('|') + '|' + accent_pat, 'gu');
+	/**
+	 * Iterates over arrays and hashes.
+	 *
+	 * ```
+	 * iterate(this.items, function(item, id) {
+	 *    // invoked for each item
+	 * });
+	 * ```
+	 *
+	 */
+	const iterate = (object, callback) => {
+	  if (Array.isArray(object)) {
+	    object.forEach(callback);
+	  } else {
+	    for (var key in object) {
+	      if (object.hasOwnProperty(key)) {
+	        callback(object[key], key);
+	      }
+	    }
+	  }
+	};
+	/**
+	 * Return a dom element from either a dom query string, jQuery object, a dom element or html string
+	 * https://stackoverflow.com/questions/494143/creating-a-new-dom-element-from-an-html-string-using-built-in-dom-methods-or-pro/35385518#35385518
+	 *
+	 * param query should be {}
+	 */
+	const getDom = query => {
+	  if (query.jquery) {
+	    return query[0];
+	  }
+	  if (query instanceof HTMLElement) {
+	    return query;
+	  }
+	  if (isHtmlString(query)) {
+	    var tpl = document.createElement('template');
+	    tpl.innerHTML = query.trim(); // Never return a text node of whitespace as the result
+	    return tpl.content.firstChild;
+	  }
+	  return document.querySelector(query);
+	};
+	const isHtmlString = arg => {
+	  if (typeof arg === 'string' && arg.indexOf('<') > -1) {
+	    return true;
+	  }
+	  return false;
+	};
+	/**
+	 * Set attributes of an element
+	 *
+	 */
+	const setAttr = (el, attrs) => {
+	  iterate(attrs, (val, attr) => {
+	    if (val == null) {
+	      el.removeAttribute(attr);
+	    } else {
+	      el.setAttribute(attr, '' + val);
+	    }
+	  });
+	};
 	/**
 	 * Plugin: "drag_drop" (Tom Select)
 	 * Copyright (c) contributors
@@ -23,45 +184,104 @@
 	 * governing permissions and limitations under the License.
 	 *
 	 */
+	const insertAfter = (referenceNode, newNode) => {
+	  var _referenceNode$parent;
+	  (_referenceNode$parent = referenceNode.parentNode) == null || _referenceNode$parent.insertBefore(newNode, referenceNode.nextSibling);
+	};
+	const insertBefore = (referenceNode, newNode) => {
+	  var _referenceNode$parent2;
+	  (_referenceNode$parent2 = referenceNode.parentNode) == null || _referenceNode$parent2.insertBefore(newNode, referenceNode);
+	};
+	const isBefore = (referenceNode, newNode) => {
+	  do {
+	    var _newNode;
+	    newNode = (_newNode = newNode) == null ? void 0 : _newNode.previousElementSibling;
+	    if (referenceNode == newNode) {
+	      return true;
+	    }
+	  } while (newNode && newNode.previousElementSibling);
+	  return false;
+	};
 	function plugin () {
 	  var self = this;
-	  if (!$.fn.sortable) throw new Error('The "drag_drop" plugin requires jQuery UI "sortable".');
 	  if (self.settings.mode !== 'multi') return;
 	  var orig_lock = self.lock;
 	  var orig_unlock = self.unlock;
+	  let sortable = true;
+	  let drag_item;
+	  /**
+	   * Add draggable attribute to item
+	   */
+	  self.hook('after', 'setupTemplates', () => {
+	    var orig_render_item = self.settings.render.item;
+	    self.settings.render.item = (data, escape) => {
+	      const item = getDom(orig_render_item.call(self, data, escape));
+	      setAttr(item, {
+	        'draggable': 'true'
+	      });
+	      // prevent doc_mousedown (see tom-select.ts)
+	      const mousedown = evt => {
+	        if (!sortable) preventDefault(evt);
+	        evt.stopPropagation();
+	      };
+	      const dragStart = evt => {
+	        drag_item = item;
+	        setTimeout(() => {
+	          item.classList.add('ts-dragging');
+	        }, 0);
+	      };
+	      const dragOver = evt => {
+	        evt.preventDefault();
+	        item.classList.add('ts-drag-over');
+	        moveitem(item, drag_item);
+	      };
+	      const dragLeave = () => {
+	        item.classList.remove('ts-drag-over');
+	      };
+	      const moveitem = (targetitem, dragitem) => {
+	        if (dragitem === undefined) return;
+	        if (isBefore(dragitem, item)) {
+	          insertAfter(targetitem, dragitem);
+	        } else {
+	          insertBefore(targetitem, dragitem);
+	        }
+	      };
+	      const dragend = () => {
+	        var _drag_item;
+	        document.querySelectorAll('.ts-drag-over').forEach(el => el.classList.remove('ts-drag-over'));
+	        (_drag_item = drag_item) == null || _drag_item.classList.remove('ts-dragging');
+	        drag_item = undefined;
+	        var values = [];
+	        self.control.querySelectorAll(`[data-value]`).forEach(el => {
+	          if (el.dataset.value) {
+	            let value = el.dataset.value;
+	            if (value) {
+	              values.push(value);
+	            }
+	          }
+	        });
+	        self.setValue(values);
+	      };
+	      addEvent(item, 'mousedown', mousedown);
+	      addEvent(item, 'dragstart', dragStart);
+	      addEvent(item, 'dragenter', dragOver);
+	      addEvent(item, 'dragover', dragOver);
+	      addEvent(item, 'dragleave', dragLeave);
+	      addEvent(item, 'dragend', dragend);
+	      return item;
+	    };
+	  });
 	  self.hook('instead', 'lock', () => {
-	    var sortable = $(self.control).data('sortable');
-	    if (sortable) sortable.disable();
+	    sortable = false;
 	    return orig_lock.call(self);
 	  });
 	  self.hook('instead', 'unlock', () => {
-	    var sortable = $(self.control).data('sortable');
-	    if (sortable) sortable.enable();
+	    sortable = true;
 	    return orig_unlock.call(self);
 	  });
-	  self.on('initialize', () => {
-	    var $control = $(self.control).sortable({
-	      items: '[data-value]',
-	      forcePlaceholderSize: true,
-	      disabled: self.isLocked,
-	      start: (e, ui) => {
-	        ui.placeholder.css('width', ui.helper.css('width'));
-	        $control.css({
-	          overflow: 'visible'
-	        });
-	      },
-	      stop: () => {
-	        $control.css({
-	          overflow: 'hidden'
-	        });
-	        var values = [];
-	        $control.children('[data-value]').each(function () {
-	          if (this.dataset.value) values.push(this.dataset.value);
-	        });
-	        self.setValue(values);
-	      }
-	    });
-	  });
 	}
 	return plugin;

data/vendor/assets/javascripts/tom-select-rails/js/plugins/drag_drop.js.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"file":"drag_drop.js","sources":["../../../src/plugins/drag_drop/plugin.ts"],"sourcesContent":["/*\n Plugin: \"drag_drop\" (Tom Select)\n * Copyright (c) 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 /\n\nimport TomSelect from '../../tom-select';\n\nexport default function(this:TomSelect) {\n\tvar self = this;\n\tif (!$.fn.sortable) throw new Error('The \"drag_drop\" plugin requires jQuery UI \"sortable\".');\n\tif (self.settings.mode !== 'multi') return;\n\n\tvar orig_lock\t\t= self.lock;\n\tvar orig_unlock\t\t= self.unlock;\n\n\tself.hook('instead','lock',()=>{\n\t\tvar sortable = $(self.control).data('sortable');\n\t\tif (sortable) sortable.disable();\n\t\treturn orig_lock.call(self);\n\t});\n\n\tself.hook('instead','unlock',()=>{\n\t\tvar sortable = $(self.control).data('sortable');\n\t\tif (sortable) sortable.enable();\n\t\treturn orig_unlock.call(self);\n\t});\n\n\tself.on('initialize',()=>{\n\t\tvar $control = $(self.control).sortable({\n\t\t\titems: '[data-value]',\n\t\t\tforcePlaceholderSize: true,\n\t\t\tdisabled: self.isLocked,\n\t\t\tstart: (e, ui) => {\n\t\t\t\tui.placeholder.css('width', ui.helper.css('width'));\n\t\t\t\t$control.css({overflow: 'visible'});\n\t\t\t},\n\t\t\tstop: ()=>{\n\t\t\t\t$control.css({overflow: 'hidden'});\n\n\t\t\t\tvar values:string[] = [];\n\t\t\t\t$control.children('[data-value]').each(function(this:HTMLElement){\n\t\t\t\t\tif( this.dataset.value ) values.push(this.dataset.value);\n\t\t\t\t});\n\n\t\t\t\tself.setValue(values);\n\t\t\t}\n\t\t});\n\n\t});\n\n};\n"],"names":["self","$","fn","sortable","Error","settings","mode","orig_lock","lock","orig_unlock","unlock","hook","control","data","disable","call","enable","on","$control","items","forcePlaceholderSize","disabled","isLocked","start","e","ui","placeholder","css","helper","overflow","stop","values","children","each","dataset","value","push","setValue"],"mappings":";;;;;;;;;;;CAAA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CAIe,eAAyB,IAAA;CACvC,EAAIA,IAAAA,IAAI,GAAG,IAAX,CAAA;CACA,EAAA,IAAI,CAACC,CAAC,CAACC,EAAF,CAAKC,QAAV,EAAoB,MAAM,IAAIC,KAAJ,CAAU,uDAAV,CAAN,CAAA;CACpB,EAAA,IAAIJ,IAAI,CAACK,QAAL,CAAcC,IAAd,KAAuB,OAA3B,EAAoC,OAAA;CAEpC,EAAA,IAAIC,SAAS,GAAIP,IAAI,CAACQ,IAAtB,CAAA;CACA,EAAA,IAAIC,WAAW,GAAIT,IAAI,CAACU,MAAxB,CAAA;CAEAV,EAAAA,IAAI,CAACW,IAAL,CAAU,SAAV,EAAoB,MAApB,EAA2B,MAAI;CAC9B,IAAA,IAAIR,QAAQ,GAAGF,CAAC,CAACD,IAAI,CAACY,OAAN,CAAD,CAAgBC,IAAhB,CAAqB,UAArB,CAAf,CAAA;CACA,IAAA,IAAIV,QAAJ,EAAcA,QAAQ,CAACW,OAAT,EAAA,CAAA;CACd,IAAA,OAAOP,SAAS,CAACQ,IAAV,CAAef,IAAf,CAAP,CAAA;CACA,GAJD,CAAA,CAAA;CAMAA,EAAAA,IAAI,CAACW,IAAL,CAAU,SAAV,EAAoB,QAApB,EAA6B,MAAI;CAChC,IAAA,IAAIR,QAAQ,GAAGF,CAAC,CAACD,IAAI,CAACY,OAAN,CAAD,CAAgBC,IAAhB,CAAqB,UAArB,CAAf,CAAA;CACA,IAAA,IAAIV,QAAJ,EAAcA,QAAQ,CAACa,MAAT,EAAA,CAAA;CACd,IAAA,OAAOP,WAAW,CAACM,IAAZ,CAAiBf,IAAjB,CAAP,CAAA;CACA,GAJD,CAAA,CAAA;CAMAA,EAAAA,IAAI,CAACiB,EAAL,CAAQ,YAAR,EAAqB,MAAI;CACxB,IAAIC,IAAAA,QAAQ,GAAGjB,CAAC,CAACD,IAAI,CAACY,OAAN,CAAD,CAAgBT,QAAhB,CAAyB;CACvCgB,MAAAA,KAAK,EAAE,cADgC;CAEvCC,MAAAA,oBAAoB,EAAE,IAFiB;CAGvCC,MAAAA,QAAQ,EAAErB,IAAI,CAACsB,QAHwB;CAIvCC,MAAAA,KAAK,EAAE,CAACC,CAAD,EAAIC,EAAJ,KAAW;CACjBA,QAAAA,EAAE,CAACC,WAAH,CAAeC,GAAf,CAAmB,OAAnB,EAA4BF,EAAE,CAACG,MAAH,CAAUD,GAAV,CAAc,OAAd,CAA5B,CAAA,CAAA;CACAT,QAAAA,QAAQ,CAACS,GAAT,CAAa;CAACE,UAAAA,QAAQ,EAAE,SAAA;CAAX,SAAb,CAAA,CAAA;CACA,OAPsC;CAQvCC,MAAAA,IAAI,EAAE,MAAI;CACTZ,QAAAA,QAAQ,CAACS,GAAT,CAAa;CAACE,UAAAA,QAAQ,EAAE,QAAA;CAAX,SAAb,CAAA,CAAA;CAEA,QAAIE,IAAAA,MAAe,GAAG,EAAtB,CAAA;CACAb,QAAAA,QAAQ,CAACc,QAAT,CAAkB,cAAlB,CAAkCC,CAAAA,IAAlC,CAAuC,YAA0B;CAChE,UAAA,IAAI,IAAKC,CAAAA,OAAL,CAAaC,KAAjB,EAAyBJ,MAAM,CAACK,IAAP,CAAY,IAAA,CAAKF,OAAL,CAAaC,KAAzB,CAAA,CAAA;CACzB,SAFD,CAAA,CAAA;CAIAnC,QAAAA,IAAI,CAACqC,QAAL,CAAcN,MAAd,CAAA,CAAA;CACA,OAAA;CAjBsC,KAAzB,CAAf,CAAA;CAoBA,GArBD,CAAA,CAAA;CAuBA;;;;;;;;"}
1	+ {"version":3,"file":"drag_drop.js","sources":["../../../src/utils.ts","../../../node_modules/@orchidjs/unicode-variants/dist/esm/index.js","../../../node_modules/@orchidjs/sifter/lib/utils.ts","../../../src/vanilla.ts","../../../src/plugins/drag_drop/plugin.ts"],"sourcesContent":["\nimport TomSelect from './tom-select';\nimport { TomLoadCallback } from './types/index';\n\n\n/*\n Converts a scalar to its best string representation\n * for hash keys and HTML attribute values.\n \n Transformations:\n * 'str' -> 'str'\n * null -> ''\n * undefined -> ''\n * true -> '1'\n * false -> '0'\n * 0 -> '0'\n * 1 -> '1'\n \n /\nexport const hash_key = (value:undefined\|null\|boolean\|string\|number):string\|null => {\n\tif (typeof value === 'undefined' \|\| value === null) return null;\n\treturn get_hash(value);\n};\n\nexport const get_hash = (value:boolean\|string\|number):string => {\n\tif (typeof value === 'boolean') return value ? '1' : '0';\n\treturn value + '';\n};\n\n/*\n Escapes a string for use within HTML.\n \n /\nexport const escape_html = (str:string):string => {\n\treturn (str + '')\n\t\t.replace(/&/g, '&')\n\t\t.replace(/</g, '<')\n\t\t.replace(/>/g, '>')\n\t\t.replace(/\"/g, '"');\n};\n\n\n/*\n use setTimeout if timeout > 0 \n /\nexport const timeout = (fn:()=>void,timeout:number) => {\n\tif( timeout > 0 ){\n\t\treturn setTimeout(fn,timeout);\n\t}\n\n\tfn.call(null);\n\treturn null;\n}\n\n/\n Debounce the user provided load function\n \n /\nexport const loadDebounce = (fn:(value:string,callback:TomLoadCallback) => void,delay:number) => {\n\tvar timeout: null\|ReturnType<typeof setTimeout>;\n\treturn function(this:TomSelect, value:string,callback:TomLoadCallback) {\n\t\tvar self = this;\n\n\t\tif( timeout ){\n\t\t\tself.loading = Math.max(self.loading - 1, 0);\n\t\t\tclearTimeout(timeout);\n\t\t}\n\t\ttimeout = setTimeout(function() {\n\t\t\ttimeout = null;\n\t\t\tself.loadedSearches[value] = true;\n\t\t\tfn.call(self, value, callback);\n\n\t\t}, delay);\n\t};\n};\n\n\n/*\n Debounce all fired events types listed in `types`\n * while executing the provided `fn`.\n \n /\nexport const debounce_events = ( self:TomSelect, types:string[], fn:() => void ) => {\n\tvar type:string;\n\tvar trigger = self.trigger;\n\tvar event_args:{ [key: string]: any } = {};\n\n\t// override trigger method\n\tself.trigger = function(){\n\t\tvar type = arguments[0];\n\t\tif (types.indexOf(type) !== -1) {\n\t\t\tevent_args[type] = arguments;\n\t\t} else {\n\t\t\treturn trigger.apply(self, arguments);\n\t\t}\n\t};\n\n\t// invoke provided function\n\tfn.apply(self, []);\n\tself.trigger = trigger;\n\n\t// trigger queued events\n\tfor( type of types ){\n\t\tif( type in event_args ){\n\t\t\ttrigger.apply(self, event_args[type]);\n\t\t}\n\t}\n};\n\n\n/*\n Determines the current selection within a text input control.\n * Returns an object containing:\n * - start\n * - length\n \n Note: \"selectionStart, selectionEnd ... apply only to inputs of types text, search, URL, tel and password\"\n * \t- https://developer.mozilla.org/en-US/docs/Web/API/HTMLInputElement/setSelectionRange\n /\nexport const getSelection = (input:HTMLInputElement):{ start: number; length: number } => {\n\treturn {\n\t\tstart\t: input.selectionStart \|\| 0,\n\t\tlength\t: (input.selectionEnd\|\|0) - (input.selectionStart\|\|0),\n\t};\n};\n\n\n/\n Prevent default\n \n /\nexport const preventDefault = (evt?:Event, stop:boolean=false):void => {\n\tif( evt ){\n\t\tevt.preventDefault();\n\t\tif( stop ){\n\t\t\tevt.stopPropagation();\n\t\t}\n\t}\n}\n\n\n/*\n Add event helper\n \n /\nexport const addEvent = (target:EventTarget, type:string, callback:EventListenerOrEventListenerObject, options?:object):void => {\n\ttarget.addEventListener(type,callback,options);\n};\n\n\n/*\n Return true if the requested key is down\n * Will return false if more than one control character is pressed ( when [ctrl+shift+a] != [ctrl+a] )\n * The current evt may not always set ( eg calling advanceSelection() )\n \n /\nexport const isKeyDown = ( key_name:keyof (KeyboardEvent\|MouseEvent), evt?:KeyboardEvent\|MouseEvent ) => {\n\n\tif( !evt ){\n\t\treturn false;\n\t}\n\n\tif( !evt[key_name] ){\n\t\treturn false;\n\t}\n\n\tvar count = (evt.altKey?1:0) + (evt.ctrlKey?1:0) + (evt.shiftKey?1:0) + (evt.metaKey?1:0);\n\n\tif( count === 1 ){\n\t\treturn true;\n\t}\n\n\treturn false;\n};\n\n\n/*\n Get the id of an element\n * If the id attribute is not set, set the attribute with the given id\n \n /\nexport const getId = (el:Element,id:string) => {\n\tconst existing_id = el.getAttribute('id');\n\tif( existing_id ){\n\t\treturn existing_id;\n\t}\n\n\tel.setAttribute('id',id);\n\treturn id;\n};\n\n\n/*\n Returns a string with backslashes added before characters that need to be escaped.\n /\nexport const addSlashes = (str:string):string => {\n\treturn str.replace(/[\\\\\"']/g, '\\\\$&');\n};\n\n/\n \n /\nexport const append = ( parent:Element\|DocumentFragment, node: string\|Node\|null\|undefined ):void =>{\n\tif( node ) parent.append(node);\n};\n","/! @orchidjs/unicode-variants \| https://github.com/orchidjs/unicode-variants \| Apache License (v2) /\nimport { toArray, setToPattern, escape_regex, arrayToPattern, sequencePattern } from './regex.js';\nexport { escape_regex } from './regex.js';\nimport { allSubstrings } from './strings.js';\n\n/\n @typedef {{[key:string]:string}} TUnicodeMap\n * @typedef {{[key:string]:Set<string>}} TUnicodeSets\n * @typedef {[[number,number]]} TCodePoints\n * @typedef {{folded:string,composed:string,code_point:number}} TCodePointObj\n * @typedef {{start:number,end:number,length:number,substr:string}} TSequencePart\n /\n/* @type {TCodePoints} /\n\nconst code_points = [[0, 65535]];\nconst accent_pat = '[\\u0300-\\u036F\\u{b7}\\u{2be}\\u{2bc}]';\n/* @type {TUnicodeMap} /\n\nlet unicode_map;\n/* @type {RegExp} /\n\nlet multi_char_reg;\nconst max_char_length = 3;\n/* @type {TUnicodeMap} /\n\nconst latin_convert = {};\n/* @type {TUnicodeMap} /\n\nconst latin_condensed = {\n '/': '⁄∕',\n '0': '߀',\n \"a\": \"ⱥɐɑ\",\n \"aa\": \"ꜳ\",\n \"ae\": \"æǽǣ\",\n \"ao\": \"ꜵ\",\n \"au\": \"ꜷ\",\n \"av\": \"ꜹꜻ\",\n \"ay\": \"ꜽ\",\n \"b\": \"ƀɓƃ\",\n \"c\": \"ꜿƈȼↄ\",\n \"d\": \"đɗɖᴅƌꮷԁɦ\",\n \"e\": \"ɛǝᴇɇ\",\n \"f\": \"ꝼƒ\",\n \"g\": \"ǥɠꞡᵹꝿɢ\",\n \"h\": \"ħⱨⱶɥ\",\n \"i\": \"ɨı\",\n \"j\": \"ɉȷ\",\n \"k\": \"ƙⱪꝁꝃꝅꞣ\",\n \"l\": \"łƚɫⱡꝉꝇꞁɭ\",\n \"m\": \"ɱɯϻ\",\n \"n\": \"ꞥƞɲꞑᴎлԉ\",\n \"o\": \"øǿɔɵꝋꝍᴑ\",\n \"oe\": \"œ\",\n \"oi\": \"ƣ\",\n \"oo\": \"ꝏ\",\n \"ou\": \"ȣ\",\n \"p\": \"ƥᵽꝑꝓꝕρ\",\n \"q\": \"ꝗꝙɋ\",\n \"r\": \"ɍɽꝛꞧꞃ\",\n \"s\": \"ßȿꞩꞅʂ\",\n \"t\": \"ŧƭʈⱦꞇ\",\n \"th\": \"þ\",\n \"tz\": \"ꜩ\",\n \"u\": \"ʉ\",\n \"v\": \"ʋꝟʌ\",\n \"vy\": \"ꝡ\",\n \"w\": \"ⱳ\",\n \"y\": \"ƴɏỿ\",\n \"z\": \"ƶȥɀⱬꝣ\",\n \"hv\": \"ƕ\"\n};\n\nfor (let latin in latin_condensed) {\n let unicode = latin_condensed[latin] \|\| '';\n\n for (let i = 0; i < unicode.length; i++) {\n let char = unicode.substring(i, i + 1);\n latin_convert[char] = latin;\n }\n}\n\nconst convert_pat = new RegExp(Object.keys(latin_convert).join('\|') + '\|' + accent_pat, 'gu');\n/\n Initialize the unicode_map from the give code point ranges\n \n @param {TCodePoints=} _code_points\n /\n\nconst initialize = _code_points => {\n if (unicode_map !== undefined) return;\n unicode_map = generateMap(_code_points \|\| code_points);\n};\n/\n Helper method for normalize a string\n * https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/normalize\n * @param {string} str\n * @param {string} form\n /\n\nconst normalize = (str, form = 'NFKD') => str.normalize(form);\n/\n Remove accents without reordering string\n * calling str.normalize('NFKD') on \\u{594}\\u{595}\\u{596} becomes \\u{596}\\u{594}\\u{595}\n * via https://github.com/krisk/Fuse/issues/133#issuecomment-318692703\n * @param {string} str\n * @return {string}\n /\n\nconst asciifold = str => {\n return toArray(str).reduce(\n /\n @param {string} result\n * @param {string} char\n /\n (result, char) => {\n return result + _asciifold(char);\n }, '');\n};\n/\n @param {string} str\n * @return {string}\n /\n\nconst _asciifold = str => {\n str = normalize(str).toLowerCase().replace(convert_pat, (\n /* @type {string} /\n char) => {\n return latin_convert[char] \|\| '';\n }); //return str;\n\n return normalize(str, 'NFC');\n};\n/\n Generate a list of unicode variants from the list of code points\n * @param {TCodePoints} code_points\n * @yield {TCodePointObj}\n /\n\nfunction generator(code_points) {\n for (const [code_point_min, code_point_max] of code_points) {\n for (let i = code_point_min; i <= code_point_max; i++) {\n let composed = String.fromCharCode(i);\n let folded = asciifold(composed);\n\n if (folded == composed.toLowerCase()) {\n continue;\n } // skip when folded is a string longer than 3 characters long\n // bc the resulting regex patterns will be long\n // eg:\n // folded صلى الله عليه وسلم length 18 code point 65018\n // folded جل جلاله length 8 code point 65019\n\n\n if (folded.length > max_char_length) {\n continue;\n }\n\n if (folded.length == 0) {\n continue;\n }\n\n yield {\n folded: folded,\n composed: composed,\n code_point: i\n };\n }\n }\n}\n/*\n Generate a unicode map from the list of code points\n * @param {TCodePoints} code_points\n * @return {TUnicodeSets}\n /\n\nconst generateSets = code_points => {\n /* @type {{[key:string]:Set<string>}} /\n const unicode_sets = {};\n /\n @param {string} folded\n * @param {string} to_add\n /\n\n const addMatching = (folded, to_add) => {\n /* @type {Set<string>} /\n const folded_set = unicode_sets[folded] \|\| new Set();\n const patt = new RegExp('^' + setToPattern(folded_set) + '$', 'iu');\n\n if (to_add.match(patt)) {\n return;\n }\n\n folded_set.add(escape_regex(to_add));\n unicode_sets[folded] = folded_set;\n };\n\n for (let value of generator(code_points)) {\n addMatching(value.folded, value.folded);\n addMatching(value.folded, value.composed);\n }\n\n return unicode_sets;\n};\n/\n Generate a unicode map from the list of code points\n * ae => (?:(?:ae\|Æ\|Ǽ\|Ǣ)\|(?:A\|Ⓐ\|Ａ...)(?:E\|ɛ\|Ⓔ...))\n \n @param {TCodePoints} code_points\n * @return {TUnicodeMap}\n /\n\nconst generateMap = code_points => {\n /* @type {TUnicodeSets} /\n const unicode_sets = generateSets(code_points);\n /* @type {TUnicodeMap} /\n\n const unicode_map = {};\n /* @type {string[]} /\n\n let multi_char = [];\n\n for (let folded in unicode_sets) {\n let set = unicode_sets[folded];\n\n if (set) {\n unicode_map[folded] = setToPattern(set);\n }\n\n if (folded.length > 1) {\n multi_char.push(escape_regex(folded));\n }\n }\n\n multi_char.sort((a, b) => b.length - a.length);\n const multi_char_patt = arrayToPattern(multi_char);\n multi_char_reg = new RegExp('^' + multi_char_patt, 'u');\n return unicode_map;\n};\n/\n Map each element of an array from it's folded value to all possible unicode matches\n * @param {string[]} strings\n * @param {number} min_replacement\n * @return {string}\n /\n\nconst mapSequence = (strings, min_replacement = 1) => {\n let chars_replaced = 0;\n strings = strings.map(str => {\n if (unicode_map[str]) {\n chars_replaced += str.length;\n }\n\n return unicode_map[str] \|\| str;\n });\n\n if (chars_replaced >= min_replacement) {\n return sequencePattern(strings);\n }\n\n return '';\n};\n/\n Convert a short string and split it into all possible patterns\n * Keep a pattern only if min_replacement is met\n \n 'abc'\n * \t\t=> [['abc'],['ab','c'],['a','bc'],['a','b','c']]\n \t\t=> ['abc-pattern','ab-c-pattern'...]\n \n \n @param {string} str\n * @param {number} min_replacement\n * @return {string}\n /\n\nconst substringsToPattern = (str, min_replacement = 1) => {\n min_replacement = Math.max(min_replacement, str.length - 1);\n return arrayToPattern(allSubstrings(str).map(sub_pat => {\n return mapSequence(sub_pat, min_replacement);\n }));\n};\n/\n Convert an array of sequences into a pattern\n * [{start:0,end:3,length:3,substr:'iii'}...] => (?:iii...)\n \n @param {Sequence[]} sequences\n * @param {boolean} all\n /\n\nconst sequencesToPattern = (sequences, all = true) => {\n let min_replacement = sequences.length > 1 ? 1 : 0;\n return arrayToPattern(sequences.map(sequence => {\n let seq = [];\n const len = all ? sequence.length() : sequence.length() - 1;\n\n for (let j = 0; j < len; j++) {\n seq.push(substringsToPattern(sequence.substrs[j] \|\| '', min_replacement));\n }\n\n return sequencePattern(seq);\n }));\n};\n/\n Return true if the sequence is already in the sequences\n * @param {Sequence} needle_seq\n * @param {Sequence[]} sequences\n /\n\n\nconst inSequences = (needle_seq, sequences) => {\n for (const seq of sequences) {\n if (seq.start != needle_seq.start \|\| seq.end != needle_seq.end) {\n continue;\n }\n\n if (seq.substrs.join('') !== needle_seq.substrs.join('')) {\n continue;\n }\n\n let needle_parts = needle_seq.parts;\n /\n @param {TSequencePart} part\n /\n\n const filter = part => {\n for (const needle_part of needle_parts) {\n if (needle_part.start === part.start && needle_part.substr === part.substr) {\n return false;\n }\n\n if (part.length == 1 \|\| needle_part.length == 1) {\n continue;\n } // check for overlapping parts\n // a = ['::=','==']\n // b = ['::','===']\n // a = ['r','sm']\n // b = ['rs','m']\n\n\n if (part.start < needle_part.start && part.end > needle_part.start) {\n return true;\n }\n\n if (needle_part.start < part.start && needle_part.end > part.start) {\n return true;\n }\n }\n\n return false;\n };\n\n let filtered = seq.parts.filter(filter);\n\n if (filtered.length > 0) {\n continue;\n }\n\n return true;\n }\n\n return false;\n};\n\nclass Sequence {\n constructor() {\n /* @type {TSequencePart[]} /\n this.parts = [];\n /* @type {string[]} /\n\n this.substrs = [];\n this.start = 0;\n this.end = 0;\n }\n /\n @param {TSequencePart\|undefined} part\n /\n\n\n add(part) {\n if (part) {\n this.parts.push(part);\n this.substrs.push(part.substr);\n this.start = Math.min(part.start, this.start);\n this.end = Math.max(part.end, this.end);\n }\n }\n\n last() {\n return this.parts[this.parts.length - 1];\n }\n\n length() {\n return this.parts.length;\n }\n /\n @param {number} position\n * @param {TSequencePart} last_piece\n /\n\n\n clone(position, last_piece) {\n let clone = new Sequence();\n let parts = JSON.parse(JSON.stringify(this.parts));\n let last_part = parts.pop();\n\n for (const part of parts) {\n clone.add(part);\n }\n\n let last_substr = last_piece.substr.substring(0, position - last_part.start);\n let clone_last_len = last_substr.length;\n clone.add({\n start: last_part.start,\n end: last_part.start + clone_last_len,\n length: clone_last_len,\n substr: last_substr\n });\n return clone;\n }\n\n}\n/\n Expand a regular expression pattern to include unicode variants\n * \teg /a/ becomes /aⓐａẚàáâầấẫẩãāăằắẵẳȧǡäǟảåǻǎȁȃạậặḁąⱥɐɑAⒶＡÀÁÂẦẤẪẨÃĀĂẰẮẴẲȦǠÄǞẢÅǺǍȀȂẠẬẶḀĄȺⱯ/\n \n Issue:\n * ﺊﺋ [ 'ﺊ = \\\\u{fe8a}', 'ﺋ = \\\\u{fe8b}' ]\n \tbecomes:\tئئ [ 'ي = \\\\u{64a}', 'ٔ = \\\\u{654}', 'ي = \\\\u{64a}', 'ٔ = \\\\u{654}' ]\n \n \tİĲ = IIJ = ⅡJ\n \n * \t1/2/4\n \n @param {string} str\n * @return {string\|undefined}\n /\n\n\nconst getPattern = str => {\n initialize();\n str = asciifold(str);\n let pattern = '';\n let sequences = [new Sequence()];\n\n for (let i = 0; i < str.length; i++) {\n let substr = str.substring(i);\n let match = substr.match(multi_char_reg);\n const char = str.substring(i, i + 1);\n const match_str = match ? match[0] : null; // loop through sequences\n // add either the char or multi_match\n\n let overlapping = [];\n let added_types = new Set();\n\n for (const sequence of sequences) {\n const last_piece = sequence.last();\n\n if (!last_piece \|\| last_piece.length == 1 \|\| last_piece.end <= i) {\n // if we have a multi match\n if (match_str) {\n const len = match_str.length;\n sequence.add({\n start: i,\n end: i + len,\n length: len,\n substr: match_str\n });\n added_types.add('1');\n } else {\n sequence.add({\n start: i,\n end: i + 1,\n length: 1,\n substr: char\n });\n added_types.add('2');\n }\n } else if (match_str) {\n let clone = sequence.clone(i, last_piece);\n const len = match_str.length;\n clone.add({\n start: i,\n end: i + len,\n length: len,\n substr: match_str\n });\n overlapping.push(clone);\n } else {\n // don't add char\n // adding would create invalid patterns: 234 => [2,34,4]\n added_types.add('3');\n }\n } // if we have overlapping\n\n\n if (overlapping.length > 0) {\n // ['ii','iii'] before ['i','i','iii']\n overlapping = overlapping.sort((a, b) => {\n return a.length() - b.length();\n });\n\n for (let clone of overlapping) {\n // don't add if we already have an equivalent sequence\n if (inSequences(clone, sequences)) {\n continue;\n }\n\n sequences.push(clone);\n }\n\n continue;\n } // if we haven't done anything unique\n // clean up the patterns\n // helps keep patterns smaller\n // if str = 'r₨㎧aarss', pattern will be 446 instead of 655\n\n\n if (i > 0 && added_types.size == 1 && !added_types.has('3')) {\n pattern += sequencesToPattern(sequences, false);\n let new_seq = new Sequence();\n const old_seq = sequences[0];\n\n if (old_seq) {\n new_seq.add(old_seq.last());\n }\n\n sequences = [new_seq];\n }\n }\n\n pattern += sequencesToPattern(sequences, true);\n return pattern;\n};\n\nexport { _asciifold, asciifold, code_points, generateMap, generateSets, generator, getPattern, initialize, mapSequence, normalize, substringsToPattern, unicode_map };\n//# sourceMappingURL=index.js.map\n","\nimport { asciifold } from '@orchidjs/unicode-variants';\nimport as T from './types';\n\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 /\nexport const getAttr = (obj:{[key:string]:any}, name:string ) => {\n if (!obj ) return;\n return obj[name];\n};\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 /\nexport const getAttrNesting = (obj:{[key:string]:any}, name:string ) => {\n if (!obj ) return;\n var part, names = name.split(\".\");\n\twhile( (part = names.shift()) && (obj = obj[part]));\n return obj;\n};\n\n/\n Calculates how close of a match the\n * given value is against a search token.\n \n /\nexport const scoreValue = (value:string, token:T.Token, weight:number ):number => {\n\tvar score, pos;\n\n\tif (!value) return 0;\n\n\tvalue = value + '';\n\tif( token.regex == null ) return 0;\n\tpos = value.search(token.regex);\n\tif (pos === -1) return 0;\n\n\tscore = token.string.length / value.length;\n\tif (pos === 0) score += 0.5;\n\n\treturn score * weight;\n};\n\n\n/*\n Cast object property to an array if it exists and has a value\n \n /\nexport const propToArray = (obj:{[key:string]:any}, key:string) => {\n\tvar value = obj[key];\n\n\tif( typeof value == 'function' ) return value;\n\n\tif( value && !Array.isArray(value) ){\n\t\tobj[key] = [value];\n\t}\n}\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 /\nexport const iterate = (object:[]\|{[key:string]:any}, callback:(value:any,key:any)=>any) => {\n\n\tif ( Array.isArray(object)) {\n\t\tobject.forEach(callback);\n\n\t}else{\n\n\t\tfor (var key in object) {\n\t\t\tif (object.hasOwnProperty(key)) {\n\t\t\t\tcallback(object[key], key);\n\t\t\t}\n\t\t}\n\t}\n};\n\n\n\nexport const cmp = (a:number\|string, b:number\|string) => {\n\tif (typeof a === 'number' && typeof b === 'number') {\n\t\treturn a > b ? 1 : (a < b ? -1 : 0);\n\t}\n\ta = asciifold(a + '').toLowerCase();\n\tb = asciifold(b + '').toLowerCase();\n\tif (a > b) return 1;\n\tif (b > a) return -1;\n\treturn 0;\n};\n","\nimport { iterate } from '@orchidjs/sifter/lib/utils';\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 /\nexport const getDom = ( query:any ):HTMLElement => {\n\n\tif( query.jquery ){\n\t\treturn query[0];\n\t}\n\n\tif( query instanceof HTMLElement ){\n\t\treturn query;\n\t}\n\n\tif( isHtmlString(query) ){\n\t\tvar tpl = document.createElement('template');\n\t\ttpl.innerHTML = query.trim(); // Never return a text node of whitespace as the result\n\t\treturn tpl.content.firstChild as HTMLElement;\n\t}\n\n\treturn document.querySelector(query);\n};\n\nexport const isHtmlString = (arg:any): boolean => {\n\tif( typeof arg === 'string' && arg.indexOf('<') > -1 ){\n\t\treturn true;\n\t}\n\treturn false;\n}\n\nexport const escapeQuery = (query:string):string => {\n\treturn query.replace(/['\"\\\\]/g, '\\\\$&');\n}\n\n/\n Dispatch an event\n \n /\nexport const triggerEvent = ( dom_el:HTMLElement, event_name:string ):void => {\n\tvar event = document.createEvent('HTMLEvents');\n\tevent.initEvent(event_name, true, false);\n\tdom_el.dispatchEvent(event)\n};\n\n/*\n Apply CSS rules to a dom element\n \n /\nexport const applyCSS = ( dom_el:HTMLElement, css:{ [key: string]: string\|number }):void => {\n\tObject.assign(dom_el.style, css);\n}\n\n\n/*\n Add css classes\n \n /\nexport const addClasses = ( elmts:HTMLElement\|HTMLElement[], ...classes:string[]\|string[][] ) => {\n\n\tvar norm_classes \t= classesArray(classes);\n\telmts\t\t\t\t= castAsArray(elmts);\n\n\telmts.map( el => {\n\t\tnorm_classes.map( cls => {\n\t\t\tel.classList.add( cls );\n\t\t});\n\t});\n}\n\n/*\n Remove css classes\n \n /\n export const removeClasses = ( elmts:HTMLElement\|HTMLElement[], ...classes:string[]\|string[][] ) => {\n\n \tvar norm_classes \t= classesArray(classes);\n\telmts\t\t\t\t= castAsArray(elmts);\n\n\telmts.map( el => {\n\t\tnorm_classes.map(cls => {\n\t \t\tel.classList.remove( cls );\n\t\t});\n \t});\n }\n\n\n/*\n Return arguments\n \n /\nexport const classesArray = (args:string[]\|string[][]):string[] => {\n\tvar classes:string[] = [];\n\titerate( args, (_classes) =>{\n\t\tif( typeof _classes === 'string' ){\n\t\t\t_classes = _classes.trim().split(/[\\11\\12\\14\\15\\40]/);\n\t\t}\n\t\tif( Array.isArray(_classes) ){\n\t\t\tclasses = classes.concat(_classes);\n\t\t}\n\t});\n\n\treturn classes.filter(Boolean);\n}\n\n\n/*\n Create an array from arg if it's not already an array\n \n /\nexport const castAsArray = (arg:any):Array<any> => {\n\tif( !Array.isArray(arg) ){\n \t\targ = [arg];\n \t}\n\treturn arg;\n}\n\n\n/*\n Get the closest node to the evt.target matching the selector\n * Stops at wrapper\n \n /\nexport const parentMatch = ( target:null\|HTMLElement, selector:string, wrapper?:HTMLElement ):HTMLElement\|void => {\n\n\tif( wrapper && !wrapper.contains(target) ){\n\t\treturn;\n\t}\n\n\twhile( target && target.matches ){\n\n\t\tif( target.matches(selector) ){\n\t\t\treturn target;\n\t\t}\n\n\t\ttarget = target.parentNode as HTMLElement;\n\t}\n}\n\n\n/*\n Get the first or last item from an array\n \n > 0 - right (last)\n * <= 0 - left (first)\n \n /\nexport const getTail = ( list:Array<any>\|NodeList, direction:number=0 ):any => {\n\n\tif( direction > 0 ){\n\t\treturn list[list.length-1];\n\t}\n\n\treturn list[0];\n}\n\n/*\n Return true if an object is empty\n \n /\nexport const isEmptyObject = (obj:object):boolean => {\n\treturn (Object.keys(obj).length === 0);\n}\n\n\n/*\n Get the index of an element amongst sibling nodes of the same type\n \n /\nexport const nodeIndex = ( el:null\|Element, amongst?:string ):number => {\n\tif (!el) return -1;\n\n\tamongst = amongst \|\| el.nodeName;\n\n\tvar i = 0;\n\twhile( el = el.previousElementSibling ){\n\n\t\tif( el.matches(amongst) ){\n\t\t\ti++;\n\t\t}\n\t}\n\treturn i;\n}\n\n\n/*\n Set attributes of an element\n \n /\nexport const setAttr = (el:Element,attrs:{ [key: string]: null\|string\|number }) => {\n\titerate( attrs,(val,attr) => {\n\t\tif( val == null ){\n\t\t\tel.removeAttribute(attr as string);\n\t\t}else{\n\t\t\tel.setAttribute(attr as string, ''+val);\n\t\t}\n\t});\n}\n\n\n/*\n Replace a node\n /\nexport const replaceNode = ( existing:Node, replacement:Node ) => {\n\tif( existing.parentNode ) existing.parentNode.replaceChild(replacement, existing);\n}\n","/\n Plugin: \"drag_drop\" (Tom Select)\n * Copyright (c) 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 /\n\nimport TomSelect from '../../tom-select';\nimport { TomOption, TomItem } from '../../types/index';\nimport { escape_html, preventDefault, addEvent } from '../../utils';\nimport { getDom, setAttr } from '../../vanilla';\n\n\nconst insertAfter = (referenceNode:Element, newNode:Element) => {\n\treferenceNode.parentNode?.insertBefore(newNode, referenceNode.nextSibling);\n}\n\nconst insertBefore = (referenceNode:Element, newNode:Element) => {\n\treferenceNode.parentNode?.insertBefore(newNode, referenceNode);\n}\n\nconst isBefore = (referenceNode:Element\|undefined\|null, newNode:Element\|undefined\|null) =>{\n\t\n\tdo{\n\t\tnewNode = newNode?.previousElementSibling;\n\n\t\tif( referenceNode == newNode ){\n\t\t\treturn true;\n\t\t}\n\n\t}while( newNode && newNode.previousElementSibling );\n\n\treturn false;\n}\n\nexport default function(this:TomSelect) {\n\tvar self = this;\n\tif (self.settings.mode !== 'multi') return;\n\n\tvar orig_lock\t\t= self.lock;\n\tvar orig_unlock\t\t= self.unlock;\n\tlet sortable = true;\n\t\tlet drag_item:TomItem\|undefined;\n\n\n\t/*\n\t Add draggable attribute to item\n\t */\n\tself.hook('after','setupTemplates',() => {\n\n\t\tvar orig_render_item = self.settings.render.item;\n\n\t\tself.settings.render.item = (data:TomOption, escape:typeof escape_html) => {\n\t\t\tconst item = getDom(orig_render_item.call(self, data, escape)) as TomItem;\n\t\t\tsetAttr(item,{'draggable':'true'});\n\n\n\t\t\t// prevent doc_mousedown (see tom-select.ts)\n\t\t\tconst mousedown = (evt:Event) => {\n\t\t\t\tif( !sortable ) preventDefault(evt);\n\t\t\t\tevt.stopPropagation();\n\t\t\t}\n\n\t\t\tconst dragStart = (evt:Event) => {\n\t\t\t\tdrag_item = item;\n\t\t\t\t\n\t\t\t\tsetTimeout(() => {\n\t\t\t\t\titem.classList.add('ts-dragging');\n\t\t\t\t}, 0);\n\t\t\t\t\n\t\t\t}\n\n\t\t\tconst dragOver = (evt:Event) =>{\n\t\t\t\tevt.preventDefault();\n\t\t\t\titem.classList.add('ts-drag-over');\n\t\t\t\tmoveitem(item,drag_item);\n\t\t\t}\n\n\t\t\tconst dragLeave = () => {\n\t\t\t\titem.classList.remove('ts-drag-over');\n\t\t\t}\n\n\t\t\tconst moveitem = (targetitem:TomItem, dragitem:TomItem\|undefined) => {\n\t\t\t\tif( dragitem === undefined ) return;\n\t\t\t\t\n\t\t\t\tif( isBefore(dragitem,item) ){\n\t\t\t\t\tinsertAfter(targetitem,dragitem);\n\t\t\t\t}else{\n\t\t\t\t\tinsertBefore(targetitem,dragitem);\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tconst dragend = () => {\n\t\t\t\tdocument.querySelectorAll('.ts-drag-over').forEach(el=> el.classList.remove('ts-drag-over'));\n\t\t\t\tdrag_item?.classList.remove('ts-dragging');\n\t\t\t\tdrag_item = undefined;\n\n\t\t\t\tvar values:string[] = [];\n\t\t\t\tself.control.querySelectorAll(`[data-value]`).forEach((el:Element)=> {\n\t\t\t\t\tif( (<HTMLOptionElement>el).dataset.value ){\n\t\t\t\t\t\tlet value = (<HTMLOptionElement>el).dataset.value;\n\t\t\t\t\t\tif( value ){\n\t\t\t\t\t\t\tvalues.push(value);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t});\n\n\t\t\t\tself.setValue(values);\n\t\t\t}\t\n\n\n\t\t\taddEvent(item,'mousedown', mousedown);\n\t\t\taddEvent(item,'dragstart', dragStart);\n\t\t\taddEvent(item,'dragenter', dragOver)\n\t\t\taddEvent(item,'dragover', dragOver);\n\t\t\taddEvent(item,'dragleave', dragLeave);\n\t\t\taddEvent(item,'dragend', dragend);\n\t\t\t\t\n\t\t\treturn item;\n\t\t}\t\n\t});\n\n\n\n\tself.hook('instead','lock',()=>{\n\t\tsortable = false;\n\t\treturn orig_lock.call(self);\n\t});\n\n\tself.hook('instead','unlock',()=>{\n\t\tsortable = true;\n\t\treturn orig_unlock.call(self);\n\t});\n\n};\n"],"names":["preventDefault","evt","stop","stopPropagation","addEvent","target","type","callback","options","addEventListener","iterate","object","Array","isArray","forEach","key","hasOwnProperty","getDom","query","jquery","HTMLElement","isHtmlString","tpl","document","createElement","innerHTML","trim","content","firstChild","querySelector","arg","indexOf","setAttr","el","attrs","val","attr","removeAttribute","setAttribute","insertAfter","referenceNode","newNode","_referenceNode$parent","parentNode","insertBefore","nextSibling","_referenceNode$parent2","isBefore","_newNode","previousElementSibling","self","settings","mode","orig_lock","lock","orig_unlock","unlock","sortable","drag_item","hook","orig_render_item","render","item","data","escape","call","mousedown","dragStart","setTimeout","classList","add","dragOver","moveitem","dragLeave","remove","targetitem","dragitem","undefined","dragend","_drag_item","querySelectorAll","values","control","dataset","value","push","setValue"],"mappings":";;;;;;;;;;;CAKA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;;CA6GA;CACA;CACA;CACA;CACO,MAAMA,cAAc,GAAGA,CAACC,GAAU,EAAEC,IAAY,GAAC,KAAK,KAAU;CACtE,EAAA,IAAID,GAAG,EAAE;KACRA,GAAG,CAACD,cAAc,EAAE,CAAA;CACpB,IAAA,IAAIE,IAAI,EAAE;OACTD,GAAG,CAACE,eAAe,EAAE,CAAA;CACtB,KAAA;CACD,GAAA;CACD,CAAC,CAAA;;CAGD;CACA;CACA;CACA;CACO,MAAMC,QAAQ,GAAGA,CAACC,MAAkB,EAAEC,IAAW,EAAEC,QAA2C,EAAEC,OAAe,KAAU;GAC/HH,MAAM,CAACI,gBAAgB,CAACH,IAAI,EAACC,QAAQ,EAACC,OAAO,CAAC,CAAA;CAC/C,CAAC;;CCnJD;CAeA,MAAM,UAAU,GAAG,qCAAqC,CAAC;CAQzD;AACA;CACA,MAAM,aAAa,GAAG,EAAE,CAAC;CACzB;AACA;CACA,MAAM,eAAe,GAAG;CACxB,EAAE,GAAG,EAAE,IAAI;CACX,EAAE,GAAG,EAAE,GAAG;CACV,EAAE,GAAG,EAAE,KAAK;CACZ,EAAE,IAAI,EAAE,GAAG;CACX,EAAE,IAAI,EAAE,KAAK;CACb,EAAE,IAAI,EAAE,GAAG;CACX,EAAE,IAAI,EAAE,GAAG;CACX,EAAE,IAAI,EAAE,IAAI;CACZ,EAAE,IAAI,EAAE,GAAG;CACX,EAAE,GAAG,EAAE,KAAK;CACZ,EAAE,GAAG,EAAE,MAAM;CACb,EAAE,GAAG,EAAE,UAAU;CACjB,EAAE,GAAG,EAAE,MAAM;CACb,EAAE,GAAG,EAAE,IAAI;CACX,EAAE,GAAG,EAAE,QAAQ;CACf,EAAE,GAAG,EAAE,MAAM;CACb,EAAE,GAAG,EAAE,IAAI;CACX,EAAE,GAAG,EAAE,IAAI;CACX,EAAE,GAAG,EAAE,QAAQ;CACf,EAAE,GAAG,EAAE,UAAU;CACjB,EAAE,GAAG,EAAE,KAAK;CACZ,EAAE,GAAG,EAAE,SAAS;CAChB,EAAE,GAAG,EAAE,SAAS;CAChB,EAAE,IAAI,EAAE,GAAG;CACX,EAAE,IAAI,EAAE,GAAG;CACX,EAAE,IAAI,EAAE,GAAG;CACX,EAAE,IAAI,EAAE,GAAG;CACX,EAAE,GAAG,EAAE,QAAQ;CACf,EAAE,GAAG,EAAE,KAAK;CACZ,EAAE,GAAG,EAAE,OAAO;CACd,EAAE,GAAG,EAAE,OAAO;CACd,EAAE,GAAG,EAAE,OAAO;CACd,EAAE,IAAI,EAAE,GAAG;CACX,EAAE,IAAI,EAAE,GAAG;CACX,EAAE,GAAG,EAAE,GAAG;CACV,EAAE,GAAG,EAAE,KAAK;CACZ,EAAE,IAAI,EAAE,GAAG;CACX,EAAE,GAAG,EAAE,GAAG;CACV,EAAE,GAAG,EAAE,KAAK;CACZ,EAAE,GAAG,EAAE,OAAO;CACd,EAAE,IAAI,EAAE,GAAG;CACX,CAAC,CAAC;AACF;CACA,KAAK,IAAI,KAAK,IAAI,eAAe,EAAE;CACnC,EAAE,IAAI,OAAO,GAAG,eAAe,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC;AAC7C;CACA,EAAE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;CAC3C,IAAI,IAAI,IAAI,GAAG,OAAO,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;CAC3C,IAAI,aAAa,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC;CAChC,GAAG;CACH,CAAC;AACD;CACoB,IAAI,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,GAAG,UAAU,EAAE,IAAI;;CCf5F;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACO,MAAME,OAAO,GAAGA,CAACC,MAA4B,EAAEJ,QAAiC,KAAK;CAE3F,EAAA,IAAKK,KAAK,CAACC,OAAO,CAACF,MAAM,CAAC,EAAE;CAC3BA,IAAAA,MAAM,CAACG,OAAO,CAACP,QAAQ,CAAC,CAAA;CAEzB,GAAC,MAAI;CAEJ,IAAA,KAAK,IAAIQ,GAAG,IAAIJ,MAAM,EAAE;CACvB,MAAA,IAAIA,MAAM,CAACK,cAAc,CAACD,GAAG,CAAC,EAAE;CAC/BR,QAAAA,QAAQ,CAACI,MAAM,CAACI,GAAG,CAAC,EAAEA,GAAG,CAAC,CAAA;CAC3B,OAAA;CACD,KAAA;CACD,GAAA;CACD,CAAC;;CCtFD;CACA;CACA;CACA;CACA;CACA;CACO,MAAME,MAAM,GAAKC,KAAS,IAAkB;GAElD,IAAIA,KAAK,CAACC,MAAM,EAAE;KACjB,OAAOD,KAAK,CAAC,CAAC,CAAC,CAAA;CAChB,GAAA;GAEA,IAAIA,KAAK,YAAYE,WAAW,EAAE;CACjC,IAAA,OAAOF,KAAK,CAAA;CACb,GAAA;CAEA,EAAA,IAAIG,YAAY,CAACH,KAAK,CAAC,EAAE;CACxB,IAAA,IAAII,GAAG,GAAGC,QAAQ,CAACC,aAAa,CAAC,UAAU,CAAC,CAAA;KAC5CF,GAAG,CAACG,SAAS,GAAGP,KAAK,CAACQ,IAAI,EAAE,CAAC;CAC7B,IAAA,OAAOJ,GAAG,CAACK,OAAO,CAACC,UAAU,CAAA;CAC9B,GAAA;CAEA,EAAA,OAAOL,QAAQ,CAACM,aAAa,CAACX,KAAK,CAAC,CAAA;CACrC,CAAC,CAAA;CAEM,MAAMG,YAAY,GAAIS,GAAO,IAAc;CACjD,EAAA,IAAI,OAAOA,GAAG,KAAK,QAAQ,IAAIA,GAAG,CAACC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE;CACrD,IAAA,OAAO,IAAI,CAAA;CACZ,GAAA;CACA,EAAA,OAAO,KAAK,CAAA;CACb,CAAC,CAAA;;CA4JD;CACA;CACA;CACA;CACO,MAAMC,OAAO,GAAGA,CAACC,EAAU,EAACC,KAA2C,KAAK;CAClFxB,EAAAA,OAAO,CAAEwB,KAAK,EAAC,CAACC,GAAG,EAACC,IAAI,KAAK;KAC5B,IAAID,GAAG,IAAI,IAAI,EAAE;CAChBF,MAAAA,EAAE,CAACI,eAAe,CAACD,IAAc,CAAC,CAAA;CACnC,KAAC,MAAI;OACJH,EAAE,CAACK,YAAY,CAACF,IAAI,EAAY,EAAE,GAACD,GAAG,CAAC,CAAA;CACxC,KAAA;CACD,GAAC,CAAC,CAAA;CACH,CAAC;;CCzMD;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;;CAQA,MAAMI,WAAW,GAAGA,CAACC,aAAqB,EAAEC,OAAe,KAAK;CAAA,EAAA,IAAAC,qBAAA,CAAA;CAC/D,EAAA,CAAAA,qBAAA,GAAAF,aAAa,CAACG,UAAU,KAAxBD,IAAAA,IAAAA,qBAAA,CAA0BE,YAAY,CAACH,OAAO,EAAED,aAAa,CAACK,WAAW,CAAC,CAAA;CAC3E,CAAC,CAAA;CAED,MAAMD,YAAY,GAAGA,CAACJ,aAAqB,EAAEC,OAAe,KAAK;CAAA,EAAA,IAAAK,sBAAA,CAAA;CAChE,EAAA,CAAAA,sBAAA,GAAAN,aAAa,CAACG,UAAU,KAAA,IAAA,IAAxBG,sBAAA,CAA0BF,YAAY,CAACH,OAAO,EAAED,aAAa,CAAC,CAAA;CAC/D,CAAC,CAAA;CAED,MAAMO,QAAQ,GAAGA,CAACP,aAAoC,EAAEC,OAA8B,KAAI;GAEzF,GAAE;CAAA,IAAA,IAAAO,QAAA,CAAA;CACDP,IAAAA,OAAO,IAAAO,QAAA,GAAGP,OAAO,KAAPO,IAAAA,GAAAA,KAAAA,CAAAA,GAAAA,QAAA,CAASC,sBAAsB,CAAA;KAEzC,IAAIT,aAAa,IAAIC,OAAO,EAAE;CAC7B,MAAA,OAAO,IAAI,CAAA;CACZ,KAAA;CAED,GAAC,QAAOA,OAAO,IAAIA,OAAO,CAACQ,sBAAsB,EAAA;CAEjD,EAAA,OAAO,KAAK,CAAA;CACb,CAAC,CAAA;CAEc,eAAyB,IAAA;GACvC,IAAIC,IAAI,GAAG,IAAI,CAAA;CACf,EAAA,IAAIA,IAAI,CAACC,QAAQ,CAACC,IAAI,KAAK,OAAO,EAAE,OAAA;CAEpC,EAAA,IAAIC,SAAS,GAAIH,IAAI,CAACI,IAAI,CAAA;CAC1B,EAAA,IAAIC,WAAW,GAAIL,IAAI,CAACM,MAAM,CAAA;GAC9B,IAAIC,QAAQ,GAAG,IAAI,CAAA;CAClB,EAAA,IAAIC,SAA2B,CAAA;;CAGhC;CACD;CACA;CACCR,EAAAA,IAAI,CAACS,IAAI,CAAC,OAAO,EAAC,gBAAgB,EAAC,MAAM;KAExC,IAAIC,gBAAgB,GAAGV,IAAI,CAACC,QAAQ,CAACU,MAAM,CAACC,IAAI,CAAA;KAEhDZ,IAAI,CAACC,QAAQ,CAACU,MAAM,CAACC,IAAI,GAAG,CAACC,IAAc,EAAEC,MAAyB,KAAK;CAC1E,MAAA,MAAMF,IAAI,GAAG7C,MAAM,CAAC2C,gBAAgB,CAACK,IAAI,CAACf,IAAI,EAAEa,IAAI,EAAEC,MAAM,CAAC,CAAY,CAAA;OACzEhC,OAAO,CAAC8B,IAAI,EAAC;CAAC,QAAA,WAAW,EAAC,MAAA;CAAM,OAAC,CAAC,CAAA;;CAGlC;OACA,MAAMI,SAAS,GAAIjE,GAAS,IAAK;CAChC,QAAA,IAAI,CAACwD,QAAQ,EAAGzD,cAAc,CAACC,GAAG,CAAC,CAAA;SACnCA,GAAG,CAACE,eAAe,EAAE,CAAA;QACrB,CAAA;OAED,MAAMgE,SAAS,GAAIlE,GAAS,IAAK;CAChCyD,QAAAA,SAAS,GAAGI,IAAI,CAAA;CAEhBM,QAAAA,UAAU,CAAC,MAAM;CAChBN,UAAAA,IAAI,CAACO,SAAS,CAACC,GAAG,CAAC,aAAa,CAAC,CAAA;UACjC,EAAE,CAAC,CAAC,CAAA;QAEL,CAAA;OAED,MAAMC,QAAQ,GAAItE,GAAS,IAAI;SAC9BA,GAAG,CAACD,cAAc,EAAE,CAAA;CACpB8D,QAAAA,IAAI,CAACO,SAAS,CAACC,GAAG,CAAC,cAAc,CAAC,CAAA;CAClCE,QAAAA,QAAQ,CAACV,IAAI,EAACJ,SAAS,CAAC,CAAA;QACxB,CAAA;OAED,MAAMe,SAAS,GAAGA,MAAM;CACvBX,QAAAA,IAAI,CAACO,SAAS,CAACK,MAAM,CAAC,cAAc,CAAC,CAAA;QACrC,CAAA;CAED,MAAA,MAAMF,QAAQ,GAAGA,CAACG,UAAkB,EAAEC,QAA0B,KAAK;SACpE,IAAIA,QAAQ,KAAKC,SAAS,EAAG,OAAA;CAE7B,QAAA,IAAI9B,QAAQ,CAAC6B,QAAQ,EAACd,IAAI,CAAC,EAAE;CAC5BvB,UAAAA,WAAW,CAACoC,UAAU,EAACC,QAAQ,CAAC,CAAA;CACjC,SAAC,MAAI;CACJhC,UAAAA,YAAY,CAAC+B,UAAU,EAACC,QAAQ,CAAC,CAAA;CAClC,SAAA;QACA,CAAA;OAED,MAAME,OAAO,GAAGA,MAAM;CAAA,QAAA,IAAAC,UAAA,CAAA;CACrBxD,QAAAA,QAAQ,CAACyD,gBAAgB,CAAC,eAAe,CAAC,CAAClE,OAAO,CAACmB,EAAE,IAAGA,EAAE,CAACoC,SAAS,CAACK,MAAM,CAAC,cAAc,CAAC,CAAC,CAAA;SAC5F,CAAAK,UAAA,GAAArB,SAAS,KAATqB,IAAAA,IAAAA,UAAA,CAAWV,SAAS,CAACK,MAAM,CAAC,aAAa,CAAC,CAAA;CAC1ChB,QAAAA,SAAS,GAAGmB,SAAS,CAAA;SAErB,IAAII,MAAe,GAAG,EAAE,CAAA;SACxB/B,IAAI,CAACgC,OAAO,CAACF,gBAAgB,CAAE,CAAa,YAAA,CAAA,CAAC,CAAClE,OAAO,CAAEmB,EAAU,IAAI;CACpE,UAAA,IAAwBA,EAAE,CAAEkD,OAAO,CAACC,KAAK,EAAE;CAC1C,YAAA,IAAIA,KAAK,GAAuBnD,EAAE,CAAEkD,OAAO,CAACC,KAAK,CAAA;CACjD,YAAA,IAAIA,KAAK,EAAE;CACVH,cAAAA,MAAM,CAACI,IAAI,CAACD,KAAK,CAAC,CAAA;CACnB,aAAA;CACD,WAAA;CACD,SAAC,CAAC,CAAA;CAEFlC,QAAAA,IAAI,CAACoC,QAAQ,CAACL,MAAM,CAAC,CAAA;QACrB,CAAA;CAGD7E,MAAAA,QAAQ,CAAC0D,IAAI,EAAC,WAAW,EAAEI,SAAS,CAAC,CAAA;CACrC9D,MAAAA,QAAQ,CAAC0D,IAAI,EAAC,WAAW,EAAEK,SAAS,CAAC,CAAA;CACrC/D,MAAAA,QAAQ,CAAC0D,IAAI,EAAC,WAAW,EAAES,QAAQ,CAAC,CAAA;CACpCnE,MAAAA,QAAQ,CAAC0D,IAAI,EAAC,UAAU,EAAES,QAAQ,CAAC,CAAA;CACnCnE,MAAAA,QAAQ,CAAC0D,IAAI,EAAC,WAAW,EAAEW,SAAS,CAAC,CAAA;CACrCrE,MAAAA,QAAQ,CAAC0D,IAAI,EAAC,SAAS,EAAEgB,OAAO,CAAC,CAAA;CAEjC,MAAA,OAAOhB,IAAI,CAAA;MACX,CAAA;CACF,GAAC,CAAC,CAAA;CAIFZ,EAAAA,IAAI,CAACS,IAAI,CAAC,SAAS,EAAC,MAAM,EAAC,MAAI;CAC9BF,IAAAA,QAAQ,GAAG,KAAK,CAAA;CAChB,IAAA,OAAOJ,SAAS,CAACY,IAAI,CAACf,IAAI,CAAC,CAAA;CAC5B,GAAC,CAAC,CAAA;CAEFA,EAAAA,IAAI,CAACS,IAAI,CAAC,SAAS,EAAC,QAAQ,EAAC,MAAI;CAChCF,IAAAA,QAAQ,GAAG,IAAI,CAAA;CACf,IAAA,OAAOF,WAAW,CAACU,IAAI,CAACf,IAAI,CAAC,CAAA;CAC9B,GAAC,CAAC,CAAA;CAEH;;;;;;;;","x_google_ignoreList":[1,2]}