strcat源码

‘壹’ 字符串连接函数strcat（）的源代码是什么

字符串连接函数,函数返回指针,两个参数都是指针.第一个参数所指向的内存的原型：extern
char
*strcat(char
*dest,char
*src);
用法：#include

‘贰’ 帮忙编写strcat与strncat的源代码，不调用C++/C 的字符串库函数，并用指针编写

char *strcat(char *s,char *t){
char *p=s;
while(*s) ++s;
while(*s++ = *t++);
return p;
}
char *strncat(char *s,char *t,int n){
char *p=s;
while(*s) ++s;
for(;n;*s++ = *t++,n--);
*s='\0';
return p;
}

‘叁’ 编写一个函数实现两个字符串的连接（不使用库函数strcat）.这个用c语言怎么写程序啊求详细解释~急!

void fun (char s1[],char s2[]){

int i,j;

for (i=0;s1[i] !=’’; i++); /*求出的i为pA字符的总长度，包括结束标记位*/

for (j=0;s2[j] !=’’; j++)

s1[i++]=s2[j]; /*将pB字符串连在pA字符串的后面*/

s1[i]='’; /*在字符串最后加上结束标记符*/

}

(3)strcat源码扩展阅读：

最常用的字符串函数：

1. 字符串输出函数puts格式：puts （字符数组名） 功能：把字符数组中的字符串输出到显示器。

2.字符串输入函数gets格式：gets （字符数组名） 功能：从标准输入设备键盘上输入一个字符串。本函数得到一个函数值，即为该字符数组的首地址。

3.字符串连接函数strcat格式：strcat （字符数组名1，字符数组名2） 功能：把字符数组2中的字符串连接到字符数组1 中字符串的后面，并删去字符串1后的串标志“”。

4.字符串拷贝函数strcpy格式：strcpy （字符数组名1，字符数组名2） 功能：把字符数组2中的字符串拷贝到字符数组1中。串结束标志“”也一同拷贝。

5.字符串比较函数strcmp格式：strcmp（字符数组名1，字符数组名2） 功能：按照ASCII码顺序比较两个数组中的字符串，并由函数返回值返回比较结果。

6.测字符串长度函数strlen格式：strlen（字符数组名） 功能：测字符串的实际长度（不含字符串结束标志‘’） 并作为函数返回值。

‘肆’ c语言中的strcat是什么意思啊

1、strcat是用来拼接字符串的，它会将参数 src 字符串复制到参数 dest 所指的字符串尾部。具体用法首先用vs2017新建一个c语言的程序文件，引入头文件，引入strcat函数所在的包“string.h”，最后设置一个主函数：

‘伍’ 字符串连接函数strcat（）的源代码是什么

字符串连接应该是把一个串里的值复制到另一个串的末尾吧。先定义一个长度足够长的串，再将另一个较短的通过strcop（）复制过去...或者是循环复制应该也可以。

‘陆’ 编写strcat函数

#include <stdio.h>

char* Strcat(char *str1,char *str2)
{
char* tempt = str1;

while(*str1!='\0')
{
str1++;
}

while(*str2!='\0')
{
*str1 = *str2;
str1++;
str2++;
}

*str1 = '\0';
return tempt;
}

int main()
{
char a[20] = "hello";
char b[20] = ",everyOne!";
printf("%s",Strcat(a,b));
}

‘柒’ c库函数源码

不是你表达不清，也许只是你根本不想仔细看一睛VC下面目录的源码，事实上就是有的。后附其中的qsort.c，以证明所言不虚。

VC的库是提供源码的，这东西也不值钱。
X:\Program Files\Microsoft Visual Studio\VCXX\CRT\SRC
注意有些可能本身是用汇编写的。

/***
*qsort.c - quicksort algorithm; qsort() library function for sorting arrays
*
* Copyright (c) 1985-1997, Microsoft Corporation. All rights reserved.
*
*Purpose:
* To implement the qsort() routine for sorting arrays.
*
*******************************************************************************/

#include <cruntime.h>
#include <stdlib.h>
#include <search.h>

/* prototypes for local routines */
static void __cdecl shortsort(char *lo, char *hi, unsigned width,
int (__cdecl *comp)(const void *, const void *));
static void __cdecl swap(char *p, char *q, unsigned int width);

/* this parameter defines the cutoff between using quick sort and
insertion sort for arrays; arrays with lengths shorter or equal to the
below value use insertion sort */

#define CUTOFF 8 /* testing shows that this is good value */

/***
*qsort(base, num, wid, comp) - quicksort function for sorting arrays
*
*Purpose:
* quicksort the array of elements
* side effects: sorts in place
*
*Entry:
* char *base = pointer to base of array
* unsigned num = number of elements in the array
* unsigned width = width in bytes of each array element
* int (*comp)() = pointer to function returning analog of strcmp for
* strings, but supplied by user for comparing the array elements.
* it accepts 2 pointers to elements and returns neg if 1<2, 0 if
* 1=2, pos if 1>2.
*
*Exit:
* returns void
*
*Exceptions:
*
*******************************************************************************/

/* sort the array between lo and hi (inclusive) */

void __cdecl qsort (
void *base,
unsigned num,
unsigned width,
int (__cdecl *comp)(const void *, const void *)
)
{
char *lo, *hi; /* ends of sub-array currently sorting */
char *mid; /* points to middle of subarray */
char *loguy, *higuy; /* traveling pointers for partition step */
unsigned size; /* size of the sub-array */
char *lostk[30], *histk[30];
int stkptr; /* stack for saving sub-array to be processed */

/* Note: the number of stack entries required is no more than
1 + log2(size), so 30 is sufficient for any array */

if (num < 2 || width == 0)
return; /* nothing to do */

stkptr = 0; /* initialize stack */

lo = base;
hi = (char *)base + width * (num-1); /* initialize limits */

/* this entry point is for pseudo-recursion calling: setting
lo and hi and jumping to here is like recursion, but stkptr is
prserved, locals aren't, so we preserve stuff on the stack */
recurse:

size = (hi - lo) / width + 1; /* number of el's to sort */

/* below a certain size, it is faster to use a O(n^2) sorting method */
if (size <= CUTOFF) {
shortsort(lo, hi, width, comp);
}
else {
/* First we pick a partititioning element. The efficiency of the
algorithm demands that we find one that is approximately the
median of the values, but also that we select one fast. Using
the first one proces bad performace if the array is already
sorted, so we use the middle one, which would require a very
wierdly arranged array for worst case performance. Testing shows
that a median-of-three algorithm does not, in general, increase
performance. */

mid = lo + (size / 2) * width; /* find middle element */
swap(mid, lo, width); /* swap it to beginning of array */

/* We now wish to partition the array into three pieces, one
consisiting of elements <= partition element, one of elements
equal to the parition element, and one of element >= to it. This
is done below; comments indicate conditions established at every
step. */

loguy = lo;
higuy = hi + width;

/* Note that higuy decreases and loguy increases on every iteration,
so loop must terminate. */
for (;;) {
/* lo <= loguy < hi, lo < higuy <= hi + 1,
A[i] <= A[lo] for lo <= i <= loguy,
A[i] >= A[lo] for higuy <= i <= hi */

do {
loguy += width;
} while (loguy <= hi && comp(loguy, lo) <= 0);

/* lo < loguy <= hi+1, A[i] <= A[lo] for lo <= i < loguy,
either loguy > hi or A[loguy] > A[lo] */

do {
higuy -= width;
} while (higuy > lo && comp(higuy, lo) >= 0);

/* lo-1 <= higuy <= hi, A[i] >= A[lo] for higuy < i <= hi,
either higuy <= lo or A[higuy] < A[lo] */

if (higuy < loguy)
break;

/* if loguy > hi or higuy <= lo, then we would have exited, so
A[loguy] > A[lo], A[higuy] < A[lo],
loguy < hi, highy > lo */

swap(loguy, higuy, width);

/* A[loguy] < A[lo], A[higuy] > A[lo]; so condition at top
of loop is re-established */
}

/* A[i] >= A[lo] for higuy < i <= hi,
A[i] <= A[lo] for lo <= i < loguy,
higuy < loguy, lo <= higuy <= hi
implying:
A[i] >= A[lo] for loguy <= i <= hi,
A[i] <= A[lo] for lo <= i <= higuy,
A[i] = A[lo] for higuy < i < loguy */

swap(lo, higuy, width); /* put partition element in place */

/* OK, now we have the following:
A[i] >= A[higuy] for loguy <= i <= hi,
A[i] <= A[higuy] for lo <= i < higuy
A[i] = A[lo] for higuy <= i < loguy */

/* We've finished the partition, now we want to sort the subarrays
[lo, higuy-1] and [loguy, hi].
We do the smaller one first to minimize stack usage.
We only sort arrays of length 2 or more.*/

if ( higuy - 1 - lo >= hi - loguy ) {
if (lo + width < higuy) {
lostk[stkptr] = lo;
histk[stkptr] = higuy - width;
++stkptr;
} /* save big recursion for later */

if (loguy < hi) {
lo = loguy;
goto recurse; /* do small recursion */
}
}
else {
if (loguy < hi) {
lostk[stkptr] = loguy;
histk[stkptr] = hi;
++stkptr; /* save big recursion for later */
}

if (lo + width < higuy) {
hi = higuy - width;
goto recurse; /* do small recursion */
}
}
}

/* We have sorted the array, except for any pending sorts on the stack.
Check if there are any, and do them. */

--stkptr;
if (stkptr >= 0) {
lo = lostk[stkptr];
hi = histk[stkptr];
goto recurse; /* pop subarray from stack */
}
else
return; /* all subarrays done */
}

/***
*shortsort(hi, lo, width, comp) - insertion sort for sorting short arrays
*
*Purpose:
* sorts the sub-array of elements between lo and hi (inclusive)
* side effects: sorts in place
* assumes that lo < hi
*
*Entry:
* char *lo = pointer to low element to sort
* char *hi = pointer to high element to sort
* unsigned width = width in bytes of each array element
* int (*comp)() = pointer to function returning analog of strcmp for
* strings, but supplied by user for comparing the array elements.
* it accepts 2 pointers to elements and returns neg if 1<2, 0 if
* 1=2, pos if 1>2.
*
*Exit:
* returns void
*
*Exceptions:
*
*******************************************************************************/

static void __cdecl shortsort (
char *lo,
char *hi,
unsigned width,
int (__cdecl *comp)(const void *, const void *)
)
{
char *p, *max;

/* Note: in assertions below, i and j are alway inside original bound of
array to sort. */

while (hi > lo) {
/* A[i] <= A[j] for i <= j, j > hi */
max = lo;
for (p = lo+width; p <= hi; p += width) {
/* A[i] <= A[max] for lo <= i < p */
if (comp(p, max) > 0) {
max = p;
}
/* A[i] <= A[max] for lo <= i <= p */
}

/* A[i] <= A[max] for lo <= i <= hi */

swap(max, hi, width);

/* A[i] <= A[hi] for i <= hi, so A[i] <= A[j] for i <= j, j >= hi */

hi -= width;

/* A[i] <= A[j] for i <= j, j > hi, loop top condition established */
}
/* A[i] <= A[j] for i <= j, j > lo, which implies A[i] <= A[j] for i < j,
so array is sorted */
}

/***
*swap(a, b, width) - swap two elements
*
*Purpose:
* swaps the two array elements of size width
*
*Entry:
* char *a, *b = pointer to two elements to swap
* unsigned width = width in bytes of each array element
*
*Exit:
* returns void
*
*Exceptions:
*
*******************************************************************************/

static void __cdecl swap (
char *a,
char *b,
unsigned width
)
{
char tmp;

if ( a != b )
/* Do the swap one character at a time to avoid potential alignment
problems. */
while ( width-- ) {
tmp = *a;
*a++ = *b;
*b++ = tmp;
}
}

‘捌’ 10倍大妖股的启动点选股源码

如下： {百底公式1} {AB:=EMA(((2*C+H+L)/4-LLV(LOW,30))/(HHV(HIGH,30)-LLV(LOW,30))*100,8); BA:=EMA(AB,5); 中:IF(AB>0 AND AB-BA<=0,中1,中1),COLORWHITE; 底:IF(AB>0 AND AB-BA<=0,底1,底1),COLORYELLOW; DRAWTEXT(ISLASTBAR,(顶),STRCAT('',CON2STR(顶,2))),COLORWHITE; DRAWTEXT(ISLASTBAR,(中),STRCAT('',CON2STR(中,2))),COLORWHITE;高:IF(CURRBARSCOUNT<=N,CONST(HHV(H,N)),DRAWNULL),COLORGREEN ; 低:IF(CURRBARSCOUNT<=N,CONST(LLV(L,N)),DRAWNULL),COLORYELLOW; NOTEXT中:低+(高-低)/2 COLORWHITE; {涨幅:(C-低)/低*100 NODRAW COLORFF00FF;} 涨幅:((C-低)/(高-低))*100 NODRAW COLORFF00FF; 涨天数:LLVBARS(L,100)COLORWHITE NODRAW; {跌幅:((C-高)/高)*100 NODRAW COLORD9D919;}; 跌幅:((C-高)/(高-低))*100 NODRAW COLORD9D919; DRAWTEXT(ISLASTBAR,(NOTEXT中),STRCAT('',CON2STR(NOTEXT中,2))),COLORWHITE; DRAWTEXT(ISLASTBAR,(低),STRCAT('',CON2STR(低,2))),COLORWHITE; MA5:MA(C,5),COLORYELLOW; NOTEXT5:IF((C<=MA5 OR MA5<=REF(MA5,1)),MA5,DRAWNULL),COLORFFFF00; 振幅:((高-低)/低)*100 NODRAW COLORGREEN; 均周月:INBLOCK('均周')AND INBLOCK('均月') COLORWHITE NODRAW; 逃周月:INBLOCK('逃周')AND INBLOCK('逃月')NODRAW COLORYELLOW; {VAR6:=REF(C,1); VAR7:=SMA(MAX(C-VAR6,0),6,1)/SMA(ABS(C-VAR6),6,1)*100; {百底距:=((C-低)/低)*100; XG1:=BETWEEN(C,低,低*(1+0.03)); 盘整天:BARSLASTCOUNT(XG1)NODRAW COLORYELLOW;} {上涨值:=MA((H+REF(L,1))/2,3); 买进高点:=MA((H+REF(H,1))/2,3); VAR1:=((O+H+L+2*C)/5)*2-L; 突破买入值:=MA(VAR1,3);{LSS轴点突破买入值} {下跌值:=MA((REF(H,1)+L)/2,3); 卖出低点:=MA((REF(L,1)+L)/2,3); VAR2:=((O+H+L+2*C)/5)*2-H; 突破卖出值:=MA(VAR2,3); 次日卖出点:=(上涨值+买进高点+突破买入值+H)/4; 次日买入点:=(下跌值+卖出低点+突破卖出值+L)/4;

‘玖’ 秒杀一切妖股指标公式源码是什么

如下：

{百底公式1}

{AB:=EMA(((2*C+H+L)/4-LLV(LOW,30))/(HHV(HIGH,30)-LLV(LOW,30))*100,8);

BA:=EMA(AB,5);

顶1:=REFDATE(REF(HHV(H,100),5),DATE);

底1:=REFDATE(REF(LLV(L,100),5),DATE);

中1:=((顶1)+(底1))/2;

顶:IF(AB>0 AND AB-BA<=0,顶1,顶1),COLOR00FF00;

中:IF(AB>0 AND AB-BA<=0,中1,中1),COLORWHITE;

底:IF(AB>0 AND AB-BA<=0,底1,底1),COLORYELLOW;

DRAWTEXT(ISLASTBAR,(顶),STRCAT('',CON2STR(顶,2))),COLORWHITE;

DRAWTEXT(ISLASTBAR,(中),STRCAT('',CON2STR(中,2))),COLORWHITE;

DRAWTEXT(ISLASTBAR,(底),STRCAT('',CON2STR(底,2))),COLORWHITE;

{百底公式2}

N:100 NODRAW ;

高:IF(CURRBARSCOUNT<=N,CONST(HHV(H,N)),DRAWNULL),COLORGREEN ;

低:IF(CURRBARSCOUNT<=N,CONST(LLV(L,N)),DRAWNULL),COLORYELLOW;

NOTEXT中:低+(高-低)/2 COLORWHITE;

{涨幅:(C-低)/低*100 NODRAW COLORFF00FF;}

涨幅:((C-低)/(高-低))*100 NODRAW COLORFF00FF;

涨天数:LLVBARS(L,100)COLORWHITE NODRAW;

{跌幅:((C-高)/高)*100 NODRAW COLORD9D919;};

跌幅:((C-高)/(高-低))*100 NODRAW COLORD9D919;

跌天数:HHVBARS(H,100)COLORWHITE NODRAW;

DRAWTEXT(ISLASTBAR,(高-(高-低)/50),STRCAT('',CON2STR(高-(高-低)/50,2))),COLORWHITE;

DRAWTEXT(ISLASTBAR,(NOTEXT中),STRCAT('',CON2STR(NOTEXT中,2))),COLORWHITE;

DRAWTEXT(ISLASTBAR,(低),STRCAT('',CON2STR(低,2))),COLORWHITE;

MA5:MA(C,5),COLORYELLOW;

NOTEXT5:IF((C<=MA5 OR MA5<=REF(MA5,1)),MA5,DRAWNULL),COLORFFFF00;

振幅:((高-低)/低)*100 NODRAW COLORGREEN;

均周月:INBLOCK('均周')AND INBLOCK('均月') COLORWHITE NODRAW;

逃周月:INBLOCK('逃周')AND INBLOCK('逃月')NODRAW COLORYELLOW;

{VAR6:=REF(C,1);

VAR7:=SMA(MAX(C-VAR6,0),6,1)/SMA(ABS(C-VAR6),6,1)*100;

DRAWTEXT(CROSS(82,VAR7),H*1.01,'高抛'),COLORFFFFFF;

VAR1:=LLV(LOW,21);

VAR2:=HHV(HIGH,21);

AK1:=EMA((((CLOSE - VAR1) / (VAR2 - VAR1)) * 100),5);

AK:=EMA((((CLOSE - VAR1) / (VAR2 - VAR1)) * 50),13);

AB:=CROSS(AK1,AK);

DRAWTEXT((AB = 1),(LOW * 0.99),'低吸'),COLORYELLOW;};

{百底距:=((C-低)/低)*100;

XG1:=BETWEEN(C,低,低*(1+0.03));

盘整天:BARSLASTCOUNT(XG1)NODRAW COLORYELLOW;}

{上涨值:=MA((H+REF(L,1))/2,3);

买进高点:=MA((H+REF(H,1))/2,3);

VAR1:=((O+H+L+2*C)/5)*2-L;

突破买入值:=MA(VAR1,3);{LSS轴点突破买入值}

{下跌值:=MA((REF(H,1)+L)/2,3);

卖出低点:=MA((REF(L,1)+L)/2,3);

VAR2:=((O+H+L+2*C)/5)*2-H;

突破卖出值:=MA(VAR2,3);

次日卖出点:=(上涨值+买进高点+突破买入值+H)/4;

次日买入点:=(下跌值+卖出低点+突破卖出值+L)/4;

均价:=(2*C+L+H/4);

买入价:IF(均价/REF(均价,1)>1,次日买入点*1.01,次日买入点)COLORWHITE NODRAW;

次低价:IF(均价/REF(均价,1)>1,次日买入点/1.0382,次日买入点)NODRAW COLORYELLOW;

卖出价:IF(均价/REF(均价,1)>1,次日卖出点*1.0191,次日卖出点)NODRAW;

必卖价:IF(均价/REF(均价,1)>1,次日卖出点*1.05,次日卖出点)COLORD9D919 NODRAW;}

{AC:=REF(C,1);

涨停K线:=IF((C-AC)*100/AC>=(10-0.01*100/AC),1,0);

跌停K线:=IF((AC-C)*100/AC>=(10-0.01*100/AC),1,0);

STICKLINE(涨停K线,OPEN,CLOSE,2.5,0),COLORYELLOW;

STICKLINE(跌停K线,OPEN,CLOSE,2.5,0),COLORED9564;}

{涨停颜色粉色，完美区分20%10%5%，创业板20200823前10%照样变色}

BK:=IF(INBLOCK('科创板'),0.2,IF(INBLOCK('创业板'),0.2,IF(INBLOCK('ST板块'),0.05,0.1)));

XA_1:=IF(DATE<=1200823,1,0);

STICKLINE((C>=ZTPRICE(REF(CLOSE,1),0.1) AND C=H) AND XA_1=1,O,C,3,0),COLORYELLOW;

STICKLINE((C<=DTPRICE(REF(CLOSE,1),0.1) AND C=L) AND XA_1=1,O,C,3,0),COLORED9564;

STICKLINE((C>=ZTPRICE(REF(C,1),BK) AND C=H),C,O,3,0),COLORYELLOW;

STICKLINE((C<=DTPRICE(REF(C,1),BK) AND C=L),C,O,3,0),COLORED9564;

{STICKLINE((H>=ZTPRICE(REF(C,1),BK) AND C<H) OR (H>=ZTPRICE(REF(CLOSE,1),0.1) AND C<H AND XA_1=1),H,MAX(C,O),0.1,0),COLORYELLOW;{涨停后回落}

{STICKLINE((L<=DTPRICE(REF(C,1),BK) AND C>L) OR (L<=DTPRICE(REF(CLOSE,1),0.1) AND C>L AND XA_1=1),L,MIN(C,O),0.1,0),COLORED9564;{跌停后回升}

{Z1:=STRCAT(HYBLOCK,' ');

Z2:=STRCAT(Z1,DYBLOCK);

Z3:=STRCAT(Z2,' ');

DRAWTEXT_FIX(ISLASTBAR,0,10,0,STRCAT(Z3,GNBLOCK)),COLORWHITE;}

{DRAWTEXT_FIX(1,0.00,0.00,0,'主题投资：')COLORYELLOW;

DRAWTEXT_FIX(1,0.06,0.00,0,EXTERNSTR(0,1))COLORYELLOW;

DRAWTEXT_FIX(1,0.00,0.06,0,'主营业务：')COLORWHITE;

DRAWTEXT_FIX(1,0.06,0.06,0,EXTERNSTR(0,2))COLORWHITE;

DRAWTEXT_FIX(1,0.00,0.12,0,'公司亮点：')COLORYELLOW;

DRAWTEXT_FIX(1,0.06,0.12,0,EXTERNSTR(0,3))COLORYELLOW; }

{流通市值:(FINANCE(40)/100000000),NODRAW,COLORRED;}

{涨停统计}

{涨停:=CLOSE/REF(CLOSE,1)>=1.095;

ZTCS:=COUNT(涨停,BARSSINCE(涨停)+1);}

{DRAWNUMBER(涨停,HIGH*1.04,ZTCS),COLORYELLOW;}

{GZT1:=STRCAT('共涨停: ',CON2STR(ZTCS,0));

GZT2:=STRCAT(GZT1,'次');

SSTS1:=STRCAT('上市: ',CON2STR(FINANCE(42),0));

SSTS2:=STRCAT(SSTS1,'天');

NTZZT1:=STRCAT('距今:',CON2STR(CONST(BARSLAST(涨停)),0));

NTZZT2:=STRCAT(NTZZT1,'天有涨停');

ZTTJ1:=STRCAT(SSTS2,GZT2);

ZTTJ2:=STRCAT(ZTTJ1,NTZZT2);

ZTTJ:=STRCAT('涨停统计:',ZTTJ2);

DRAWTEXT_FIX(CURRBARSCOUNT=1,0,0.18,0,ZTTJ),COLORWHITE;}。