js前端一些操作整理

异步加载js，

function loadScript(url, callback){
             var script = document.createElement("script")
             script.type = "text/javascript";
                            if (script.readyState){ //IE
                                         script.onreadystatechange = function(){
                                            if (script.readyState == "loaded" ||
                                                        script.readyState == "complete"){
                                                        script.onreadystatechange = null;
                                                        callback();
                                                     }
                                          };
                           } else { //Others: Firefox, Safari, Chrome, and Opera
                                   script.onload = function(){
                                     callback();
                              };
     }
    script.src = url;
    document.body.appendChild(script);
}

数组去重js，

function oSort(arr)
{
	var result ={};
	var newArr=[];
	for(var i=0;i<arr.length;i++)
	{
		if(!result[arr[i]])
		{
			newArr.push(arr[i])
			result[arr[i]]=1
		}
	}
	return newArr
}

深度克隆，

Object.prototype.deepClone=function(){
	function cloneObj(){}
	cloneObj.prototype=this;
	var obj=new cloneObj();
	for(var o in obj){
		if(typeof(obj[o])=="object")obj[o]=obj[o].deepClone();
	}
	return obj;
}

原生js代码ajax，

var xmlHttp;
function createxmlHttpRequest() {
	if (window.ActiveXObject) {
		xmlHttp = new ActiveXObject("Microsoft.XMLHTTP");
	} else if (window.XMLHttpRequest) {
		xmlHttp=new XMLHttpRequest();
	}
	function doPost(url,data){
// 注意在传参数值的时候最好使用encodeURI处理一下，以防出现乱码
createxmlHttpRequest();
xmlHttp.open("POST",url);
xmlHttp.setRequestHeader("Content-Type","application/x-www-form-urlencoded");
xmlHttp.send(data);
xmlHttp.onreadystatechange = function() {
	if ((xmlHttp.readyState == 4) && (xmlHttp.status == 200)) {
		alert(‘success‘);
	} else {
		alert(‘fail‘);
	}
}
}
}

排序，

快速排序：
function oSort(arr)
{
	var left=[];
	var right=[];
	var oNum = Math.floor(arr.length/2);
	var oNumVode = arr.splice(oNum,1);
	for(var i=0;i<arr.length;i++)
	{
		if(arr[i]<oNumVode)
		{
			left.push(arr[i])
		}
		else
		{
			right.push(arr[i])
		}
	}
	return oSort(left).concat([oNumVode],oSort(right))
}

冒泡排序：
var array = [5, 4, 3, 2, 1];
var temp = 0;
for (var i = 0; i < array.length; i++)
{
	for (var j = 0; j < array.length - i; j++)
	{
		if (array[j] > array[j + 1])
		{
			temp = array[j + 1];
			array[j + 1] = array[j];
			array[j] = temp;
		}
	}
}

这几天mark的一些代码，放在这里啦。