zoukankan      html  css  js  c++  java
  • Base64编码解码

    what is base64 coding and decoding is in reference to

    https://en.wikipedia.org/wiki/Base64
    http://www.cnblogs.com/chengxiaohui/articles/3951129.html
      

    //sample code in c++. Please note that the code needs refinements as there is some warning in some analysis tools,e.g. pc-lint, Coverity etc.

    // it is just a sample code for study.

    //declaration in header

    std::string base64Encode(const std::vector<char>& byteData);
    std::vector<char> base64Decode(std::string & const inputString);

    //implemenation

    std::string Cbase64Dlg::base64Encode(const std::vector<char>& byteData)
    {
       const std::string codes = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=";
       std::string base64String;
       int b;
       for (size_t i = 0; i < byteData.size(); i = i+3)
       {
          b = (byteData[i] & 0xFC) >> 2;
          base64String.push_back(codes[b]);
          b = (byteData[i] & 0x03) << 4;
          if (i + 1 < byteData.size())
          {
             b |= (byteData[i + 1] & 0xF0) >> 4;
             base64String.push_back(codes[b]);
             b = (byteData[i + 1] & 0x0F) << 2;
             if (i+2 < byteData.size())
             {
                b |= (byteData[i + 2] & 0xC0) >> 6;
                base64String.push_back(codes[b]);
                b = byteData[i + 2] & 0x3F;
                base64String.push_back(codes[b]);
             }
             else
             {
                base64String.push_back(codes[b]);
                base64String.append("=");
             }
          }
          else
          {
             base64String.push_back(codes[b]);
             base64String.append("==");
          }
       }
       
       return base64String;
    }

    std::vector<char> Cbase64Dlg::base64Decode(std::string & const inputString)
    {   
       static std::string codes = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=";
       std::vector<char> decoded;

       if (inputString.length() % 4 != 0)    
       {
          return std::vector<char>();
       }

       //The ratio of output bytes to input bytes is 4:3
       int outLen = (inputString.length() * 3 / 4);

       size_t pos = inputString.find_first_of('=');
       if (pos != std::string::npos)
       {
          decoded.resize(outLen - (inputString.length() - pos));
       }
       else
       {
          decoded.resize(outLen);
       }

       int j = 0;
       int b[4] = {};

       const char* p = inputString.c_str();

       while(p && *p && j < outLen)
       {
          bool valid = false;
          for (int i=0; p && i < 4; ++i)
          {
             size_t pos = codes.find_first_of(*p++);
             if ( pos != std::string::npos)
             {
                b[i] = pos;
             }
          }

          if (j < outLen)
          {
             decoded[j++] = (byte) ((b[0] << 2) | (b[1] >> 4));;
             if (j < outLen && b[2] < 64)      
             {
                decoded[j++] = (byte) ((b[1] << 4) | (b[2] >> 2));

                if (j < outLen && b[3] < 64)  
                {
                   decoded[j++] = (byte) ((b[2] << 6) | b[3]);
                }
             }
          }
       }

       return decoded;
    }

    // test code

       char myints[] = "ABC&&&&&&&&&&";
       std::vector<char> byte (myints, myints + sizeof(myints) / sizeof(char) );
       std::string value = base64Encode(byte);
       std::cout << value << std::endl;
       std::vector<char>decode = base64Decode(value);

  • 相关阅读:
    Passbook教程中生成pass时遇到的“Couldn't find a passTypeIdentifier in the pass”
    几个app maker的网站
    forever start Error: Cannot find module './daemon.v0.10.26'
    [Effective Objective-C 读书笔记] 第1章 几条基本写法 (2~5条)
    在linux环境下配置node:node + npm + forever
    [技术翻译] 构建现代化的Objective-C (下)
    [技术翻译]构建现代化的 Objective-C (上)
    NSDate与 NSString 、long long类型的相互转化
    Java对象的序列化与反序列化:默认格式及JSON格式(使用jackson)
    基本网络请求
  • 原文地址:https://www.cnblogs.com/zhoug2020/p/5040772.html
Copyright © 2011-2022 走看看