亚洲在线久爱草,狠狠天天香蕉网,天天搞日日干久草,伊人亚洲日本欧美

為了賬號安全,請及時綁定郵箱和手機立即綁定

求幫忙檢查一段計算“代碼行數”的代碼

Dev系統提示第62行錯了,下面一行是Dev給出的報錯

/////62 21 C:\Users\Administrator\Desktop\c編程\第一節\5.11代碼行數.cpp [Error] aggregate 'findALLDirs(const char*)::_finddate_t fa' has incomplete type and cannot be defined//////

https://img1.sycdn.imooc.com//5b83c61c0001b86709530397.jpg

https://img1.sycdn.imooc.com//5b83c62a0001e51f10520386.jpg

https://img1.sycdn.imooc.com//5b83c63b0001811410070361.jpg

https://img1.sycdn.imooc.com//5b83c6490001444808660364.jpg

https://img1.sycdn.imooc.com//5b83c65500017b0b08190212.jpg

https://img1.sycdn.imooc.com//5b83c6610001770f10200129.jpg

#include<io.h>

#include<direct.h>

#include<stdio.h>

#include<stdlib.h>

#include<string.h>


#define MAX ? ? 256


long total;


int countLines(const char *filename);

void findAllCodes(const char *path);

void findALLFiles(const char *path);


int countLines(const char *filename)

{

FILE *fp;

int count=0;

int temp;

if((fp=fopen(filename,"r"))==NULL)

{

fprintf(stderr,"Can not open the file:%s\n",filename);?

return 0;

}

while((temp=fgetc(fp))!=EOF)

{

if(temp=='\n')

{

count++;

}

? ? }

? ??

? ? fclose(fp);

? ??

? ? return count;

}


void findAllCodes(const char *path)

{

struct _finddata_t fa;

long handle;

char thePath[MAX],target[MAX];

strcpy(thePath,path);

if((handle=_findfirst(strcat(thePath,"/*.c"),&fa))!=-1L)

{

do

{

sprintf(target,"%s/%s",path,fa.name);

total+=countLines(target);

}while(_findnext(handle,&fa)==0);

}

_findclose(handle);

}


void findALLDirs(const char *path)

{

struct _finddate_t fa;

long handle;

char thePath[MAX];

strcpy(thePath,path);

if((handle=_findfirst(strcat(thePath,"/*"),&fa))==-1L)

{

fprintf(stderr,"The path %s is wrong!\n",path);

return;

}

do

{

if(!strcmp(fa.name,".")||!strcmp(fa.name,".."))

continue;

if(fa.attrib==_A_SUBDIR)

{

sprintf(thePath,"%s/%s",path,fa.name);

findAllCodes(thePath);

findALLDirs(thePath);

}

}while(_findnext(handle,&fa)==0);

_findclose(handle);

}


int main()

{

char path[MAX]=".";

printf("計算中...\n");

findAllCodes(path);

findALLDirs(path);

printf("目前你總共寫了%ld行代碼!\n\n",total);

system("pause");

return 0 ;

}


正在回答

1 回答

我已找到問題,

第62行應是struct _finddata_t fa;

data寫成了date,

歡迎冒泡回答,立即采納

1 回復 有任何疑惑可以回復我~

舉報

0/150
提交
取消

求幫忙檢查一段計算“代碼行數”的代碼

我要回答 關注問題
微信客服

購課補貼
聯系客服咨詢優惠詳情

幫助反饋 APP下載

慕課網APP
您的移動學習伙伴

公眾號

掃描二維碼
關注慕課網微信公眾號