网络编程 
首页 > 网络编程 > 浏览文章

utf-8编码转换成gb2312

(编辑:jimmy 日期: 2024/11/26 浏览:3 次 )
[code]<script>  
function  chinesefromutf8url(strutf8)    
{  
           var  bstr  =  "";  
           var  noffset  =  0; 
 //  processing  point  on  strutf8               
           if(  strutf8  ==  ""  )  
               return  "";                 
           strutf8  =  strutf8.tolowercase();  
           noffset  =  strutf8.indexof("%e");  
           if(  noffset  ==  -1  )  
               return  strutf8;  

           while(  noffset  !=  -1  )  
           {  
               bstr  +=  strutf8.substr(0,  noffset);  
               strutf8  =  strutf8.substr(noffset,  strutf8.length  -  noffset);  
               if(  strutf8  ==  ""    ¦  ¦  strutf8.length  <  9  )      //  bad  string  
                   return  bstr;  

               bstr  +=  utf8codetochinesechar(strutf8.substr(0,  9));  
               strutf8  =  strutf8.substr(9,  strutf8.length  -  9);  
               noffset  =  strutf8.indexof("%e");  
           }  

           return  bstr  +  strutf8;  
}  

function  unicodefromutf8(strutf8)    
{  
           var  bstr  =  "";  
           var  ntotalchars  =  strutf8.length;            //  total  chars  to  be  processed.  
           var  noffset  =  0;                                                            //  processing  point  on  strutf8  
           var  nremainingbytes  =  ntotalchars;            //  how  many  bytes  left  to  be  converted  
           var  noutputposition  =  0;  
           var  icode,  icode1,  icode2;                                    //  the  value  of  the  unicode.  

           while  (noffset  <  ntotalchars)  
           {  
                       icode  =  strutf8.charcodeat(noffset);  
                       if  ((icode  &  0x80)  ==  0)                                    //  1  byte.  
                       {  
                                   if  (  nremainingbytes  <  1  )                        //  not  enough  data  
                                               break;  

                                   bstr  +=  string.fromcharcode(icode  &  0x7f);  
                                   noffset  ++;  
                                   nremainingbytes  -=  1;  
                       }  
                       else  if  ((icode  &  0xe0)  ==  0xc0)            //  2  bytes  
                       {  
                                   icode1  =    strutf8.charcodeat(noffset  +  1);  
                                   if  (  nremainingbytes  <  2    ¦  ¦                                    //  not  enough  data  
                                                 (icode1  &  0xc0)  !=  0x80  )                        //  invalid  pattern  
                                   {  
                                               break;  
                                   }  

                                   bstr  +=  string.fromcharcode(((icode  &  0x3f)  <<  6)    ¦  (              icode1  &  0x3f));  
                                   noffset  +=  2;  
                                   nremainingbytes  -=  2;  
                       }  
                       else  if  ((icode  &  0xf0)  ==  0xe0)            //  3  bytes  
                       {  
                                   icode1  =    strutf8.charcodeat(noffset  +  1);  
                                   icode2  =    strutf8.charcodeat(noffset  +  2);  
                                   if  (  nremainingbytes  <  3    ¦  ¦                                    //  not  enough  data  
                                                 (icode1  &  0xc0)  !=  0x80    ¦  ¦                        //  invalid  pattern  
                                                 (icode2  &  0xc0)  !=  0x80  )  
                                   {  
                                               break;  
                                   }  

                                   bstr  +=  string.fromcharcode(((icode  &  0x0f)  <<  12)    ¦    
                                                           ((icode1  &  0x3f)  <<    6)    ¦  
                                                           (icode2  &  0x3f));  
                                   noffset  +=  3;  
                                   nremainingbytes  -=  3;  
                       }  
                       else                                                                                                //  4  or  more  bytes  --  unsupported  
                                   break;  
           }  

           if  (nremainingbytes  !=  0)  
           {  
                       //  bad  utf8  string.  
                       return  "";  
           }  

           return  bstr;  
}  

function  utf8codetochinesechar(strutf8)  
{  
   var  icode,  icode1,  icode2;  
   icode  =  parseint("0x"  +  strutf8.substr(1,  2));  
   icode1  =  parseint("0x"  +  strutf8.substr(4,  2));  
   icode2  =  parseint("0x"  +  strutf8.substr(7,  2));  

   return  string.fromcharcode(((icode  &  0x0f)  <<  12)    ¦    
                                                           ((icode1  &  0x3f)  <<    6)    ¦  
                                                           (icode2  &  0x3f));  
}  
alert(chinesefromutf8url("%e6%b5%8b%e8%af%95"))  
</script>[code]
上一篇:Utf-8和Gb2312乱码问题的终结
下一篇:UTF-8编码第1/2页
一句话新闻
一文看懂荣耀MagicBook Pro 16
荣耀猎人回归!七大亮点看懂不只是轻薄本,更是游戏本的MagicBook Pro 16.
人们对于笔记本电脑有一个固有印象:要么轻薄但性能一般,要么性能强劲但笨重臃肿。然而,今年荣耀新推出的MagicBook Pro 16刷新了人们的认知——发布会上,荣耀宣布猎人游戏本正式回归,称其继承了荣耀 HUNTER 基因,并自信地为其打出“轻薄本,更是游戏本”的口号。
众所周知,寻求轻薄本的用户普遍更看重便携性、外观造型、静谧性和打字办公等用机体验,而寻求游戏本的用户则普遍更看重硬件配置、性能释放等硬核指标。把两个看似难以相干的产品融合到一起,我们不禁对它产生了强烈的好奇:作为代表荣耀猎人游戏本的跨界新物种,它究竟做了哪些平衡以兼顾不同人群的各类需求呢?
友情链接:杰晶网络 DDR爱好者之家 南强小屋 黑松山资源网 白云城资源网 网站地图 SiteMap