php获取Google PageRank值代码 php, google, function, features, Google

php获取google PageRank值代码，注意最新的Google PageRank API地址已变为“http://toolbarqueries.google.com ... client-auto&features=Rank:&q=info:”

1. 
   
2. class PageRank {
   
3. function __construct($url) {
   
4. $url = 'info:' . $url;
   
5. $hash = '6' . $this->c($this->e($this->b($url)));
   
6. $fetch = 'http://toolbarqueries.google.com/tbr?client=navclient-auto&ch=' . $hash . '&ie=UTF-8&oe=UTF-8&features=Rank&q=' . $url;
   
7. if(function_exists('curl_init')) {
   
8. $ch = curl_init();
   
9. curl_setopt($ch, CURLOPT_URL, $fetch);
   
10. curl_setopt($ch, CURLOPT_HEADER, 0);
    
11. curl_setopt($ch, CURLOPT_RETURNTRANSFER, 1);
    
12. $out = curl_exec($ch);
    
13. curl_close($ch);
    
14. } else {
    
15. $out = file_get_contents($fetch);
    
16. }
    
17. $out = trim($out);
    
18. if(strlen($out) > 0) {
    
19. $this->pr = substr($out, 9);
    
20. } else {
    
21. $this->pr = -1;
    
22. }
    
23. }
    
24. function b($hash) {
    
25. $j = array();
    
26. $length = strlen($hash);
    
27. for($i = 0; $i < $length; $i++) {
    
28. $j[$i] = ord($hash[$i]);
    
29. }
    
30. return $j;
    
31. }
    
32. function c($l) {
    
33. $l = ((($l / 7) << 2) | (($this->h($l, 13)) & 7));
    
34. $j = array();
    
35. $j[0] = $l;
    
36. for($i = 1; $i < 20; $i++) {
    
37. $j[$i] = $j[$i - 1] – 9;
    
38. }
    
39. $l = $this->e($this->g($j), 80);
    
40. return $l;
    
41. }
    
42. function e($hash) {
    
43. $r = 3862272608;
    
44. $j = count($hash);
    
45. $p = 2654435769;
    
46. $o = 2654435769;
    
47. $n = 3862272608;
    
48. $l = 0;
    
49. $m = $j;
    
50. $q = array();
    
51. while ($m >= 12) {
    
52. $p += ($hash[$l] + ( $hash[$l + 1] << 8 ) + ($hash[$l + 2] << 16) + ($hash[$l + 3] << 24));
    
53. $o += ($hash[$l + 4] + ( $hash[$l + 5] << 8 ) + ($hash[$l + 6] << 16) + ($hash[$l + 7] << 24));
    
54. $n += ($hash[$l + 8] + ( $hash[$l + 9] << 8 ) + ($hash[$l + 10] << 16) + ($hash[$l + 11] << 24));
    
55. $q = $this->s($p, $o, $n);
    
56. $p = $q[0];
    
57. $o = $q[1];
    
58. $n = $q[2];
    
59. $l += 12;
    
60. $m -= 12;
    
61. }
    
62. $n += $j;
    
63. switch ($m) {
    
64. case 11:
    
65. $n += $hash[$l + 10] << 24;
    
66. case 10:
    
67. $n += $hash[$l + 9] << 16;
    
68. case 9:
    
69. $n += $hash[$l + 8] << 8;
    
70. case 8:
    
71. $o += $hash[$l + 7] << 24;
    
72. case 7:
    
73. $o += $hash[$l + 6] << 16;
    
74. case 6:
    
75. $o += $hash[$l + 5] << 8;
    
76. case 5:
    
77. $o += $hash[$l + 4];
    
78. case 4:
    
79. $p += $hash[$l + 3] << 24;
    
80. case 3:
    
81. $p += $hash[$l + 2] << 16;
    
82. case 2:
    
83. $p += $hash[$l + 1] << 8;
    
84. case 1:
    
85. $p += $hash[$l];
    
86. }
    
87. $q = $this->s($p, $o, $n);
    
88. return ($q[2] < 0) ? (4294967296 + $q[2]) : $q[2];
    
89. }
    
90. function f($j, $i) {
    
91. $k = 2147483648;
    
92. if ($k & $j) {
    
93. $j = $j >> 1;
    
94. $j &= ~$k;
    
95. $j |= 1073741824;
    
96. $j = $j >> ($i – 1);
    
97. } else {
    
98. $j = $j >> $i;
    
99. }
    
100. return $j;
     
101. }
     
102. function g($j) {
     
103. $l = array();
     
104. $length = count($j);
     
105. for($k = 0; $k < $length; $k++) {
     
106. for ($m = $k * 4; $m <= $k * 4 + 3; $m++) {
     
107. $l[$m] = $j[$k] & 255;
     
108. $j[$k] = $this->f($j[$k], 8);
     
109. }
     
110. }
     
111. return $l;
     
112. }
     
113. function h($j, $l) {
     
114. $k = floor($j / $l);
     
115. return ($j – $k * $l);
     
116. }
     
117. function s($t, $k, $u) {
     
118. $t -= $k;
     
119. $t -= $u;
     
120. $t ^= ($this->f($u, 13));
     
121. $k -= $u;
     
122. $k -= $t;
     
123. $k ^= ($t << 8);
     
124. $u -= $t;
     
125. $u -= $k;
     
126. $u ^= ($this->f($k, 13));
     
127. $t -= $k;
     
128. $t -= $u;
     
129. $t ^= ($this->f($u, 12));
     
130. $k -= $u;
     
131. $k -= $t;
     
132. $k ^= ($t << 16);
     
133. $u -= $t;
     
134. $u -= $k;
     
135. $u ^= ($this->f($k, 5));
     
136. $t -= $k;
     
137. $t -= $u;
     
138. $t ^= ($this->f($u, 3));
     
139. $k -= $u;
     
140. $k -= $t;
     
141. $k ^= ($t << 10);
     
142. $u -= $t;
     
143. $u -= $k;
     
144. $u ^= ($this->f($k, 15));
     
145. return array($t, $k, $u);
     
146. }
     
147. }
     
148. $pr = new PageRank('http://www.xinran001.com');
     
149. echo $pr->pr;

复制代码

最核心的地方就是这个checknum算法，有了这段代码你也可以建一个PR值查询工具。

本站PR值查询地址：http://www.hujuntao.com/api/pr/