• 1
预览模式: 普通 | 列表

nginx location 不详解

文档地址 

http://nginx.org/en/docs/http/ngx_http_core_module.html#location

 

语法规则: location [=|~|~*|^~] /uri/ { … }

查看更多...

分类:WEB服务器 | 固定链接 | 评论: 0 | 查看次数: 3894

针对JS对象数组的Array排序实现

 这里只实现了冒泡排序和快速排序,一般来说也够用了

 点击下载此文件

/*
 * 对Array进行排序
 */
 
var CMPMETHOD = {
  btTimeCmp: function(a, b) {
    a=a.replace("天", "");
    b=b.replace("天", "");
    var as = a.split("年");
    var bs = b.split("年"); 

    var ayear = as.length > 1 ? as[0] : 0;
    var aday  = as.length > 1 ? as[1] : parseInt(as[0]);

    var byear = bs.length > 1 ? bs[0] : 0;
    var bday  = bs.length > 1 ? bs[1] : parseInt(bs[0]);

    var va = ayear * 365 + parseInt(aday);
    var vb = byear * 365 + parseInt(bday);
    
    if (va > vb ) return 1;
    if (va < vb ) return -1;
    if (va == vb) return 0;
  },
  numberCmp: function(a, b) {
    a = parseFloat(a);
    b = parseFloat(b);
    return CMPMETHOD.commonCmp(a, b);
  },
  commonCmp: function(a, b){
    if (a < b) return -1;
    if (a == b) return 0;
    if (a > b) return 1;
  }
}

Array.prototype.swap = function(i, j) {
  var temp = this[i];
  this[i]  = this[j];
  this[j]  = temp;
}

Array.prototype.quickSort = function() {
  var s=null, e=null, k=null, cmp=CMPMETHOD.commonCmp;
  if (arguments.length == 1) {
    s = null; e = null; k =arguments[0];
  }

  if (arguments.length == 2 ) {
    s = arguments[0];
    e = arguments[1];
  }

  if (arguments.length == 3) {
    s = arguments[0];
    e = arguments[1];
    k = arguments[2];
  }

  if (arguments.length == 4) {
    s = arguments[0];
    e = arguments[1];
    k = arguments[2];
    cmp = arguments[3];
  }

  if (s == null ) s = 0;
  if (e == null ) e = this.length-1;
  if (s >= e) return ;
  var x = s;    //基准索引
  var i, j;

  i = s; j = e;
  while(j > i) {
    for(; j>i; j--) {
      if (cmp(this[j][k], this[x][k]) < 0) {
        this.swap(j, x);
        x = j;
        break;
      }
    }

    for(; i
分类:网络安全 | 固定链接 | 评论: 0 | 查看次数: 5682

一个JS的MD5加密函数

 网上转的,上个月公司的网络好像一直有问题,没能发成博客,今天来发的时候都忘记这个代码是出自哪是的了

 

var hex_chr = "0123456789abcdef";

function rhex(num) {
	str = "";
	for (j = 0; j <= 3; j++)
		str += hex_chr.charAt((num >> (j * 8 + 4)) & 0x0F) +
			hex_chr.charAt((num >> (j * 8)) & 0x0F);
	return str;
}

function str2blks_MD5(str) {
	nblk = ((str.length + 8) >> 6) + 1;
	blks = new Array(nblk * 16);
	for (i = 0; i < nblk * 16; i++) blks[i] = 0;
	for (i = 0; i < str.length; i++)
		blks[i >> 2] |= str.charCodeAt(i) << ((i % 4) * 8);
	blks[i >> 2] |= 0x80 << ((i % 4) * 8);
	blks[nblk * 16 - 2] = str.length * 8;
	return blks;
}

function add(x, y) {
	var lsw = (x & 0xFFFF) + (y & 0xFFFF);
	var msw = (x >> 16) + (y >> 16) + (lsw >> 16);
	return (msw << 16) | (lsw & 0xFFFF);
}

function rol(num, cnt) {
	return (num << cnt) | (num >>> (32 - cnt));
}

function cmn(q, a, b, x, s, t) {
	return add(rol(add(add(a, q), add(x, t)), s), b);
}

function ff(a, b, c, d, x, s, t) {
	return cmn((b & c) | ((~b) & d), a, b, x, s, t);
}

function gg(a, b, c, d, x, s, t) {
	return cmn((b & d) | (c & (~d)), a, b, x, s, t);
}

function hh(a, b, c, d, x, s, t) {
	return cmn(b ^ c ^ d, a, b, x, s, t);
}

function ii(a, b, c, d, x, s, t) {
	return cmn(c ^ (b | (~d)), a, b, x, s, t);
}

function MD5(str) {
	x = str2blks_MD5(str);
	var a = 1732584193;
	var b = -271733879;
	var c = -1732584194;
	var d = 271733878;
	for (i = 0; i < x.length; i += 16) {
		var olda = a;
		var oldb = b;
		var oldc = c;
		var oldd = d;
		a = ff(a, b, c, d, x[i + 0], 7, -680876936);
		d = ff(d, a, b, c, x[i + 1], 12, -389564586);
		c = ff(c, d, a, b, x[i + 2], 17, 606105819);
		b = ff(b, c, d, a, x[i + 3], 22, -1044525330);
		a = ff(a, b, c, d, x[i + 4], 7, -176418897);
		d = ff(d, a, b, c, x[i + 5], 12, 1200080426);
		c = ff(c, d, a, b, x[i + 6], 17, -1473231341);
		b = ff(b, c, d, a, x[i + 7], 22, -45705983);
		a = ff(a, b, c, d, x[i + 8], 7, 1770035416);
		d = ff(d, a, b, c, x[i + 9], 12, -1958414417);
		c = ff(c, d, a, b, x[i + 10], 17, -42063);
		b = ff(b, c, d, a, x[i + 11], 22, -1990404162);
		a = ff(a, b, c, d, x[i + 12], 7, 1804603682);
		d = ff(d, a, b, c, x[i + 13], 12, -40341101);
		c = ff(c, d, a, b, x[i + 14], 17, -1502002290);
		b = ff(b, c, d, a, x[i + 15], 22, 1236535329);
		a = gg(a, b, c, d, x[i + 1], 5, -165796510);
		d = gg(d, a, b, c, x[i + 6], 9, -1069501632);
		c = gg(c, d, a, b, x[i + 11], 14, 643717713);
		b = gg(b, c, d, a, x[i + 0], 20, -373897302);
		a = gg(a, b, c, d, x[i + 5], 5, -701558691);
		d = gg(d, a, b, c, x[i + 10], 9, 38016083);
		c = gg(c, d, a, b, x[i + 15], 14, -660478335);
		b = gg(b, c, d, a, x[i + 4], 20, -405537848);
		a = gg(a, b, c, d, x[i + 9], 5, 568446438);
		d = gg(d, a, b, c, x[i + 14], 9, -1019803690);
		c = gg(c, d, a, b, x[i + 3], 14, -187363961);
		b = gg(b, c, d, a, x[i + 8], 20, 1163531501);
		a = gg(a, b, c, d, x[i + 13], 5, -1444681467);
		d = gg(d, a, b, c, x[i + 2], 9, -51403784);
		c = gg(c, d, a, b, x[i + 7], 14, 1735328473);
		b = gg(b, c, d, a, x[i + 12], 20, -1926607734);
		a = hh(a, b, c, d, x[i + 5], 4, -378558);
		d = hh(d, a, b, c, x[i + 8], 11, -2022574463);
		c = hh(c, d, a, b, x[i + 11], 16, 1839030562);
		b = hh(b, c, d, a, x[i + 14], 23, -35309556);
		a = hh(a, b, c, d, x[i + 1], 4, -1530992060);
		d = hh(d, a, b, c, x[i + 4], 11, 1272893353);
		c = hh(c, d, a, b, x[i + 7], 16, -155497632);
		b = hh(b, c, d, a, x[i + 10], 23, -1094730640);
		a = hh(a, b, c, d, x[i + 13], 4, 681279174);
		d = hh(d, a, b, c, x[i + 0], 11, -358537222);
		c = hh(c, d, a, b, x[i + 3], 16, -722521979);
		b = hh(b, c, d, a, x[i + 6], 23, 76029189);
		a = hh(a, b, c, d, x[i + 9], 4, -640364487);
		d = hh(d, a, b, c, x[i + 12], 11, -421815835);
		c = hh(c, d, a, b, x[i + 15], 16, 530742520);
		b = hh(b, c, d, a, x[i + 2], 23, -995338651);
		a = ii(a, b, c, d, x[i + 0], 6, -198630844);
		d = ii(d, a, b, c, x[i + 7], 10, 1126891415);
		c = ii(c, d, a, b, x[i + 14], 15, -1416354905);
		b = ii(b, c, d, a, x[i + 5], 21, -57434055);
		a = ii(a, b, c, d, x[i + 12], 6, 1700485571);
		d = ii(d, a, b, c, x[i + 3], 10, -1894986606);
		c = ii(c, d, a, b, x[i + 10], 15, -1051523);
		b = ii(b, c, d, a, x[i + 1], 21, -2054922799);
		a = ii(a, b, c, d, x[i + 8], 6, 1873313359);
		d = ii(d, a, b, c, x[i + 15], 10, -30611744);
		c = ii(c, d, a, b, x[i + 6], 15, -1560198380);
		b = ii(b, c, d, a, x[i + 13], 21, 1309151649);
		a = ii(a, b, c, d, x[i + 4], 6, -145523070);
		d = ii(d, a, b, c, x[i + 11], 10, -1120210379);
		c = ii(c, d, a, b, x[i + 2], 15, 718787259);
		b = ii(b, c, d, a, x[i + 9], 21, -343485551);
		a = add(a, olda);
		b = add(b, oldb);
		c = add(c, oldc);
		d = add(d, oldd);
	}
	return rhex(a) + rhex(b) + rhex(c) + rhex(d);
}

 

分类:web前端 | 固定链接 | 评论: 0 | 查看次数: 6295

一个简单的js模板引擎

自己写来快速生成html代码用的, 因为要求比较简单,也就没用网上的模板解析引擎了

 

//charset gbk

/* 快速模板处理
 * author: gaohuia 2013.06.05
 */

function Render(html, config) {
	/* 模板 */
	this.html = html;

	/* 对默认值进行覆盖 */
	if (config) {
		for (var key in config) {
			this.config[key] = config[key];
		}
	}
}
Render.prototype = {
	/* 配置 */
	config: {
		allowEmpty: false /*设置值是否为空字符*/
	},

	html: "',
	htmlCollection: [],
	varCollection: [],
	onRenderTag: function(tag, rowData) {},
	/*
	 * 渲染所有数据,data被视为一个行数据的集合,如果data是一个对象,则自动作为一个行对象来渲染
	 */
	renderData: function(data) {
		/*
		 * 分析html文本, 提取变量
		 */
		this.prepareHtml();

		if (data instanceof Array) {
			var htmls = [];
			for (var i = 0; i < data.length; i++) {
				htmls.push(this.fetchRow(data[i]));
			}
			return htmls.join('');
		} else if (data instanceof Object) {
			return this.fetchRow(data);
		} else {
			throw "data必需是一个Object或Array的一个实例";
		}
	},
	/*
	 * 将一行视为一个模板渲染的对象
	 */
	fetchRow: function(rowData) {
		var htmlCollection = this.htmlCollection;
		var varCollection = this.varCollection;

		/**/

		var htmls = [];
		for (var i = 0; i < varCollection.length; i++) {
			var varTag = varCollection[i];

			/*
			 * 变量在字典中存在的情况
			 */

			if (rowData.hasOwnProperty(varTag.varName) && rowData[varTag.varName] != null && (rowData[varTag.varName] != '' || this.config['allowEmpty'])) {
				varTag.varValue = rowData[varTag.varName];
				this.onRenderTag(varTag, rowData);
			} else {
				if (varTag.varAttr.hasOwnProperty('default')) {
					varTag.varValue = varTag.varAttr['default'];
				} else {
					varTag.varValue = '';
				}
			}

			htmls.push(htmlCollection[i]);
			htmls.push(varTag.varValue);
		}

		htmls.push(htmlCollection[i]);
		return htmls.join('');
	},
	prepareHtml: function() {
		var html = this.html;
		if (html.length == 0) return;
		var exp = /\{\$(.*?)\}/g;
		var varCollection = [];
		var htmlCollection = [];

		var arr = null;
		var lastIndex = 0;
		while ((arr = exp.exec(html)) != null) {
			var varAttr = {};
			var varFull = arr[1];
			var tagFull = arr[0];

			/*
			 * 对多于空格进替换,方便后面提取标签属性
			 */
			varFull = varFull.replace(/\s+/g, " ");

			var tmp = varFull.split(' ');
			var varName = tmp[0];
			for (var i = 1; i < tmp.length; i++) {
				var attrPair = tmp[i].split('=');
				var attrName = attrPair[0];
				var attrValue = attrPair[1].replace(/[\"\']/g, "");
				varAttr[attrName] = attrValue;
			}

			/*
			 * 一个单独的标签, 用户可以根据标签的属性对标签的值做不同的处理
			 */
			var varSingle = {
				tagFull: tagFull,
				varName: varName,
				varFull: varFull,
				varValue: '',
				varAttr: varAttr
			}

			/* 为变量设置默认值 */
			if (varSingle.varAttr.hasOwnProperty('default')) {
				varSingle.varValue = varSingle.varAttr['default'];
			}

			varCollection.push(varSingle);
			var htmlPiece = html.substr(lastIndex, arr.index - lastIndex);
			htmlCollection.push(htmlPiece);

			/*
			 * 准备下一次标签寻找
			 */
			lastIndex = arr.index + arr[0].length;
		}

		htmlPiece = html.substr(lastIndex);
		htmlCollection.push(htmlPiece);

		this.htmlCollection = htmlCollection;
		this.varCollection = varCollection;
	}
}
分类:web前端 | 固定链接 | 评论: 0 | 查看次数: 4283
  • 1
博主QQ: 友情链接请找我
QQ群: 灰色档案
返回顶部 关闭