https://www.univ-ubs.fr/plugins/jquery/resources/js/jquery.js

1/*!
2 * jQuery JavaScript Library v1.12.0
3 * http://jquery.com/
4 *
5 * Includes Sizzle.js
6 * http://sizzlejs.com/
7 *
8 * Copyright jQuery Foundation and other contributors
9 * Released under the MIT license
10 * http://jquery.org/license
11 *
12 * Date: 2016-01-08T19:56Z
13 */
14
15(function( global, factory ) {
16
17	if ( typeof module === "object" && typeof module.exports === "object" ) {
18		// For CommonJS and CommonJS-like environments where a proper `window`
19		// is present, execute the factory and get jQuery.
20		// For environments that do not have a `window` with a `document`
21		// (such as Node.js), expose a factory as module.exports.
22		// This accentuates the need for the creation of a real `window`.
23		// e.g. var jQuery = require("jquery")(window);
24		// See ticket #14549 for more info.
25		module.exports = global.document ?
26			factory( global, true ) :
27			function( w ) {
28				if ( !w.document ) {
29					throw new Error( "jQuery requires a window with a document" );
30				}
31				return factory( w );
32			};
33	} else {
34		factory( global );
35	}
36
37// Pass this if window is not defined yet
38}(typeof window !== "undefined" ? window : this, function( window, noGlobal ) {
39
40// Support: Firefox 18+
41// Can't be in strict mode, several libs including ASP.NET trace
42// the stack via arguments.caller.callee and Firefox dies if
43// you try to trace through "use strict" call chains. (#13335)
44//"use strict";
45var deletedIds = [];
46
47var document = window.document;
48
49var slice = deletedIds.slice;
50
51var concat = deletedIds.concat;
52
53var push = deletedIds.push;
54
55var indexOf = deletedIds.indexOf;
56
57var class2type = {};
58
59var toString = class2type.toString;
60
61var hasOwn = class2type.hasOwnProperty;
62
63var support = {};
64
65
66
67var
68	version = "1.12.0",
69
70	// Define a local copy of jQuery
71	jQuery = function( selector, context ) {
72
73		// The jQuery object is actually just the init constructor 'enhanced'
74		// Need init if jQuery is called (just allow error to be thrown if not included)
75		return new jQuery.fn.init( selector, context );
76	},
77
78	// Support: Android<4.1, IE<9
79	// Make sure we trim BOM and NBSP
80	rtrim = /^[\s\uFEFF\xA0]+|[\s\uFEFF\xA0]+$/g,
81
82	// Matches dashed string for camelizing
83	rmsPrefix = /^-ms-/,
84	rdashAlpha = /-([\da-z])/gi,
85
86	// Used by jQuery.camelCase as callback to replace()
87	fcamelCase = function( all, letter ) {
88		return letter.toUpperCase();
89	};
90
91jQuery.fn = jQuery.prototype = {
92
93	// The current version of jQuery being used
94	jquery: version,
95
96	constructor: jQuery,
97
98	// Start with an empty selector
99	selector: "",
100
101	// The default length of a jQuery object is 0
102	length: 0,
103
104	toArray: function() {
105		return slice.call( this );
106	},
107
108	// Get the Nth element in the matched element set OR
109	// Get the whole matched element set as a clean array
110	get: function( num ) {
111		return num != null ?
112
113			// Return just the one element from the set
114			( num < 0 ? this[ num + this.length ] : this[ num ] ) :
115
116			// Return all the elements in a clean array
117			slice.call( this );
118	},
119
120	// Take an array of elements and push it onto the stack
121	// (returning the new matched element set)
122	pushStack: function( elems ) {
123
124		// Build a new jQuery matched element set
125		var ret = jQuery.merge( this.constructor(), elems );
126
127		// Add the old object onto the stack (as a reference)
128		ret.prevObject = this;
129		ret.context = this.context;
130
131		// Return the newly-formed element set
132		return ret;
133	},
134
135	// Execute a callback for every element in the matched set.
136	each: function( callback ) {
137		return jQuery.each( this, callback );
138	},
139
140	map: function( callback ) {
141		return this.pushStack( jQuery.map( this, function( elem, i ) {
142			return callback.call( elem, i, elem );
143		} ) );
144	},
145
146	slice: function() {
147		return this.pushStack( slice.apply( this, arguments ) );
148	},
149
150	first: function() {
151		return this.eq( 0 );
152	},
153
154	last: function() {
155		return this.eq( -1 );
156	},
157
158	eq: function( i ) {
159		var len = this.length,
160			j = +i + ( i < 0 ? len : 0 );
161		return this.pushStack( j >= 0 && j < len ? [ this[ j ] ] : [] );
162	},
163
164	end: function() {
165		return this.prevObject || this.constructor();
166	},
167
168	// For internal use only.
169	// Behaves like an Array's method, not like a jQuery method.
170	push: push,
171	sort: deletedIds.sort,
172	splice: deletedIds.splice
173};
174
175jQuery.extend = jQuery.fn.extend = function() {
176	var src, copyIsArray, copy, name, options, clone,
177		target = arguments[ 0 ] || {},
178		i = 1,
179		length = arguments.length,
180		deep = false;

360	nodeName: function( elem, name ) {
361		return elem.nodeName && elem.nodeName.toLowerCase() === name.toLowerCase();
362	},
363
364	each: function( obj, callback ) {
365		var length, i = 0;
366
367		if ( isArrayLike( obj ) ) {
368			length = obj.length;
369			for ( ; i < length; i++ ) {
370				if ( callback.call( obj[ i ], i, obj[ i ] ) === false ) {
371					break;
372				}
373			}
374		} else {
375			for ( i in obj ) {
376				if ( callback.call( obj[ i ], i, obj[ i ] ) === false ) {
377					break;
378				}
379			}
380		}
381
382		return obj;
383	},
384
385	// Support: Android<4.1, IE<9
386	trim: function( text ) {
387		return text == null ?
388			"" :
389			( text + "" ).replace( rtrim, "" );
390	},
391
392	// results is for internal usage only
393	makeArray: function( arr, results ) {
394		var ret = results || [];
395
396		if ( arr != null ) {
397			if ( isArrayLike( Object( arr ) ) ) {
398				jQuery.merge( ret,
399					typeof arr === "string" ?
400					[ arr ] : arr
401				);
402			} else {
403				push.call( ret, arr );
404			}
405		}
406
407		return ret;
408	},
409
410	inArray: function( elem, arr, i ) {
411		var len;
412
413		if ( arr ) {
414			if ( indexOf ) {
415				return indexOf.call( arr, elem, i );
416			}
417
418			len = arr.length;
419			i = i ? i < 0 ? Math.max( 0, len + i ) : i : 0;
420
421			for ( ; i < len; i++ ) {
422
423				// Skip accessing in sparse arrays
424				if ( i in arr && arr[ i ] === elem ) {
425					return i;
426				}
427			}
428		}
429
430		return -1;
431	},
432
433	merge: function( first, second ) {
434		var len = +second.length,
435			j = 0,
436			i = first.length;
437
438		while ( j < len ) {
439			first[ i++ ] = second[ j++ ];
440		}
441
442		// Support: IE<9
443		// Workaround casting of .length to NaN on otherwise arraylike objects (e.g., NodeLists)
444		if ( len !== len ) {
445			while ( second[ j ] !== undefined ) {
446				first[ i++ ] = second[ j++ ];
447			}
448		}
449
450		first.length = i;
451
452		return first;
453	},
454
455	grep: function( elems, callback, invert ) {
456		var callbackInverse,
457			matches = [],
458			i = 0,
459			length = elems.length,
460			callbackExpect = !invert;
461
462		// Go through the array, only saving the items
463		// that pass the validator function
464		for ( ; i < length; i++ ) {
465			callbackInverse = !callback( elems[ i ], i );
466			if ( callbackInverse !== callbackExpect ) {
467				matches.push( elems[ i ] );
468			}
469		}
470
471		return matches;
472	},
473
474	// arg is for internal usage only
475	map: function( elems, callback, arg ) {
476		var length, value,
477			i = 0,
478			ret = [];
479
480		// Go through the array, translating each of the items to their new values
481		if ( isArrayLike( elems ) ) {
482			length = elems.length;
483			for ( ; i < length; i++ ) {
484				value = callback( elems[ i ], i, arg );
485
486				if ( value != null ) {
487					ret.push( value );
488				}
489			}
490
491		// Go through every key on the object,
492		} else {
493			for ( i in elems ) {
494				value = callback( elems[ i ], i, arg );
495
496				if ( value != null ) {
497					ret.push( value );
498				}
499			}
500		}
501
502		// Flatten any nested arrays
503		return concat.apply( [], ret );
504	},
505
506	// A global GUID counter for objects
507	guid: 1,
508
509	// Bind a function to a context, optionally partially applying any
510	// arguments.
511	proxy: function( fn, context ) {
512		var args, proxy, tmp;
513
514		if ( typeof context === "string" ) {
515			tmp = fn[ context ];
516			context = fn;
517			fn = tmp;
518		}
519
520		// Quick check to determine if target is callable, in the spec
521		// this throws a TypeError, but we will just return undefined.
522		if ( !jQuery.isFunction( fn ) ) {
523			return undefined;
524		}
525
526		// Simulated bind
527		args = slice.call( arguments, 2 );
528		proxy = function() {
529			return fn.apply( context || this, args.concat( slice.call( arguments ) ) );
530		};
531
532		// Set the guid of unique handler to the same of original handler, so it can be removed
533		proxy.guid = fn.guid = fn.guid || jQuery.guid++;
534
535		return proxy;
536	},
537
538	now: function() {
539		return +( new Date() );
540	},
541
542	// jQuery.support is not used in Core but other projects attach their
543	// properties to it so it needs to exist.
544	support: support
545} );
546
547// JSHint would error on this code due to the Symbol not being defined in ES5.
548// Defining this global in .jshintrc would create a danger of using the global
549// unguarded in another place, it seems safer to just disable JSHint for these
550// three lines.
551/* jshint ignore: start */
552if ( typeof Symbol === "function" ) {
553	jQuery.fn[ Symbol.iterator ] = deletedIds[ Symbol.iterator ];
554}
555/* jshint ignore: end */
556
557// Populate the class2type map
558jQuery.each( "Boolean Number String Function Array Date RegExp Object Error Symbol".split( " " ),
559function( i, name ) {
560	class2type[ "[object " + name + "]" ] = name.toLowerCase();
561} );
562
563function isArrayLike( obj ) {
564
565	// Support: iOS 8.2 (not reproducible in simulator)
566	// `in` check used to prevent JIT error (gh-2145)
567	// hasOwn isn't used here due to false negatives
568	// regarding Nodelist length in IE
569	var length = !!obj && "length" in obj && obj.length,
570		type = jQuery.type( obj );
571
572	if ( type === "function" || jQuery.isWindow( obj ) ) {
573		return false;
574	}
575
576	return type === "array" || length === 0 ||
577		typeof length === "number" && length > 0 && ( length - 1 ) in obj;
578}
579var Sizzle =
580/*!
581 * Sizzle CSS Selector Engine v2.2.1
582 * http://sizzlejs.com/
583 *
584 * Copyright jQuery Foundation and other contributors
585 * Released under the MIT license
586 * http://jquery.org/license
587 *
588 * Date: 2015-10-17
589 */
590(function( window ) {
591
592var i,
593	support,
594	Expr,
595	getText,
596	isXML,
597	tokenize,
598	compile,
599	select,
600	outermostContext,
601	sortInput,
602	hasDuplicate,
603
604	// Local document vars
605	setDocument,
606	document,
607	docElem,
608	documentIsHTML,
609	rbuggyQSA,
610	rbuggyMatches,
611	matches,
612	contains,
613
614	// Instance-specific data
615	expando = "sizzle" + 1 * new Date(),
616	preferredDoc = window.document,
617	dirruns = 0,
618	done = 0,
619	classCache = createCache(),
620	tokenCache = createCache(),
621	compilerCache = createCache(),
622	sortOrder = function( a, b ) {
623		if ( a === b ) {
624			hasDuplicate = true;
625		}
626		return 0;
627	},
628
629	// General-purpose constants
630	MAX_NEGATIVE = 1 << 31,
631
632	// Instance methods
633	hasOwn = ({}).hasOwnProperty,
634	arr = [],
635	pop = arr.pop,
636	push_native = arr.push,
637	push = arr.push,
638	slice = arr.slice,
639	// Use a stripped-down indexOf as it's faster than native
640	// http://jsperf.com/thor-indexof-vs-for/5
641	indexOf = function( list, elem ) {
642		var i = 0,
643			len = list.length;
644		for ( ; i < len; i++ ) {
645			if ( list[i] === elem ) {
646				return i;
647			}
648		}
649		return -1;
650	},
651
652	booleans = "checked|selected|async|autofocus|autoplay|controls|defer|disabled|hidden|ismap|loop|multiple|open|readonly|required|scoped",
653
654	// Regular expressions
655
656	// http://www.w3.org/TR/css3-selectors/#whitespace
657	whitespace = "[\\x20\\t\\r\\n\\f]",
658
659	// http://www.w3.org/TR/CSS21/syndata.html#value-def-identifier
660	identifier = "(?:\\\\.|[\\w-]|[^\\x00-\\xa0])+",
661
662	// Attribute selectors: http://www.w3.org/TR/selectors/#attribute-selectors
663	attributes = "\\[" + whitespace + "*(" + identifier + ")(?:" + whitespace +
664		// Operator (capture 2)
665		"*([*^$|!~]?=)" + whitespace +
666		// "Attribute values must be CSS identifiers [capture 5] or strings [capture 3 or capture 4]"
667		"*(?:'((?:\\\\.|[^\\\\'])*)'|\"((?:\\\\.|[^\\\\\"])*)\"|(" + identifier + "))|)" + whitespace +
668		"*\\]",
669
670	pseudos = ":(" + identifier + ")(?:\\((" +
671		// To reduce the number of selectors needing tokenize in the preFilter, prefer arguments:
672		// 1. quoted (capture 3; capture 4 or capture 5)
673		"('((?:\\\\.|[^\\\\'])*)'|\"((?:\\\\.|[^\\\\\"])*)\")|" +
674		// 2. simple (capture 6)
675		"((?:\\\\.|[^\\\\()[\\]]|" + attributes + ")*)|" +
676		// 3. anything else (capture 2)
677		".*" +
678		")\\)|)",
679
680	// Leading and non-escaped trailing whitespace, capturing some non-whitespace characters preceding the latter
681	rwhitespace = new RegExp( whitespace + "+", "g" ),
682	rtrim = new RegExp( "^" + whitespace + "+|((?:^|[^\\\\])(?:\\\\.)*)" + whitespace + "+$", "g" ),
683
684	rcomma = new RegExp( "^" + whitespace + "*," + whitespace + "*" ),
685	rcombinators = new RegExp( "^" + whitespace + "*([>+~]|" + whitespace + ")" + whitespace + "*" ),
686
687	rattributeQuotes = new RegExp( "=" + whitespace + "*([^\\]'\"]*?)" + whitespace + "*\\]", "g" ),
688
689	rpseudo = new RegExp( pseudos ),
690	ridentifier = new RegExp( "^" + identifier + "$" ),
691
692	matchExpr = {
693		"ID": new RegExp( "^#(" + identifier + ")" ),
694		"CLASS": new RegExp( "^\\.(" + identifier + ")" ),
695		"TAG": new RegExp( "^(" + identifier + "|[*])" ),
696		"ATTR": new RegExp( "^" + attributes ),
697		"PSEUDO": new RegExp( "^" + pseudos ),
698		"CHILD": new RegExp( "^:(only|first|last|nth|nth-last)-(child|of-type)(?:\\(" + whitespace +
699			"*(even|odd|(([+-]|)(\\d*)n|)" + whitespace + "*(?:([+-]|)" + whitespace +
700			"*(\\d+)|))" + whitespace + "*\\)|)", "i" ),
701		"bool": new RegExp( "^(?:" + booleans + ")$", "i" ),
702		// For use in libraries implementing .is()
703		// We use this for POS matching in `select`
704		"needsContext": new RegExp( "^" + whitespace + "*[>+~]|:(even|odd|eq|gt|lt|nth|first|last)(?:\\(" +
705			whitespace + "*((?:-\\d)?\\d*)" + whitespace + "*\\)|)(?=[^-]|$)", "i" )
706	},
707
708	rinputs = /^(?:input|select|textarea|button)$/i,
709	rheader = /^h\d$/i,
710
711	rnative = /^[^{]+\{\s*\[native \w/,
712
713	// Easily-parseable/retrievable ID or TAG or CLASS selectors
714	rquickExpr = /^(?:#([\w-]+)|(\w+)|\.([\w-]+))$/,
715
716	rsibling = /[+~]/,
717	rescape = /'|\\/g,
718
719	// CSS escapes http://www.w3.org/TR/CSS21/syndata.html#escaped-characters
720	runescape = new RegExp( "\\\\([\\da-f]{1,6}" + whitespace + "?|(" + whitespace + ")|.)", "ig" ),
721	funescape = function( _, escaped, escapedWhitespace ) {
722		var high = "0x" + escaped - 0x10000;
723		// NaN means non-codepoint
724		// Support: Firefox<24
725		// Workaround erroneous numeric interpretation of +"0x"
726		return high !== high || escapedWhitespace ?
727			escaped :
728			high < 0 ?
729				// BMP codepoint
730				String.fromCharCode( high + 0x10000 ) :
731				// Supplemental Plane codepoint (surrogate pair)
732				String.fromCharCode( high >> 10 | 0xD800, high & 0x3FF | 0xDC00 );
733	},
734
735	// Used for iframes
736	// See setDocument()
737	// Removing the function wrapper causes a "Permission Denied"
738	// error in IE
739	unloadHandler = function() {
740		setDocument();
741	};
742
743// Optimize for push.apply( _, NodeList )
744try {
745	push.apply(
746		(arr = slice.call( preferredDoc.childNodes )),
747		preferredDoc.childNodes
748	);
749	// Support: Android<4.0
750	// Detect silently failing push.apply
751	arr[ preferredDoc.childNodes.length ].nodeType;
752} catch ( e ) {
753	push = { apply: arr.length ?
754
755		// Leverage slice if possible
756		function( target, els ) {
757			push_native.apply( target, slice.call(els) );
758		} :
759
760		// Support: IE<9
761		// Otherwise append directly
762		function( target, els ) {
763			var j = target.length,
764				i = 0;
765			// Can't trust NodeList.length
766			while ( (target[j++] = els[i++]) ) {}
767			target.length = j - 1;
768		}
769	};
770}
771
772function Sizzle( selector, context, results, seed ) {
773	var m, i, elem, nid, nidselect, match, groups, newSelector,
774		newContext = context && context.ownerDocument,
775
776		// nodeType defaults to 9, since context defaults to document
777		nodeType = context ? context.nodeType : 9;
778
779	results = results || [];
780
781	// Return early from calls with invalid selector or context
782	if ( typeof selector !== "string" || !selector ||
783		nodeType !== 1 && nodeType !== 9 && nodeType !== 11 ) {
784
785		return results;
786	}
787
788	// Try to shortcut find operations (as opposed to filters) in HTML documents
789	if ( !seed ) {
790
791		if ( ( context ? context.ownerDocument || context : preferredDoc ) !== document ) {
792			setDocument( context );
793		}
794		context = context || document;
795
796		if ( documentIsHTML ) {
797
798			// If the selector is sufficiently simple, try using a "get*By*" DOM method
799			// (excepting DocumentFragment context, where the methods don't exist)
800			if ( nodeType !== 11 && (match = rquickExpr.exec( selector )) ) {
801
802				// ID selector
803				if ( (m = match[1]) ) {
804
805					// Document context
806					if ( nodeType === 9 ) {
807						if ( (elem = context.getElementById( m )) ) {
808
809							// Support: IE, Opera, Webkit
810							// TODO: identify versions
811							// getElementById can match elements by name instead of ID
812							if ( elem.id === m ) {
813								results.push( elem );
814								return results;
815							}
816						} else {
817							return results;
818						}
819
820					// Element context
821					} else {
822
823						// Support: IE, Opera, Webkit
824						// TODO: identify versions
825						// getElementById can match elements by name instead of ID
826						if ( newContext && (elem = newContext.getElementById( m )) &&
827							contains( context, elem ) &&
828							elem.id === m ) {
829
830							results.push( elem );
831							return results;
832						}
833					}
834
835				// Type selector
836				} else if ( match[2] ) {
837					push.apply( results, context.getElementsByTagName( selector ) );
838					return results;
839
840				// Class selector
841				} else if ( (m = match[3]) && support.getElementsByClassName &&
842					context.getElementsByClassName ) {
843
844					push.apply( results, context.getElementsByClassName( m ) );
845					return results;
846				}
847			}
848
849			// Take advantage of querySelectorAll
850			if ( support.qsa &&
851				!compilerCache[ selector + " " ] &&
852				(!rbuggyQSA || !rbuggyQSA.test( selector )) ) {
853
854				if ( nodeType !== 1 ) {
855					newContext = context;
856					newSelector = selector;
857
858				// qSA looks outside Element context, which is not what we want
859				// Thanks to Andrew Dupont for this workaround technique
860				// Support: IE <=8
861				// Exclude object elements
862				} else if ( context.nodeName.toLowerCase() !== "object" ) {
863
864					// Capture the context ID, setting it first if necessary
865					if ( (nid = context.getAttribute( "id" )) ) {
866						nid = nid.replace( rescape, "\\$&" );
867					} else {
868						context.setAttribute( "id", (nid = expando) );
869					}
870
871					// Prefix every selector in the list
872					groups = tokenize( selector );
873					i = groups.length;
874					nidselect = ridentifier.test( nid ) ? "#" + nid : "[id='" + nid + "']";
875					while ( i-- ) {
876						groups[i] = nidselect + " " + toSelector( groups[i] );
877					}
878					newSelector = groups.join( "," );
879
880					// Expand context for sibling selectors
881					newContext = rsibling.test( selector ) && testContext( context.parentNode ) ||
882						context;
883				}
884
885				if ( newSelector ) {
886					try {
887						push.apply( results,
888							newContext.querySelectorAll( newSelector )
889						);
890						return results;
891					} catch ( qsaError ) {
892					} finally {
893						if ( nid === expando ) {
894							context.removeAttribute( "id" );
895						}
896					}
897				}
898			}
899		}
900	}
901
902	// All others
903	return select( selector.replace( rtrim, "$1" ), context, results, seed );
904}
905
906/**
907 * Create key-value caches of limited size
908 * @returns {function(string, object)} Returns the Object data after storing it on itself with
909 *	property name the (space-suffixed) string and (if the cache is larger than Expr.cacheLength)
910 *	deleting the oldest entry
911 */
912function createCache() {
913	var keys = [];
914
915	function cache( key, value ) {
916		// Use (key + " ") to avoid collision with native prototype properties (see Issue #157)
917		if ( keys.push( key + " " ) > Expr.cacheLength ) {
918			// Only keep the most recent entries
919			delete cache[ keys.shift() ];
920		}
921		return (cache[ key + " " ] = value);
922	}
923	return cache;
924}
925
926/**
927 * Mark a function for special use by Sizzle
928 * @param {Function} fn The function to mark
929 */
930function markFunction( fn ) {
931	fn[ expando ] = true;
932	return fn;
933}
934
935/**
936 * Support testing using an element
937 * @param {Function} fn Passed the created div and expects a boolean result
938 */
939function assert( fn ) {
940	var div = document.createElement("div");
941
942	try {
943		return !!fn( div );
944	} catch (e) {
945		return false;
946	} finally {
947		// Remove from its parent by default
948		if ( div.parentNode ) {
949			div.parentNode.removeChild( div );
950		}
951		// release memory in IE
952		div = null;
953	}
954}
955
956/**
957 * Adds the same handler for all of the specified attrs
958 * @param {String} attrs Pipe-separated list of attributes
959 * @param {Function} handler The method that will be applied
960 */
961function addHandle( attrs, handler ) {
962	var arr = attrs.split("|"),
963		i = arr.length;
964
965	while ( i-- ) {
966		Expr.attrHandle[ arr[i] ] = handler;
967	}
968}
969
970/**
971 * Checks document order of two siblings
972 * @param {Element} a
973 * @param {Element} b
974 * @returns {Number} Returns less than 0 if a precedes b, greater than 0 if a follows b
975 */
976function siblingCheck( a, b ) {
977	var cur = b && a,
978		diff = cur && a.nodeType === 1 && b.nodeType === 1 &&
979			( ~b.sourceIndex || MAX_NEGATIVE ) -
980			( ~a.sourceIndex || MAX_NEGATIVE );
981
982	// Use IE sourceIndex if available on both nodes
983	if ( diff ) {
984		return diff;
985	}
986
987	// Check if b follows a
988	if ( cur ) {
989		while ( (cur = cur.nextSibling) ) {
990			if ( cur === b ) {
991				return -1;
992			}
993		}
994	}
995
996	return a ? 1 : -1;
997}
998
999/**
1000 * Returns a function to use in pseudos for input types
1001 * @param {String} type
1002 */
1003function createInputPseudo( type ) {
1004	return function( elem ) {
1005		var name = elem.nodeName.toLowerCase();
1006		return name === "input" && elem.type === type;
1007	};
1008}
1009
1010/**
1011 * Returns a function to use in pseudos for buttons
1012 * @param {String} type
1013 */
1014function createButtonPseudo( type ) {
1015	return function( elem ) {
1016		var name = elem.nodeName.toLowerCase();
1017		return (name === "input" || name === "button") && elem.type === type;
1018	};
1019}
1020
1021/**
1022 * Returns a function to use in pseudos for positionals
1023 * @param {Function} fn
1024 */
1025function createPositionalPseudo( fn ) {
1026	return markFunction(function( argument ) {
1027		argument = +argument;
1028		return markFunction(function( seed, matches ) {
1029			var j,
1030				matchIndexes = fn( [], seed.length, argument ),
1031				i = matchIndexes.length;
1032
1033			// Match elements found at the specified indexes
1034			while ( i-- ) {
1035				if ( seed[ (j = matchIndexes[i]) ] ) {
1036					seed[j] = !(matches[j] = seed[j]);
1037				}
1038			}
1039		});
1040	});
1041}
1042
1043/**
1044 * Checks a node for validity as a Sizzle context
1045 * @param {Element|Object=} context
1046 * @returns {Element|Object|Boolean} The input node if acceptable, otherwise a falsy value
1047 */
1048function testContext( context ) {
1049	return context && typeof context.getElementsByTagName !== "undefined" && context;
1050}
1051
1052// Expose support vars for convenience
1053support = Sizzle.support = {};
1054
1055/**
1056 * Detects XML nodes
1057 * @param {Element|Object} elem An element or a document
1058 * @returns {Boolean} True iff elem is a non-HTML XML node
1059 */
1060isXML = Sizzle.isXML = function( elem ) {
1061	// documentElement is verified for cases where it doesn't yet exist
1062	// (such as loading iframes in IE - #4833)
1063	var documentElement = elem && (elem.ownerDocument || elem).documentElement;
1064	return documentElement ? documentElement.nodeName !== "HTML" : false;
1065};
1066
1067/**
1068 * Sets document-related variables once based on the current document
1069 * @param {Element|Object} [doc] An element or document object to use to set the document
1070 * @returns {Object} Returns the current document
1071 */
1072setDocument = Sizzle.setDocument = function( node ) {
1073	var hasCompare, parent,
1074		doc = node ? node.ownerDocument || node : preferredDoc;
1075
1076	// Return early if doc is invalid or already selected
1077	if ( doc === document || doc.nodeType !== 9 || !doc.documentElement ) {
1078		return document;
1079	}
1080
1081	// Update global variables
1082	document = doc;
1083	docElem = document.documentElement;
1084	documentIsHTML = !isXML( document );
1085
1086	// Support: IE 9-11, Edge
1087	// Accessing iframe documents after unload throws "permission denied" errors (jQuery #13936)
1088	if ( (parent = document.defaultView) && parent.top !== parent ) {
1089		// Support: IE 11
1090		if ( parent.addEventListener ) {
1091			parent.addEventListener( "unload", unloadHandler, false );
1092
1093		// Support: IE 9 - 10 only
1094		} else if ( parent.attachEvent ) {
1095			parent.attachEvent( "onunload", unloadHandler );
1096		}
1097	}
1098
1099	/* Attributes
1100	---------------------------------------------------------------------- */
1101
1102	// Support: IE<8
1103	// Verify that getAttribute really returns attributes and not properties
1104	// (excepting IE8 booleans)
1105	support.attributes = assert(function( div ) {
1106		div.className = "i";
1107		return !div.getAttribute("className");
1108	});
1109
1110	/* getElement(s)By*
1111	---------------------------------------------------------------------- */
1112
1113	// Check if getElementsByTagName("*") returns only elements
1114	support.getElementsByTagName = assert(function( div ) {
1115		div.appendChild( document.createComment("") );
1116		return !div.getElementsByTagName("*").length;
1117	});
1118
1119	// Support: IE<9
1120	support.getElementsByClassName = rnative.test( document.getElementsByClassName );
1121
1122	// Support: IE<10
1123	// Check if getElementById returns elements by name
1124	// The broken getElementById methods don't pick up programatically-set names,
1125	// so use a roundabout getElementsByName test
1126	support.getById = assert(function( div ) {
1127		docElem.appendChild( div ).id = expando;
1128		return !document.getElementsByName || !document.getElementsByName( expando ).length;
1129	});
1130
1131	// ID find and filter
1132	if ( support.getById ) {
1133		Expr.find["ID"] = function( id, context ) {
1134			if ( typeof context.getElementById !== "undefined" && documentIsHTML ) {
1135				var m = context.getElementById( id );
1136				return m ? [ m ] : [];
1137			}
1138		};
1139		Expr.filter["ID"] = function( id ) {
1140			var attrId = id.replace( runescape, funescape );
1141			return function( elem ) {
1142				return elem.getAttribute("id") === attrId;
1143			};
1144		};
1145	} else {
1146		// Support: IE6/7
1147		// getElementById is not reliable as a find shortcut
1148		delete Expr.find["ID"];
1149
1150		Expr.filter["ID"] =  function( id ) {
1151			var attrId = id.replace( runescape, funescape );
1152			return function( elem ) {
1153				var node = typeof elem.getAttributeNode !== "undefined" &&
1154					elem.getAttributeNode("id");
1155				return node && node.value === attrId;
1156			};
1157		};
1158	}
1159
1160	// Tag
1161	Expr.find["TAG"] = support.getElementsByTagName ?
1162		function( tag, context ) {
1163			if ( typeof context.getElementsByTagName !== "undefined" ) {
1164				return context.getElementsByTagName( tag );
1165
1166			// DocumentFragment nodes don't have gEBTN
1167			} else if ( support.qsa ) {
1168				return context.querySelectorAll( tag );
1169			}
1170		} :
1171
1172		function( tag, context ) {
1173			var elem,
1174				tmp = [],
1175				i = 0,
1176				// By happy coincidence, a (broken) gEBTN appears on DocumentFragment nodes too
1177				results = context.getElementsByTagName( tag );
1178
1179			// Filter out possible comments
1180			if ( tag === "*" ) {
1181				while ( (elem = results[i++]) ) {
1182					if ( elem.nodeType === 1 ) {
1183						tmp.push( elem );
1184					}
1185				}
1186
1187				return tmp;
1188			}
1189			return results;
1190		};
1191
1192	// Class
1193	Expr.find["CLASS"] = support.getElementsByClassName && function( className, context ) {
1194		if ( typeof context.getElementsByClassName !== "undefined" && documentIsHTML ) {
1195			return context.getElementsByClassName( className );
1196		}
1197	};
1198
1199	/* QSA/matchesSelector
1200	---------------------------------------------------------------------- */
1201
1202	// QSA and matchesSelector support
1203
1204	// matchesSelector(:active) reports false when true (IE9/Opera 11.5)
1205	rbuggyMatches = [];
1206
1207	// qSa(:focus) reports false when true (Chrome 21)
1208	// We allow this because of a bug in IE8/9 that throws an error
1209	// whenever `document.activeElement` is accessed on an iframe
1210	// So, we allow :focus to pass through QSA all the time to avoid the IE error
1211	// See http://bugs.jquery.com/ticket/13378
1212	rbuggyQSA = [];
1213
1214	if ( (support.qsa = rnative.test( document.querySelectorAll )) ) {
1215		// Build QSA regex
1216		// Regex strategy adopted from Diego Perini
1217		assert(function( div ) {
1218			// Select is set to empty string on purpose
1219			// This is to test IE's treatment of not explicitly
1220			// setting a boolean content attribute,
1221			// since its presence should be enough
1222			// http://bugs.jquery.com/ticket/12359
1223			docElem.appendChild( div ).innerHTML = "<a id='" + expando + "'></a>" +
1224				"<select id='" + expando + "-\r\\' msallowcapture=''>" +
1225				"<option selected=''></option></select>";
1226
1227			// Support: IE8, Opera 11-12.16
1228			// Nothing should be selected when empty strings follow ^= or $= or *=
1229			// The test attribute must be unknown in Opera but "safe" for WinRT
1230			// http://msdn.microsoft.com/en-us/library/ie/hh465388.aspx#attribute_section
1231			if ( div.querySelectorAll("[msallowcapture^='']").length ) {
1232				rbuggyQSA.push( "[*^$]=" + whitespace + "*(?:''|\"\")" );
1233			}
1234
1235			// Support: IE8
1236			// Boolean attributes and "value" are not treated correctly
1237			if ( !div.querySelectorAll("[selected]").length ) {
1238				rbuggyQSA.push( "\\[" + whitespace + "*(?:value|" + booleans + ")" );
1239			}
1240
1241			// Support: Chrome<29, Android<4.4, Safari<7.0+, iOS<7.0+, PhantomJS<1.9.8+
1242			if ( !div.querySelectorAll( "[id~=" + expando + "-]" ).length ) {
1243				rbuggyQSA.push("~=");
1244			}
1245
1246			// Webkit/Opera - :checked should return selected option elements
1247			// http://www.w3.org/TR/2011/REC-css3-selectors-20110929/#checked
1248			// IE8 throws error here and will not see later tests
1249			if ( !div.querySelectorAll(":checked").length ) {
1250				rbuggyQSA.push(":checked");
1251			}
1252
1253			// Support: Safari 8+, iOS 8+
1254			// https://bugs.webkit.org/show_bug.cgi?id=136851
1255			// In-page `selector#id sibing-combinator selector` fails
1256			if ( !div.querySelectorAll( "a#" + expando + "+*" ).length ) {
1257				rbuggyQSA.push(".#.+[+~]");
1258			}
1259		});
1260
1261		assert(function( div ) {
1262			// Support: Windows 8 Native Apps
1263			// The type and name attributes are restricted during .innerHTML assignment
1264			var input = document.createElement("input");
1265			input.setAttribute( "type", "hidden" );
1266			div.appendChild( input ).setAttribute( "name", "D" );
1267
1268			// Support: IE8
1269			// Enforce case-sensitivity of name attribute
1270			if ( div.querySelectorAll("[name=d]").length ) {
1271				rbuggyQSA.push( "name" + whitespace + "*[*^$|!~]?=" );
1272			}
1273
1274			// FF 3.5 - :enabled/:disabled and hidden elements (hidden elements are still enabled)
1275			// IE8 throws error here and will not see later tests
1276			if ( !div.querySelectorAll(":enabled").length ) {
1277				rbuggyQSA.push( ":enabled", ":disabled" );
1278			}
1279
1280			// Opera 10-11 does not throw on post-comma invalid pseudos
1281			div.querySelectorAll("*,:x");
1282			rbuggyQSA.push(",.*:");
1283		});
1284	}
1285
1286	if ( (support.matchesSelector = rnative.test( (matches = docElem.matches ||
1287		docElem.webkitMatchesSelector ||
1288		docElem.mozMatchesSelector ||
1289		docElem.oMatchesSelector ||
1290		docElem.msMatchesSelector) )) ) {
1291
1292		assert(function( div ) {
1293			// Check to see if it's possible to do matchesSelector
1294			// on a disconnected node (IE 9)
1295			support.disconnectedMatch = matches.call( div, "div" );
1296
1297			// This should fail with an exception
1298			// Gecko does not error, returns false instead
1299			matches.call( div, "[s!='']:x" );
1300			rbuggyMatches.push( "!=", pseudos );
1301		});
1302	}
1303
1304	rbuggyQSA = rbuggyQSA.length && new RegExp( rbuggyQSA.join("|") );
1305	rbuggyMatches = rbuggyMatches.length && new RegExp( rbuggyMatches.join("|") );
1306
1307	/* Contains
1308	---------------------------------------------------------------------- */
1309	hasCompare = rnative.test( docElem.compareDocumentPosition );
1310
1311	// Element contains another
1312	// Purposefully self-exclusive
1313	// As in, an element does not contain itself
1314	contains = hasCompare || rnative.test( docElem.contains ) ?
1315		function( a, b ) {
1316			var adown = a.nodeType === 9 ? a.documentElement : a,
1317				bup = b && b.parentNode;
1318			return a === bup || !!( bup && bup.nodeType === 1 && (
1319				adown.contains ?
1320					adown.contains( bup ) :
1321					a.compareDocumentPosition && a.compareDocumentPosition( bup ) & 16
1322			));
1323		} :
1324		function( a, b ) {
1325			if ( b ) {
1326				while ( (b = b.parentNode) ) {
1327					if ( b === a ) {
1328						return true;
1329					}
1330				}
1331			}
1332			return false;
1333		};
1334
1335	/* Sorting
1336	---------------------------------------------------------------------- */
1337
1338	// Document order sorting
1339	sortOrder = hasCompare ?
1340	function( a, b ) {
1341
1342		// Flag for duplicate removal
1343		if ( a === b ) {
1344			hasDuplicate = true;
1345			return 0;
1346		}
1347
1348		// Sort on method existence if only one input has compareDocumentPosition
1349		var compare = !a.compareDocumentPosition - !b.compareDocumentPosition;
1350		if ( compare ) {
1351			return compare;
1352		}
1353
1354		// Calculate position if both inputs belong to the same document
1355		compare = ( a.ownerDocument || a ) === ( b.ownerDocument || b ) ?
1356			a.compareDocumentPosition( b ) :
1357
1358			// Otherwise we know they are disconnected
1359			1;
1360
1361		// Disconnected nodes
1362		if ( compare & 1 ||
1363			(!support.sortDetached && b.compareDocumentPosition( a ) === compare) ) {
1364
1365			// Choose the first element that is related to our preferred document
1366			if ( a === document || a.ownerDocument === preferredDoc && contains(preferredDoc, a) ) {
1367				return -1;
1368			}
1369			if ( b === document || b.ownerDocument === preferredDoc && contains(preferredDoc, b) ) {
1370				return 1;
1371			}
1372
1373			// Maintain original order
1374			return sortInput ?
1375				( indexOf( sortInput, a ) - indexOf( sortInput, b ) ) :
1376				0;
1377		}
1378
1379		return compare & 4 ? -1 : 1;
1380	} :
1381	function( a, b ) {
1382		// Exit early if the nodes are identical
1383		if ( a === b ) {
1384			hasDuplicate = true;
1385			return 0;
1386		}
1387
1388		var cur,
1389			i = 0,
1390			aup = a.parentNode,
1391			bup = b.parentNode,
1392			ap = [ a ],
1393			bp = [ b ];
1394
1395		// Parentless nodes are either documents or disconnected
1396		if ( !aup || !bup ) {
1397			return a === document ? -1 :
1398				b === document ? 1 :
1399				aup ? -1 :
1400				bup ? 1 :
1401				sortInput ?
1402				( indexOf( sortInput, a ) - indexOf( sortInput, b ) ) :
1403				0;
1404
1405		// If the nodes are siblings, we can do a quick check
1406		} else if ( aup === bup ) {
1407			return siblingCheck( a, b );
1408		}
1409
1410		// Otherwise we need full lists of their ancestors for comparison
1411		cur = a;
1412		while ( (cur = cur.parentNode) ) {
1413			ap.unshift( cur );
1414		}
1415		cur = b;
1416		while ( (cur = cur.parentNode) ) {
1417			bp.unshift( cur );
1418		}
1419
1420		// Walk down the tree looking for a discrepancy
1421		while ( ap[i] === bp[i] ) {
1422			i++;
1423		}
1424
1425		return i ?
1426			// Do a sibling check if the nodes have a common ancestor
1427			siblingCheck( ap[i], bp[i] ) :
1428
1429			// Otherwise nodes in our document sort first
1430			ap[i] === preferredDoc ? -1 :
1431			bp[i] === preferredDoc ? 1 :
1432			0;
1433	};
1434
1435	return document;
1436};
1437
1438Sizzle.matches = function( expr, elements ) {
1439	return Sizzle( expr, null, null, elements );
1440};
1441
1442Sizzle.matchesSelector = function( elem, expr ) {
1443	// Set document vars if needed
1444	if ( ( elem.ownerDocument || elem ) !== document ) {
1445		setDocument( elem );
1446	}
1447
1448	// Make sure that attribute selectors are quoted
1449	expr = expr.replace( rattributeQuotes, "='$1']" );
1450
1451	if ( support.matchesSelector && documentIsHTML &&
1452		!compilerCache[ expr + " " ] &&
1453		( !rbuggyMatches || !rbuggyMatches.test( expr ) ) &&
1454		( !rbuggyQSA     || !rbuggyQSA.test( expr ) ) ) {
1455
1456		try {
1457			var ret = matches.call( elem, expr );
1458
1459			// IE 9's matchesSelector returns false on disconnected nodes
1460			if ( ret || support.disconnectedMatch ||
1461					// As well, disconnected nodes are said to be in a document
1462					// fragment in IE 9
1463					elem.document && elem.document.nodeType !== 11 ) {
1464				return ret;
1465			}
1466		} catch (e) {}
1467	}
1468
1469	return Sizzle( expr, document, null, [ elem ] ).length > 0;
1470};
1471
1472Sizzle.contains = function( context, elem ) {
1473	// Set document vars if needed
1474	if ( ( context.ownerDocument || context ) !== document ) {
1475		setDocument( context );
1476	}
1477	return contains( context, elem );
1478};
1479
1480Sizzle.attr = function( elem, name ) {
1481	// Set document vars if needed
1482	if ( ( elem.ownerDocument || elem ) !== document ) {
1483		setDocument( elem );
1484	}
1485
1486	var fn = Expr.attrHandle[ name.toLowerCase() ],
1487		// Don't get fooled by Object.prototype properties (jQuery #13807)
1488		val = fn && hasOwn.call( Expr.attrHandle, name.toLowerCase() ) ?
1489			fn( elem, name, !documentIsHTML ) :
1490			undefined;
1491
1492	return val !== undefined ?
1493		val :
1494		support.attributes || !documentIsHTML ?
1495			elem.getAttribute( name ) :
1496			(val = elem.getAttributeNode(name)) && val.specified ?
1497				val.value :
1498				null

1498;
1499};
1500
1501Sizzle.error = function( msg ) {
1502	throw new Error( "Syntax error, unrecognized expression: " + msg );
1503};
1504
1505/**
1506 * Document sorting and removing duplicates
1507 * @param {ArrayLike} results
1508 */
1509Sizzle.uniqueSort = function( results ) {
1510	var elem,
1511		duplicates = [],
1512		j = 0,
1513		i = 0;
1514
1515	// Unless we *know* we can detect duplicates, assume their presence
1516	hasDuplicate = !support.detectDuplicates;
1517	sortInput = !support.sortStable && results.slice( 0 );
1518	results.sort( sortOrder );
1519
1520	if ( hasDuplicate ) {
1521		while ( (elem = results[i++]) ) {
1522			if ( elem === results[ i ] ) {
1523				j = duplicates.push( i );
1524			}
1525		}
1526		while ( j-- ) {
1527			results.splice( duplicates[ j ], 1 );
1528		}
1529	}
1530
1531	// Clear input after sorting to release objects
1532	// See https://github.com/jquery/sizzle/pull/225
1533	sortInput = null;
1534
1535	return results;
1536};
1537
1538/**
1539 * Utility function for retrieving the text value of an array of DOM nodes
1540 * @param {Array|Element} elem
1541 */
1542getText = Sizzle.getText = function( elem ) {
1543	var node,
1544		ret = "",
1545		i = 0,
1546		nodeType = elem.nodeType;
1547
1548	if ( !nodeType ) {
1549		// If no nodeType, this is expected to be an array
1550		while ( (node = elem[i++]) ) {
1551			// Do not traverse comment nodes
1552			ret += getText( node );
1553		}
1554	} else if ( nodeType === 1 || nodeType === 9 || nodeType === 11 ) {
1555		// Use textContent for elements
1556		// innerText usage removed for consistency of new lines (jQuery #11153)
1557		if ( typeof elem.textContent === "string" ) {
1558			return elem.textContent;
1559		} else {
1560			// Traverse its children
1561			for ( elem = elem.firstChild; elem; elem = elem.nextSibling ) {
1562				ret += getText( elem );
1563			}
1564		}
1565	} else if ( nodeType === 3 || nodeType === 4 ) {
1566		return elem.nodeValue;
1567	}
1568	// Do not include comment or processing instruction nodes
1569
1570	return ret;
1571};
1572
1573Expr = Sizzle.selectors = {
1574
1575	// Can be adjusted by the user
1576	cacheLength: 50,
1577
1578	createPseudo: markFunction,
1579
1580	match: matchExpr,
1581
1582	attrHandle: {},
1583
1584	find: {},
1585
1586	relative: {
1587		">": { dir: "parentNode", first: true },
1588		" ": { dir: "parentNode" },
1589		"+": { dir: "previousSibling", first: true },
1590		"~": { dir: "previousSibling" }
1591	},
1592
1593	preFilter: {
1594		"ATTR": function( match ) {
1595			match[1] = match[1].replace( runescape, funescape );
1596
1597			// Move the given value to match[3] whether quoted or unquoted
1598			match[3] = ( match[3] || match[4] || match[5] || "" ).replace( runescape, funescape );
1599
1600			if ( match[2] === "~=" ) {
1601				match[3] = " " + match[3] + " ";
1602			}
1603
1604			return match.slice( 0, 4 );
1605		},
1606
1607		"CHILD": function( match ) {
1608			/* matches from matchExpr["CHILD"]
1609				1 type (only|nth|...)
1610				2 what (child|of-type)
1611				3 argument (even|odd|\d*|\d*n([+-]\d+)?|...)
1612				4 xn-component of xn+y argument ([+-]?\d*n|)
1613				5 sign of xn-component
1614				6 x of xn-component
1615				7 sign of y-component
1616				8 y of y-component
1617			*/
1618			match[1] = match[1].toLowerCase();
1619
1620			if ( match[1].slice( 0, 3 ) === "nth" ) {
1621				// nth-* requires argument
1622				if ( !match[3] ) {
1623					Sizzle.error( match[0] );
1624				}
1625
1626				// numeric x and y parameters for Expr.filter.CHILD
1627				// remember that false/true cast respectively to 0/1
1628				match[4] = +( match[4] ? match[5] + (match[6] || 1) : 2 * ( match[3] === "even" || match[3] === "odd" ) );
1629				match[5] = +( ( match[7] + match[8] ) || match[3] === "odd" );
1630
1631			// other types prohibit arguments
1632			} else if ( match[3] ) {
1633				Sizzle.error( match[0] );
1634			}
1635
1636			return match;
1637		},
1638
1639		"PSEUDO": function( match ) {
1640			var excess,
1641				unquoted = !match[6] && match[2];
1642
1643			if ( matchExpr["CHILD"].test( match[0] ) ) {
1644				return null;
1645			}
1646
1647			// Accept quoted arguments as-is
1648			if ( match[3] ) {
1649				match[2] = match[4] || match[5] || "";
1650
1651			// Strip excess characters from unquoted arguments
1652			} else if ( unquoted && rpseudo.test( unquoted ) &&
1653				// Get excess from tokenize (recursively)
1654				(excess = tokenize( unquoted, true )) &&
1655				// advance to the next closing parenthesis
1656				(excess = unquoted.indexOf( ")", unquoted.length - excess ) - unquoted.length) ) {
1657
1658				// excess is a negative index
1659				match[0] = match[0].slice( 0, excess );
1660				match[2] = unquoted.slice( 0, excess );
1661			}
1662
1663			// Return only captures needed by the pseudo filter method (type and argument)
1664			return match.slice( 0, 3 );
1665		}
1666	},
1667
1668	filter: {
1669
1670		"TAG": function( nodeNameSelector ) {
1671			var nodeName = nodeNameSelector.replace( runescape, funescape ).toLowerCase();
1672			return nodeNameSelector === "*" ?
1673				function() { return true; } :
1674				function( elem ) {
1675					return elem.nodeName && elem.nodeName.toLowerCase() === nodeName;
1676				};
1677		},
1678
1679		"CLASS": function( className ) {
1680			var pattern = classCache[ className + " " ];
1681
1682			return pattern ||
1683				(pattern = new RegExp( "(^|" + whitespace + ")" + className + "(" + whitespace + "|$)" )) &&
1684				classCache( className, function( elem ) {
1685					return pattern.test( typeof elem.className === "string" && elem.className || typeof elem.getAttribute !== "undefined" && elem.getAttribute("class") || "" );
1686				});
1687		},
1688
1689		"ATTR": function( name, operator, check ) {
1690			return function( elem ) {
1691				var result = Sizzle.attr( elem, name );
1692
1693				if ( result == null ) {
1694					return operator === "!=";
1695				}
1696				if ( !operator ) {
1697					return true;
1698				}
1699
1700				result += "";
1701
1702				return operator === "=" ? result === check :
1703					operator === "!=" ? result !== check :
1704					operator === "^=" ? check && result.indexOf( check ) === 0 :
1705					operator === "*=" ? check && result.indexOf( check ) > -1 :
1706					operator === "$=" ? check && result.slice( -check.length ) === check :
1707					operator === "~=" ? ( " " + result.replace( rwhitespace, " " ) + " " ).indexOf( check ) > -1 :
1708					operator === "|=" ? result === check || result.slice( 0, check.length + 1 ) === check + "-" :
1709					false;
1710			};
1711		},
1712
1713		"CHILD": function( type, what, argument, first, last ) {
1714			var simple = type.slice( 0, 3 ) !== "nth",
1715				forward = type.slice( -4 ) !== "last",
1716				ofType = what === "of-type";
1717
1718			return first === 1 && last === 0 ?
1719
1720				// Shortcut for :nth-*(n)
1721				function( elem ) {
1722					return !!elem.parentNode;
1723				} :
1724
1725				function( elem, context, xml ) {
1726					var cache, uniqueCache, outerCache, node, nodeIndex, start,
1727						dir = simple !== forward ? "nextSibling" : "previousSibling",
1728						parent = elem.parentNode,
1729						name = ofType && elem.nodeName.toLowerCase(),
1730						useCache = !xml && !ofType,
1731						diff = false;
1732
1733					if ( parent ) {
1734
1735						// :(first|last|only)-(child|of-type)
1736						if ( simple ) {
1737							while ( dir ) {
1738								node = elem;
1739								while ( (node = node[ dir ]) ) {
1740									if ( ofType ?
1741										node.nodeName.toLowerCase() === name :
1742										node.nodeType === 1 ) {
1743
1744										return false;
1745									}
1746								}
1747								// Reverse direction for :only-* (if we haven't yet done so)
1748								start = dir = type === "only" && !start && "nextSibling";
1749							}
1750							return true;
1751						}
1752
1753						start = [ forward ? parent.firstChild : parent.lastChild ];
1754
1755						// non-xml :nth-child(...) stores cache data on `parent`
1756						if ( forward && useCache ) {
1757
1758							// Seek `elem` from a previously-cached index
1759
1760							// ...in a gzip-friendly way
1761							node = parent;
1762							outerCache = node[ expando ] || (node[ expando ] = {});
1763
1764							// Support: IE <9 only
1765							// Defend against cloned attroperties (jQuery gh-1709)
1766							uniqueCache = outerCache[ node.uniqueID ] ||
1767								(outerCache[ node.uniqueID ] = {});
1768
1769							cache = uniqueCache[ type ] || [];
1770							nodeIndex = cache[ 0 ] === dirruns && cache[ 1 ];
1771							diff = nodeIndex && cache[ 2 ];
1772							node = nodeIndex && parent.childNodes[ nodeIndex ];
1773
1774							while ( (node = ++nodeIndex && node && node[ dir ] ||
1775
1776								// Fallback to seeking `elem` from the start
1777								(diff = nodeIndex = 0) || start.pop()) ) {
1778
1779								// When found, cache indexes on `parent` and break
1780								if ( node.nodeType === 1 && ++diff && node === elem ) {
1781									uniqueCache[ type ] = [ dirruns, nodeIndex, diff ];
1782									break;
1783								}
1784							}
1785
1786						} else {
1787							// Use previously-cached element index if available
1788							if ( useCache ) {
1789								// ...in a gzip-friendly way
1790								node = elem;
1791								outerCache = node[ expando ] || (node[ expando ] = {});
1792
1793								// Support: IE <9 only
1794								// Defend against cloned attroperties (jQuery gh-1709)
1795								uniqueCache = outerCache[ node.uniqueID ] ||
1796									(outerCache[ node.uniqueID ] = {});
1797
1798								cache = uniqueCache[ type ] || [];
1799								nodeIndex = cache[ 0 ] === dirruns && cache[ 1 ];
1800								diff = nodeIndex;
1801							}
1802
1803							// xml :nth-child(...)
1804							// or :nth-last-child(...) or :nth(-last)?-of-type(...)
1805							if ( diff === false ) {
1806								// Use the same loop as above to seek `elem` from the start
1807								while ( (node = ++nodeIndex && node && node[ dir ] ||
1808									(diff = nodeIndex = 0) || start.pop()) ) {
1809
1810									if ( ( ofType ?
1811										node.nodeName.toLowerCase() === name :
1812										node.nodeType === 1 ) &&
1813										++diff ) {
1814
1815										// Cache the index of each encountered element
1816										if ( useCache ) {
1817											outerCache = node[ expando ] || (node[ expando ] = {});
1818
1819											// Support: IE <9 only
1820											// Defend against cloned attroperties (jQuery gh-1709)
1821											uniqueCache = outerCache[ node.uniqueID ] ||
1822												(outerCache[ node.uniqueID ] = {});
1823
1824											uniqueCache[ type ] = [ dirruns, diff ];
1825										}
1826
1827										if ( node === elem ) {
1828											break;
1829										}
1830									}
1831								}
1832							}
1833						}
1834
1835						// Incorporate the offset, then check against cycle size
1836						diff -= last;
1837						return diff === first || ( diff % first === 0 && diff / first >= 0 );
1838					}
1839				};
1840		},
1841
1842		"PSEUDO": function( pseudo, argument ) {
1843			// pseudo-class names are case-insensitive
1844			// http://www.w3.org/TR/selectors/#pseudo-classes
1845			// Prioritize by case sensitivity in case custom pseudos are added with uppercase letters
1846			// Remember that setFilters inherits from pseudos
1847			var args,
1848				fn = Expr.pseudos[ pseudo ] || Expr.setFilters[ pseudo.toLowerCase() ] ||
1849					Sizzle.error( "unsupported pseudo: " + pseudo );
1850
1851			// The user may use createPseudo to indicate that
1852			// arguments are needed to create the filter function
1853			// just as Sizzle does
1854			if ( fn[ expando ] ) {
1855				return fn( argument );
1856			}
1857
1858			// But maintain support for old signatures
1859			if ( fn.length > 1 ) {
1860				args = [ pseudo, pseudo, "", argument ];
1861				return Expr.setFilters.hasOwnProperty( pseudo.toLowerCase() ) ?
1862					markFunction(function( seed, matches ) {
1863						var idx,
1864							matched = fn( seed, argument ),
1865							i = matched.length;
1866						while ( i-- ) {
1867							idx = indexOf( seed, matched[i] );
1868							seed[ idx ] = !( matches[ idx ] = matched[i] );
1869						}
1870					}) :
1871					function( elem ) {
1872						return fn( elem, 0, args );
1873					};
1874			}
1875
1876			return fn;
1877		}
1878	},
1879
1880	pseudos: {
1881		// Potentially complex pseudos
1882		"not": markFunction(function( selector ) {
1883			// Trim the selector passed to compile
1884			// to avoid treating leading and trailing
1885			// spaces as combinators
1886			var input = [],
1887				results = [],
1888				matcher = compile( selector.replace( rtrim, "$1" ) );
1889
1890			return matcher[ expando ] ?
1891				markFunction(function( seed, matches, context, xml ) {
1892					var elem,
1893						unmatched = matcher( seed, null, xml, [] ),
1894						i = seed.length;
1895
1896					// Match elements unmatched by `matcher`
1897					while ( i-- ) {
1898						if ( (elem = unmatched[i]) ) {
1899							seed[i] = !(matches[i] = elem);
1900						}
1901					}
1902				}) :
1903				function( elem, context, xml ) {
1904					input[0] = elem;
1905					matcher( input, null, xml, results );
1906					// Don't keep the element (issue #299)
1907					input[0] = null;
1908					return !results.pop();
1909				};
1910		}),
1911
1912		"has": markFunction(function( selector ) {
1913			return function( elem ) {
1914				return Sizzle( selector, elem ).length > 0;
1915			};
1916		}),
1917
1918		"contains": markFunction(function( text ) {
1919			text = text.replace( runescape, funescape );
1920			return function( elem ) {
1921				return ( elem.textContent || elem.innerText || getText( elem ) ).indexOf( text ) > -1;
1922			};
1923		}),
1924
1925		// "Whether an element is represented by a :lang() selector
1926		// is based solely on the element's language value
1927		// being equal to the identifier C,
1928		// or beginning with the identifier C immediately followed by "-".
1929		// The matching of C against the element's language value is performed case-insensitively.
1930		// The identifier C does not have to be a valid language name."
1931		// http://www.w3.org/TR/selectors/#lang-pseudo
1932		"lang": markFunction( function( lang ) {
1933			// lang value must be a valid identifier
1934			if ( !ridentifier.test(lang || "") ) {
1935				Sizzle.error( "unsupported lang: " + lang );
1936			}
1937			lang = lang.replace( runescape, funescape ).toLowerCase();
1938			return function( elem ) {
1939				var elemLang;
1940				do {
1941					if ( (elemLang = documentIsHTML ?
1942						elem.lang :
1943						elem.getAttribute("xml:lang") || elem.getAttribute("lang")) ) {
1944
1945						elemLang = elemLang.toLowerCase();
1946						return elemLang === lang || elemLang.indexOf( lang + "-" ) === 0;
1947					}
1948				} while ( (elem = elem.parentNode) && elem.nodeType === 1 );
1949				return false;
1950			};
1951		}),
1952
1953		// Miscellaneous
1954		"target": function( elem ) {
1955			var hash = window.location && window.location.hash;
1956			return hash && hash.slice( 1 ) === elem.id;
1957		},
1958
1959		"root": function( elem ) {
1960			return elem === docElem;
1961		},
1962
1963		"focus": function( elem ) {
1964			return elem === document.activeElement && (!document.hasFocus || document.hasFocus()) && !!(elem.type || elem.href || ~elem.tabIndex);
1965		},
1966
1967		// Boolean properties
1968		"enabled": 

1968function( elem ) {
1969			return elem.disabled === false;
1970		},
1971
1972		"disabled": function( elem ) {
1973			return elem.disabled === true;
1974		},
1975
1976		"checked": function( elem ) {
1977			// In CSS3, :checked should return both checked and selected elements
1978			// http://www.w3.org/TR/2011/REC-css3-selectors-20110929/#checked
1979			var nodeName = elem.nodeName.toLowerCase();
1980			return (nodeName === "input" && !!elem.checked) || (nodeName === "option" && !!elem.selected);
1981		},
1982
1983		"selected": function( elem ) {
1984			// Accessing this property makes selected-by-default
1985			// options in Safari work properly
1986			if ( elem.parentNode ) {
1987				elem.parentNode.selectedIndex;
1988			}
1989
1990			return elem.selected === true;
1991		},
1992
1993		// Contents
1994		"empty": function( elem ) {
1995			// http://www.w3.org/TR/selectors/#empty-pseudo
1996			// :empty is negated by element (1) or content nodes (text: 3; cdata: 4; entity ref: 5),
1997			//   but not by others (comment: 8; processing instruction: 7; etc.)
1998			// nodeType < 6 works because attributes (2) do not appear as children
1999			for ( elem = elem.firstChild; elem; elem = elem.nextSibling ) {
2000				if ( elem.nodeType < 6 ) {
2001					return false;
2002				}
2003			}
2004			return true;
2005		},
2006
2007		"parent": function( elem ) {
2008			return !Expr.pseudos["empty"]( elem );
2009		},
2010
2011		// Element/input types
2012		"header": function( elem ) {
2013			return rheader.test( elem.nodeName );
2014		},
2015
2016		"input": function( elem ) {
2017			return rinputs.test( elem.nodeName );
2018		},
2019
2020		"button": function( elem ) {
2021			var name = elem.nodeName.toLowerCase();
2022			return name === "input" && elem.type === "button" || name === "button";
2023		},
2024
2025		"text": function( elem ) {
2026			var attr;
2027			return elem.nodeName.toLowerCase() === "input" &&
2028				elem.type === "text" &&
2029
2030				// Support: IE<8
2031				// New HTML5 attribute values (e.g., "search") appear with elem.type === "text"
2032				( (attr = elem.getAttribute("type")) == null || attr.toLowerCase() === "text" );
2033		},
2034
2035		// Position-in-collection
2036		"first": createPositionalPseudo(function() {
2037			return [ 0 ];
2038		}),
2039
2040		"last": createPositionalPseudo(function( matchIndexes, length ) {
2041			return [ length - 1 ];
2042		}),
2043
2044		"eq": createPositionalPseudo(function( matchIndexes, length, argument ) {
2045			return [ argument < 0 ? argument + length : argument ];
2046		}),
2047
2048		"even": createPositionalPseudo(function( matchIndexes, length ) {
2049			var i = 0;
2050			for ( ; i < length; i += 2 ) {
2051				matchIndexes.push( i );
2052			}
2053			return matchIndexes;
2054		}),
2055
2056		"odd": createPositionalPseudo(function( matchIndexes, length ) {
2057			var i = 1;
2058			for ( ; i < length; i += 2 ) {
2059				matchIndexes.push( i );
2060			}
2061			return matchIndexes;
2062		}),
2063
2064		"lt": createPositionalPseudo(function( matchIndexes, length, argument ) {
2065			var i = argument < 0 ? argument + length : argument;
2066			for ( ; --i >= 0; ) {
2067				matchIndexes.push( i );
2068			}
2069			return matchIndexes;
2070		}),
2071
2072		"gt": createPositionalPseudo(function( matchIndexes, length, argument ) {
2073			var i = argument < 0 ? argument + length : argument;
2074			for ( ; ++i < length; ) {
2075				matchIndexes.push( i );
2076			}
2077			return matchIndexes;
2078		})
2079	}
2080};
2081
2082Expr.pseudos["nth"] = Expr.pseudos["eq"];
2083
2084// Add button/input type pseudos
2085for ( i in { radio: true, checkbox: true, file: true, password: true, image: true } ) {
2086	Expr.pseudos[ i ] = createInputPseudo( i );
2087}
2088for ( i in { submit: true, reset: true } ) {
2089	Expr.pseudos[ i ] = createButtonPseudo( i );
2090}
2091
2092// Easy API for creating new setFilters
2093function setFilters() {}
2094setFilters.prototype = Expr.filters = Expr.pseudos;
2095Expr.setFilters = new setFilters();
2096
2097tokenize = Sizzle.tokenize = function( selector, parseOnly ) {
2098	var matched, match, tokens, type,
2099		soFar, groups, preFilters,
2100		cached = tokenCache[ selector + " " ];
2101
2102	if ( cached ) {
2103		return parseOnly ? 0 : cached.slice( 0 );
2104	}
2105
2106	soFar = selector;
2107	groups = [];
2108	preFilters = Expr.preFilter;
2109
2110	while ( soFar ) {
2111
2112		// Comma and first run
2113		if ( !matched || (match = rcomma.exec( soFar )) ) {
2114			if ( match ) {
2115				// Don't consume trailing commas as valid
2116				soFar = soFar.slice( match[0].length ) || soFar;
2117			}
2118			groups.push( (tokens = []) );
2119		}
2120
2121		matched = false;
2122
2123		// Combinators
2124		if ( (match = rcombinators.exec( soFar )) ) {
2125			matched = match.shift();
2126			tokens.push({
2127				value: matched,
2128				// Cast descendant combinators to space
2129				type: match[0].replace( rtrim, " " )
2130			});
2131			soFar = soFar.slice( matched.length );
2132		}
2133
2134		// Filters
2135		for ( type in Expr.filter ) {
2136			if ( (match = matchExpr[ type ].exec( soFar )) && (!preFilters[ type ] ||
2137				(match = preFilters[ type ]( match ))) ) {
2138				matched = match.shift();
2139				tokens.push({
2140					value: matched,
2141					type: type,
2142					matches: match
2143				});
2144				soFar = soFar.slice( matched.length );
2145			}
2146		}
2147
2148		if ( !matched ) {
2149			break;
2150		}
2151	}
2152
2153	// Return the length of the invalid excess
2154	// if we're just parsing
2155	// Otherwise, throw an error or return tokens
2156	return parseOnly ?
2157		soFar.length :
2158		soFar ?
2159			Sizzle.error( selector ) :
2160			// Cache the tokens
2161			tokenCache( selector, groups ).slice( 0 );
2162};
2163
2164function toSelector( tokens ) {
2165	var i = 0,
2166		len = tokens.length,
2167		selector = "";
2168	for ( ; i < len; i++ ) {
2169		selector += tokens[i].value;
2170	}
2171	return selector;
2172}
2173
2174function addCombinator( matcher, combinator, base ) {
2175	var dir = combinator.dir,
2176		checkNonElements = base && dir === "parentNode",
2177		doneName = done++;
2178
2179	return combinator.first ?
2180		// Check against closest ancestor/preceding element
2181		function( elem, context, xml ) {
2182			while ( (elem = elem[ dir ]) ) {
2183				if ( elem.nodeType === 1 || checkNonElements ) {
2184					return matcher( elem, context, xml );
2185				}
2186			}
2187		} :
2188
2189		// Check against all ancestor/preceding elements
2190		function( elem, context, xml ) {
2191			var oldCache, uniqueCache, outerCache,
2192				newCache = [ dirruns, doneName ];
2193
2194			// We can't set arbitrary data on XML nodes, so they don't benefit from combinator caching
2195			if ( xml ) {
2196				while ( (elem = elem[ dir ]) ) {
2197					if ( elem.nodeType === 1 || checkNonElements ) {
2198						if ( matcher( elem, context, xml ) ) {
2199							return true;
2200						}
2201					}
2202				}
2203			} else {
2204				while ( (elem = elem[ dir ]) ) {
2205					if ( elem.nodeType === 1 || checkNonElements ) {
2206						outerCache = elem[ expando ] || (elem[ expando ] = {});
2207
2208						// Support: IE <9 only
2209						// Defend against cloned attroperties (jQuery gh-1709)
2210						uniqueCache = outerCache[ elem.uniqueID ] || (outerCache[ elem.uniqueID ] = {});
2211
2212						if ( (oldCache = uniqueCache[ dir ]) &&
2213							oldCache[ 0 ] === dirruns && oldCache[ 1 ] === doneName ) {
2214
2215							// Assign to newCache so results back-propagate to previous elements
2216							return (newCache[ 2 ] = oldCache[ 2 ]);
2217						} else {
2218							// Reuse newcache so results back-propagate to previous elements
2219							uniqueCache[ dir

2219 ] = newCache;
2220
2221							// A match means we're done; a fail means we have to keep checking
2222							if ( (newCache[ 2 ] = matcher( elem, context, xml )) ) {
2223								return true;
2224							}
2225						}
2226					}
2227				}
2228			}
2229		};
2230}
2231
2232function elementMatcher( matchers ) {
2233	return matchers.length > 1 ?
2234		function( elem, context, xml ) {
2235			var i = matchers.length;
2236			while ( i-- ) {
2237				if ( !matchers[i]( elem, context, xml ) ) {
2238					return false;
2239				}
2240			}
2241			return true;
2242		} :
2243		matchers[0];
2244}
2245
2246function multipleContexts( selector, contexts, results ) {
2247	var i = 0,
2248		len = contexts.length;
2249	for ( ; i < len; i++ ) {
2250		Sizzle( selector, contexts[i], results );
2251	}
2252	return results;
2253}
2254
2255function condense( unmatched, map, filter, context, xml ) {
2256	var elem,
2257		newUnmatched = [],
2258		i = 0,
2259		len = unmatched.length,
2260		mapped = map != null;
2261
2262	for ( ; i < len; i++ ) {
2263		if ( (elem = unmatched[i]) ) {
2264			if ( !filter || filter( elem, context, xml ) ) {
2265				newUnmatched.push( elem );
2266				if ( mapped ) {
2267					map.push( i );
2268				}
2269			}
2270		}
2271	}
2272
2273	return newUnmatched;
2274}
2275
2276function setMatcher( preFilter, selector, matcher, postFilter, postFinder, postSelector ) {
2277	if ( postFilter && !postFilter[ expando ] ) {
2278		postFilter = setMatcher( postFilter );
2279	}
2280	if ( postFinder && !postFinder[ expando ] ) {
2281		postFinder = setMatcher( postFinder, postSelector );
2282	}
2283	return markFunction(function( seed, results, context, xml ) {
2284		var temp, i, elem,
2285			preMap = [],
2286			postMap = [],
2287			preexisting = results.length,
2288
2289			// Get initial elements from seed or context
2290			elems = seed || multipleContexts( selector || "*", context.nodeType ? [ context ] : context, [] ),
2291
2292			// Prefilter to get matcher input, preserving a map for seed-results synchronization
2293			matcherIn = preFilter && ( seed || !selector ) ?
2294				condense( elems, preMap, preFilter, context, xml ) :
2295				elems,
2296
2297			matcherOut = matcher ?
2298				// If we have a postFinder, or filtered seed, or non-seed postFilter or preexisting results,
2299				postFinder || ( seed ? preFilter : preexisting || postFilter ) ?
2300
2301					// ...intermediate processing is necessary
2302					[] :
2303
2304					// ...otherwise use results directly
2305					results :
2306				matcherIn;
2307
2308		// Find primary matches
2309		if ( matcher ) {
2310			matcher( matcherIn, matcherOut, context, xml );
2311		}
2312
2313		// Apply postFilter
2314		if ( postFilter ) {
2315			temp = condense( matcherOut, postMap );
2316			postFilter( temp, [], context, xml );
2317
2318			// Un-match failing elements by moving them back to matcherIn
2319			i = temp.length;
2320			while ( i-- ) {
2321				if ( (elem = temp[i]) ) {
2322					matcherOut[ postMap[i] ] = !(matcherIn[ postMap[i] ] = elem);
2323				}
2324			}
2325		}
2326
2327		if ( seed ) {
2328			if ( postFinder || preFilter ) {
2329				if ( postFinder ) {
2330					// Get the final matcherOut by condensing this intermediate into postFinder contexts
2331					temp = [];
2332					i = matcherOut.length;
2333					while ( i-- ) {
2334						if ( (elem = matcherOut[i]) ) {
2335							// Restore matcherIn since elem is not yet a final match
2336							temp.push( (matcherIn[i] = elem) );
2337						}
2338					}
2339					postFinder( null, (matcherOut = []), temp, xml );
2340				}
2341
2342				// Move matched elements from seed to results to keep them synchronized
2343				i = matcherOut.length;
2344				while ( i-- ) {
2345					if ( (elem = matcherOut[i]) &&
2346						(temp = postFinder ? indexOf( seed, elem ) : preMap[i]) > -1 ) {
2347
2348						seed[temp] = !(results[temp] = elem);
2349					}
2350				}
2351			}
2352
2353		// Add elements to results, through postFinder if defined
2354		} else {
2355			matcherOut = condense(
2356				matcherOut === results ?
2357					matcherOut.splice( preexisting, matcherOut.length ) :
2358					matcherOut
2359			);
2360			if ( postFinder ) {
2361				postFinder( null, results, matcherOut, xml );
2362			} else {
2363				push.apply( results, matcherOut );
2364			}
2365		}
2366	});
2367}
2368
2369function matcherFromTokens( tokens ) {
2370	var checkContext, matcher, j,
2371		len = tokens.length,
2372		leadingRelative = Expr.relative[ tokens[0].type ],
2373		implicitRelative = leadingRelative || Expr.relative[" "],
2374		i = leadingRelative ? 1 : 0,
2375
2376		// The foundational matcher ensures that elements are reachable from top-level context(s)
2377		matchContext = addCombinator( function( elem ) {
2378			return elem === checkContext;
2379		}, implicitRelative, true ),
2380		matchAnyContext = addCombinator( function( elem ) {
2381			return indexOf( checkContext, elem ) > -1;
2382		}, implicitRelative, true ),
2383		matchers = [ function( elem, context, xml ) {
2384			var ret = ( !leadingRelative && ( xml || context !== outermostContext ) ) || (
2385				(checkContext = context).nodeType ?
2386					matchContext( elem, context, xml ) :
2387					matchAnyContext( elem, context, xml ) );
2388			// Avoid hanging onto element (issue #299)
2389			checkContext = null;
2390			return ret;
2391		} ];
2392
2393	for ( ; i < len; i++ ) {
2394		if ( (matcher = Expr.relative[ tokens[i].type ]) ) {
2395			matchers = [ addCombinator(elementMatcher( matchers ), matcher) ];
2396		} else {
2397			matcher = Expr.filter[ tokens[i].type ].apply( null, tokens[i].matches );
2398
2399			// Return special upon seeing a positional matcher
2400			if ( matcher[ expando ] ) {
2401				// Find the next relative operator (if any) for proper handling
2402				j = ++i;
2403				for ( ; j < len; j++ ) {
2404					if ( Expr.relative[ tokens[j].type ] ) {
2405						break;
2406					}
2407				}
2408				return setMatcher(
2409					i > 1 && elementMatcher( matchers ),
2410					i > 1 && toSelector(
2411						// If the preceding token was a descendant combinator, insert an implicit any-element `*`
2412						tokens.slice( 0, i - 1 ).concat({ value: tokens[ i - 2 ].type === " " ? "*" : "" })
2413					).replace( rtrim, "$1" ),
2414					matcher,
2415					i < j && matcherFromTokens( tokens.slice( i, j ) ),
2416					j < len && matcherFromTokens( (tokens = tokens.slice( j )) ),
2417					j < len && toSelector( tokens )
2418				);
2419			}
2420			matchers.push( matcher );
2421		}
2422	}
2423
2424	return elementMatcher( matchers );
2425}
2426
2427function matcherFromGroupMatchers( elementMatchers, setMatchers ) {
2428	var bySet = setMatchers.length > 0,
2429		byElement = elementMatchers.length > 0,
2430		superMatcher = function( seed, context, xml, results, outermost ) {
2431			var elem, j, matcher,
2432				matchedCount = 0,
2433				i = "0",
2434				unmatched = seed && [],
2435				setMatched = [],
2436				contextBackup = outermostContext,
2437				// We must always have either seed elements or outermost context
2438				elems = seed || byElement && Expr.find["TAG"]( "*", outermost ),
2439				// Use integer dirruns iff this is the outermost matcher
2440				dirrunsUnique = (dirruns += contextBackup == null ? 1 : Math.random() || 0.1),
2441				len = elems.length;
2442
2443			if ( outermost ) {
2444				outermostContext = context === document || context || outermost;
2445			}
2446
2447			// Add elements passing elementMatchers directly to results
2448			// Support: IE<9, Safari
2449			// Tolerate NodeList properties (IE: "length"; Safari: <number>) matching elements by id
2450			for ( ; i !== len && (elem = elems[i]) != null; i++ ) {
2451				if ( byElement && elem ) {
2452					j = 0;
2453					if ( !context && elem.ownerDocument !== document ) {
2454						setDocument( elem );
2455						xml = !documentIsHTML;
2456					}
2457					while ( (matcher = elementMatchers[j++]) ) {
2458						if ( matcher( elem, context || document, xml) ) {
2459							results.push( elem );
2460							break;
2461						}
2462					}
2463					if ( outermost ) {
2464						dirruns = dirrunsUnique;
2465					}
2466				}
2467
2468				// Track unmatched elements for set filters
2469				if ( bySet ) {
2470					// They will have gone through all possible matchers
2471					if ( (elem = !matcher && elem) ) {
2472						matchedCount--;
2473					}
2474
2475					// Lengthen the array for every element, matched or not
2476					if ( seed ) {
2477						unmatched.push( elem );
2478					}
2479				}
2480			}
2481
2482			// `i` is now the count of elements visited above, and adding it to `matchedCount`
2483			// makes the latter nonnegative.
2484			matchedCount += i;
2485
2486			// Apply set filters to unmatched elements
2487			// NOTE: This can be skipped if there are no unmatched elements (i.e., `matchedCount`
2488			// equals `i`), unless we didn't visit _any_ elements in the above loop because we have
2489			// no element matchers and no seed.
2490			// Incrementing an initially-string "0" `i` allows `i` to remain a string only in that
2491			// case, which will result in a "00" `matchedCount` that differs from `i` but is also
2492			// numerically zero.
2493			if ( bySet && i !== matchedCount ) {
2494				j = 0;
2495				while ( (matcher = setMatchers[j++]) ) {
2496					matcher( unmatched, setMatched, context, xml );
2497				}
2498
2499				if ( seed ) {
2500					// Reintegrate element matches to eliminate the need for sorting
2501					if ( matchedCount > 0 ) {
2502						while ( i-- ) {
2503							if ( !(unmatched[i] || setMatched[i]) ) {
2504								setMatched[i] = pop.call( results );
2505							}
2506						}
2507					}
2508
2509					// Discard index placeholder values to get only actual matches
2510					setMatched = condense( setMatched );
2511				}
2512
2513				// Add matches to results
2514				push.apply( results, setMatched );
2515
2516				// Seedless set matches succeeding multiple successful matchers stipulate sorting
2517				if ( outermost && !seed && setMatched.length > 0 &&
2518					( matchedCount + setMatchers.length ) > 1 ) {
2519
2520					Sizzle.uniqueSort( results );
2521				}
2522			}
2523
2524			// Override manipulation of globals by nested matchers
2525			if ( outermost ) {
2526				dirruns = dirrunsUnique;
2527				outermostContext = contextBackup;
2528			}
2529
2530			return unmatched;
2531		};
2532
2533	return bySet ?
2534		markFunction( superMatcher ) :
2535		superMatcher;
2536}
2537
2538compile = Sizzle.compile = function( selector, match /* Internal Use Only */ ) {
2539	var i,
2540		setMatchers = [],
2541		elementMatchers = [],
2542		cached = compilerCache[ selector + " " ];
2543
2544	if ( !cached ) {
2545		// Generate a function of recursive functions that can be used to check each element
2546		if ( !match ) {
2547			match = tokenize( selector );
2548		}
2549		i = match.length;
2550		while ( i-- ) {
2551			cached = matcherFromTokens( match[i] );
2552			if ( cached[ expando ] ) {
2553				setMatchers.push( cached );
2554			} else {
2555				elementMatchers.push( cached );
2556			}
2557		}
2558
2559		// Cache the compiled function
2560		cached = compilerCache( selector, matcherFromGroupMatchers( elementMatchers, setMatchers ) );
2561
2562		// Save selector and tokenization
2563		cached.selector = selector;
2564	}
2565	return cached;
2566};
2567
2568/**
2569 * A low-level selection function that works with Sizzle's compiled
2570 *  selector functions
2571 * @param {String|Function} selector A selector or a pre-compiled
2572 *  selector function built with Sizzle.compile
2573 * @param {Element} context
2574 * @param {Array} [results]
2575 * @param {Array} [seed] A set of elements to match against
2576 */
2577select = Sizzle.select = function( selector, context, results, seed ) {
2578	var i, tokens, token, type, find,
2579		compiled = typeof selector === "function" && selector,
2580		match = !seed && tokenize( (selector = compiled.selector || selector) );
2581
2582	results = results || [];
2583
2584	// Try to minimize operations if there is only one selector in the list and no seed
2585	// (the latter of which guarantees us context)
2586	if ( match.length === 1 ) {
2587
2588		// Reduce context if the leading compound selector is an ID
2589		tokens = match[0] = match[0].slice( 0 );
2590		if ( tokens.length > 2 && (token = tokens[0]).type === "ID" &&
2591				support.getById && context.nodeType === 9 && documentIsHTML &&
2592				Expr.relative[ tokens[1].type ] ) {
2593
2594			context = ( Expr.find["ID"]( token.matches[0].replace(runescape, funescape), context ) || [] )[0];
2595			if ( !context ) {
2596				return results;
2597
2598			// Precompiled matchers will still verify ancestry, so step up a level
2599			} else if ( compiled ) {
2600				context = context.parentNode;
2601			}
2602
2603			selector = selector.slice( tokens.shift().value.length );
2604		}
2605
2606		// Fetch a seed set for right-to-left matching
2607		i = matchExpr["needsContext"].test( selector ) ? 0 : tokens.length;
2608		while ( i-- ) {
2609			token = tokens[i];
2610
2611			// Abort if we hit a combinator
2612			if ( Expr.relative[ (type = token.type) ] ) {
2613				break;
2614			}
2615			if ( (find = Expr.find[ type ]) ) {
2616				// Search, expanding context for leading sibling combinators
2617				if ( (seed = find(
2618					token.matches[0].replace( runescape, funescape ),
2619					rsibling.test( tokens[0].type ) && testContext( context.parentNode ) || context
2620				)) ) {
2621
2622					// If seed is empty or no tokens remain, we can return early
2623					tokens.splice( i, 1 );
2624					selector = seed.length && toSelector( tokens );
2625					if ( !selector ) {
2626						push.apply( results, seed );
2627						return results;
2628					}
2629
2630					break;
2631				}
2632			}
2633		}
2634	}
2635
2636	// Compile and execute a filtering function if one is not provided
2637	// Provide `match` to avoid retokenization if we modified the selector above
2638	( compiled || compile( selector, match ) )(
2639		seed,
2640		context,
2641		!documentIsHTML,
2642		results,
2643		!context || rsibling.test( selector ) && testContext( context.parentNode ) || context
2644	);
2645	return results;
2646};
2647
2648// One-time assignments
2649
2650// Sort stability
2651support.sortStable = expando.split("").sort( sortOrder ).join("") === expando;
2652
2653// Support: Chrome 14-35+
2654// Always assume duplicates if they aren't passed to the comparison function
2655support.detectDuplicates = !!hasDuplicate;
2656
2657// Initialize against the default document
2658setDocument();
2659
2660// Support: Webkit<537.32 - Safari 6.0.3/Chrome 25 (fixed in Chrome 27)
2661// Detached nodes confoundingly follow *each other*
2662support.sortDetached = assert(function(