common.js

来自「最强的爬虫工程」· JavaScript 代码 · 共 178 行

function getXMLValue(obj, tag, index)
{
	var tags;
	if (typeof(obj.getElementsByTagName) != 'undefined')
	{
		tags = obj.getElementsByTagName(tag);
	}
	else if (obj.all && obj.all.tags)
	{
		tags = obj.all.tags(tag);
	}
	else
	{
		return null;
	}
	if (tags.length <= index)
	{
		return null;
	}
	nodes = tags[index].childNodes;
	if (nodes.length == 0)
	{
		return "";
	}
	return nodes[0].nodeValue;
}
function boldNum(str)
{
	re = /(特\d+|运通\d+|小\d+|\d+内|\d+外|\d+支|\d+快|\d+区间|\d+)/i;
	return str.replace(re, "<b>$1</b>"); 
}
function isIE(){
	if(navigator.appName!="Microsoft Internet Explorer"){return false;}
	return true;
}

function correctPNG()
{
   for(var i=0; i<document.images.length; i++)
   {
	  var img = document.images[i];
	  var LW = img.width;
	  var LH = img.height;
	  var imgName = img.src.toUpperCase();
	  if (imgName.substring(imgName.length-3, imgName.length) == "PNG")
	  {
         img.style.filter += "progid:DXImageTransform.Microsoft.AlphaImageLoader(src="+img.src+", sizingmethod=scale);";
         img.src = "http://image2.sina.com.cn/pfp/i/l2/l2_trans.gif";
         img.width = LW;
         img.height = LH;
	  }
   }
}

function GetAnchor()
{
	var str = window.location.href.split("#");
	if (str.length >= 2)
	{
		return str[1];
	}
	return "0";
}

function h_ttc(){
	$("ttc1").style.visibility = $("ttc2").style.visibility = "hidden";
}
function s_ttc(ttc){
	h_ttc();
	$(ttc).style.visibility = "visible";
}
function v_ttc(a,b){
	h_ttc();
	$(a).value = b.innerHTML;
}

function weather_ajax(city)
{
	var url = "/i/i_weather.php";
	var pars = "city="+city;
	var myAjax = new Ajax.Request(url, {method: "get", parameters: pars, onComplete: function (req) { weather(req); } });

}
function weather(req)
{
	var result = getXMLValue(req.responseXML, "result", 0); 
	if((result == 0) ||(result==null)||typeof(result)=='undefined')
	{
		$("weather").innerHTML = "数据载入错误";
		return;
	}
	var html = getXMLValue(req.responseXML, "html", 0);
	html = html.replace(/&lt;/ig,"<");
	html = html.replace(/&gt;/ig,">");
	htmlstr = "<div class=\"c6\">"+html+"</div>";
	$("weather").innerHTML = htmlstr;
}

function ti_on(obj){
	if((obj.className.indexOf("3") != -1)||(obj.className.indexOf("4") != -1)){
		return false;
	}
	else{
		obj.className = $f(obj) + 2;
	}
}
function ti_of(obj){
	if((obj.className.indexOf("3") != -1)||(obj.className.indexOf("4") != -1)){
		return false;
	}
	else{
		obj.className = $f(obj) + 1;
	}
}
function city(cityname,city)
{
	if(typeof(global_type) !='undefined' &&global_type=="3")
		cityMap(city,cityname);
}

//----------------Cookie操作-----------------//
function GetCookieVal(offset)
//获得Cookie解码后的值
{
	var endstr = document.cookie.indexOf (";", offset);
	if (endstr == -1)
	endstr = document.cookie.length;
	return unescape(document.cookie.substring(offset, endstr));
}
function SetCookie(name, value)
//设定Cookie值
{
	var expdate = new Date();
	var argv = SetCookie.arguments;
	var argc = SetCookie.arguments.length;
	var expires = (argc > 2) ? argv[2] : null;
	var path = (argc > 3) ? argv[3] : null;
	var domain = (argc > 4) ? argv[4] : null;
	var secure = (argc > 5) ? argv[5] : false;
	if(expires!=null) expdate.setTime(expdate.getTime() + ( expires * 1000 ));
	document.cookie = name + "=" + escape (value) +((expires == null) ? "" : ("; expires="+ expdate.toGMTString()))
	+((path == null) ? "" : ("; path=" + path)) +((domain == null) ? "" : ("; domain=" + domain))
	+((secure == true) ? "; secure" : "");
}
function DelCookie(name)
//删除Cookie
{
	var exp = new Date();
	exp.setTime (exp.getTime() - 1);
	var cval = GetCookie (name);
	document.cookie = name + "=" + cval + "; expires="+ exp.toGMTString();
}
function GetCookie(name)
//获得Cookie的原始值
{
	var arg = name + "=";
	var alen = arg.length;
	var clen = document.cookie.length;
	var i = 0;
	while (i < clen)
	{
	var j = i + alen;
	if (document.cookie.substring(i, j) == arg)
	return GetCookieVal (j);
	i = document.cookie.indexOf(" ", i) + 1;
	if (i == 0) break;
	}
	return null;
}
function in_array(needle,stack)
{
	for(var i=0;i<stack.length;i++)
	{
		if(stack[i]==needle)
			return true;
	}
	return false;
}