ajax重写和参数编码

版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/ministech/article/details/79245039

重写$.ajax

(function($){  
    //首先备份下jquery的ajax方法  
    var _ajax=$.ajax;
    //重写jquery的ajax方法  
    $.ajax=function(opt){
        //备份opt中beforeSend,error和success方法  
        var fn = {  
            error:function(XMLHttpRequest, textStatus, errorThrown){},  
            success:function(data, textStatus){},
            beforeSend:function(XHR){}
        }  
        if(opt.error){  
            fn.error=opt.error; 
        }  
        if(opt.success){  
            fn.success=opt.success; 
        }  
        if(opt.beforeSend){  
            fn.beforeSend=opt.beforeSend; 
        } 
        //对get请求中的参数base64加密后赋值给p(后台定义,后台处理)
        if(opt.type == 'GET'){
            var arr = opt.url.split('?');
            if(arr.length > 1){ //解决有些url参数值中带有? if(arr.length == 2){ opt.url = arr[0] + '?p=' + Base.encode(arr[1]); }else{ var urlStr = ''; for(var i = 1;i<arr.length;i++){ urlStr = urlStr + arr[i]; } opt.url = arr[0] + '?p=' + Base.encode(urlStr); } }else{ if(opt.data){ var json = opt.data,str=''; for(var key in json){ str+=key + '=' + json[key] + '&'; } opt.url = opt.url + '?p=' + Base.encode(str.substring(0,str.length-1)); opt.data = ''; } } }; //扩展增强处理 var _opt = $.extend(opt,{ error:function(XMLHttpRequest, textStatus, errorThrown){ //错误方法增强处理 fn.error(XMLHttpRequest, textStatus, errorThrown);  }, success:function(data, textStatus){ //成功回调方法增强处理 fn.success(data, textStatus);  }, beforeSend:function(xhr){ //提交前回调方法 //跨站请求伪造保护 var csrftoken = jQuery("[name=csrfmiddlewaretoken]").val(); xhr.setRequestHeader("X-CSRFToken", csrftoken); fn.beforeSend(xhr); }, complete:function(XHR, TS){ //请求完成后回调函数 (请求成功或失败之后均调用)。 $("#ajaxInfo").remove();;  } }); return _ajax(_opt); };  })(jQuery); 

跨站请求伪造保护 CSRF token:https://docs.djangoproject.com/en/1.11/ref/csrf/

{% csrf_token %}
<script type="text/javascript">
// using jQuery
var csrftoken = jQuery("[name=csrfmiddlewaretoken]").val();
</script>

get中的参数base64,且将 + 替换为 - 将 / 替换为 _
用法:
加密:Base.encode(‘要加密的字符串’)
加密:Base.decode(‘要解密的字符串’)

(function(root, factory) {
    if (typeof define === "function" && define.amd) {
        define([], factory);
    } else if (typeof module === "object" && module.exports) {
        module.exports = factory();
    } else {
        root.Base = factory();
    }
}(this, function() {
    'use strict';

    function Base64() {
        // private property
        this._keyStr = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=";
    }
    //public method for encoding
    Base64.prototype.encode = function (input) {
        var output = "", chr1, chr2, chr3, enc1, enc2, enc3, enc4, i = 0;
        input = this._utf8_encode(input);
        while (i < input.length) {
            chr1 = input.charCodeAt(i++);
            chr2 = input.charCodeAt(i++);
            chr3 = input.charCodeAt(i++);
            enc1 = chr1 >> 2;
            enc2 = ((chr1 & 3) << 4) | (chr2 >> 4);
            enc3 = ((chr2 & 15) << 2) | (chr3 >> 6);
            enc4 = chr3 & 63;
            if (isNaN(chr2)) {
                enc3 = enc4 = 64;
            } else if (isNaN(chr3)) {
                enc4 = 64;
            }
            output = output +
                this._keyStr.charAt(enc1) + this._keyStr.charAt(enc2) +
                this._keyStr.charAt(enc3) + this._keyStr.charAt(enc4);
        }
        return output.replace(/\+/g, "-").replace(/\//g, "_");
    }

    // public method for decoding
    Base64.prototype.decode = function (input) {
        var output = "", chr1, chr2, chr3, enc1, enc2, enc3, enc4, i = 0;
        input = input.replace(/[^A-Za-z0-9\+\/\=]/g, "");
        while (i < input.length) {
            enc1 = this._keyStr.indexOf(input.charAt(i++));
            enc2 = this._keyStr.indexOf(input.charAt(i++));
            enc3 = this._keyStr.indexOf(input.charAt(i++));
            enc4 = this._keyStr.indexOf(input.charAt(i++));
            chr1 = (enc1 << 2) | (enc2 >> 4);
            chr2 = ((enc2 & 15) << 4) | (enc3 >> 2);
            chr3 = ((enc3 & 3) << 6) | enc4;
            output = output + String.fromCharCode(chr1);
            if (enc3 != 64) {
                output = output + String.fromCharCode(chr2);
            }
            if (enc4 != 64) {
                output = output + String.fromCharCode(chr3);
            }
        }
        output = this._utf8_decode(output);
        return output.replace(/\-/g, "+").replace(/\_/g, "/");
    }

    // private method for UTF-8 encoding
    Base64.prototype._utf8_encode = function (string) {
        string = string.replace(/\r\n/g,"\n");
        var utftext = "";
        for (var n = 0; n < string.length; n++) {
            var c = string.charCodeAt(n);
            if (c < 128) {
                utftext += String.fromCharCode(c);
            } else if((c > 127) && (c < 2048)) {
                utftext += String.fromCharCode((c >> 6) | 192);
                utftext += String.fromCharCode((c & 63) | 128);
            } else {
                utftext += String.fromCharCode((c >> 12) | 224);
                utftext += String.fromCharCode(((c >> 6) & 63) | 128);
                utftext += String.fromCharCode((c & 63) | 128);
            }

        }
        return utftext;
    }

    // private method for UTF-8 decoding
    Base64.prototype._utf8_decode = function (utftext) {
        var string = "", i = 0, c = 0, c1 = 0, c2 = 0, c3 = 0;
        while ( i < utftext.length ) {
            c = utftext.charCodeAt(i);
            if (c < 128) {
                string += String.fromCharCode(c);
                i++;
            } else if((c > 191) && (c < 224)) {
                c2 = utftext.charCodeAt(i+1);
                string += String.fromCharCode(((c & 31) << 6) | (c2 & 63));
                i += 2;
            } else {
                c2 = utftext.charCodeAt(i+1);
                c3 = utftext.charCodeAt(i+2);
                string += String.fromCharCode(((c & 15) << 12) | ((c2 & 63) << 6) | (c3 & 63));
                i += 3;
            }
        }
        return string;
    }

    var Base = new Base64();

    return Base;
}));

猜你喜欢

转载自blog.csdn.net/ministech/article/details/79245039