排名中的rank类

<?php
 define('GOOGLE_MAGIC', 0xE6359A60);
 
 //unsigned shift right
 function zeroFill($a, $b)
 {
     $z = hexdec(80000000);
         if ($z & $a)
         {
             $a = ($a>>1);
             $a &= (~$z);
             $a |= 0x40000000;
             $a = ($a>>($b-1));
         }
         else
         {
             $a = ($a>>$b);
         }
         return $a;
 }
 
 function toInt32(& $x){
   $z = hexdec(80000000);
   $y = (int)$x;
  if($y==-$z&&$x<-$z){
    $y = (int)((-1)*$x);
    $y = (-1)*$y;
   }
   $x = $y;
 }
 
 function mix($a,$b,$c) {
 $a -= $b; $a -= $c; toInt32($a); $a = (int)($a ^ (zeroFill($c,13)));
 $b -= $c; $b -= $a; toInt32($b); $b = (int)($b ^ ($a<<8));
 $c -= $a; $c -= $b; toInt32($c); $c = (int)($c ^ (zeroFill($b,13)));
 $a -= $b; $a -= $c; toInt32($a); $a = (int)($a ^ (zeroFill($c,12)));
 $b -= $c; $b -= $a; toInt32($b); $b = (int)($b ^ ($a<<16));
 $c -= $a; $c -= $b; toInt32($c); $c = (int)($c ^ (zeroFill($b,5)));
 $a -= $b; $a -= $c; toInt32($a); $a = (int)($a ^ (zeroFill($c,3)));
 $b -= $c; $b -= $a; toInt32($b); $b = (int)($b ^ ($a<<10));
 $c -= $a; $c -= $b; toInt32($c); $c = (int)($c ^ (zeroFill($b,15)));
 return array($a,$b,$c);
 }
 
 function GoogleCH($url, $length=null, $init=GOOGLE_MAGIC) {
     if(is_null($length)) {
         $length = sizeof($url);
     }
     $a = $b = 0x9E3779B9;
     $c = $init;
     $k = 0;
     $len = $length;
     while($len>= 12) {
         $a += ($url[$k+0] +($url[$k+1]<<8) +($url[$k+2]<<16) +($url[$k+3]<<24));
         $b += ($url[$k+4] +($url[$k+5]<<8) +($url[$k+6]<<16) +($url[$k+7]<<24));
         $c += ($url[$k+8] +($url[$k+9]<<8) +($url[$k+10]<<16)+($url[$k+11]<<24));
         $mix = mix($a,$b,$c);
         $a = $mix[0]; $b = $mix[1]; $c = $mix[2];
         $k += 12;
         $len -= 12;
     }
 
     $c += $length;
     switch($len)              /* all the case statements fall through */
     {
         case 11: $c+=($url[$k+10]<<24);
         case 10: $c+=($url[$k+9]<<16);
         case 9 : $c+=($url[$k+8]<<8);
           /* the first byte of c is reserved for the length */
         case 8 : $b+=($url[$k+7]<<24);
         case 7 : $b+=($url[$k+6]<<16);
         case 6 : $b+=($url[$k+5]<<8);
         case 5 : $b+=($url[$k+4]);
         case 4 : $a+=($url[$k+3]<<24);
         case 3 : $a+=($url[$k+2]<<16);
         case 2 : $a+=($url[$k+1]<<8);
         case 1 : $a+=($url[$k+0]);
          /* case 0: nothing left to add */
     }
     $mix = mix($a,$b,$c);
     /*-------------------------------------------- report the result */
     return $mix[2];
 }
 
 //converts a string into an array of integers containing the numeric value of the char
 function strord($string) {
     for($i=0;$i<strlen($string);$i++) {
         $result[$i] = ord($string{$i});
     }
     return $result;
 }
 
 
 // converts an array of 32 bit integers into an array with 8 bit values. Equivalent to (BYTE *)arr32
 
 function c32to8bit($arr32) {
     for($i=0;$i<count($arr32);$i++) {
         for ($bitOrder=$i*4;$bitOrder<=$i*4+3;$bitOrder++) {
             $arr8[$bitOrder]=$arr32[$i]&255;
             $arr32[$i]=zeroFill($arr32[$i], 8);
         }    
     }
     return $arr8;
 }
 
 
 function get_page_rank($url){
     $url = preg_replace('//?.*$/','?',$url);
     $reqgr = "info:".$url;
     $reqgre = "info:".urlencode($url);  
     $res=array("content"=>''); 
     $gch = "6".GoogleCH(strord($reqgr));    
         $fsock = fsockopen('toolbarqueries.google.com', 80, $errno, $errstr);
         if ( !$fsock ){  
             //echo 'Can not connect to server';
             return 0;
         }
         $base_get = "/search?client=navclient-auto&ch=".$gch."&ie=UTF-8&oe=UTF-8&features=Rank:FVN&q=".$reqgre;
         fputs($fsock, "GET $base_get HTTP/1.1/r/n");
         fputs($fsock, "HOST: toolbarqueries.google.com/r/n");
         fputs($fsock, "User-Agent: Mozilla/4.0 (compatible; GoogleToolbar 2.0.114-big; Windows XP 5.1)/r/n");
         fputs($fsock, "Connection: close/r/n/r/n");
         while(!feof($fsock)){
             $res['content'] .= fread($fsock, 1024);
         }
         fclose($fsock);
         if(preg_match('/Rank_.*?:.*?:(/d+)/i', $res['content'], $m)){    
             return $m[1];
         }else{    
             return 0;
         }      
 }
 
// echo get_page_rank("ja.wikipedia.org/wiki/%E8%B6%A3%E5%91%B3%E3%81%AE%E4%B8%80%E8%A6%A7");
 
?>
 
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值