base64编解码

char legal_letter[128];


char encode_table[] = { 'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H',
'I', 'J', 'K', 'L', 'M', 'N', 'O', 'P',
'Q', 'R', 'S', 'T', 'U', 'V', 'W', 'X',
'Y', 'Z', 'a', 'b', 'c', 'd', 'e', 'f',
'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n',
'o', 'p', 'q', 'r', 's', 't', 'u', 'v',
'w', 'x', 'y', 'z', '0', '1', '2', '3',
'4', '5', '6', '7', '8', '9', '+', '/',};


unsigned char decode_table[256] = {
        100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,
        100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,
        100,100,100,100,100,100,100,100,100,100,100,62 ,100,100,100, 63,
         52, 53, 54, 55, 56, 57, 58, 59, 60, 61,100,100,100, 99,100,100,
        100,  0,  1,  2,  3,  4,  5,  6,  7,  8,  9, 10, 11, 12, 13, 14,
         15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25,100,100,100,100,100,
        100, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40,
         41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51,100,100,100,100,100,
        100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,
        100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,
        100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,
        100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,
        100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,
        100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,
        100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,
        100,100,100,100,100,100,100,100,100,100,100,100,100,100,100,100};


/************************************************************

************************************************************/
void init_legal_letter_table()
{
char c = 0;


memset(legal_letter, 0x00, 128);
for( c = 'A'; c <= 'Z'; c++)
{
legal_letter[c] = 1;
}


for( c = 'a'; c <= 'z'; c++)
{
legal_letter[c] = 1;
}


for( c = '0'; c <= '9'; c++)
{
legal_letter[c] = 1;
}

legal_letter['+'] = 1;
legal_letter['/'] = 1;
legal_letter['='] = 1;
}
/************************************************************

************************************************************/
int is_legal(unsigned char *data)
{
int legal = 1;
char c;


init_legal_letter_table();
while( *data != '\0' )
{
c = *data;
if( legal_letter[c] == 0 )
{
printf("%s| Illegal character:[0x%02x|%c].\n", __FUNCTION__, c, c);
legal = 0;
break;
}
data++;
}


return legal;
}
/************************************************************

************************************************************/
int get_parenthesis_number(unsigned char* base64code)
{
int count = 0;
unsigned char *end = NULL;


end = base64code + strlen(base64code) - 1;
while( end >= base64code && *end == '=' )
{
count++;
end--;
}


if( count > 2 )
{
BASE64_DEBUG_PRINT("Error: Not Base64 code.\n");
return -1;
}


return count;
}
/************************************************************

************************************************************/
unsigned char *base64_encode(void *data)
{
unsigned char *original = (unsigned char*)data;
int len = strlen(original);
BASE64_DEBUG_PRINT("Original len:%d\n", len);
int base64_len = (len+2)/3*4;
BASE64_DEBUG_PRINT("After the base64 encode, the len is:%d\n", base64_len);
unsigned char *base64code = (unsigned char*)malloc(sizeof(unsigned char)*base64_len+1);
unsigned char *begin = original;
unsigned char *p = base64code;
unsigned char c[4];


memset(base64code, 0x00, base64_len+1);


while(len - 3 >= 0)
{
memset(c, 0x00, 4);
BASE64_DEBUG_PRINT("%u %u %u\n", begin[0], begin[1], begin[2]);
c[0] = begin[0]>>2;
c[1] = (begin[0]&0x3)<<4|begin[1]>>4;
c[2] = (begin[1]&0xf)<<2|begin[2]>>6;
c[3] = begin[2]&0x3f;
BASE64_DEBUG_PRINT("%u %u %u %u\n", c[0], c[1], c[2], c[3]);


c[0] = encode_table[c[0]];
c[1] = encode_table[c[1]]; 
c[2] = encode_table[c[2]]; 
c[3] = encode_table[c[3]]; 
BASE64_DEBUG_PRINT("%c%c%c%c\n", c[0], c[1], c[2], c[3]);

strncpy(p, c, 4);
len -= 3;
begin += 3;
p += 4;
}


memset(c, 0x00, 4);
if( len == 1 )
{
c[0] = begin[0]>>2;
c[1] = (begin[0]&0x3)<<4;
c[0] = encode_table[c[0]];
c[1] = encode_table[c[1]]; 
c[2] = c[3] = '=';
}
else if( len == 2 )
{
c[0] = begin[0]>>2;
c[1] = (begin[0]&0x3)<<4|begin[1]>>4;
c[2] = (begin[1]&0xf)<<2;
c[0] = encode_table[c[0]];
c[1] = encode_table[c[1]]; 
c[2] = encode_table[c[2]]; 
c[3] = '=';
}
strncpy(p, c, 4);


return base64code;
}


/************************************************************

************************************************************/
unsigned char *base64_decode(unsigned char *base64, int *dlen)
{
int parenthesis = 0; 
int base64_len = 0; 
int len = 0; 
unsigned char *original = NULL; 
unsigned char *begin = NULL; 
unsigned char c[4];


parenthesis = get_parenthesis_number(base64);
if( parenthesis < 0 )
{
return NULL;
}
base64_len = strlen(base64);
len = base64_len / 4 * 3 - parenthesis;
original = (unsigned char*)malloc(len + 1);
begin = original;


memset(original, 0x00, len+1);


while( base64_len - 4 > 0 || (base64_len - 4 == 0 && parenthesis == 0) )
{
memset(c, 0x00, 4);
c[0] = decode_table[base64[0]];
c[1] = decode_table[base64[1]];
c[2] = decode_table[base64[2]];
c[3] = decode_table[base64[3]];


begin[0] = c[0]<<2 | c[1]>>4;
begin[1] = c[1]<<4 | c[2]>>2;
begin[2] = c[2]<<6 | c[3];


base64_len -= 4;
base64 += 4;
begin += 3;
}


memset(c, 0x00, 4);
if( parenthesis == 1 )
{
c[0] = decode_table[base64[0]];
c[1] = decode_table[base64[1]];
c[2] = decode_table[base64[2]];
begin[0] = c[0]<<2 | c[1]>>4;
begin[1] = c[1]<<4 | c[2]>>2;
}
else if( parenthesis == 2 )
{
c[0] = decode_table[base64[0]];
c[1] = decode_table[base64[1]];
begin[0] = c[0]<<2 | c[1]>>4;
}

*dlen = len;


return original;
}
考虑柔性负荷的综合能源系统低碳经济优化调度【考虑碳交易机制】(Matlab代码实现)内容概要:本文围绕“考虑柔性负荷的综合能源系统低碳经济优化调度”展开,重点研究在碳交易机制下如何实现综合能源系统的低碳化与经济性协同优化。通过构建包含风电、光伏、储能、柔性负荷等多种能源形式的系统模型,结合碳交易成本与能源调度成本,提出优化调度策略,以降低碳排放并提升系统运行经济性。文中采用Matlab进行仿真代码实现,验证了所提模型在平衡能源供需、平抑可再生能源波动、引导柔性负荷参与调度等方面的有效性,为低碳能源系统的设计与运行提供了技术支撑。; 适合人群:具备一定电力系统、能源系统背景,熟悉Matlab编程,从事能源优化、低碳调度、综合能源系统等相关领域研究的研究生、科研人员及工程技术人员。; 使用场景及目标:①研究碳交易机制对综合能源系统调度决策的影响;②实现柔性负荷在削峰填谷、促进可再生能源消纳中的作用;③掌握基于Matlab的能源系统建模与优化求解方法;④为实际综合能源项目提供低碳经济调度方案参考。; 阅读建议:建议读者结合Matlab代码深入理解模型构建与求解过程,重点关注目标函数设计、约束条件设置及碳交易成本的量化方式,可进一步扩展至多能互补、需求响应等场景进行二次开发与仿真验证。
评论
成就一亿技术人!
拼手气红包6.0元
还能输入1000个字符  | 博主筛选后可见
 
红包 添加红包
表情包 插入表情
 条评论被折叠 查看
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值