我写的按日期归类的哈希表

最新推荐文章于 2025-02-09 19:08:09 发布

原创最新推荐文章于 2025-02-09 19:08:09 发布 · 422 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#null #os #date #path

本文介绍了一个程序如何通过遍历文件系统收集文件路径及其修改时间，并将这些信息存储到特定的数据结构中，以便进一步处理。具体实现包括使用动态内存分配创建节点，以及根据时间对虚拟文件夹进行排序。

memset(pAppletData->fullpath,0,PHOTO_MAX_PATH); sprintf(pAppletData->fullpath,"%s%s",pAppletData->selectpath,entry->d_name);

if(pAppletData->filepStat == ListHead) { //creat pS =(FiledataNode *)OS_Malloc(sizeof(FiledataNode)); pS->next = NULL; pS->index = index; //get entry data strcpy(pS->fullpath,pAppletData->fullpath); // strcat(pS->fullpath,entry->d_name); // OS_TaskDelay(10); #ifdef WIN32 pS->datetime = i%8; sprintf(pS->datetime_name, "%d-%d-%d",i%8,i%8,i%8);

#else

ufs_stat(pAppletData->fullpath, &f_stat); filedate = f_stat.st_mtime; AF_PRINTF("fullpath: %s, /r/nyear(%d), month(%d), date(%d) /r/n",pAppletData->fullpath,(1980 + filedate.year),filedate.month,filedate.day); pS->datetime = 19800000 + filedate.year*10000 + filedate.month*100 + filedate.day; AF_PRINTF("----------------------------name =%s index =%d/n",pS->fullpath,pS->index); sprintf(pS->datetime_name, "%d-%d-%d",(1980 + filedate.year),filedate.month,filedate.day); #endif

// strcpy(pS->datetime_name,pAppletData->pSVirtualDirArray->datetime_name);

pSVirtualDirArray = (VirtualDirArray *)OS_Malloc(sizeof(VirtualDirArray)); pSVirtualDirArray->next = NULL; pHeadVirtualDirArray = pSVirtualDirArray; pSVirtualDirArray->childNode = pS; pSVirtualDirArray->datetime = pS->datetime; strcpy(pSVirtualDirArray->datetime_name,pS->datetime_name);

pAppletData->nfilesCount++; pAppletData->totalEntriesCount++; pAppletData->filepStat = ListBody; } else //Body { pS =(FiledataNode *)OS_Malloc(sizeof(FiledataNode)); pS->next = NULL; pS->index = index; //get fullpath and Time data strcpy(pS->fullpath,pAppletData->fullpath); // strcat(pS->fullpath,entry->d_name); //OS_TaskDelay(10); // AF_PRINTF("----------------------------name =%s index =%d/n",pS->fullpath,pS->index); #ifdef WIN32 pS->datetime = i%8; sprintf(pS->datetime_name, "%d-%d-%d",i%8,i%8,i%8); #else

if (pSVirtualDirArray->datetime == pS->datetime)

{ FiledataNode *temp; temp = pSVirtualDirArray->childNode; pSVirtualDirArray->childNode = pS; pS->next = temp; findout = TRUE; break; } pSVirtualDirArray = pSVirtualDirArray->next; } //the last one if(pSVirtualDirArray->next == NULL) { if (pSVirtualDirArray->datetime == pS->datetime) { FiledataNode *temp; temp = pSVirtualDirArray->childNode; pSVirtualDirArray->childNode = pS; pS->next = temp; findout = TRUE; } } if(findout != TRUE) { pSVirtualDirArray->next = (VirtualDirArray *)OS_Malloc(sizeof(VirtualDirArray)); pSVirtualDirArray = pSVirtualDirArray->next; pSVirtualDirArray->next = NULL; pSVirtualDirArray->childNode = pS; pSVirtualDirArray->datetime = pS->datetime; strcpy(pSVirtualDirArray->datetime_name,pS->datetime_name); AF_PRINTF("fullpath: %s/r/n",pAppletData->fullpath);

} pAppletData->nfilesCount++; pAppletData->totalEntriesCount++; pAppletData->filepStat = ListBody; } // if (pAppletData->nfilesCount==pAppletData->nfiles) if ((i + 1) ==(pAppletData->totalEntries-1)) { VirtualfolderSort(pHeadVirtualDirArray); pAppletData->pHeadVirtualDirArray = pHeadVirtualDirArray; pSVirtualDirArray = pHeadVirtualDirArray; //count how many virual dir is. for ( pAppletData->nVirualdirs = 0;pSVirtualDirArray != NULL;pAppletData->nVirualdirs++) { pSVirtualDirArray = pSVirtualDirArray->next; } }