BiTreeOpe.c

#include "NodeInfo.h"
#include "State.h"
#include "NodeOpe.h"

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

//获取文件状态所需的头文件
#include <time.h>
#include <sys/types.h>
#include <sys/stat.h>
#include <dirent.h>


#define MAX_SPACING 15	//最大的输出间距，超过这个间距，剩余的字符就会被截断



/*
 * Author: 谢文?? Modify：宋??
 * 作用：返回文件目录下的所有文件名路径
 * 用法：参数path是文件的绝对路径，path不存在返回NULL
*/
char **get_inner_pathes(FileInfo *info)
{
	int strLength;
	char *path = info->path;
	char **paths_arr = (char ** )malloc(sizeof(char* ) * info->innerFileNum);  //动态分配内存空??
	DIR *dir = opendir(path);
	struct dirent *entry;
	int num = 0;
	int lenth = strlen(path); //获取文件路径的长??
	if(paths_arr == NULL || dir == NULL)//若path为空路径不存??,或内存分配失败，返回NULL
	{
		return NULL;
	}
	//把小圆点去掉
	readdir(dir);
	readdir(dir);
	char **p;
	for (p=paths_arr ; num < info->innerFileNum; ++p, ++num)
	{
		entry = readdir(dir);
		// printf("%d: " , num);
		// char *name = (char *)malloc(sizeof(char) * (strlen(entry->d_name)+1));
		// strcpy(name, entry->d_name);
		// printf("%s:.1\n", __func__);
		strLength = strlen(path) + entry->d_namlen + 2;
		// printf("strlen = %d\n", strLength);
		char *tmp = (char *)malloc(strLength * sizeof(char));
		if (tmp==NULL)
		{
			printf("NULL Pointer\n");
		}
		// printf("%s:.2\n", __func__);
		*p = tmp;
		// 另两个空间，一个是\\，一个是\0
		if(*p == NULL) //空间分配失败，返回NULL
		{
			return NULL;
		}
		strcpy(*p, path);
		*((*p)+lenth) = '\\';
		// p[lenth] = '\\';  //分隔??
		// strcpy(paths_arr[num]+lenth+1, entry->d_name);  //生成绝对路径
		strcpy((*p)+lenth+1, entry->d_name);
	}
	closedir(dir);
	// printf("%s:end", __func__);
	return paths_arr;
}



/*
 * Author：宋??
 * 功能：只建立path文件夹下的同一层的兄弟二叉??(退化为链表)
*/
FilesBiTree create_blising_tree(char *path)
{
	FilesBiTree root = (FilesBiTree) malloc (sizeof(FileNode));
	FileNode *node = root;
	if( node == NULL ||  NULL == path || 0==strlen(path)
	  ||  (!file_exsists(path) && !folder_exsists(path))) //若分配空间失??
	{
		return NULL;
	}
	node->rch = NULL;
	node->info = create_info_node(path); //获取文件信息
	int fileNum = node->info->innerFileNum;

	char **p = get_inner_pathes(node->info);  //获取文件夹内的文件路??

	int i;
	node->lch = (FilesBiTree) malloc (sizeof(FileNode));
	node = node->lch;
	node->info = create_info_node(p[0]);
	node->lch = NULL;
	for(i = 1; i < fileNum; ++i)
	{
		node->rch = (FilesBiTree) malloc (sizeof(FileNode)); //右子结点为目录下的后面文??
		node = node->rch;
		node->lch = NULL;
		node->info = create_info_node(p[i]);
	}
	node->rch = NULL;	//到了最后一个右孩子
	return root;
}



/*
 * Author: 谢文??  Modify:宋淳
 * 作用：返回文件目录二叉树的根节点
 * 用法：参数path是文件的绝对路径，path不存在返回NULL
 */
FilesBiTree create_files_bitree(char *path)
{
	FilesBiTree root = (FilesBiTree) malloc (sizeof(FileNode));
	if(root == NULL || (!file_exsists(path) && !folder_exsists(path)))
	{
		return NULL;
	}
	root->info = create_info_node(path); //获取文件信息

	if(root->info == NULL)  //若文件不存在，返回NULL
	{
		free(root);
		return NULL;
	}

	if(file == root->info->type) //如果是文??
	{
		root->lch = NULL;
	}
	else //如果是文件夹
	{
		if (0 == root->info->innerFileNum)	//若为空文件夹
		{
			root->lch = NULL;
			return root;
		}
		char **p = get_inner_pathes(root->info);  //获取文件夹内的文件路??

		root->lch = create_files_bitree(p[0]); //左子结点为目录下的第一?? 文件
		FilesBiTree pointer = root->lch;
		int i;
		for(i = 1; i < root->info->innerFileNum; i++)
		{
			pointer->rch = create_files_bitree(p[i]); //右子结点为目录下的后面文??
			pointer = pointer->rch;
		}
		pointer->rch = NULL;	//到了最后一个右孩子
	}
	root->rch = NULL;
	return root;
}



/*
 * Author:宋淳
 * 实现功能：只输出此目录下的文??(??)的名字，按列对齐
 */
int list_files_name_only(FilesBiTree tree)
{
    FileNode *node = tree;
    if (node->info->type != folder)     //若不是文件夹，直接退??
    {
        return Error;
    }
    if (NULL == node->lch)  //若是空文件夹，提示并退??
    {
        printf("空文件夹\n");
        return OK;
    }
    FilesBiTree p = tree->lch;

    int maxLength = 0;
    int tempLength = 0;
    int spacing = 0;
	int i;
    for (i=0; i<(node->info->innerFileNum); ++i, p=p->rch)
    {
        if (maxLength < (tempLength=strlen(p->info->name)))
        {
            maxLength = tempLength;
        }
    }
    //获取间隔，若字符串的最大宽度大于预设的最大宽度，则间隔为预设的最大宽??
    spacing = maxLength < MAX_SPACING ? maxLength : MAX_SPACING;
    p = tree->lch;  //从头开始输??
    // printf("%d %d\n", maxLength, spacing);

    for (i=1; i<node->info->innerFileNum; ++i, p=p->rch)
    {
        print_name(p->info->name, spacing);
        if (0 == i%4)
        {
            printf("\n");
        }
    }
    printf("\n");
    return OK;
}



/*
 * Author：宋??
 * 作用：只输出此目录下的文??(??)的名字，按列对齐
*/
int list_files_name_only_in_path(char *path)
{
    FilesBiTree blisingTree = create_blising_tree(path);
    list_files_name_only(blisingTree);
	free_tree(blisingTree);
    return OK;
}

FileNode *locate_node(char *path, FilesBiTree root)
{
	if(root == NULL || path == NULL) //如果路径不存在或者根节点不存在，返回NULL
	{
		return NULL;
	}
	if(strcmp(path, root->info->path) == 0 && root->info->type == folder)
	{
		return root;
	}

	FileNode *node1 =  locate_node(path,root->rch);
	if(node1 != NULL)
		return node1;
	FileNode *node2	= locate_node(path, root->lch);
	if(node2 != NULL)
		return node2;
	return NULL;
}



int copy_folder(char *destPath, FileNode *sourceNode, FilesBiTree root)
{
	if( destPath == NULL || sourceNode == NULL || root == NULL || file_exsists(destPath)) //如果待复制路径为文件或其他异常
	{
		return Error;
	}
	FilesBiTree cloneSourceNode = (FilesBiTree)malloc(sizeof(FileNode));
	if(cloneSourceNode == NULL) //若分配内存空间失败
	{
		return Error;
	}
	// 兼容性不好，不同的终端有不同的命令
	// // 创建命令
	// char command[300];
	// char *p = command;
	// strcpy(p, "copy ");
	// p += strlen("copy ");
	// strcpy(p, sourceNode->info->path);
	// p += strlen(sourceNode->info->path);
	// strcpy(p, destPath);
	// p +=strlen(destPath);
	// *p = '\0';
	// printf("%s\n", command);
	// system(command);	//执行系统的cp函数

	cloneSourceNode = create_files_bitree(sourceNode->info->path);
	if(cloneSourceNode == NULL) //若分配内存空间失败
	{
		return Error;
	}
	FileNode *destNode = locate_node(destPath, root);  //定位到待复制的结点
	//用头插法
	cloneSourceNode->rch = destNode->lch;
	destNode->lch = cloneSourceNode;
	return OK;
}



/*
 * 实现功能：在一行中输出一个文件(夹)的文件(夹)命，大小，时间
 * 实验要求：
 *      1. 判断是不是文件夹，为空文件夹直接返回
 *      2. 列与列间要对齐，参考在PowerShell中ls命令的样式
 */
int list_files(FilesBiTree tree)
{
	if(tree->info->type == file || tree->info->innerFileNum == 0) //如果为文件或者为控股文件夹
	{
		return Error;
	}
	if(tree == NULL)
	{
		return Error;
	}

	int i;
	FilesBiTree node = tree->lch;

	printf("\tDIR: %s\n", tree->info->path);
	printf("\tTotal: %d\n", tree->info->innerFileNum);
	if (0 == tree->info->innerFileNum)
	{
		printf("\tEmpty Direction.\n");
	}
	print_name("Name", 22);
	printf("\t");
	print_name("MofifyTime", 24);
	printf("\t");
	print_name("Size", 10);
	printf("\n");
	print_name("----", 22);
	printf("\t");
	print_name("-----------", 24);
	printf("\t");
	print_name("----", 10);
	printf("\n");

	for(i = 0; i < tree->info->innerFileNum; i++)
	{
		print_name(node->info->name, 22);
		printf("\t");
		print_name(node->info->modifyTime, 24);
		printf("\t");
		if(node->info->type == file)
		{
			char *string = get_size_string(node->info->size);
			print_name(string, 10);
			// free(string);	//会出bug
		}
		else
		{
			printf("<DIR>");
		}
		printf("\n");

		node = node->rch;
	}
	printf("\n");
	return OK;
}

int list_files_in_path(char *path)
{
	FilesBiTree blisingTree = create_blising_tree(path);
    list_files(blisingTree);
	free_tree(blisingTree);
    return OK;
}



// /*
//  * 返回类型：OK表示成功执行，ERROR表示执行失败
//  * 实现功能：打印此目录下的文件(夹)，参考在powerShell中使用tree命令的效果
//  * 实现要求：
//  *          1. 要先判断接收到的是文件还是文件夹
//  *          2. 若文件夹为空，则直接返回
//  *          3. 递归调用，输出此文件夹下的所有文件(夹)
//  */
// int tree_files(FilesBiTree tree)
// {
// 	if (NULL == tree)
// 	{
// 		return;
// 	}
// 	printf("%s", tree->info->name);
// 	printf()

// }