zoukankan      html  css  js  c++  java
  • js 操作cookies 方法

    js 操作cookies 方法
    
    
    var str="";
    //JS操作cookies方法!
    //Expires		设置Cookie的有效期限
    //Domain		添加域名限制
    //Path			添加路径限制
    //写cookies
    function setCookie(name,value){
    	var Days=30;//过期时间30天
    	var date=new Date(); 
    	date.setTime(date.getTime()+Days*24*60*60*1000);
    	document.cookie=name+"="+escape(value)+";expires="+date.toGMTString();
    }
    //读取cookies的值
    function getCookie(name){
    	var arr,reg=new RegExp("(^| )"+name+"=([^;]*)(;|$)");
    	if(arr=document.cookie.match(reg)){
    		return unescape(arr[2]);
    	}
    	else{
    		return null;
    	}
    }
    
    	function delCookie(name) {
    		var exp = new Date();
    		exp.setTime(exp.getTime() - 1);
    		var cval = getCookie(name);
    		str += "||cval:" +cval;
    		if (cval != null)
    		document.cookie=name+"="+escape(cval)+";expires="+exp.toGMTString();
    	}
    
    	function w() {
    		var name = document.getElementById("vkey").value;
    		var value = document.getElementById("vvalue").value;
    		setCookie(name, value);
    		str += "||get:"+getCookie(name);
    		write();
    		str="";
    	}
    
    	function d() {
    		var name = document.getElementById("vkey").value;
    		delCookie(name);
    		write();
    		str="";
    	}
    	function g() {
    		var name = document.getElementById("vkey").value;
    		str += "||get:"+getCookie(name);
    		write();
    		str="";
    	}
    	
    	function write()
    	{
    		document.getElementById("info").innerHTML= ("||cookes:"+document.cookie)+" ||||" +str;
    	}
    </script>


  • 相关阅读:
    拓扑排序
    Codeforces #503 C. Elections(贪心,逆向
    Codeforces #367 (Div. 2) D. Vasiliy's Multiset (trie 树)
    字典树
    最大子段和
    P1880 [NOI1995] 石子合并
    P1140 相似基因
    P1280 尼克的任务
    [BZOJ4064/Cerc2012]The Dragon and the knights
    [BZOJ4066]简单题
  • 原文地址:https://www.cnblogs.com/xinyuyuanm/p/2990588.html
Copyright © 2011-2022 走看看