strcpy, strcmp, strlen, memcpy 实现

#include <assert.h>
#include <string.h>
#include <stdlib.h>
#include <stdio.h>

char *StrCpy(char *dest, const char *src)
{
assert((dest != NULL) && (src != NULL));
char *str = dest;
while ((*dest ++ = *src ++) != '\0');
return str;
}

int Strlen(const char *str)
{
assert((str != NULL));
int len = 0;
while (*str ++)
{
len++;
}
return len;
}

int StrCmp(const char *str1, const char *str2)
{
assert((str1 != NULL) && (str2 != NULL));
int rt = 0;
while ( !(rt = *(unsigned char *)str1 - *(unsigned char*)str2 ) && *str2)
{
str1 ++;
str2 ++;
}
if (rt > 0)
{
rt = 1;
}
else if (rt < 0)
{
rt = -1;
}
return rt;
}

//为了解决内存重叠的现象
void *MemCpy(void *dst, const void *src, size_t count)
{
char *pdst = static_cast<char *>(dst);
const char *psrc = static_cast<const char *>(src);

if (pdst > psrc && pdst < psrc + count)
{
for (int i = count - 1; i >= 0; i--)
{
pdst[i] = psrc[i];
}
}
else
{
for (int i = 0; i < count; i++)
{
pdst[i] = psrc[i];
}
}
return dst;
}

// memcpy 实现源码
void * __cdecl memcpy (
void * dst,
const void * src,
size_t count
)
{
void * ret = dst;

while (count--) {
*(char *)dst = *(char *)src;
dst = (char *)dst + 1;
src = (char *)src + 1;
}

return(ret);
}

int main()
{
char str2[100] = "abcd";
char *str1 = (char *)malloc(100);
str1= str2 + 2;
//考虑了内存重叠
MemCpy(str1, str2, 5);
printf("调用MemCpy后str1的内容: %s\n", str1);

//未考虑内存重叠
memcpy(str1, str2, 5);
printf("调用memcpy后str1的内容: %s\n", str1);
while(1);
}
[cpp]
#include <assert.h>
#include <string.h>
#include <stdlib.h>
#include <stdio.h>

char *StrCpy(char *dest, const char *src)
{
assert((dest != NULL) && (src != NULL));
char *str = dest;
while ((*dest ++ = *src ++) != '\0');
return str;
}

int Strlen(const char *str)
{
assert((str != NULL));
int len = 0;
while (*str ++)
{
len++;
}
return len;
}

int StrCmp(const char *str1, const char *str2)
{
assert((str1 != NULL) && (str2 != NULL));
int rt = 0;
while ( !(rt = *(unsigned char *)str1 - *(unsigned char*)str2 ) && *str2)
{
str1 ++;
str2 ++;
}
if (rt > 0)
{
rt = 1;
}
else if (rt < 0)
{
rt = -1;
}
return rt;
}

//为了解决内存重叠的现象
void *MemCpy(void *dst, const void *src, size_t count)
{
char *pdst = static_cast<char *>(dst);
const char *psrc = static_cast<const char *>(src);

if (pdst > psrc && pdst < psrc + count)
{
for (int i = count - 1; i >= 0; i--)
{
pdst[i] = psrc[i];
}
}
else
{
for (int i = 0; i < count; i++)
{
pdst[i] = psrc[i];
}
}
return dst;
}

// memcpy 实现源码
void * __cdecl memcpy (
void * dst,
const void * src,
size_t count
)
{
void * ret = dst;

while (count--) {
*(char *)dst = *(char *)src;
dst = (char *)dst + 1;
src = (char *)src + 1;
}

return(ret);
}

int main()
{
char str2[100] = "abcd";
char *str1 = (char *)malloc(100);
str1= str2 + 2;
//考虑了内存重叠
MemCpy(str1, str2, 5);
printf("调用MemCpy后str1的内容: %s\n", str1);

//未考虑内存重叠
memcpy(str1, str2, 5);
printf("调用memcpy后str1的内容: %s\n", str1);
while(1);
}

转载于:https://www.cnblogs.com/chenzomi/p/3618760.html

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值