Baymack
Enviado por Miguel Mamt Marin • 7 de Octubre de 2018 • Tareas • 9.769 Palabras (40 Páginas) • 64 Visitas
// ==UserScript==
// @name Baymack
// @namespace http://tampermonkey.net/
// @version 6.0
// @description try to take over the world!
// @author LSJD
// @match https://www.baymack.com/videos*
// @match https://www.baymack.com/entry*
// @include https://www.youtube.com/embed*
// @include https://*google*
// @include http*://mitly.us*
// @include http*://adshort.im*
// @include http*://j.gs*
// @grant none
// ==/UserScript==
(function() {
if(document.location.pathname.split("/").indexOf("entry") != -1){
document.location.assign("/videos");
return;
}
if(document.location.host.toLowerCase().split(".").indexOf("google") != -1 &&
document.location.pathname.toLowerCase().split("/").indexOf("recaptcha") != -1){
return;
}
document.addEventListener("click", function(e){
if(e.target.tagName.toLowerCase() == "a"){
if(!e.target.href) return;
document.location.assign(e.target.href);
if(!e.target.href.indexOf("http")) e.preventDefault();
return false;
}
});
if(document.location.host.indexOf("j.gs") != -1){
var intervalo = setInterval(function(){
var element = document.querySelector("a[id*=skip]");
if(element){
if(element.href && element.href != "#"){
document.location.assign(element.href);
clearInterval(intervalo);
}
}
}, 100);
}
var video = null;
var title = "";
var inAction = false;
var active = false;
var frm;
var Data;
var Aa;
var W;
var count = {};
var max_count = 2;
var new_entry = false;
var isInAction = function(){
if(W !== undefined && W !== null){
if(W.closed){
return !1;
}else{
return !0;
}
}
return !1;
};
var msg = function(e, fn, cnt){
try{
if(e.data == Aa.call(Data.msgs.ra)){
SC(cnt, "true");
window.removeEventListener("message", fn);
}
}catch(err){}
};
var svrf = function(){
var interval = setInterval(function(){
if(isInAction()){
W.postMessage("r", "*");
}else{
clearInterval(interval);
}
}, 100);
};
var GCb = function(arg){
if(!Aa || !Data) return !1;
inAction = isInAction();
if(!inAction){
var k, v, msa;
for(var i=1; i < arg.length; i++){
k = arg[i][0];
v = arg[i][1];
if(!GC(Aa.call(k))){
if(count[Aa.call(v)]){
if(count[Aa.call(v)] != -1){
count[Aa.call(v)]++;
}else{
return !1;
}
}else{
count[Aa.call(v)] = 1;
...