Pomelo Lee workspace

<?php
/*
 * Created on 2008-11-5
 *
 * To change the template for this generated file go to
 * Window - Preferences - PHPeclipse - PHP - Code Templates
 */
 
 
 //===================================
//
// 功能：IP地址获取真实地址函数
// 参数：$ip - IP地址
//
//===================================
function convertip($ip) {
    //IP数据文件路径
    $dat_path = 'ip/QQWry.Dat';
 
    //检查IP地址
   if(!preg_match("/^\d{1,3}\.\d{1,3}\.\d{1,3}\.\d{1,3}$/", $ip)) {
        return 'IP Address Error';
    }
    //打开IP数据文件
    if(!$fd = @fopen($dat_path, 'rb')){
        return 'IP date file not exists or access denied';
    }
 
    //分解IP进行运算，得出整形数
    $ip = explode('.', $ip);
    $ipNum = $ip[0] * 16777216 + $ip[1] * 65536 + $ip[2] * 256 + $ip[3];
 
    //获取IP数据索引开始和结束位置
    $DataBegin = fread($fd, 4);
    $DataEnd = fread($fd, 4);
    $ipbegin = implode('', unpack('L', $DataBegin));
    if($ipbegin < 0) $ipbegin += pow(2, 32);
    $ipend = implode('', unpack('L', $DataEnd));
    if($ipend < 0) $ipend += pow(2, 32);
    $ipAllNum = ($ipend - $ipbegin) / 7 + 1;
 
    $BeginNum = 0;
    $EndNum = $ipAllNum;
    $ip1num=0;
    $ip2num=0;
    //使用二分查找法从索引记录中搜索匹配的IP记录
    while($ip1num>$ipNum || $ip2num<$ipNum) {
        $Middle= intval(($EndNum + $BeginNum) / 2);
 
        //偏移指针到索引位置读取4个字节
        fseek($fd, $ipbegin + 7 * $Middle);
        $ipData1 = fread($fd, 4);
        if(strlen($ipData1) < 4) {
            fclose($fd);
            return 'System Error';
        }
        //提取出来的数据转换成长整形，如果数据是负数则加上2的32次幂
        $ip1num = implode('', unpack('L', $ipData1));
        if($ip1num < 0) $ip1num += pow(2, 32);
 
        //提取的长整型数大于我们IP地址则修改结束位置进行下一次循环
        if($ip1num > $ipNum) {
            $EndNum = $Middle;
            continue;
        }
 
        //取完上一个索引后取下一个索引
        $DataSeek = fread($fd, 3);
        if(strlen($DataSeek) < 3) {
            fclose($fd);
            return 'System Error';
        }
        $DataSeek = implode('', unpack('L', $DataSeek.chr(0)));
        fseek($fd, $DataSeek);
        $ipData2 = fread($fd, 4);
        if(strlen($ipData2) < 4) {
            fclose($fd);
            return 'System Error';
        }
        $ip2num = implode('', unpack('L', $ipData2));
        if($ip2num < 0) $ip2num += pow(2, 32);
 
        //没找到提示未知
        if($ip2num < $ipNum) {
            if($Middle == $BeginNum) {
                fclose($fd);
                return 'Unknown';
            }
            $BeginNum = $Middle;
        }
    }
 
 
    $ipFlag = fread($fd, 1);
    if($ipFlag == chr(1)) {
        $ipSeek = fread($fd, 3);
        if(strlen($ipSeek) < 3) {
            fclose($fd);
            return 'System Error';
        }
        $ipSeek = implode('', unpack('L', $ipSeek.chr(0)));
        fseek($fd, $ipSeek);
        $ipFlag = fread($fd, 1);
    }
 
    if($ipFlag == chr(2)) {
        $AddrSeek = fread($fd, 3);
        if(strlen($AddrSeek) < 3) {
            fclose($fd);
            return 'System Error';
        }
        $ipFlag = fread($fd, 1);
        if($ipFlag == chr(2)) {
            $AddrSeek2 = fread($fd, 3);
            if(strlen($AddrSeek2) < 3) {
                fclose($fd);
                return 'System Error';
            }
            $AddrSeek2 = implode('', unpack('L', $AddrSeek2.chr(0)));
            fseek($fd, $AddrSeek2);
        } else {
            fseek($fd, -1, SEEK_CUR);
        }
 
        while(($char = fread($fd, 1)) != chr(0))
            $ipAddr2 .= $char;
 
        $AddrSeek = implode('', unpack('L', $AddrSeek.chr(0)));
        fseek($fd, $AddrSeek);
 
        while(($char = fread($fd, 1)) != chr(0))
            $ipAddr1 .= $char;
    } else {
        fseek($fd, -1, SEEK_CUR);
        while(($char = fread($fd, 1)) != chr(0))
            $ipAddr1 .= $char;
 
        $ipFlag = fread($fd, 1);
        if($ipFlag == chr(2)) {
            $AddrSeek2 = fread($fd, 3);
            if(strlen($AddrSeek2) < 3) {
                fclose($fd);
                return 'System Error';
            }
            $AddrSeek2 = implode('', unpack('L', $AddrSeek2.chr(0)));
            fseek($fd, $AddrSeek2);
        } else {
            fseek($fd, -1, SEEK_CUR);
        }
        while(($char = fread($fd, 1)) != chr(0)){
            $ipAddr2 .= $char;
        }
    }
    fclose($fd);
 
    //最后做相应的替换操作后返回结果
    if(preg_match('/http/i', $ipAddr2)) {
        $ipAddr2 = '';
    }
    $ipaddr = "$ipAddr1 $ipAddr2";
    $ipaddr = preg_replace('/CZ88.Net/is', '', $ipaddr);
    $ipaddr = preg_replace('/^s*/is', '', $ipaddr);
    $ipaddr = preg_replace('/s*$/is', '', $ipaddr);
    if(preg_match('/http/i', $ipaddr) || $ipaddr == '') {
        $ipaddr = 'Unknown';
    }
 
    return $ipaddr;
}
 
 
//========================
//
//  调用举例（速度很快）
//
//========================
 
/**
 * testing use
 * 
echo convertip("192.168.101.888.99")."<br>";
 
echo convertip("192.168.101.118")."<br>";
 
echo convertip('219.238.235.10')."<br>";
//输出: 北京市 电信通
 
echo convertip('23.56.82.12')."<br>";
//输出：IANA
 
echo convertip('250.69.52.0')."<br>";
//输出：IANA保留地址
 
echo convertip('238.69.52.0')."<br>";
//输出：IANA保留地址 用于多点传送
 
echo convertip('192.168.0.1')."<br>";
//输出：局域网 对方和您在同一内部网
 
echo convertip('255.255.255.255')."<br>";
//输出：纯真网络 
 
  */
?>

#!/usr/bin/perl -w
$maxprimes=100;
$value=1;
$count=0;
while($count <$maxprimes){
	$value++;
	$composite=0;
OUTER: for($i=2;$i<$value;$i++){
		for($j=$i;$j<$value;$j++){
		  if(($j*$i)==$value){
			$composite=1;
			last OUTER;
  			}
		}
	}
	if(!$composite){
		$count++;
		print "$value is prime count is $count \n";}
}

package com.liyz.num.test;
public class PrimeNum {
	public static void main(String[] args) {
		long start=System.currentTimeMillis();
		primeMehtodTwo(100);
		long end=System.currentTimeMillis();
		System.out.println("use time is " +(end-start)+" ms");
	}
	//效率太差,取的质数越多，比较的次数也越多,效率也越低
	public static void primeMehtodOne( int number){
		int num=number;
		int value=1;
		int count=0;
		boolean composite;
		while (count<num){
			value++;
			composite=false;
			for(int i=2;i<value;i++){
				for(int j=i;j<value;j++){
					if((j*i)==value){
						composite=true;
						break;
					}
				}
			}
			if(!composite){
				count++;
				System.out.println(value+" is prime!");
			}
		}
	}
	//感觉好多了,更好的算法没有去研究过
	public static void primeMehtodTwo(int number){
		int count=0;
		int fg=1;
		int num=number;
 
		for( int i=2;count<num;i++){
			double k=Math.sqrt(i+1);
			for(int j=2;j<=k;j++){
				if((i%j)==0){
					fg=0;
					break;
				}
			}
			if(fg==1){
				System.out.println(i+" is prime!");
				count++;
			}
			fg=1;
		}
	}
	}

  #!/usr/bin/perl
 print "hello,world!\n";

    package com.utils;
 
import magick.ImageInfo;
import magick.MagickApiException;
import magick.MagickException;
import magick.MagickImage;
 
public class Treamspdf {
 public static void main(String[] args) {
resetsize("E:/mylearn/workspace/TTPDF/src/com/utils/http_imgload.jpg","new.jpg");
}
	public static void resetsize(String picFrom,String picTo){
		try{
			ImageInfo info=new ImageInfo(picFrom);
			MagickImage image=new MagickImage(new ImageInfo(picFrom));
			MagickImage scaled=image.scaleImage(120, 97);
			scaled.setFileName(picTo);
			scaled.writeImage(info);
		}catch(MagickApiException ex){
			ex.printStackTrace();
		} catch(MagickException   ex)   {
			ex.printStackTrace();
		}
	}
}