zoukankan      html  css  js  c++  java
  • 手机号,邮箱,邮政编码的判断

    public function isEmail($str)
    	{
    		$j = "/^[w|.]+@w+.w+/i";
    		if(preg_match($j,$str))return $str;
    		else return false;
    	}
    
    	public function isTelphone($str)
    	{
    		$j = "/^d+-?d+/i";
    		if(preg_match($j,$str))return $str;
    		else return false;
    	}
    
    	public function isZipCode($str)
    	{
    		$j = "/^d{6}/i";
    		if(preg_match($j,$str))return $str;
    		else return false;
    	}
    
    	public function isUserName($str)
    	{
    		if(HE == 'utf-8')
    		{
    			//if(eregi('^[u0391-uFFE5|w]{2,40}$',$str))
    			if(preg_match('/^[x7f-xff|w]{2,40}$/i',$str))
    			return $str;
    			else return false;
    		}
    		else return true;
    	}
    
    	public function isAllowKey($str)
    	{
    		//$j = "/^[w|[|]|-|_]+$/i";
    		$j = "/^[w|-|_]+$/i";
    		if(preg_match($j,$str))return $str;
    		else return false;
    	}
    
    	public function isPassword($str)
    	{
    		if(strlen($str)>=6)
    		return $str;
    		else return false;
    	}
    
    	public function isUrl($str)
    	{
    		$j = "/^http://.+/i";
    		if(preg_match($j,$str))return $str;
    		else return false;
    	}
    
    	public function subString($str,$lenth,$start = 0)
    	{
    		if(strlen($str) < $lenth && !$start)return $str;
    		if(HE == 'utf-8')$l = 3;
    		else $l = 2;
    		$k = 1;
    		if($start)
    		{
    			$m = $start;
    			while($k)if(ord($str[--$m]) < 128)$k = 0;
    			$k = $l - ($lenth-$m)%$l;
    			$start = $start + $k;
    		}
    		$t = substr($str,$start,$lenth);
    		$m = $lenth;
    		$k = 1;
    		while($k)if(ord($t[--$m]) < 128)$k = 0;
    		$k = ($lenth-1-$m)%$l;
    		if($k)$t = substr($t,0,$lenth-$k);
    		if($start)
    		return $t;
    		else
    		return $t.'...';
    	}
    
    	public function hexString($str,$hex = 16)
    	{
    		$tmp = "";
    		$e = strlen($str);
    		if(!$e)return false;
    		for($i=0;$i<$e;$i++)
    		{
    			$t = base_convert(ord($str[$i]),10,16);
    			$tmp .= "x{$t}";
    		}
    		return $tmp;
    	}
    
    	public function encode($info)
    	{
    		$info = serialize($info);
    		$key = CS;
    		$kl = strlen($key);
    		$il = strlen($info);
    		for($i = 0; $i < $il; $i++)
    		{
    			$p = $i%$kl;
    			$info[$i] = chr(ord($info[$i])+ord($key[$p]));
    		}
    		return urlencode($info);
    	}
    
    	public function decode($info)
    	{
    		$key = CS;
    		$info = urldecode($info);
    		$kl = strlen($key);
    		$il = strlen($info);
    		for($i = 0; $i < $il; $i++)
    		{
    			$p = $i%$kl;
    			$info[$i] = chr(ord($info[$i])-ord($key[$p]));
    		}
    		$info = unserialize($info);
    		return $info;
    	}
    
    	public function enstr($str)
    	{
    		$str = base64_encode($str);
    		$str = str_replace(array('+','/','='),array('-','_',''),$str);
    		return $str;
    	}
    
    	public function destr($str)
    	{
    		$str = str_replace(array('-','_'),array('+','/'),$str);
    		$str = base64_decode($str);
    		return $str;
    	}        
    

      

  • 相关阅读:
    唯有坚持方能成功
    Java程序猿,你为什么要关注Scala
    HDU 2871 Memory Control(线段树)
    SQL 合并两个结果集 一个倒序,一个正序
    Charm Bracelet(poj3624)(01背包)
    Dijkstra算法,求单源最短路径(包括路径)
    aix平台安装10.2.0.5的CRS时遇到的bug
    Java语言基础系列之1--用IDEA编写HelloWorld
    UVA 10986 Sending email SPFA
    NumberProgressBar开源项目学习
  • 原文地址:https://www.cnblogs.com/bluealine/p/8872521.html
Copyright © 2011-2022 走看看