/**
* This js provide a simple way to operate cookie in javascript
* function getCookie(name);
* function setCookie(name,value[,expireDays]);
* function deleteCookie(name);
*/
function getCookie(name)
{
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 "";
}
function setCookie(name, value)
{
var argv = setCookie.arguments;
var argc = setCookie.arguments.length;
var expDay = (argc > 2) ? argv[2] : -1;
try
{
expDay = parseInt(expDay);
}
catch(e)
{
expDay = -1;
}
if(expDay < 0) {
setCookieVal(name, value);
} else {
var expDate = new Date();
// The expDate is the date when the cookie should expire, we will keep it for a month
expDate.setTime(expDate.getTime() + (expDay * 24 * 60 * 60 * 1000));
setCookieVal(name, value, expDate);
}
}
function deleteCookie(name)
{
var exp = new Date();
exp.setTime(exp.getTime() - 1);
// This cookie is history
var cval = getCookie(name);
document.cookie = name + "=" + cval + "; expires=" + exp.toGMTString();
}
function getCookieVal(offset)
{
var endstr = document.cookie.indexOf(";", offset);
if (endstr == -1)
endstr = document.cookie.length;
return unescape(document.cookie.substring(offset, endstr));
}
function setCookieVal(name, value)
{
var argv = setCookieVal.arguments;
var argc = setCookieVal.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;
document.cookie = name + "=" + escape(value) +
((expires == null || expires < 0) ? "" : ("; expires=" + expires.toGMTString())) +
((path == null) ? "" : ("; path=" + path)) +
((domain == null) ? "" : ("; domain=" + domain)) +
((secure == true) ? "; secure" : "");
}
Redis实现消息的发布/订阅
java设计模式----模板方法模式
java设计模式----适配器模式
Filter注入对象
java设计模式----命令模式
css3中animation的应用
bootstrap的学习注意点
关于animate的一些属性
ie的兼容方法,条件注释的方法
- 最新文章
-
SPOJ 10628 Count on a tree(Tarjan离线 | RMQ-ST在线求LCA+主席树求树上第K小)
POJ 1986 Distance Queries(Tarjan离线法求LCA)
HDU 4358 Boring counting(莫队+DFS序+离散化)
NOJ 1074 Hey Judge(DFS回溯)
HDU 5919 Sequence II(主席树+逆序思想)
HDU 1264 Counting Squares(线段树求面积的并)
Leetcode 102 Binary Tree Level Order Traversal 二叉树+BFS
Leetcode 172 Factorial Trailing Zeroes
Leetcode 118 Pascal's Triangle 数论递推
Leetcode 66 Plus One STL