zoukankan      html  css  js  c++  java
  • 各种文字编码解码方式大合集

    统一的函数以下几种编码解码方式需要使用
    function left_zero_4(str) {
                if (str != null && str != '' && str != 'undefined') {
                    if (str.length == 2) {
                        return '00' + str;
                    }
                }
                return str;
            }
    中文汉字转Unicode
    function unicode(str){
                var value='';
                for (var i = 0; i < str.length; i++) {
                    value += '\u' + left_zero_4(parseInt(str.charCodeAt(i)).toString(16));
                }
                return value;
            }
            function left_zero_4(str) {
                if (str != null && str != '' && str != 'undefined') {
                    if (str.length == 2) {
                        return '00' + str;
                    }
                }
                return str;
            }
    Unicode转中文汉字、ASCII转换Unicode
    function reconvert(str){
                str = str.replace(/(\u)(w{1,4})/gi,function($0){
                    return (String.fromCharCode(parseInt((escape($0).replace(/(%5Cu)(w{1,4})/g,"$2")),16)));
                });
                str = str.replace(/(&#x)(w{1,4});/gi,function($0){
                    return String.fromCharCode(parseInt(escape($0).replace(/(%26%23x)(w{1,4})(%3B)/g,"$2"),16));
                });
                str = str.replace(/(&#)(d{1,6});/gi,function($0){
                    return String.fromCharCode(parseInt(escape($0).replace(/(%26%23)(d{1,6})(%3B)/g,"$2")));
                });
                 
                return str;
            }
    Unicode转换ASCII
    function unicode1(str){
        var value='';
        for (var i = 0; i < str.length; i++)
            value += '&#' + str.charCodeAt(i) + ';';
        return value;
    }
    中文转换&#XXXX
    function ascii(str){
        var value='';
        for (var i = 0; i < str.length; i++) {
            value += '&#x' + left_zero_4(parseInt(str.charCodeAt(i)).toString(16))+';';
        }
        return value;
    }
     
  • 相关阅读:
    02-qiankun-gitsubmodule使用及部署流程
    01-eslint/vetur/preitter/vscode配置
    01-mac m1 安装nvm / node-sass报错
    17-JS数组方法,是否改变原数组归纳
    03-webpack之require.context()实现前端工程自动化
    最小生成树prim算法
    bfs
    数据结构实验三题目一
    邻接表
    邻接矩阵
  • 原文地址:https://www.cnblogs.com/bluesky1024/p/7703995.html
Copyright © 2011-2022 走看看