/*!
* jQuery JavaScript Library v2.1.0
* http://jquery.com/
*
* Includes Sizzle.js
* http://sizzlejs.com/
*
* Copyright 2005, 2014 jQuery Foundation, Inc. and other contributors
* Released under the MIT license
* http://jquery.org/license
*
* Date: 2014-01-23T21:10Z
*/
(function (global, factory) {
if (typeof module === 'object' && typeof module.exports === 'object') {
// For CommonJS and CommonJS-like environments where a proper window is present,
// execute the factory and get jQuery
// For environments that do not inherently posses a window with a document
// (such as Node.js), expose a jQuery-making factory as module.exports
// This accentuates the need for the creation of a real window
// e.g. var jQuery = require("jquery")(window);
// See ticket #14549 for more info
module.exports = global.document
? factory(global, true)
: function (w) {
if (!w.document) {
throw new Error('jQuery requires a window with a document');
}
return factory(w);
};
} else {
factory(global);
}
// Pass this if window is not defined yet
}(typeof window !== 'undefined' ? window : this, (window, noGlobal) => {
// Can't do this because several apps including ASP.NET trace
// the stack via arguments.caller.callee and Firefox dies if
// you try to trace through "use strict" call chains. (#13335)
// Support: Firefox 18+
//
const arr = [];
const { slice } = arr;
const { concat } = arr;
const { push } = arr;
const { indexOf } = arr;
const class2type = {};
const { toString } = class2type;
const hasOwn = class2type.hasOwnProperty;
const { trim } = '';
const support = {};
const
// Use the correct document accordingly with window argument (sandbox)
{ document } = window;
const version = '2.1.0';
// Define a local copy of jQuery
var jQuery = function (selector, context) {
// The jQuery object is actually just the init constructor 'enhanced'
// Need init if jQuery is called (just allow error to be thrown if not included)
return new jQuery.fn.init(selector, context);
};
// Matches dashed string for camelizing
const rmsPrefix = /^-ms-/;
const rdashAlpha = /-([\da-z])/gi;
// Used by jQuery.camelCase as callback to replace()
const fcamelCase = function (all, letter) {
return letter.toUpperCase();
};
jQuery.fn = jQuery.prototype = {
// The current version of jQuery being used
jquery: version,
constructor: jQuery,
// Start with an empty selector
selector: '',
// The default length of a jQuery object is 0
length: 0,
toArray() {
return slice.call(this);
},
// Get the Nth element in the matched element set OR
// Get the whole matched element set as a clean array
get(num) {
return num != null
// Return a 'clean' array
? (num < 0 ? this[num + this.length] : this[num])
// Return just the object
: slice.call(this);
},
// Take an array of elements and push it onto the stack
// (returning the new matched element set)
pushStack(elems) {
// Build a new jQuery matched element set
const ret = jQuery.merge(this.constructor(), elems);
// Add the old object onto the stack (as a reference)
ret.prevObject = this;
ret.context = this.context;
// Return the newly-formed element set
return ret;
},
// Execute a callback for every element in the matched set.
// (You can seed the arguments with an array of args, but this is
// only used internally.)
each(callback, args) {
return jQuery.each(this, callback, args);
},
map(callback) {
return this.pushStack(jQuery.map(this, (elem, i) => callback.call(elem, i, elem)));
},
slice() {
return this.pushStack(slice.apply(this, arguments));
},
first() {
return this.eq(0);
},
last() {
return this.eq(-1);
},
eq(i) {
const len = this.length;
const j = +i + (i < 0 ? len : 0);
return this.pushStack(j >= 0 && j < len ? [this[j]] : []);
},
end() {
return this.prevObject || this.constructor(null);
},
// For internal use only.
// Behaves like an Array's method, not like a jQuery method.
push,
sort: arr.sort,
splice: arr.splice,
};
jQuery.extend = jQuery.fn.extend = function () {
let options; let name; let src; let copy; let copyIsArray; let clone;
let target = arguments[0] || {};
let i = 1;
const { length } = arguments;
let deep = false;
// Handle a deep copy situation
if (typeof target === 'boolean') {
deep = target;
// skip the boolean and the target
target = arguments[i] || {};
i++;
}
// Handle case when target is a string or something (possible in deep copy)
if (typeof target !== 'object' && !jQuery.isFunction(target)) {
target = {};
}
// extend jQuery itself if only one argument is passed
if (i === length) {
target = this;
i--;
}
for (; i < length; i++) {
// Only deal with non-null/undefined values
if ((options = arguments[i]) != null) {
// Extend the base object
for (name in options) {
src = target[name];
copy = options[name];
// Prevent never-ending loop
if (target === copy) {
continue;
}
// Recurse if we're merging plain objects or arrays
if (deep && copy && (jQuery.isPlainObject(copy) || (copyIsArray = jQuery.isArray(copy)))) {
if (copyIsArray) {
copyIsArray = false;
clone = src && jQuery.isArray(src) ? src : [];
} else {
clone = src && jQuery.isPlainObject(src) ? src : {};
}
// Never move original objects, clone them
target[name] = jQuery.extend(deep, clone, copy);
// Don't bring in undefined values
} else if (copy !== undefined) {
target[name] = copy;
}
}
}
}
// Return the modified object
return target;
};
jQuery.extend({
// Unique for each copy of jQuery on the page
expando: `jQuery${(version + Math.random()).replace(/\D/g, '')}`,
// Assume jQuery is ready without the ready module
isReady: true,
error(msg) {
throw new Error(msg);
},
noop() {},
// See test/unit/core.js for details concerning isFunction.
// Since version 1.3, DOM methods and functions like alert
// aren't supported. They return false on IE (#2968).
isFunction(obj) {
return jQuery.type(obj) === 'function';
},
isArray: Array.isArray,
isWindow(obj) {
return obj != null && obj === obj.window;
},
isNumeric(obj) {
// parseFloat NaNs numeric-cast false positives (null|true|false|"")
// ...but misinterprets leading-number strings, particularly hex literals ("0x...")
// subtraction forces infinities to NaN
return obj - parseFloat(obj) >= 0;
},
isPlainObject(obj) {
// Not plain objects:
// - Any object or value whose internal [[Class]] property is not "[object Object]"
// - DOM nodes
// - window
if (jQuery.type(obj) !== 'object' || obj.nodeType || jQuery.isWindow(obj)) {
return false;
}
// Support: Firefox <20
// The try/catch suppresses exceptions thrown when attempting to access
// the "constructor" property of certain host objects, ie. |window.location|
// https://bugzilla.mozilla.org/show_bug.cgi?id=814622
try {
if (obj.constructor
&& !hasOwn.call(obj.constructor.prototype, 'isPrototypeOf')) {
return false;
}
} catch (e) {
return false;
}
// If the function hasn't returned already, we're confident that
// |obj| is a plain object, created by {} or constructed with new Object
return true;
},
isEmptyObject(obj) {
let name;
for (name in obj) {
return false;
}
return true;
},
type(obj) {
if (obj == null) {
return `${obj}`;
}
// Support: Android < 4.0, iOS < 6 (functionish RegExp)
return typeof obj === 'object' || typeof obj === 'function'
? class2type[toString.call(obj)] || 'object'
: typeof obj;
},
// Evaluates a script in a global context
globalEval(code) {
let script;
const indirect = eval;
code = jQuery.trim(code);
if (code) {
// If the code includes a valid, prologue position
// strict mode pragma, execute code by injecting a
// script tag into the document.
if (code.indexOf('use strict') === 1) {
script = document.createElement('script');
script.text = code;
document.head.appendChild(script).parentNode.removeChild(script);
} else {
// Otherwise, avoid the DOM node creation, insertion
// and removal by using an indirect global eval
indirect(code);
}
}
},
// Convert dashed to camelCase; used by the css and data modules
// Microsoft forgot to hump their vendor prefix (#9572)
camelCase(string) {
return string.replace(rmsPrefix, 'ms-').replace(rdashAlpha, fcamelCase);
},
nodeName(elem, name) {
return elem.nodeName && elem.nodeName.toLowerCase() === name.toLowerCase();
},
// args is for internal usage only
each(obj, callback, args) {
let value;
let i = 0;
const { length } = obj;
const isArray = isArraylike(obj);
if (args) {
if (isArray) {
for (; i < length; i++) {
value = callback.apply(obj[i], args);
if (value === false) {
break;
}
}
} else {
for (i in obj) {
value = callback.apply(obj[i], args);
if (value === false) {
break;
}
}
}
// A special, fast, case for the most common use of each
} else if (isArray) {
for (; i < length; i++) {
value = callback.call(obj[i], i, obj[i]);
if (value === false) {
break;
}
}
} else {
for (i in obj) {
value = callback.call(obj[i], i, obj[i]);
if (value === false) {
break;
}
}
}
return obj;
},
trim(text) {
return text == null ? '' : trim.call(text);
},
// results is for internal usage only
makeArray(arr, results) {
const ret = results || [];
if (arr != null) {
if (isArraylike(Object(arr))) {
jQuery.merge(ret,
typeof arr === 'string'
? [arr] : arr);
} else {
push.call(ret, arr);
}
}
return ret;
},
inArray(elem, arr, i) {
return arr == null ? -1 : indexOf.call(arr, elem, i);
},
merge(first, second) {
const len = +second.length;
let j = 0;
let i = first.length;
for (; j < len; j++) {
first[i++] = second[j];
}
first.length = i;
return first;
},
grep(elems, callback, invert) {
let callbackInverse;
const matches = [];
let i = 0;
const { length } = elems;
const callbackExpect = !invert;
// Go through the array, only saving the items
// that pass the validator function
for (; i < length; i++) {
callbackInverse = !callback(elems[i], i);
if (callbackInverse !== callbackExpect) {
matches.push(elems[i]);
}
}
return matches;
},
// arg is for internal usage only
map(elems, callback, arg) {
let value;
let i = 0;
const { length } = elems;
const isArray = isArraylike(elems);
const ret = [];
// Go through the array, translating each of the items to their new values
if (isArray) {
for (; i < length; i++) {
value = callback(elems[i], i, arg);
if (value != null) {
ret.push(value);
}
}
// Go through every key on the object,
} else {
for (i in elems) {
value = callback(elems[i], i, arg);
if (value != null) {
ret.push(value);
}
}
}
// Flatten any nested arrays
return concat.apply([], ret);
},
// A global GUID counter for objects
guid: 1,
// Bind a function to a context, optionally partially applying any
// arguments.
proxy(fn, context) {
let tmp; let args; let
proxy;
if (typeof context === 'string') {
tmp = fn[context];
context = fn;
fn = tmp;
}
// Quick check to determine if target is callable, in the spec
// this throws a TypeError, but we will just return undefined.
if (!jQuery.isFunction(fn)) {
return undefined;
}
// Simulated bind
args = slice.call(arguments, 2);
proxy = function () {
return fn.apply(context || this, args.concat(slice.call(arguments)));
};
// Set the guid of unique handler to the same of original handler, so it can be removed
proxy.guid = fn.guid = fn.guid || jQuery.guid++;
return proxy;
},
now: Date.now,
// jQuery.support is not used in Core but other projects attach their
// properties to it so it needs to exist.
support,
});
// Populate the class2type map
jQuery.each('Boolean Number String Function Array Date RegExp Object Error'.split(' '), (i, name) => {
class2type[`[object ${name}]`] = name.toLowerCase();
});
function isArraylike(obj) {
const { length } = obj;
const type = jQuery.type(obj);
if (type === 'function' || jQuery.isWindow(obj)) {
return false;
}
if (obj.nodeType === 1 && length) {
return true;
}
return type === 'array' || length === 0
|| typeof length === 'number' && length > 0 && (length - 1) in obj;
}
const Sizzle =
/*!
* Sizzle CSS Selector Engine v1.10.16
* http://sizzlejs.com/
*
* Copyright 2013 jQuery Foundation, Inc. and other contributors
* Released under the MIT license
* http://jquery.org/license
*
* Date: 2014-01-13
*/
(function (window) {
let i;
let support;
let Expr;
let getText;
let isXML;
let compile;
let outermostContext;
let sortInput;
let hasDuplicate;
// Local document vars
let setDocument;
let document;
let docElem;
let documentIsHTML;
let rbuggyQSA;
let rbuggyMatches;
let matches;
let contains;
// Instance-specific data
const expando = `sizzle${-(new Date())}`;
const preferredDoc = window.document;
let dirruns = 0;
let done = 0;
const classCache = createCache();
const tokenCache = createCache();
const compilerCache = createCache();
let sortOrder = function (a, b) {
if (a === b) {
hasDuplicate = true;
}
return 0;
};
// General-purpose constants
const strundefined = typeof undefined;
const MAX_NEGATIVE = 1 << 31;
// Instance methods
const hasOwn = ({}).hasOwnProperty;
let arr = [];
const { pop } = arr;
const push_native = arr.push;
let { push } = arr;
const { slice } = arr;
// Use a stripped-down indexOf if we can't use a native one
const indexOf = arr.indexOf || function (elem) {
let i = 0;
const len = this.length;
for (; i < len; i++) {
if (this[i] === elem) {
return i;
}
}
return -1;
};
const booleans = 'checked|selected|async|autofocus|autoplay|controls|defer|disabled|hidden|ismap|loop|multiple|open|readonly|required|scoped';
// Regular expressions
// Whitespace characters http://www.w3.org/TR/css3-selectors/#whitespace
const whitespace = '[\\x20\\t\\r\\n\\f]';
// http://www.w3.org/TR/css3-syntax/#characters
const characterEncoding = '(?:\\\\.|[\\w-]|[^\\x00-\\xa0])+';
// Loosely modeled on CSS identifier characters
// An unquoted value should be a CSS identifier http://www.w3.org/TR/css3-selectors/#attribute-selectors
// Proper syntax: http://www.w3.org/TR/CSS21/syndata.html#value-def-identifier
const identifier = characterEncoding.replace('w', 'w#');
// Acceptable operators http://www.w3.org/TR/selectors/#attribute-selectors
const attributes = `\\[${whitespace}*(${characterEncoding})${whitespace
}*(?:([*^$|!~]?=)${whitespace}*(?:(['"])((?:\\\\.|[^\\\\])*?)\\3|(${identifier})|)|)${whitespace}*\\]`;
// Prefer arguments quoted,
// then not containing pseudos/brackets,
// then attribute selectors/non-parenthetical expressions,
// then anything else
// These preferences are here to reduce the number of selectors
// needing tokenize in the PSEUDO preFilter
const pseudos = `:(${characterEncoding})(?:\\(((['"])((?:\\\\.|[^\\\\])*?)\\3|((?:\\\\.|[^\\\\()[\\]]|${attributes.replace(3, 8)})*)|.*)\\)|)`;
// Leading and non-escaped trailing whitespace, capturing some non-whitespace characters preceding the latter
const rtrim = new RegExp(`^${whitespace}+|((?:^|[^\\\\])(?:\\\\.)*)${whitespace}+$`, 'g');
const rcomma = new RegExp(`^${whitespace}*,${whitespace}*`);
const rcombinators = new RegExp(`^${whitespace}*([>+~]|${whitespace})${whitespace}*`);
const rattributeQuotes = new RegExp(`=${whitespace}*([^\\]'"]*?)${whitespace}*\\]`, 'g');
const rpseudo = new RegExp(pseudos);
const ridentifier = new RegExp(`^${identifier}$`);
const matchExpr = {
ID: new RegExp(`^#(${characterEncoding})`),
CLASS: new RegExp(`^\\.(${characterEncoding})`),
TAG: new RegExp(`^(${characterEncoding.replace('w', 'w*')})`),
ATTR: new RegExp(`^${attributes}`),
PSEUDO: new RegExp(`^${pseudos}`),
CHILD: new RegExp(`^:(only|first|last|nth|nth-last)-(child|of-type)(?:\\(${whitespace
}*(even|odd|(([+-]|)(\\d*)n|)${whitespace}*(?:([+-]|)${whitespace
}*(\\d+)|))${whitespace}*\\)|)`, 'i'),
bool: new RegExp(`^(?:${booleans})$`, 'i'),
// For use in libraries implementing .is()
// We use this for POS matching in `select`
needsContext: new RegExp(`^${whitespace}*[>+~]|:(even|odd|eq|gt|lt|nth|first|last)(?:\\(${
whitespace}*((?:-\\d)?\\d*)${whitespace}*\\)|)(?=[^-]|$)`, 'i'),
};
const rinputs = /^(?:input|select|textarea|button)$/i;
const rheader = /^h\d$/i;
const rnative = /^[^{]+\{\s*\[native \w/;
// Easily-parseable/retrievable ID or TAG or CLASS selectors
const rquickExpr = /^(?:#([\w-]+)|(\w+)|\.([\w-]+))$/;
const rsibling = /[+~]/;
const rescape = /'|\\/g;
// CSS escapes http://www.w3.org/TR/CSS21/syndata.html#escaped-characters
const runescape = new RegExp(`\\\\([\\da-f]{1,6}${whitespace}?|(${whitespace})|.)`, 'ig');
const funescape = function (_, escaped, escapedWhitespace) {
const high = `0x${escaped}` - 0x10000;
// NaN means non-codepoint
// Support: Firefox
// Workaround erroneous numeric interpretation of +"0x"
return high !== high || escapedWhitespace
? escaped
: high < 0
// BMP codepoint
? String.fromCharCode(high + 0x10000)
// Supplemental Plane codepoint (surrogate pair)
: String.fromCharCode(high >> 10 | 0xD800, high & 0x3FF | 0xDC00);
};
// Optimize for push.apply( _, NodeList )
try {
push.apply(
(arr = slice.call(preferredDoc.childNodes)),
preferredDoc.childNodes,
);
// Support: Android<4.0
// Detect silently failing push.apply
arr[preferredDoc.childNodes.length].nodeType;
} catch (e) {
push = {
apply: arr.length
// Leverage slice if possible
? function (target, els) {
push_native.apply(target, slice.call(els));
}
// Support: IE<9
// Otherwise append directly
: function (target, els) {
let j = target.length;
let i = 0;
// Can't trust NodeList.length
while ((target[j++] = els[i++])) {}
target.length = j - 1;
},
};
}
function Sizzle(selector, context, results, seed) {
let match; let elem; let m; let nodeType;
// QSA vars
let i; let groups; let old; let nid; let newContext; let
newSelector;
if ((context ? context.ownerDocument || context : preferredDoc) !== document) {
setDocument(context);
}
context = context || document;
results = results || [];
if (!selector || typeof selector !== 'string') {
return results;
}
if ((nodeType = context.nodeType) !== 1 && nodeType !== 9) {
return [];
}
if (documentIsHTML && !seed) {
// Shortcuts
if ((match = rquickExpr.exec(selector))) {
// Speed-up: Sizzle("#ID")
if ((m = match[1])) {
if (nodeType === 9) {
elem = context.getElementById(m);
// Check parentNode to catch when Blackberry 4.6 returns
// nodes that are no longer in the document (jQuery #6963)
if (elem && elem.parentNode) {
// Handle the case where IE, Opera, and Webkit return items
// by name instead of ID
if (elem.id === m) {
results.push(elem);
return results;
}
} else {
return results;
}
} else {
// Context is not a document
if (context.ownerDocument && (elem = context.ownerDocument.getElementById(m))
&& contains(context, elem) && elem.id === m) {
results.push(elem);
return results;
}
}
// Speed-up: Sizzle("TAG")
} else if (match[2]) {
push.apply(results, context.getElementsByTagName(selector));
return results;
// Speed-up: Sizzle(".CLASS")
} else if ((m = match[3]) && support.getElementsByClassName && context.getElementsByClassName) {
push.apply(results, context.getElementsByClassName(m));
return results;
}
}
// QSA path
if (support.qsa && (!rbuggyQSA || !rbuggyQSA.test(selector))) {
nid = old = expando;
newContext = context;
newSelector = nodeType === 9 && selector;
// qSA works strangely on Element-rooted queries
// We can work around this by specifying an extra ID on the root
// and working up from there (Thanks to Andrew Dupont for the technique)
// IE 8 doesn't work on object elements
if (nodeType === 1 && context.nodeName.toLowerCase() !== 'object') {
groups = tokenize(selector);
if ((old = context.getAttribute('id'))) {
nid = old.replace(rescape, '\\$&');
} else {
context.setAttribute('id', nid);
}
nid = `[id='${nid}'] `;
i = groups.length;
while (i--) {
groups[i] = nid + toSelector(groups[i]);
}
newContext = rsibling.test(selector) && testContext(context.parentNode) || context;
newSelector = groups.join(',');
}
if (newSelector) {
try {
push.apply(results,
newContext.querySelectorAll(newSelector));
return results;
} catch (qsaError) {
} finally {
if (!old) {
context.removeAttribute('id');
}
}
}
}
}
// All others
return select(selector.replace(rtrim, '$1'), context, results, seed);
}
/**
* Create key-value caches of limited size
* @returns {Function(string, Object)} Returns the Object data after storing it on itself with
* property name the (space-suffixed) string and (if the cache is larger than Expr.cacheLength)
* deleting the oldest entry
*/
function createCache() {
const keys = [];
function cache(key, value) {
// Use (key + " ") to avoid collision with native prototype properties (see Issue #157)
if (keys.push(`${key} `) > Expr.cacheLength) {
// Only keep the most recent entries
delete cache[keys.shift()];
}
return (cache[`${key} `] = value);
}
return cache;
}
/**
* Mark a function for special use by Sizzle
* @param {Function} fn The function to mark
*/
function markFunction(fn) {
fn[expando] = true;
return fn;
}
/**
* Support testing using an element
* @param {Function} fn Passed the created div and expects a boolean result
*/
function assert(fn) {
let div = document.createElement('div');
try {
return !!fn(div);
} catch (e) {
return false;
} finally {
// Remove from its parent by default
if (div.parentNode) {
div.parentNode.removeChild(div);
}
// release memory in IE
div = null;
}
}
/**
* Adds the same handler for all of the specified attrs
* @param {String} attrs Pipe-separated list of attributes
* @param {Function} handler The method that will be applied
*/
function addHandle(attrs, handler) {
const arr = attrs.split('|');
let i = attrs.length;
while (i--) {
Expr.attrHandle[arr[i]] = handler;
}
}
/**
* Checks document order of two siblings
* @param {Element} a
* @param {Element} b
* @returns {Number} Returns less than 0 if a precedes b, greater than 0 if a follows b
*/
function siblingCheck(a, b) {
let cur = b && a;
const diff = cur && a.nodeType === 1 && b.nodeType === 1
&& (~b.sourceIndex || MAX_NEGATIVE)
- (~a.sourceIndex || MAX_NEGATIVE);
// Use IE sourceIndex if available on both nodes
if (diff) {
return diff;
}
// Check if b follows a
if (cur) {
while ((cur = cur.nextSibling)) {
if (cur === b) {
return -1;
}
}
}
return a ? 1 : -1;
}
/**
* Returns a function to use in pseudos for input types
* @param {String} type
*/
function createInputPseudo(type) {
return function (elem) {
const name = elem.nodeName.toLowerCase();
return name === 'input' && elem.type === type;
};
}
/**
* Returns a function to use in pseudos for buttons
* @param {String} type
*/
function createButtonPseudo(type) {
return function (elem) {
const name = elem.nodeName.toLowerCase();
return (name === 'input' || name === 'button') && elem.type === type;
};
}
/**
* Returns a function to use in pseudos for positionals
* @param {Function} fn
*/
function createPositionalPseudo(fn) {
return markFunction((argument) => {
argument = +argument;
return markFunction((seed, matches) => {
let j;
const matchIndexes = fn([], seed.length, argument);
let i = matchIndexes.length;
// Match elements found at the specified indexes
while (i--) {
if (seed[(j = matchIndexes[i])]) {
seed[j] = !(matches[j] = seed[j]);
}
}
});
});
}
/**
* Checks a node for validity as a Sizzle context
* @param {Element|Object=} context
* @returns {Element|Object|Boolean} The input node if acceptable, otherwise a falsy value
*/
function testContext(context) {
return context && typeof context.getElementsByTagName !== strundefined && context;
}
// Expose support vars for convenience
support = Sizzle.support = {};
/**
* Detects XML nodes
* @param {Element|Object} elem An element or a document
* @returns {Boolean} True iff elem is a non-HTML XML node
*/
isXML = Sizzle.isXML = function (elem) {
// documentElement is verified for cases where it doesn't yet exist
// (such as loading iframes in IE - #4833)
const documentElement = elem && (elem.ownerDocument || elem).documentElement;
return documentElement ? documentElement.nodeName !== 'HTML' : false;
};
/**
* Sets document-related variables once based on the current document
* @param {Element|Object} [doc] An element or document object to use to set the document
* @returns {Object} Returns the current document
*/
setDocument = Sizzle.setDocument = function (node) {
let hasCompare;
const doc = node ? node.ownerDocument || node : preferredDoc;
const parent = doc.defaultView;
// If no document and documentElement is available, return
if (doc === document || doc.nodeType !== 9 || !doc.documentElement) {
return document;
}
// Set our document
document = doc;
docElem = doc.documentElement;
// Support tests
documentIsHTML = !isXML(doc);
// Support: IE>8
// If iframe document is assigned to "document" variable and if iframe has been reloaded,
// IE will throw "permission denied" error when accessing "document" variable, see jQuery #13936
// IE6-8 do not support the defaultView property so parent will be undefined
if (parent && parent !== parent.top) {
// IE11 does not have attachEvent, so all must suffer
if (parent.addEventListener) {
parent.addEventListener('unload', () => {
setDocument();
}, false);
} else if (parent.attachEvent) {
parent.attachEvent('onunload', () => {
setDocument();
});
}
}
/* Attributes
---------------------------------------------------------------------- */
// Support: IE<8
// Verify that getAttribute really returns attributes and not properties (excepting IE8 booleans)
support.attributes = assert((div) => {
div.className = 'i';
return !div.getAttribute('className');
});
/* getElement(s)By*
---------------------------------------------------------------------- */
// Check if getElementsByTagName("*") returns only elements
support.getElementsByTagName = assert((div) => {
div.appendChild(doc.createComment(''));
return !div.getElementsByTagName('*').length;
});
// Check if getElementsByClassName can be trusted
support.getElementsByClassName = rnative.test(doc.getElementsByClassName) && assert((div) => {
div.innerHTML = "
";
// Support: Safari<4
// Catch class over-caching
div.firstChild.className = 'i';
// Support: Opera<10
// Catch gEBCN failure to find non-leading classes
return div.getElementsByClassName('i').length === 2;
});
// Support: IE<10
// Check if getElementById returns elements by name
// The broken getElementById methods don't pick up programatically-set names,
// so use a roundabout getElementsByName test
support.getById = assert((div) => {
docElem.appendChild(div).id = expando;
return !doc.getElementsByName || !doc.getElementsByName(expando).length;
});
// ID find and filter
if (support.getById) {
Expr.find.ID = function (id, context) {
if (typeof context.getElementById !== strundefined && documentIsHTML) {
const m = context.getElementById(id);
// Check parentNode to catch when Blackberry 4.6 returns
// nodes that are no longer in the document #6963
return m && m.parentNode ? [m] : [];
}
};
Expr.filter.ID = function (id) {
const attrId = id.replace(runescape, funescape);
return function (elem) {
return elem.getAttribute('id') === attrId;
};
};
} else {
// Support: IE6/7
// getElementById is not reliable as a find shortcut
delete Expr.find.ID;
Expr.filter.ID = function (id) {
const attrId = id.replace(runescape, funescape);
return function (elem) {
const node = typeof elem.getAttributeNode !== strundefined && elem.getAttributeNode('id');
return node && node.value === attrId;
};
};
}
// Tag
Expr.find.TAG = support.getElementsByTagName
? function (tag, context) {
if (typeof context.getElementsByTagName !== strundefined) {
return context.getElementsByTagName(tag);
}
}
: function (tag, context) {
let elem;
const tmp = [];
let i = 0;
const results = context.getElementsByTagName(tag);
// Filter out possible comments
if (tag === '*') {
while ((elem = results[i++])) {
if (elem.nodeType === 1) {
tmp.push(elem);
}
}
return tmp;
}
return results;
};
// Class
Expr.find.CLASS = support.getElementsByClassName && function (className, context) {
if (typeof context.getElementsByClassName !== strundefined && documentIsHTML) {
return context.getElementsByClassName(className);
}
};
/* QSA/matchesSelector
---------------------------------------------------------------------- */
// QSA and matchesSelector support
// matchesSelector(:active) reports false when true (IE9/Opera 11.5)
rbuggyMatches = [];
// qSa(:focus) reports false when true (Chrome 21)
// We allow this because of a bug in IE8/9 that throws an error
// whenever `document.activeElement` is accessed on an iframe
// So, we allow :focus to pass through QSA all the time to avoid the IE error
// See http://bugs.jquery.com/ticket/13378
rbuggyQSA = [];
if ((support.qsa = rnative.test(doc.querySelectorAll))) {
// Build QSA regex
// Regex strategy adopted from Diego Perini
assert((div) => {
// Select is set to empty string on purpose
// This is to test IE's treatment of not explicitly
// setting a boolean content attribute,
// since its presence should be enough
// http://bugs.jquery.com/ticket/12359
div.innerHTML = "";
// Support: IE8, Opera 10-12
// Nothing should be selected when empty strings follow ^= or $= or *=
if (div.querySelectorAll("[t^='']").length) {
rbuggyQSA.push(`[*^$]=${whitespace}*(?:''|"")`);
}
// Support: IE8
// Boolean attributes and "value" are not treated correctly
if (!div.querySelectorAll('[selected]').length) {
rbuggyQSA.push(`\\[${whitespace}*(?:value|${booleans})`);
}
// Webkit/Opera - :checked should return selected option elements
// http://www.w3.org/TR/2011/REC-css3-selectors-20110929/#checked
// IE8 throws error here and will not see later tests
if (!div.querySelectorAll(':checked').length) {
rbuggyQSA.push(':checked');
}
});
assert((div) => {
// Support: Windows 8 Native Apps
// The type and name attributes are restricted during .innerHTML assignment
const input = doc.createElement('input');
input.setAttribute('type', 'hidden');
div.appendChild(input).setAttribute('name', 'D');
// Support: IE8
// Enforce case-sensitivity of name attribute
if (div.querySelectorAll('[name=d]').length) {
rbuggyQSA.push(`name${whitespace}*[*^$|!~]?=`);
}
// FF 3.5 - :enabled/:disabled and hidden elements (hidden elements are still enabled)
// IE8 throws error here and will not see later tests
if (!div.querySelectorAll(':enabled').length) {
rbuggyQSA.push(':enabled', ':disabled');
}
// Opera 10-11 does not throw on post-comma invalid pseudos
div.querySelectorAll('*,:x');
rbuggyQSA.push(',.*:');
});
}
if ((support.matchesSelector = rnative.test((matches = docElem.webkitMatchesSelector
|| docElem.mozMatchesSelector
|| docElem.oMatchesSelector
|| docElem.msMatchesSelector)))) {
assert((div) => {
// Check to see if it's possible to do matchesSelector
// on a disconnected node (IE 9)
support.disconnectedMatch = matches.call(div, 'div');
// This should fail with an exception
// Gecko does not error, returns false instead
matches.call(div, "[s!='']:x");
rbuggyMatches.push('!=', pseudos);
});
}
rbuggyQSA = rbuggyQSA.length && new RegExp(rbuggyQSA.join('|'));
rbuggyMatches = rbuggyMatches.length && new RegExp(rbuggyMatches.join('|'));
/* Contains
---------------------------------------------------------------------- */
hasCompare = rnative.test(docElem.compareDocumentPosition);
// Element contains another
// Purposefully does not implement inclusive descendent
// As in, an element does not contain itself
contains = hasCompare || rnative.test(docElem.contains)
? function (a, b) {
const adown = a.nodeType === 9 ? a.documentElement : a;
const bup = b && b.parentNode;
return a === bup || !!(bup && bup.nodeType === 1 && (
adown.contains
? adown.contains(bup)
: a.compareDocumentPosition && a.compareDocumentPosition(bup) & 16
));
}
: function (a, b) {
if (b) {
while ((b = b.parentNode)) {
if (b === a) {
return true;
}
}
}
return false;
};
/* Sorting
---------------------------------------------------------------------- */
// Document order sorting
sortOrder = hasCompare
? function (a, b) {
// Flag for duplicate removal
if (a === b) {
hasDuplicate = true;
return 0;
}
// Sort on method existence if only one input has compareDocumentPosition
let compare = !a.compareDocumentPosition - !b.compareDocumentPosition;
if (compare) {
return compare;
}
// Calculate position if both inputs belong to the same document
compare = (a.ownerDocument || a) === (b.ownerDocument || b)
? a.compareDocumentPosition(b)
// Otherwise we know they are disconnected
: 1;
// Disconnected nodes
if (compare & 1
|| (!support.sortDetached && b.compareDocumentPosition(a) === compare)) {
// Choose the first element that is related to our preferred document
if (a === doc || a.ownerDocument === preferredDoc && contains(preferredDoc, a)) {
return -1;
}
if (b === doc || b.ownerDocument === preferredDoc && contains(preferredDoc, b)) {
return 1;
}
// Maintain original order
return sortInput
? (indexOf.call(sortInput, a) - indexOf.call(sortInput, b))
: 0;
}
return compare & 4 ? -1 : 1;
}
: function (a, b) {
// Exit early if the nodes are identical
if (a === b) {
hasDuplicate = true;
return 0;
}
let cur;
let i = 0;
const aup = a.parentNode;
const bup = b.parentNode;
const ap = [a];
const bp = [b];
// Parentless nodes are either documents or disconnected
if (!aup || !bup) {
return a === doc ? -1
: b === doc ? 1
: aup ? -1
: bup ? 1
: sortInput
? (indexOf.call(sortInput, a) - indexOf.call(sortInput, b))
: 0;
// If the nodes are siblings, we can do a quick check
} if (aup === bup) {
return siblingCheck(a, b);
}
// Otherwise we need full lists of their ancestors for comparison
cur = a;
while ((cur = cur.parentNode)) {
ap.unshift(cur);
}
cur = b;
while ((cur = cur.parentNode)) {
bp.unshift(cur);
}
// Walk down the tree looking for a discrepancy
while (ap[i] === bp[i]) {
i++;
}
return i
// Do a sibling check if the nodes have a common ancestor
? siblingCheck(ap[i], bp[i])
// Otherwise nodes in our document sort first
: ap[i] === preferredDoc ? -1
: bp[i] === preferredDoc ? 1
: 0;
};
return doc;
};
Sizzle.matches = function (expr, elements) {
return Sizzle(expr, null, null, elements);
};
Sizzle.matchesSelector = function (elem, expr) {
// Set document vars if needed
if ((elem.ownerDocument || elem) !== document) {
setDocument(elem);
}
// Make sure that attribute selectors are quoted
expr = expr.replace(rattributeQuotes, "='$1']");
if (support.matchesSelector && documentIsHTML
&& (!rbuggyMatches || !rbuggyMatches.test(expr))
&& (!rbuggyQSA || !rbuggyQSA.test(expr))) {
try {
const ret = matches.call(elem, expr);
// IE 9's matchesSelector returns false on disconnected nodes
if (ret || support.disconnectedMatch
// As well, disconnected nodes are said to be in a document
// fragment in IE 9
|| elem.document && elem.document.nodeType !== 11) {
return ret;
}
} catch (e) {}
}
return Sizzle(expr, document, null, [elem]).length > 0;
};
Sizzle.contains = function (context, elem) {
// Set document vars if needed
if ((context.ownerDocument || context) !== document) {
setDocument(context);
}
return contains(context, elem);
};
Sizzle.attr = function (elem, name) {
// Set document vars if needed
if ((elem.ownerDocument || elem) !== document) {
setDocument(elem);
}
const fn = Expr.attrHandle[name.toLowerCase()];
// Don't get fooled by Object.prototype properties (jQuery #13807)
let val = fn && hasOwn.call(Expr.attrHandle, name.toLowerCase())
? fn(elem, name, !documentIsHTML)
: undefined;
return val !== undefined
? val
: support.attributes || !documentIsHTML
? elem.getAttribute(name)
: (val = elem.getAttributeNode(name)) && val.specified
? val.value
: null;
};
Sizzle.error = function (msg) {
throw new Error(`Syntax error, unrecognized expression: ${msg}`);
};
/**
* Document sorting and removing duplicates
* @param {ArrayLike} results
*/
Sizzle.uniqueSort = function (results) {
let elem;
const duplicates = [];
let j = 0;
let i = 0;
// Unless we *know* we can detect duplicates, assume their presence
hasDuplicate = !support.detectDuplicates;
sortInput = !support.sortStable && results.slice(0);
results.sort(sortOrder);
if (hasDuplicate) {
while ((elem = results[i++])) {
if (elem === results[i]) {
j = duplicates.push(i);
}
}
while (j--) {
results.splice(duplicates[j], 1);
}
}
// Clear input after sorting to release objects
// See https://github.com/jquery/sizzle/pull/225
sortInput = null;
return results;
};
/**
* Utility function for retrieving the text value of an array of DOM nodes
* @param {Array|Element} elem
*/
getText = Sizzle.getText = function (elem) {
let node;
let ret = '';
let i = 0;
const { nodeType } = elem;
if (!nodeType) {
// If no nodeType, this is expected to be an array
while ((node = elem[i++])) {
// Do not traverse comment nodes
ret += getText(node);
}
} else if (nodeType === 1 || nodeType === 9 || nodeType === 11) {
// Use textContent for elements
// innerText usage removed for consistency of new lines (jQuery #11153)
if (typeof elem.textContent === 'string') {
return elem.textContent;
}
// Traverse its children
for (elem = elem.firstChild; elem; elem = elem.nextSibling) {
ret += getText(elem);
}
} else if (nodeType === 3 || nodeType === 4) {
return elem.nodeValue;
}
// Do not include comment or processing instruction nodes
return ret;
};
Expr = Sizzle.selectors = {
// Can be adjusted by the user
cacheLength: 50,
createPseudo: markFunction,
match: matchExpr,
attrHandle: {},
find: {},
relative: {
'>': { dir: 'parentNode', first: true },
' ': { dir: 'parentNode' },
'+': { dir: 'previousSibling', first: true },
'~': { dir: 'previousSibling' },
},
preFilter: {
ATTR(match) {
match[1] = match[1].replace(runescape, funescape);
// Move the given value to match[3] whether quoted or unquoted
match[3] = (match[4] || match[5] || '').replace(runescape, funescape);
if (match[2] === '~=') {
match[3] = ` ${match[3]} `;
}
return match.slice(0, 4);
},
CHILD(match) {
/* matches from matchExpr["CHILD"]
1 type (only|nth|...)
2 what (child|of-type)
3 argument (even|odd|\d*|\d*n([+-]\d+)?|...)
4 xn-component of xn+y argument ([+-]?\d*n|)
5 sign of xn-component
6 x of xn-component
7 sign of y-component
8 y of y-component
*/
match[1] = match[1].toLowerCase();
if (match[1].slice(0, 3) === 'nth') {
// nth-* requires argument
if (!match[3]) {
Sizzle.error(match[0]);
}
// numeric x and y parameters for Expr.filter.CHILD
// remember that false/true cast respectively to 0/1
match[4] = +(match[4] ? match[5] + (match[6] || 1) : 2 * (match[3] === 'even' || match[3] === 'odd'));
match[5] = +((match[7] + match[8]) || match[3] === 'odd');
// other types prohibit arguments
} else if (match[3]) {
Sizzle.error(match[0]);
}
return match;
},
PSEUDO(match) {
let excess;
const unquoted = !match[5] && match[2];
if (matchExpr.CHILD.test(match[0])) {
return null;
}
// Accept quoted arguments as-is
if (match[3] && match[4] !== undefined) {
match[2] = match[4];
// Strip excess characters from unquoted arguments
} else if (unquoted && rpseudo.test(unquoted)
// Get excess from tokenize (recursively)
&& (excess = tokenize(unquoted, true))
// advance to the next closing parenthesis
&& (excess = unquoted.indexOf(')', unquoted.length - excess) - unquoted.length)) {
// excess is a negative index
match[0] = match[0].slice(0, excess);
match[2] = unquoted.slice(0, excess);
}
// Return only captures needed by the pseudo filter method (type and argument)
return match.slice(0, 3);
},
},
filter: {
TAG(nodeNameSelector) {
const nodeName = nodeNameSelector.replace(runescape, funescape).toLowerCase();
return nodeNameSelector === '*'
? function () { return true; }
: function (elem) {
return elem.nodeName && elem.nodeName.toLowerCase() === nodeName;
};
},
CLASS(className) {
let pattern = classCache[`${className} `];
return pattern
|| (pattern = new RegExp(`(^|${whitespace})${className}(${whitespace}|$)`))
&& classCache(className, (elem) => pattern.test(typeof elem.className === 'string' && elem.className || typeof elem.getAttribute !== strundefined && elem.getAttribute('class') || ''));
},
ATTR(name, operator, check) {
return function (elem) {
let result = Sizzle.attr(elem, name);
if (result == null) {
return operator === '!=';
}
if (!operator) {
return true;
}
result += '';
return operator === '=' ? result === check
: operator === '!=' ? result !== check
: operator === '^=' ? check && result.indexOf(check) === 0
: operator === '*=' ? check && result.indexOf(check) > -1
: operator === '$=' ? check && result.slice(-check.length) === check
: operator === '~=' ? (` ${result} `).indexOf(check) > -1
: operator === '|=' ? result === check || result.slice(0, check.length + 1) === `${check}-`
: false;
};
},
CHILD(type, what, argument, first, last) {
const simple = type.slice(0, 3) !== 'nth';
const forward = type.slice(-4) !== 'last';
const ofType = what === 'of-type';
return first === 1 && last === 0
// Shortcut for :nth-*(n)
? function (elem) {
return !!elem.parentNode;
}
: function (elem, context, xml) {
let cache; let outerCache; let node; let diff; let nodeIndex; let start;
let dir = simple !== forward ? 'nextSibling' : 'previousSibling';
const parent = elem.parentNode;
const name = ofType && elem.nodeName.toLowerCase();
const useCache = !xml && !ofType;
if (parent) {
// :(first|last|only)-(child|of-type)
if (simple) {
while (dir) {
node = elem;
while ((node = node[dir])) {
if (ofType ? node.nodeName.toLowerCase() === name : node.nodeType === 1) {
return false;
}
}
// Reverse direction for :only-* (if we haven't yet done so)
start = dir = type === 'only' && !start && 'nextSibling';
}
return true;
}
start = [forward ? parent.firstChild : parent.lastChild];
// non-xml :nth-child(...) stores cache data on `parent`
if (forward && useCache) {
// Seek `elem` from a previously-cached index
outerCache = parent[expando] || (parent[expando] = {});
cache = outerCache[type] || [];
nodeIndex = cache[0] === dirruns && cache[1];
diff = cache[0] === dirruns && cache[2];
node = nodeIndex && parent.childNodes[nodeIndex];
while ((node = ++nodeIndex && node && node[dir]
// Fallback to seeking `elem` from the start
|| (diff = nodeIndex = 0) || start.pop())) {
// When found, cache indexes on `parent` and break
if (node.nodeType === 1 && ++diff && node === elem) {
outerCache[type] = [dirruns, nodeIndex, diff];
break;
}
}
// Use previously-cached element index if available
} else if (useCache && (cache = (elem[expando] || (elem[expando] = {}))[type]) && cache[0] === dirruns) {
diff = cache[1];
// xml :nth-child(...) or :nth-last-child(...) or :nth(-last)?-of-type(...)
} else {
// Use the same loop as above to seek `elem` from the start
while ((node = ++nodeIndex && node && node[dir]
|| (diff = nodeIndex = 0) || start.pop())) {
if ((ofType ? node.nodeName.toLowerCase() === name : node.nodeType === 1) && ++diff) {
// Cache the index of each encountered element
if (useCache) {
(node[expando] || (node[expando] = {}))[type] = [dirruns, diff];
}
if (node === elem) {
break;
}
}
}
}
// Incorporate the offset, then check against cycle size
diff -= last;
return diff === first || (diff % first === 0 && diff / first >= 0);
}
};
},
PSEUDO(pseudo, argument) {
// pseudo-class names are case-insensitive
// http://www.w3.org/TR/selectors/#pseudo-classes
// Prioritize by case sensitivity in case custom pseudos are added with uppercase letters
// Remember that setFilters inherits from pseudos
let args;
const fn = Expr.pseudos[pseudo] || Expr.setFilters[pseudo.toLowerCase()]
|| Sizzle.error(`unsupported pseudo: ${pseudo}`);
// The user may use createPseudo to indicate that
// arguments are needed to create the filter function
// just as Sizzle does
if (fn[expando]) {
return fn(argument);
}
// But maintain support for old signatures
if (fn.length > 1) {
args = [pseudo, pseudo, '', argument];
return Expr.setFilters.hasOwnProperty(pseudo.toLowerCase())
? markFunction((seed, matches) => {
let idx;
const matched = fn(seed, argument);
let i = matched.length;
while (i--) {
idx = indexOf.call(seed, matched[i]);
seed[idx] = !(matches[idx] = matched[i]);
}
})
: function (elem) {
return fn(elem, 0, args);
};
}
return fn;
},
},
pseudos: {
// Potentially complex pseudos
not: markFunction((selector) => {
// Trim the selector passed to compile
// to avoid treating leading and trailing
// spaces as combinators
const input = [];
const results = [];
const matcher = compile(selector.replace(rtrim, '$1'));
return matcher[expando]
? markFunction((seed, matches, context, xml) => {
let elem;
const unmatched = matcher(seed, null, xml, []);
let i = seed.length;
// Match elements unmatched by `matcher`
while (i--) {
if ((elem = unmatched[i])) {
seed[i] = !(matches[i] = elem);
}
}
})
: function (elem, context, xml) {
input[0] = elem;
matcher(input, null, xml, results);
return !results.pop();
};
}),
has: markFunction((selector) => function (elem) {
return Sizzle(selector, elem).length > 0;
}),
contains: markFunction((text) => function (elem) {
return (elem.textContent || elem.innerText || getText(elem)).indexOf(text) > -1;
}),
// "Whether an element is represented by a :lang() selector
// is based solely on the element's language value
// being equal to the identifier C,
// or beginning with the identifier C immediately followed by "-".
// The matching of C against the element's language value is performed case-insensitively.
// The identifier C does not have to be a valid language name."
// http://www.w3.org/TR/selectors/#lang-pseudo
lang: markFunction((lang) => {
// lang value must be a valid identifier
if (!ridentifier.test(lang || '')) {
Sizzle.error(`unsupported lang: ${lang}`);
}
lang = lang.replace(runescape, funescape).toLowerCase();
return function (elem) {
let elemLang;
do {
if ((elemLang = documentIsHTML
? elem.lang
: elem.getAttribute('xml:lang') || elem.getAttribute('lang'))) {
elemLang = elemLang.toLowerCase();
return elemLang === lang || elemLang.indexOf(`${lang}-`) === 0;
}
} while ((elem = elem.parentNode) && elem.nodeType === 1);
return false;
};
}),
// Miscellaneous
target(elem) {
const hash = window.location && window.location.hash;
return hash && hash.slice(1) === elem.id;
},
root(elem) {
return elem === docElem;
},
focus(elem) {
return elem === document.activeElement && (!document.hasFocus || document.hasFocus()) && !!(elem.type || elem.href || ~elem.tabIndex);
},
// Boolean properties
enabled(elem) {
return elem.disabled === false;
},
disabled(elem) {
return elem.disabled === true;
},
checked(elem) {
// In CSS3, :checked should return both checked and selected elements
// http://www.w3.org/TR/2011/REC-css3-selectors-20110929/#checked
const nodeName = elem.nodeName.toLowerCase();
return (nodeName === 'input' && !!elem.checked) || (nodeName === 'option' && !!elem.selected);
},
selected(elem) {
// Accessing this property makes selected-by-default
// options in Safari work properly
if (elem.parentNode) {
elem.parentNode.selectedIndex;
}
return elem.selected === true;
},
// Contents
empty(elem) {
// http://www.w3.org/TR/selectors/#empty-pseudo
// :empty is negated by element (1) or content nodes (text: 3; cdata: 4; entity ref: 5),
// but not by others (comment: 8; processing instruction: 7; etc.)
// nodeType < 6 works because attributes (2) do not appear as children
for (elem = elem.firstChild; elem; elem = elem.nextSibling) {
if (elem.nodeType < 6) {
return false;
}
}
return true;
},
parent(elem) {
return !Expr.pseudos.empty(elem);
},
// Element/input types
header(elem) {
return rheader.test(elem.nodeName);
},
input(elem) {
return rinputs.test(elem.nodeName);
},
button(elem) {
const name = elem.nodeName.toLowerCase();
return name === 'input' && elem.type === 'button' || name === 'button';
},
text(elem) {
let attr;
return elem.nodeName.toLowerCase() === 'input'
&& elem.type === 'text'
// Support: IE<8
// New HTML5 attribute values (e.g., "search") appear with elem.type === "text"
&& ((attr = elem.getAttribute('type')) == null || attr.toLowerCase() === 'text');
},
// Position-in-collection
first: createPositionalPseudo(() => [0]),
last: createPositionalPseudo((matchIndexes, length) => [length - 1]),
eq: createPositionalPseudo((matchIndexes, length, argument) => [argument < 0 ? argument + length : argument]),
even: createPositionalPseudo((matchIndexes, length) => {
let i = 0;
for (; i < length; i += 2) {
matchIndexes.push(i);
}
return matchIndexes;
}),
odd: createPositionalPseudo((matchIndexes, length) => {
let i = 1;
for (; i < length; i += 2) {
matchIndexes.push(i);
}
return matchIndexes;
}),
lt: createPositionalPseudo((matchIndexes, length, argument) => {
let i = argument < 0 ? argument + length : argument;
for (; --i >= 0;) {
matchIndexes.push(i);
}
return matchIndexes;
}),
gt: createPositionalPseudo((matchIndexes, length, argument) => {
let i = argument < 0 ? argument + length : argument;
for (; ++i < length;) {
matchIndexes.push(i);
}
return matchIndexes;
}),
},
};
Expr.pseudos.nth = Expr.pseudos.eq;
// Add button/input type pseudos
for (i in {
radio: true, checkbox: true, file: true, password: true, image: true,
}) {
Expr.pseudos[i] = createInputPseudo(i);
}
for (i in { submit: true, reset: true }) {
Expr.pseudos[i] = createButtonPseudo(i);
}
// Easy API for creating new setFilters
function setFilters() {}
setFilters.prototype = Expr.filters = Expr.pseudos;
Expr.setFilters = new setFilters();
function tokenize(selector, parseOnly) {
let matched; let match; let tokens; let type;
let soFar; let groups; let preFilters;
const cached = tokenCache[`${selector} `];
if (cached) {
return parseOnly ? 0 : cached.slice(0);
}
soFar = selector;
groups = [];
preFilters = Expr.preFilter;
while (soFar) {
// Comma and first run
if (!matched || (match = rcomma.exec(soFar))) {
if (match) {
// Don't consume trailing commas as valid
soFar = soFar.slice(match[0].length) || soFar;
}
groups.push((tokens = []));
}
matched = false;
// Combinators
if ((match = rcombinators.exec(soFar))) {
matched = match.shift();
tokens.push({
value: matched,
// Cast descendant combinators to space
type: match[0].replace(rtrim, ' '),
});
soFar = soFar.slice(matched.length);
}
// Filters
for (type in Expr.filter) {
if ((match = matchExpr[type].exec(soFar)) && (!preFilters[type]
|| (match = preFilters[type](match)))) {
matched = match.shift();
tokens.push({
value: matched,
type,
matches: match,
});
soFar = soFar.slice(matched.length);
}
}
if (!matched) {
break;
}
}
// Return the length of the invalid excess
// if we're just parsing
// Otherwise, throw an error or return tokens
return parseOnly
? soFar.length
: soFar
? Sizzle.error(selector)
// Cache the tokens
: tokenCache(selector, groups).slice(0);
}
function toSelector(tokens) {
let i = 0;
const len = tokens.length;
let selector = '';
for (; i < len; i++) {
selector += tokens[i].value;
}
return selector;
}
function addCombinator(matcher, combinator, base) {
const { dir } = combinator;
const checkNonElements = base && dir === 'parentNode';
const doneName = done++;
return combinator.first
// Check against closest ancestor/preceding element
? function (elem, context, xml) {
while ((elem = elem[dir])) {
if (elem.nodeType === 1 || checkNonElements) {
return matcher(elem, context, xml);
}
}
}
// Check against all ancestor/preceding elements
: function (elem, context, xml) {
let oldCache; let outerCache;
const newCache = [dirruns, doneName];
// We can't set arbitrary data on XML nodes, so they don't benefit from dir caching
if (xml) {
while ((elem = elem[dir])) {
if (elem.nodeType === 1 || checkNonElements) {
if (matcher(elem, context, xml)) {
return true;
}
}
}
} else {
while ((elem = elem[dir])) {
if (elem.nodeType === 1 || checkNonElements) {
outerCache = elem[expando] || (elem[expando] = {});
if ((oldCache = outerCache[dir])
&& oldCache[0] === dirruns && oldCache[1] === doneName) {
// Assign to newCache so results back-propagate to previous elements
return (newCache[2] = oldCache[2]);
}
// Reuse newcache so results back-propagate to previous elements
outerCache[dir] = newCache;
// A match means we're done; a fail means we have to keep checking
if ((newCache[2] = matcher(elem, context, xml))) {
return true;
}
}
}
}
};
}
function elementMatcher(matchers) {
return matchers.length > 1
? function (elem, context, xml) {
let i = matchers.length;
while (i--) {
if (!matchers[i](elem, context, xml)) {
return false;
}
}
return true;
}
: matchers[0];
}
function condense(unmatched, map, filter, context, xml) {
let elem;
const newUnmatched = [];
let i = 0;
const len = unmatched.length;
const mapped = map != null;
for (; i < len; i++) {
if ((elem = unmatched[i])) {
if (!filter || filter(elem, context, xml)) {
newUnmatched.push(elem);
if (mapped) {
map.push(i);
}
}
}
}
return newUnmatched;
}
function setMatcher(preFilter, selector, matcher, postFilter, postFinder, postSelector) {
if (postFilter && !postFilter[expando]) {
postFilter = setMatcher(postFilter);
}
if (postFinder && !postFinder[expando]) {
postFinder = setMatcher(postFinder, postSelector);
}
return markFunction((seed, results, context, xml) => {
let temp; let i; let elem;
const preMap = [];
const postMap = [];
const preexisting = results.length;
// Get initial elements from seed or context
const elems = seed || multipleContexts(selector || '*', context.nodeType ? [context] : context, []);
// Prefilter to get matcher input, preserving a map for seed-results synchronization
const matcherIn = preFilter && (seed || !selector)
? condense(elems, preMap, preFilter, context, xml)
: elems;
let matcherOut = matcher
// If we have a postFinder, or filtered seed, or non-seed postFilter or preexisting results,
? postFinder || (seed ? preFilter : preexisting || postFilter)
// ...intermediate processing is necessary
? []
// ...otherwise use results directly
: results
: matcherIn;
// Find primary matches
if (matcher) {
matcher(matcherIn, matcherOut, context, xml);
}
// Apply postFilter
if (postFilter) {
temp = condense(matcherOut, postMap);
postFilter(temp, [], context, xml);
// Un-match failing elements by moving them back to matcherIn
i = temp.length;
while (i--) {
if ((elem = temp[i])) {
matcherOut[postMap[i]] = !(matcherIn[postMap[i]] = elem);
}
}
}
if (seed) {
if (postFinder || preFilter) {
if (postFinder) {
// Get the final matcherOut by condensing this intermediate into postFinder contexts
temp = [];
i = matcherOut.length;
while (i--) {
if ((elem = matcherOut[i])) {
// Restore matcherIn since elem is not yet a final match
temp.push((matcherIn[i] = elem));
}
}
postFinder(null, (matcherOut = []), temp, xml);
}
// Move matched elements from seed to results to keep them synchronized
i = matcherOut.length;
while (i--) {
if ((elem = matcherOut[i])
&& (temp = postFinder ? indexOf.call(seed, elem) : preMap[i]) > -1) {
seed[temp] = !(results[temp] = elem);
}
}
}
// Add elements to results, through postFinder if defined
} else {
matcherOut = condense(
matcherOut === results
? matcherOut.splice(preexisting, matcherOut.length)
: matcherOut,
);
if (postFinder) {
postFinder(null, results, matcherOut, xml);
} else {
push.apply(results, matcherOut);
}
}
});
}
function matcherFromTokens(tokens) {
let checkContext; let matcher; let j;
const len = tokens.length;
const leadingRelative = Expr.relative[tokens[0].type];
const implicitRelative = leadingRelative || Expr.relative[' '];
let i = leadingRelative ? 1 : 0;
// The foundational matcher ensures that elements are reachable from top-level context(s)
const matchContext = addCombinator((elem) => elem === checkContext, implicitRelative, true);
const matchAnyContext = addCombinator((elem) => indexOf.call(checkContext, elem) > -1, implicitRelative, true);
let matchers = [function (elem, context, xml) {
return (!leadingRelative && (xml || context !== outermostContext)) || (
(checkContext = context).nodeType
? matchContext(elem, context, xml)
: matchAnyContext(elem, context, xml));
}];
for (; i < len; i++) {
if ((matcher = Expr.relative[tokens[i].type])) {
matchers = [addCombinator(elementMatcher(matchers), matcher)];
} else {
matcher = Expr.filter[tokens[i].type].apply(null, tokens[i].matches);
// Return special upon seeing a positional matcher
if (matcher[expando]) {
// Find the next relative operator (if any) for proper handling
j = ++i;
for (; j < len; j++) {
if (Expr.relative[tokens[j].type]) {
break;
}
}
return setMatcher(
i > 1 && elementMatcher(matchers),
i > 1 && toSelector(
// If the preceding token was a descendant combinator, insert an implicit any-element `*`
tokens.slice(0, i - 1).concat({ value: tokens[i - 2].type === ' ' ? '*' : '' }),
).replace(rtrim, '$1'),
matcher,
i < j && matcherFromTokens(tokens.slice(i, j)),
j < len && matcherFromTokens((tokens = tokens.slice(j))),
j < len && toSelector(tokens),
);
}
matchers.push(matcher);
}
}
return elementMatcher(matchers);
}
function matcherFromGroupMatchers(elementMatchers, setMatchers) {
const bySet = setMatchers.length > 0;
const byElement = elementMatchers.length > 0;
const superMatcher = function (seed, context, xml, results, outermost) {
let elem; let j; let matcher;
let matchedCount = 0;
let i = '0';
const unmatched = seed && [];
let setMatched = [];
const contextBackup = outermostContext;
// We must always have either seed elements or outermost context
const elems = seed || byElement && Expr.find.TAG('*', outermost);
// Use integer dirruns iff this is the outermost matcher
const dirrunsUnique = (dirruns += contextBackup == null ? 1 : Math.random() || 0.1);
const len = elems.length;
if (outermost) {
outermostContext = context !== document && context;
}
// Add elements passing elementMatchers directly to results
// Keep `i` a string if there are no elements so `matchedCount` will be "00" below
// Support: IE<9, Safari
// Tolerate NodeList properties (IE: "length"; Safari: ) matching elements by id
for (; i !== len && (elem = elems[i]) != null; i++) {
if (byElement && elem) {
j = 0;
while ((matcher = elementMatchers[j++])) {
if (matcher(elem, context, xml)) {
results.push(elem);
break;
}
}
if (outermost) {
dirruns = dirrunsUnique;
}
}
// Track unmatched elements for set filters
if (bySet) {
// They will have gone through all possible matchers
if ((elem = !matcher && elem)) {
matchedCount--;
}
// Lengthen the array for every element, matched or not
if (seed) {
unmatched.push(elem);
}
}
}
// Apply set filters to unmatched elements
matchedCount += i;
if (bySet && i !== matchedCount) {
j = 0;
while ((matcher = setMatchers[j++])) {
matcher(unmatched, setMatched, context, xml);
}
if (seed) {
// Reintegrate element matches to eliminate the need for sorting
if (matchedCount > 0) {
while (i--) {
if (!(unmatched[i] || setMatched[i])) {
setMatched[i] = pop.call(results);
}
}
}
// Discard index placeholder values to get only actual matches
setMatched = condense(setMatched);
}
// Add matches to results
push.apply(results, setMatched);
// Seedless set matches succeeding multiple successful matchers stipulate sorting
if (outermost && !seed && setMatched.length > 0
&& (matchedCount + setMatchers.length) > 1) {
Sizzle.uniqueSort(results);
}
}
// Override manipulation of globals by nested matchers
if (outermost) {
dirruns = dirrunsUnique;
outermostContext = contextBackup;
}
return unmatched;
};
return bySet
? markFunction(superMatcher)
: superMatcher;
}
compile = Sizzle.compile = function (selector, group /* Internal Use Only */) {
let i;
const setMatchers = [];
const elementMatchers = [];
let cached = compilerCache[`${selector} `];
if (!cached) {
// Generate a function of recursive functions that can be used to check each element
if (!group) {
group = tokenize(selector);
}
i = group.length;
while (i--) {
cached = matcherFromTokens(group[i]);
if (cached[expando]) {
setMatchers.push(cached);
} else {
elementMatchers.push(cached);
}
}
// Cache the compiled function
cached = compilerCache(selector, matcherFromGroupMatchers(elementMatchers, setMatchers));
}
return cached;
};
function multipleContexts(selector, contexts, results) {
let i = 0;
const len = contexts.length;
for (; i < len; i++) {
Sizzle(selector, contexts[i], results);
}
return results;
}
function select(selector, context, results, seed) {
let i; let tokens; let token; let type; let find;
const match = tokenize(selector);
if (!seed) {
// Try to minimize operations if there is only one group
if (match.length === 1) {
// Take a shortcut and set the context if the root selector is an ID
tokens = match[0] = match[0].slice(0);
if (tokens.length > 2 && (token = tokens[0]).type === 'ID'
&& support.getById && context.nodeType === 9 && documentIsHTML
&& Expr.relative[tokens[1].type]) {
context = (Expr.find.ID(token.matches[0].replace(runescape, funescape), context) || [])[0];
if (!context) {
return results;
}
selector = selector.slice(tokens.shift().value.length);
}
// Fetch a seed set for right-to-left matching
i = matchExpr.needsContext.test(selector) ? 0 : tokens.length;
while (i--) {
token = tokens[i];
// Abort if we hit a combinator
if (Expr.relative[(type = token.type)]) {
break;
}
if ((find = Expr.find[type])) {
// Search, expanding context for leading sibling combinators
if ((seed = find(
token.matches[0].replace(runescape, funescape),
rsibling.test(tokens[0].type) && testContext(context.parentNode) || context,
))) {
// If seed is empty or no tokens remain, we can return early
tokens.splice(i, 1);
selector = seed.length && toSelector(tokens);
if (!selector) {
push.apply(results, seed);
return results;
}
break;
}
}
}
}
}
// Compile and execute a filtering function
// Provide `match` to avoid retokenization if we modified the selector above
compile(selector, match)(
seed,
context,
!documentIsHTML,
results,
rsibling.test(selector) && testContext(context.parentNode) || context,
);
return results;
}
// One-time assignments
// Sort stability
support.sortStable = expando.split('').sort(sortOrder).join('') === expando;
// Support: Chrome<14
// Always assume duplicates if they aren't passed to the comparison function
support.detectDuplicates = !!hasDuplicate;
// Initialize against the default document
setDocument();
// Support: Webkit<537.32 - Safari 6.0.3/Chrome 25 (fixed in Chrome 27)
// Detached nodes confoundingly follow *each other*
support.sortDetached = assert((div1) =>
// Should return 1, but returns 4 (following)
div1.compareDocumentPosition(document.createElement('div')) & 1);
// Support: IE<8
// Prevent attribute/property "interpolation"
// http://msdn.microsoft.com/en-us/library/ms536429%28VS.85%29.aspx
if (!assert((div) => {
div.innerHTML = "";
return div.firstChild.getAttribute('href') === '#';
})) {
addHandle('type|href|height|width', (elem, name, isXML) => {
if (!isXML) {
return elem.getAttribute(name, name.toLowerCase() === 'type' ? 1 : 2);
}
});
}
// Support: IE<9
// Use defaultValue in place of getAttribute("value")
if (!support.attributes || !assert((div) => {
div.innerHTML = '';
div.firstChild.setAttribute('value', '');
return div.firstChild.getAttribute('value') === '';
})) {
addHandle('value', (elem, name, isXML) => {
if (!isXML && elem.nodeName.toLowerCase() === 'input') {
return elem.defaultValue;
}
});
}
// Support: IE<9
// Use getAttributeNode to fetch booleans when getAttribute lies
if (!assert((div) => div.getAttribute('disabled') == null)) {
addHandle(booleans, (elem, name, isXML) => {
let val;
if (!isXML) {
return elem[name] === true ? name.toLowerCase()
: (val = elem.getAttributeNode(name)) && val.specified
? val.value
: null;
}
});
}
return Sizzle;
}(window));
jQuery.find = Sizzle;
jQuery.expr = Sizzle.selectors;
jQuery.expr[':'] = jQuery.expr.pseudos;
jQuery.unique = Sizzle.uniqueSort;
jQuery.text = Sizzle.getText;
jQuery.isXMLDoc = Sizzle.isXML;
jQuery.contains = Sizzle.contains;
const rneedsContext = jQuery.expr.match.needsContext;
const rsingleTag = (/^<(\w+)\s*\/?>(?:<\/\1>|)$/);
const risSimple = /^.[^:#\[\.,]*$/;
// Implement the identical functionality for filter and not
function winnow(elements, qualifier, not) {
if (jQuery.isFunction(qualifier)) {
return jQuery.grep(elements, (elem, i) =>
/* jshint -W018 */
!!qualifier.call(elem, i, elem) !== not);
}
if (qualifier.nodeType) {
return jQuery.grep(elements, (elem) => (elem === qualifier) !== not);
}
if (typeof qualifier === 'string') {
if (risSimple.test(qualifier)) {
return jQuery.filter(qualifier, elements, not);
}
qualifier = jQuery.filter(qualifier, elements);
}
return jQuery.grep(elements, (elem) => (indexOf.call(qualifier, elem) >= 0) !== not);
}
jQuery.filter = function (expr, elems, not) {
const elem = elems[0];
if (not) {
expr = `:not(${expr})`;
}
return elems.length === 1 && elem.nodeType === 1
? jQuery.find.matchesSelector(elem, expr) ? [elem] : []
: jQuery.find.matches(expr, jQuery.grep(elems, (elem) => elem.nodeType === 1));
};
jQuery.fn.extend({
find(selector) {
let i;
const len = this.length;
let ret = [];
const self = this;
if (typeof selector !== 'string') {
return this.pushStack(jQuery(selector).filter(function () {
for (i = 0; i < len; i++) {
if (jQuery.contains(self[i], this)) {
return true;
}
}
}));
}
for (i = 0; i < len; i++) {
jQuery.find(selector, self[i], ret);
}
// Needed because $( selector, context ) becomes $( context ).find( selector )
ret = this.pushStack(len > 1 ? jQuery.unique(ret) : ret);
ret.selector = this.selector ? `${this.selector} ${selector}` : selector;
return ret;
},
filter(selector) {
return this.pushStack(winnow(this, selector || [], false));
},
not(selector) {
return this.pushStack(winnow(this, selector || [], true));
},
is(selector) {
return !!winnow(
this,
// If this is a positional/relative selector, check membership in the returned set
// so $("p:first").is("p:last") won't return true for a doc with two "p".
typeof selector === 'string' && rneedsContext.test(selector)
? jQuery(selector)
: selector || [],
false,
).length;
},
});
// Initialize a jQuery object
// A central reference to the root jQuery(document)
let rootjQuery;
// A simple way to check for HTML strings
// Prioritize #id over to avoid XSS via location.hash (#9521)
// Strict HTML recognition (#11290: must start with <)
const rquickExpr = /^(?:\s*(<[\w\W]+>)[^>]*|#([\w-]*))$/;
const init = jQuery.fn.init = function (selector, context) {
let match; let
elem;
// HANDLE: $(""), $(null), $(undefined), $(false)
if (!selector) {
return this;
}
// Handle HTML strings
if (typeof selector === 'string') {
if (selector[0] === '<' && selector[selector.length - 1] === '>' && selector.length >= 3) {
// Assume that strings that start and end with <> are HTML and skip the regex check
match = [null, selector, null];
} else {
match = rquickExpr.exec(selector);
}
// Match html or make sure no context is specified for #id
if (match && (match[1] || !context)) {
// HANDLE: $(html) -> $(array)
if (match[1]) {
context = context instanceof jQuery ? context[0] : context;
// scripts is true for back-compat
// Intentionally let the error be thrown if parseHTML is not present
jQuery.merge(this, jQuery.parseHTML(
match[1],
context && context.nodeType ? context.ownerDocument || context : document,
true,
));
// HANDLE: $(html, props)
if (rsingleTag.test(match[1]) && jQuery.isPlainObject(context)) {
for (match in context) {
// Properties of context are called as methods if possible
if (jQuery.isFunction(this[match])) {
this[match](context[match]);
// ...and otherwise set as attributes
} else {
this.attr(match, context[match]);
}
}
}
return this;
// HANDLE: $(#id)
}
elem = document.getElementById(match[2]);
// Check parentNode to catch when Blackberry 4.6 returns
// nodes that are no longer in the document #6963
if (elem && elem.parentNode) {
// Inject the element directly into the jQuery object
this.length = 1;
this[0] = elem;
}
this.context = document;
this.selector = selector;
return this;
// HANDLE: $(expr, $(...))
} if (!context || context.jquery) {
return (context || rootjQuery).find(selector);
// HANDLE: $(expr, context)
// (which is just equivalent to: $(context).find(expr)
}
return this.constructor(context).find(selector);
// HANDLE: $(DOMElement)
} if (selector.nodeType) {
this.context = this[0] = selector;
this.length = 1;
return this;
// HANDLE: $(function)
// Shortcut for document ready
} if (jQuery.isFunction(selector)) {
return typeof rootjQuery.ready !== 'undefined'
? rootjQuery.ready(selector)
// Execute immediately if ready is not present
: selector(jQuery);
}
if (selector.selector !== undefined) {
this.selector = selector.selector;
this.context = selector.context;
}
return jQuery.makeArray(selector, this);
};
// Give the init function the jQuery prototype for later instantiation
init.prototype = jQuery.fn;
// Initialize central reference
rootjQuery = jQuery(document);
const rparentsprev = /^(?:parents|prev(?:Until|All))/;
// methods guaranteed to produce a unique set when starting from a unique set
const guaranteedUnique = {
children: true,
contents: true,
next: true,
prev: true,
};
jQuery.extend({
dir(elem, dir, until) {
const matched = [];
const truncate = until !== undefined;
while ((elem = elem[dir]) && elem.nodeType !== 9) {
if (elem.nodeType === 1) {
if (truncate && jQuery(elem).is(until)) {
break;
}
matched.push(elem);
}
}
return matched;
},
sibling(n, elem) {
const matched = [];
for (; n; n = n.nextSibling) {
if (n.nodeType === 1 && n !== elem) {
matched.push(n);
}
}
return matched;
},
});
jQuery.fn.extend({
has(target) {
const targets = jQuery(target, this);
const l = targets.length;
return this.filter(function () {
let i = 0;
for (; i < l; i++) {
if (jQuery.contains(this, targets[i])) {
return true;
}
}
});
},
closest(selectors, context) {
let cur;
let i = 0;
const l = this.length;
const matched = [];
const pos = rneedsContext.test(selectors) || typeof selectors !== 'string'
? jQuery(selectors, context || this.context)
: 0;
for (; i < l; i++) {
for (cur = this[i]; cur && cur !== context; cur = cur.parentNode) {
// Always skip document fragments
if (cur.nodeType < 11 && (pos
? pos.index(cur) > -1
// Don't pass non-elements to Sizzle
: cur.nodeType === 1
&& jQuery.find.matchesSelector(cur, selectors))) {
matched.push(cur);
break;
}
}
}
return this.pushStack(matched.length > 1 ? jQuery.unique(matched) : matched);
},
// Determine the position of an element within
// the matched set of elements
index(elem) {
// No argument, return index in parent
if (!elem) {
return (this[0] && this[0].parentNode) ? this.first().prevAll().length : -1;
}
// index in selector
if (typeof elem === 'string') {
return indexOf.call(jQuery(elem), this[0]);
}
// Locate the position of the desired element
return indexOf.call(this,
// If it receives a jQuery object, the first element is used
elem.jquery ? elem[0] : elem);
},
add(selector, context) {
return this.pushStack(
jQuery.unique(
jQuery.merge(this.get(), jQuery(selector, context)),
),
);
},
addBack(selector) {
return this.add(selector == null
? this.prevObject : this.prevObject.filter(selector));
},
});
function sibling(cur, dir) {
while ((cur = cur[dir]) && cur.nodeType !== 1) {}
return cur;
}
jQuery.each({
parent(elem) {
const parent = elem.parentNode;
return parent && parent.nodeType !== 11 ? parent : null;
},
parents(elem) {
return jQuery.dir(elem, 'parentNode');
},
parentsUntil(elem, i, until) {
return jQuery.dir(elem, 'parentNode', until);
},
next(elem) {
return sibling(elem, 'nextSibling');
},
prev(elem) {
return sibling(elem, 'previousSibling');
},
nextAll(elem) {
return jQuery.dir(elem, 'nextSibling');
},
prevAll(elem) {
return jQuery.dir(elem, 'previousSibling');
},
nextUntil(elem, i, until) {
return jQuery.dir(elem, 'nextSibling', until);
},
prevUntil(elem, i, until) {
return jQuery.dir(elem, 'previousSibling', until);
},
siblings(elem) {
return jQuery.sibling((elem.parentNode || {}).firstChild, elem);
},
children(elem) {
return jQuery.sibling(elem.firstChild);
},
contents(elem) {
return elem.contentDocument || jQuery.merge([], elem.childNodes);
},
}, (name, fn) => {
jQuery.fn[name] = function (until, selector) {
let matched = jQuery.map(this, fn, until);
if (name.slice(-5) !== 'Until') {
selector = until;
}
if (selector && typeof selector === 'string') {
matched = jQuery.filter(selector, matched);
}
if (this.length > 1) {
// Remove duplicates
if (!guaranteedUnique[name]) {
jQuery.unique(matched);
}
// Reverse order for parents* and prev-derivatives
if (rparentsprev.test(name)) {
matched.reverse();
}
}
return this.pushStack(matched);
};
});
const rnotwhite = (/\S+/g);
// String to Object options format cache
const optionsCache = {};
// Convert String-formatted options into Object-formatted ones and store in cache
function createOptions(options) {
const object = optionsCache[options] = {};
jQuery.each(options.match(rnotwhite) || [], (_, flag) => {
object[flag] = true;
});
return object;
}
/*
* Create a callback list using the following parameters:
*
* options: an optional list of space-separated options that will change how
* the callback list behaves or a more traditional option object
*
* By default a callback list will act like an event callback list and can be
* "fired" multiple times.
*
* Possible options:
*
* once: will ensure the callback list can only be fired once (like a Deferred)
*
* memory: will keep track of previous values and will call any callback added
* after the list has been fired right away with the latest "memorized"
* values (like a Deferred)
*
* unique: will ensure a callback can only be added once (no duplicate in the list)
*
* stopOnFalse: interrupt callings when a callback returns false
*
*/
jQuery.Callbacks = function (options) {
// Convert options from String-formatted to Object-formatted if needed
// (we check in cache first)
options = typeof options === 'string'
? (optionsCache[options] || createOptions(options))
: jQuery.extend({}, options);
let // Last fire value (for non-forgettable lists)
memory;
// Flag to know if list was already fired
let fired;
// Flag to know if list is currently firing
let firing;
// First callback to fire (used internally by add and fireWith)
let firingStart;
// End of the loop when firing
let firingLength;
// Index of currently firing callback (modified by remove if needed)
let firingIndex;
// Actual callback list
let list = [];
// Stack of fire calls for repeatable lists
let stack = !options.once && [];
// Fire callbacks
var fire = function (data) {
memory = options.memory && data;
fired = true;
firingIndex = firingStart || 0;
firingStart = 0;
firingLength = list.length;
firing = true;
for (; list && firingIndex < firingLength; firingIndex++) {
if (list[firingIndex].apply(data[0], data[1]) === false && options.stopOnFalse) {
memory = false; // To prevent further calls using add
break;
}
}
firing = false;
if (list) {
if (stack) {
if (stack.length) {
fire(stack.shift());
}
} else if (memory) {
list = [];
} else {
self.disable();
}
}
};
// Actual Callbacks object
var self = {
// Add a callback or a collection of callbacks to the list
add() {
if (list) {
// First, we save the current length
const start = list.length;
(function add(args) {
jQuery.each(args, (_, arg) => {
const type = jQuery.type(arg);
if (type === 'function') {
if (!options.unique || !self.has(arg)) {
list.push(arg);
}
} else if (arg && arg.length && type !== 'string') {
// Inspect recursively
add(arg);
}
});
}(arguments));
// Do we need to add the callbacks to the
// current firing batch?
if (firing) {
firingLength = list.length;
// With memory, if we're not firing then
// we should call right away
} else if (memory) {
firingStart = start;
fire(memory);
}
}
return this;
},
// Remove a callback from the list
remove() {
if (list) {
jQuery.each(arguments, (_, arg) => {
let index;
while ((index = jQuery.inArray(arg, list, index)) > -1) {
list.splice(index, 1);
// Handle firing indexes
if (firing) {
if (index <= firingLength) {
firingLength--;
}
if (index <= firingIndex) {
firingIndex--;
}
}
}
});
}
return this;
},
// Check if a given callback is in the list.
// If no argument is given, return whether or not list has callbacks attached.
has(fn) {
return fn ? jQuery.inArray(fn, list) > -1 : !!(list && list.length);
},
// Remove all callbacks from the list
empty() {
list = [];
firingLength = 0;
return this;
},
// Have the list do nothing anymore
disable() {
list = stack = memory = undefined;
return this;
},
// Is it disabled?
disabled() {
return !list;
},
// Lock the list in its current state
lock() {
stack = undefined;
if (!memory) {
self.disable();
}
return this;
},
// Is it locked?
locked() {
return !stack;
},
// Call all callbacks with the given context and arguments
fireWith(context, args) {
if (list && (!fired || stack)) {
args = args || [];
args = [context, args.slice ? args.slice() : args];
if (firing) {
stack.push(args);
} else {
fire(args);
}
}
return this;
},
// Call all the callbacks with the given arguments
fire() {
self.fireWith(this, arguments);
return this;
},
// To know if the callbacks have already been called at least once
fired() {
return !!fired;
},
};
return self;
};
jQuery.extend({
Deferred(func) {
const tuples = [
// action, add listener, listener list, final state
['resolve', 'done', jQuery.Callbacks('once memory'), 'resolved'],
['reject', 'fail', jQuery.Callbacks('once memory'), 'rejected'],
['notify', 'progress', jQuery.Callbacks('memory')],
];
let state = 'pending';
var promise = {
state() {
return state;
},
always() {
deferred.done(arguments).fail(arguments);
return this;
},
then(/* fnDone, fnFail, fnProgress */) {
let fns = arguments;
return jQuery.Deferred((newDefer) => {
jQuery.each(tuples, (i, tuple) => {
const fn = jQuery.isFunction(fns[i]) && fns[i];
// deferred[ done | fail | progress ] for forwarding actions to newDefer
deferred[tuple[1]](function () {
const returned = fn && fn.apply(this, arguments);
if (returned && jQuery.isFunction(returned.promise)) {
returned.promise()
.done(newDefer.resolve)
.fail(newDefer.reject)
.progress(newDefer.notify);
} else {
newDefer[`${tuple[0]}With`](this === promise ? newDefer.promise() : this, fn ? [returned] : arguments);
}
});
});
fns = null;
}).promise();
},
// Get a promise for this deferred
// If obj is provided, the promise aspect is added to the object
promise(obj) {
return obj != null ? jQuery.extend(obj, promise) : promise;
},
};
var deferred = {};
// Keep pipe for back-compat
promise.pipe = promise.then;
// Add list-specific methods
jQuery.each(tuples, (i, tuple) => {
const list = tuple[2];
const stateString = tuple[3];
// promise[ done | fail | progress ] = list.add
promise[tuple[1]] = list.add;
// Handle state
if (stateString) {
list.add(() => {
// state = [ resolved | rejected ]
state = stateString;
// [ reject_list | resolve_list ].disable; progress_list.lock
}, tuples[i ^ 1][2].disable, tuples[2][2].lock);
}
// deferred[ resolve | reject | notify ]
deferred[tuple[0]] = function () {
deferred[`${tuple[0]}With`](this === deferred ? promise : this, arguments);
return this;
};
deferred[`${tuple[0]}With`] = list.fireWith;
});
// Make the deferred a promise
promise.promise(deferred);
// Call given func if any
if (func) {
func.call(deferred, deferred);
}
// All done!
return deferred;
},
// Deferred helper
when(subordinate /* , ..., subordinateN */) {
let i = 0;
const resolveValues = slice.call(arguments);
const { length } = resolveValues;
// the count of uncompleted subordinates
let remaining = length !== 1 || (subordinate && jQuery.isFunction(subordinate.promise)) ? length : 0;
// the master Deferred. If resolveValues consist of only a single Deferred, just use that.
const deferred = remaining === 1 ? subordinate : jQuery.Deferred();
// Update function for both resolve and progress values
const updateFunc = function (i, contexts, values) {
return function (value) {
contexts[i] = this;
values[i] = arguments.length > 1 ? slice.call(arguments) : value;
if (values === progressValues) {
deferred.notifyWith(contexts, values);
} else if (!(--remaining)) {
deferred.resolveWith(contexts, values);
}
};
};
let progressValues; let progressContexts; let
resolveContexts;
// add listeners to Deferred subordinates; treat others as resolved
if (length > 1) {
progressValues = new Array(length);
progressContexts = new Array(length);
resolveContexts = new Array(length);
for (; i < length; i++) {
if (resolveValues[i] && jQuery.isFunction(resolveValues[i].promise)) {
resolveValues[i].promise()
.done(updateFunc(i, resolveContexts, resolveValues))
.fail(deferred.reject)
.progress(updateFunc(i, progressContexts, progressValues));
} else {
--remaining;
}
}
}
// if we're not waiting on anything, resolve the master
if (!remaining) {
deferred.resolveWith(resolveContexts, resolveValues);
}
return deferred.promise();
},
});
// The deferred used on DOM ready
let readyList;
jQuery.fn.ready = function (fn) {
// Add the callback
jQuery.ready.promise().done(fn);
return this;
};
jQuery.extend({
// Is the DOM ready to be used? Set to true once it occurs.
isReady: false,
// A counter to track how many items to wait for before
// the ready event fires. See #6781
readyWait: 1,
// Hold (or release) the ready event
holdReady(hold) {
if (hold) {
jQuery.readyWait++;
} else {
jQuery.ready(true);
}
},
// Handle when the DOM is ready
ready(wait) {
// Abort if there are pending holds or we're already ready
if (wait === true ? --jQuery.readyWait : jQuery.isReady) {
return;
}
// Remember that the DOM is ready
jQuery.isReady = true;
// If a normal DOM Ready event fired, decrement, and wait if need be
if (wait !== true && --jQuery.readyWait > 0) {
return;
}
// If there are functions bound, to execute
readyList.resolveWith(document, [jQuery]);
// Trigger any bound ready events
if (jQuery.fn.trigger) {
jQuery(document).trigger('ready').off('ready');
}
},
});
/**
* The ready event handler and self cleanup method
*/
function completed() {
document.removeEventListener('DOMContentLoaded', completed, false);
window.removeEventListener('load', completed, false);
jQuery.ready();
}
jQuery.ready.promise = function (obj) {
if (!readyList) {
readyList = jQuery.Deferred();
// Catch cases where $(document).ready() is called after the browser event has already occurred.
// we once tried to use readyState "interactive" here, but it caused issues like the one
// discovered by ChrisS here: http://bugs.jquery.com/ticket/12282#comment:15
if (document.readyState === 'complete') {
// Handle it asynchronously to allow scripts the opportunity to delay ready
setTimeout(jQuery.ready);
} else {
// Use the handy event callback
document.addEventListener('DOMContentLoaded', completed, false);
// A fallback to window.onload, that will always work
window.addEventListener('load', completed, false);
}
}
return readyList.promise(obj);
};
// Kick off the DOM ready check even if the user does not
jQuery.ready.promise();
// Multifunctional method to get and set values of a collection
// The value/s can optionally be executed if it's a function
const access = jQuery.access = function (elems, fn, key, value, chainable, emptyGet, raw) {
let i = 0;
const len = elems.length;
let bulk = key == null;
// Sets many values
if (jQuery.type(key) === 'object') {
chainable = true;
for (i in key) {
jQuery.access(elems, fn, i, key[i], true, emptyGet, raw);
}
// Sets one value
} else if (value !== undefined) {
chainable = true;
if (!jQuery.isFunction(value)) {
raw = true;
}
if (bulk) {
// Bulk operations run against the entire set
if (raw) {
fn.call(elems, value);
fn = null;
// ...except when executing function values
} else {
bulk = fn;
fn = function (elem, key, value) {
return bulk.call(jQuery(elem), value);
};
}
}
if (fn) {
for (; i < len; i++) {
fn(elems[i], key, raw ? value : value.call(elems[i], i, fn(elems[i], key)));
}
}
}
return chainable
? elems
// Gets
: bulk
? fn.call(elems)
: len ? fn(elems[0], key) : emptyGet;
};
/**
* Determines whether an object can have data
*/
jQuery.acceptData = function (owner) {
// Accepts only:
// - Node
// - Node.ELEMENT_NODE
// - Node.DOCUMENT_NODE
// - Object
// - Any
/* jshint -W018 */
return owner.nodeType === 1 || owner.nodeType === 9 || !(+owner.nodeType);
};
function Data() {
// Support: Android < 4,
// Old WebKit does not have Object.preventExtensions/freeze method,
// return new empty object instead with no [[set]] accessor
Object.defineProperty(this.cache = {}, 0, {
get() {
return {};
},
});
this.expando = jQuery.expando + Math.random();
}
Data.uid = 1;
Data.accepts = jQuery.acceptData;
Data.prototype = {
key(owner) {
// We can accept data for non-element nodes in modern browsers,
// but we should not, see #8335.
// Always return the key for a frozen object.
if (!Data.accepts(owner)) {
return 0;
}
const descriptor = {};
// Check if the owner object already has a cache key
let unlock = owner[this.expando];
// If not, create one
if (!unlock) {
unlock = Data.uid++;
// Secure it in a non-enumerable, non-writable property
try {
descriptor[this.expando] = { value: unlock };
Object.defineProperties(owner, descriptor);
// Support: Android < 4
// Fallback to a less secure definition
} catch (e) {
descriptor[this.expando] = unlock;
jQuery.extend(owner, descriptor);
}
}
// Ensure the cache object
if (!this.cache[unlock]) {
this.cache[unlock] = {};
}
return unlock;
},
set(owner, data, value) {
let prop;
// There may be an unlock assigned to this node,
// if there is no entry for this "owner", create one inline
// and set the unlock as though an owner entry had always existed
const unlock = this.key(owner);
const cache = this.cache[unlock];
// Handle: [ owner, key, value ] args
if (typeof data === 'string') {
cache[data] = value;
// Handle: [ owner, { properties } ] args
} else {
// Fresh assignments by object are shallow copied
if (jQuery.isEmptyObject(cache)) {
jQuery.extend(this.cache[unlock], data);
// Otherwise, copy the properties one-by-one to the cache object
} else {
for (prop in data) {
cache[prop] = data[prop];
}
}
}
return cache;
},
get(owner, key) {
// Either a valid cache is found, or will be created.
// New caches will be created and the unlock returned,
// allowing direct access to the newly created
// empty data object. A valid owner object must be provided.
const cache = this.cache[this.key(owner)];
return key === undefined
? cache : cache[key];
},
access(owner, key, value) {
let stored;
// In cases where either:
//
// 1. No key was specified
// 2. A string key was specified, but no value provided
//
// Take the "read" path and allow the get method to determine
// which value to return, respectively either:
//
// 1. The entire cache object
// 2. The data stored at the key
//
if (key === undefined
|| ((key && typeof key === 'string') && value === undefined)) {
stored = this.get(owner, key);
return stored !== undefined
? stored : this.get(owner, jQuery.camelCase(key));
}
// [*]When the key is not a string, or both a key and value
// are specified, set or extend (existing objects) with either:
//
// 1. An object of properties
// 2. A key and value
//
this.set(owner, key, value);
// Since the "set" path can have two possible entry points
// return the expected data based on which path was taken[*]
return value !== undefined ? value : key;
},
remove(owner, key) {
let i; let name; let camel;
const unlock = this.key(owner);
const cache = this.cache[unlock];
if (key === undefined) {
this.cache[unlock] = {};
} else {
// Support array or space separated string of keys
if (jQuery.isArray(key)) {
// If "name" is an array of keys...
// When data is initially created, via ("key", "val") signature,
// keys will be converted to camelCase.
// Since there is no way to tell _how_ a key was added, remove
// both plain key and camelCase key. #12786
// This will only penalize the array argument path.
name = key.concat(key.map(jQuery.camelCase));
} else {
camel = jQuery.camelCase(key);
// Try the string as a key before any manipulation
if (key in cache) {
name = [key, camel];
} else {
// If a key with the spaces exists, use it.
// Otherwise, create an array by matching non-whitespace
name = camel;
name = name in cache
? [name] : (name.match(rnotwhite) || []);
}
}
i = name.length;
while (i--) {
delete cache[name[i]];
}
}
},
hasData(owner) {
return !jQuery.isEmptyObject(
this.cache[owner[this.expando]] || {},
);
},
discard(owner) {
if (owner[this.expando]) {
delete this.cache[owner[this.expando]];
}
},
};
const data_priv = new Data();
const data_user = new Data();
/*
Implementation Summary
1. Enforce API surface and semantic compatibility with 1.9.x branch
2. Improve the module's maintainability by reducing the storage
paths to a single mechanism.
3. Use the same single mechanism to support "private" and "user" data.
4. _Never_ expose "private" data to user code (TODO: Drop _data, _removeData)
5. Avoid exposing implementation details on user objects (eg. expando properties)
6. Provide a clear path for implementation upgrade to WeakMap in 2014
*/
const rbrace = /^(?:\{[\w\W]*\}|\[[\w\W]*\])$/;
const rmultiDash = /([A-Z])/g;
function dataAttr(elem, key, data) {
let name;
// If nothing was found internally, try to fetch any
// data from the HTML5 data-* attribute
if (data === undefined && elem.nodeType === 1) {
name = `data-${key.replace(rmultiDash, '-$1').toLowerCase()}`;
data = elem.getAttribute(name);
if (typeof data === 'string') {
try {
data = data === 'true' ? true
: data === 'false' ? false
: data === 'null' ? null
// Only convert to a number if it doesn't change the string
: `${+data}` === data ? +data
: rbrace.test(data) ? jQuery.parseJSON(data)
: data;
} catch (e) {}
// Make sure we set the data so it isn't changed later
data_user.set(elem, key, data);
} else {
data = undefined;
}
}
return data;
}
jQuery.extend({
hasData(elem) {
return data_user.hasData(elem) || data_priv.hasData(elem);
},
data(elem, name, data) {
return data_user.access(elem, name, data);
},
removeData(elem, name) {
data_user.remove(elem, name);
},
// TODO: Now that all calls to _data and _removeData have been replaced
// with direct calls to data_priv methods, these can be deprecated.
_data(elem, name, data) {
return data_priv.access(elem, name, data);
},
_removeData(elem, name) {
data_priv.remove(elem, name);
},
});
jQuery.fn.extend({
data(key, value) {
let i; let name; let data;
const elem = this[0];
const attrs = elem && elem.attributes;
// Gets all values
if (key === undefined) {
if (this.length) {
data = data_user.get(elem);
if (elem.nodeType === 1 && !data_priv.get(elem, 'hasDataAttrs')) {
i = attrs.length;
while (i--) {
name = attrs[i].name;
if (name.indexOf('data-') === 0) {
name = jQuery.camelCase(name.slice(5));
dataAttr(elem, name, data[name]);
}
}
data_priv.set(elem, 'hasDataAttrs', true);
}
}
return data;
}
// Sets multiple values
if (typeof key === 'object') {
return this.each(function () {
data_user.set(this, key);
});
}
return access(this, function (value) {
let data;
const camelKey = jQuery.camelCase(key);
// The calling jQuery object (element matches) is not empty
// (and therefore has an element appears at this[ 0 ]) and the
// `value` parameter was not undefined. An empty jQuery object
// will result in `undefined` for elem = this[ 0 ] which will
// throw an exception if an attempt to read a data cache is made.
if (elem && value === undefined) {
// Attempt to get data from the cache
// with the key as-is
data = data_user.get(elem, key);
if (data !== undefined) {
return data;
}
// Attempt to get data from the cache
// with the key camelized
data = data_user.get(elem, camelKey);
if (data !== undefined) {
return data;
}
// Attempt to "discover" the data in
// HTML5 custom data-* attrs
data = dataAttr(elem, camelKey, undefined);
if (data !== undefined) {
return data;
}
// We tried really hard, but the data doesn't exist.
return;
}
// Set the data...
this.each(function () {
// First, attempt to store a copy or reference of any
// data that might've been store with a camelCased key.
const data = data_user.get(this, camelKey);
// For HTML5 data-* attribute interop, we have to
// store property names with dashes in a camelCase form.
// This might not apply to all properties...*
data_user.set(this, camelKey, value);
// *... In the case of properties that might _actually_
// have dashes, we need to also store a copy of that
// unchanged property.
if (key.indexOf('-') !== -1 && data !== undefined) {
data_user.set(this, key, value);
}
});
}, null, value, arguments.length > 1, null, true);
},
removeData(key) {
return this.each(function () {
data_user.remove(this, key);
});
},
});
jQuery.extend({
queue(elem, type, data) {
let queue;
if (elem) {
type = `${type || 'fx'}queue`;
queue = data_priv.get(elem, type);
// Speed up dequeue by getting out quickly if this is just a lookup
if (data) {
if (!queue || jQuery.isArray(data)) {
queue = data_priv.access(elem, type, jQuery.makeArray(data));
} else {
queue.push(data);
}
}
return queue || [];
}
},
dequeue(elem, type) {
type = type || 'fx';
const queue = jQuery.queue(elem, type);
let startLength = queue.length;
let fn = queue.shift();
const hooks = jQuery._queueHooks(elem, type);
const next = function () {
jQuery.dequeue(elem, type);
};
// If the fx queue is dequeued, always remove the progress sentinel
if (fn === 'inprogress') {
fn = queue.shift();
startLength--;
}
if (fn) {
// Add a progress sentinel to prevent the fx queue from being
// automatically dequeued
if (type === 'fx') {
queue.unshift('inprogress');
}
// clear up the last queue stop function
delete hooks.stop;
fn.call(elem, next, hooks);
}
if (!startLength && hooks) {
hooks.empty.fire();
}
},
// not intended for public consumption - generates a queueHooks object, or returns the current one
_queueHooks(elem, type) {
const key = `${type}queueHooks`;
return data_priv.get(elem, key) || data_priv.access(elem, key, {
empty: jQuery.Callbacks('once memory').add(() => {
data_priv.remove(elem, [`${type}queue`, key]);
}),
});
},
});
jQuery.fn.extend({
queue(type, data) {
let setter = 2;
if (typeof type !== 'string') {
data = type;
type = 'fx';
setter--;
}
if (arguments.length < setter) {
return jQuery.queue(this[0], type);
}
return data === undefined
? this
: this.each(function () {
const queue = jQuery.queue(this, type, data);
// ensure a hooks for this queue
jQuery._queueHooks(this, type);
if (type === 'fx' && queue[0] !== 'inprogress') {
jQuery.dequeue(this, type);
}
});
},
dequeue(type) {
return this.each(function () {
jQuery.dequeue(this, type);
});
},
clearQueue(type) {
return this.queue(type || 'fx', []);
},
// Get a promise resolved when queues of a certain type
// are emptied (fx is the type by default)
promise(type, obj) {
let tmp;
let count = 1;
const defer = jQuery.Deferred();
const elements = this;
let i = this.length;
const resolve = function () {
if (!(--count)) {
defer.resolveWith(elements, [elements]);
}
};
if (typeof type !== 'string') {
obj = type;
type = undefined;
}
type = type || 'fx';
while (i--) {
tmp = data_priv.get(elements[i], `${type}queueHooks`);
if (tmp && tmp.empty) {
count++;
tmp.empty.add(resolve);
}
}
resolve();
return defer.promise(obj);
},
});
const pnum = (/[+-]?(?:\d*\.|)\d+(?:[eE][+-]?\d+|)/).source;
const cssExpand = ['Top', 'Right', 'Bottom', 'Left'];
const isHidden = function (elem, el) {
// isHidden might be called from jQuery#filter function;
// in that case, element will be second argument
elem = el || elem;
return jQuery.css(elem, 'display') === 'none' || !jQuery.contains(elem.ownerDocument, elem);
};
const rcheckableType = (/^(?:checkbox|radio)$/i);
(function () {
const fragment = document.createDocumentFragment();
const div = fragment.appendChild(document.createElement('div'));
// #11217 - WebKit loses check when the name is after the checked attribute
div.innerHTML = "";
// Support: Safari 5.1, iOS 5.1, Android 4.x, Android 2.3
// old WebKit doesn't clone checked state correctly in fragments
support.checkClone = div.cloneNode(true).cloneNode(true).lastChild.checked;
// Make sure textarea (and checkbox) defaultValue is properly cloned
// Support: IE9-IE11+
div.innerHTML = '';
support.noCloneChecked = !!div.cloneNode(true).lastChild.defaultValue;
}());
const strundefined = typeof undefined;
support.focusinBubbles = 'onfocusin' in window;
const
rkeyEvent = /^key/;
const rmouseEvent = /^(?:mouse|contextmenu)|click/;
const rfocusMorph = /^(?:focusinfocus|focusoutblur)$/;
const rtypenamespace = /^([^.]*)(?:\.(.+)|)$/;
function returnTrue() {
return true;
}
function returnFalse() {
return false;
}
function safeActiveElement() {
try {
return document.activeElement;
} catch (err) { }
}
/*
* Helper functions for managing events -- not part of the public interface.
* Props to Dean Edwards' addEvent library for many of the ideas.
*/
jQuery.event = {
global: {},
add(elem, types, handler, data, selector) {
let handleObjIn; let eventHandle; let tmp;
let events; let t; let handleObj;
let special; let handlers; let type; let namespaces; let origType;
const elemData = data_priv.get(elem);
// Don't attach events to noData or text/comment nodes (but allow plain objects)
if (!elemData) {
return;
}
// Caller can pass in an object of custom data in lieu of the handler
if (handler.handler) {
handleObjIn = handler;
handler = handleObjIn.handler;
selector = handleObjIn.selector;
}
// Make sure that the handler has a unique ID, used to find/remove it later
if (!handler.guid) {
handler.guid = jQuery.guid++;
}
// Init the element's event structure and main handler, if this is the first
if (!(events = elemData.events)) {
events = elemData.events = {};
}
if (!(eventHandle = elemData.handle)) {
eventHandle = elemData.handle = function (e) {
// Discard the second event of a jQuery.event.trigger() and
// when an event is called after a page has unloaded
return typeof jQuery !== strundefined && jQuery.event.triggered !== e.type
? jQuery.event.dispatch.apply(elem, arguments) : undefined;
};
}
// Handle multiple events separated by a space
types = (types || '').match(rnotwhite) || [''];
t = types.length;
while (t--) {
tmp = rtypenamespace.exec(types[t]) || [];
type = origType = tmp[1];
namespaces = (tmp[2] || '').split('.').sort();
// There *must* be a type, no attaching namespace-only handlers
if (!type) {
continue;
}
// If event changes its type, use the special event handlers for the changed type
special = jQuery.event.special[type] || {};
// If selector defined, determine special event api type, otherwise given type
type = (selector ? special.delegateType : special.bindType) || type;
// Update special based on newly reset type
special = jQuery.event.special[type] || {};
// handleObj is passed to all event handlers
handleObj = jQuery.extend({
type,
origType,
data,
handler,
guid: handler.guid,
selector,
needsContext: selector && jQuery.expr.match.needsContext.test(selector),
namespace: namespaces.join('.'),
}, handleObjIn);
// Init the event handler queue if we're the first
if (!(handlers = events[type])) {
handlers = events[type] = [];
handlers.delegateCount = 0;
// Only use addEventListener if the special events handler returns false
if (!special.setup || special.setup.call(elem, data, namespaces, eventHandle) === false) {
if (elem.addEventListener) {
elem.addEventListener(type, eventHandle, false);
}
}
}
if (special.add) {
special.add.call(elem, handleObj);
if (!handleObj.handler.guid) {
handleObj.handler.guid = handler.guid;
}
}
// Add to the element's handler list, delegates in front
if (selector) {
handlers.splice(handlers.delegateCount++, 0, handleObj);
} else {
handlers.push(handleObj);
}
// Keep track of which events have ever been used, for event optimization
jQuery.event.global[type] = true;
}
},
// Detach an event or set of events from an element
remove(elem, types, handler, selector, mappedTypes) {
let j; let origCount; let tmp;
let events; let t; let handleObj;
let special; let handlers; let type; let namespaces; let origType;
const elemData = data_priv.hasData(elem) && data_priv.get(elem);
if (!elemData || !(events = elemData.events)) {
return;
}
// Once for each type.namespace in types; type may be omitted
types = (types || '').match(rnotwhite) || [''];
t = types.length;
while (t--) {
tmp = rtypenamespace.exec(types[t]) || [];
type = origType = tmp[1];
namespaces = (tmp[2] || '').split('.').sort();
// Unbind all events (on this namespace, if provided) for the element
if (!type) {
for (type in events) {
jQuery.event.remove(elem, type + types[t], handler, selector, true);
}
continue;
}
special = jQuery.event.special[type] || {};
type = (selector ? special.delegateType : special.bindType) || type;
handlers = events[type] || [];
tmp = tmp[2] && new RegExp(`(^|\\.)${namespaces.join('\\.(?:.*\\.|)')}(\\.|$)`);
// Remove matching events
origCount = j = handlers.length;
while (j--) {
handleObj = handlers[j];
if ((mappedTypes || origType === handleObj.origType)
&& (!handler || handler.guid === handleObj.guid)
&& (!tmp || tmp.test(handleObj.namespace))
&& (!selector || selector === handleObj.selector || selector === '**' && handleObj.selector)) {
handlers.splice(j, 1);
if (handleObj.selector) {
handlers.delegateCount--;
}
if (special.remove) {
special.remove.call(elem, handleObj);
}
}
}
// Remove generic event handler if we removed something and no more handlers exist
// (avoids potential for endless recursion during removal of special event handlers)
if (origCount && !handlers.length) {
if (!special.teardown || special.teardown.call(elem, namespaces, elemData.handle) === false) {
jQuery.removeEvent(elem, type, elemData.handle);
}
delete events[type];
}
}
// Remove the expando if it's no longer used
if (jQuery.isEmptyObject(events)) {
delete elemData.handle;
data_priv.remove(elem, 'events');
}
},
trigger(event, data, elem, onlyHandlers) {
let i; let cur; let tmp; let bubbleType; let ontype; let handle; let special;
const eventPath = [elem || document];
let type = hasOwn.call(event, 'type') ? event.type : event;
let namespaces = hasOwn.call(event, 'namespace') ? event.namespace.split('.') : [];
cur = tmp = elem = elem || document;
// Don't do events on text and comment nodes
if (elem.nodeType === 3 || elem.nodeType === 8) {
return;
}
// focus/blur morphs to focusin/out; ensure we're not firing them right now
if (rfocusMorph.test(type + jQuery.event.triggered)) {
return;
}
if (type.indexOf('.') >= 0) {
// Namespaced trigger; create a regexp to match event type in handle()
namespaces = type.split('.');
type = namespaces.shift();
namespaces.sort();
}
ontype = type.indexOf(':') < 0 && `on${type}`;
// Caller can pass in a jQuery.Event object, Object, or just an event type string
event = event[jQuery.expando]
? event
: new jQuery.Event(type, typeof event === 'object' && event);
// Trigger bitmask: & 1 for native handlers; & 2 for jQuery (always true)
event.isTrigger = onlyHandlers ? 2 : 3;
event.namespace = namespaces.join('.');
event.namespace_re = event.namespace
? new RegExp(`(^|\\.)${namespaces.join('\\.(?:.*\\.|)')}(\\.|$)`)
: null;
// Clean up the event in case it is being reused
event.result = undefined;
if (!event.target) {
event.target = elem;
}
// Clone any incoming data and prepend the event, creating the handler arg list
data = data == null
? [event]
: jQuery.makeArray(data, [event]);
// Allow special events to draw outside the lines
special = jQuery.event.special[type] || {};
if (!onlyHandlers && special.trigger && special.trigger.apply(elem, data) === false) {
return;
}
// Determine event propagation path in advance, per W3C events spec (#9951)
// Bubble up to document, then to window; watch for a global ownerDocument var (#9724)
if (!onlyHandlers && !special.noBubble && !jQuery.isWindow(elem)) {
bubbleType = special.delegateType || type;
if (!rfocusMorph.test(bubbleType + type)) {
cur = cur.parentNode;
}
for (; cur; cur = cur.parentNode) {
eventPath.push(cur);
tmp = cur;
}
// Only add window if we got to document (e.g., not plain obj or detached DOM)
if (tmp === (elem.ownerDocument || document)) {
eventPath.push(tmp.defaultView || tmp.parentWindow || window);
}
}
// Fire handlers on the event path
i = 0;
while ((cur = eventPath[i++]) && !event.isPropagationStopped()) {
event.type = i > 1
? bubbleType
: special.bindType || type;
// jQuery handler
handle = (data_priv.get(cur, 'events') || {})[event.type] && data_priv.get(cur, 'handle');
if (handle) {
handle.apply(cur, data);
}
// Native handler
handle = ontype && cur[ontype];
if (handle && handle.apply && jQuery.acceptData(cur)) {
event.result = handle.apply(cur, data);
if (event.result === false) {
event.preventDefault();
}
}
}
event.type = type;
// If nobody prevented the default action, do it now
if (!onlyHandlers && !event.isDefaultPrevented()) {
if ((!special._default || special._default.apply(eventPath.pop(), data) === false)
&& jQuery.acceptData(elem)) {
// Call a native DOM method on the target with the same name name as the event.
// Don't do default actions on window, that's where global variables be (#6170)
if (ontype && jQuery.isFunction(elem[type]) && !jQuery.isWindow(elem)) {
// Don't re-trigger an onFOO event when we call its FOO() method
tmp = elem[ontype];
if (tmp) {
elem[ontype] = null;
}
// Prevent re-triggering of the same event, since we already bubbled it above
jQuery.event.triggered = type;
elem[type]();
jQuery.event.triggered = undefined;
if (tmp) {
elem[ontype] = tmp;
}
}
}
}
return event.result;
},
dispatch(event) {
// Make a writable jQuery.Event from the native event object
event = jQuery.event.fix(event);
let i; let j; let ret; let matched; let handleObj;
let handlerQueue = [];
const args = slice.call(arguments);
const handlers = (data_priv.get(this, 'events') || {})[event.type] || [];
const special = jQuery.event.special[event.type] || {};
// Use the fix-ed jQuery.Event rather than the (read-only) native event
args[0] = event;
event.delegateTarget = this;
// Call the preDispatch hook for the mapped type, and let it bail if desired
if (special.preDispatch && special.preDispatch.call(this, event) === false) {
return;
}
// Determine handlers
handlerQueue = jQuery.event.handlers.call(this, event, handlers);
// Run delegates first; they may want to stop propagation beneath us
i = 0;
while ((matched = handlerQueue[i++]) && !event.isPropagationStopped()) {
event.currentTarget = matched.elem;
j = 0;
while ((handleObj = matched.handlers[j++]) && !event.isImmediatePropagationStopped()) {
// Triggered event must either 1) have no namespace, or
// 2) have namespace(s) a subset or equal to those in the bound event (both can have no namespace).
if (!event.namespace_re || event.namespace_re.test(handleObj.namespace)) {
event.handleObj = handleObj;
event.data = handleObj.data;
ret = ((jQuery.event.special[handleObj.origType] || {}).handle || handleObj.handler)
.apply(matched.elem, args);
if (ret !== undefined) {
if ((event.result = ret) === false) {
event.preventDefault();
event.stopPropagation();
}
}
}
}
}
// Call the postDispatch hook for the mapped type
if (special.postDispatch) {
special.postDispatch.call(this, event);
}
return event.result;
},
handlers(event, handlers) {
let i; let matches; let sel; let handleObj;
const handlerQueue = [];
const { delegateCount } = handlers;
let cur = event.target;
// Find delegate handlers
// Black-hole SVG