类DOS文件管理

// 类DOS文件系统演示.cpp : 定义控制台应用程序的入口点。 // #include <iostream> #include <string> using namespace std; struct Node { // 二叉树节点 Node* left; // 孩子指针 Node* right; // 兄弟指针 Node* parent; string name; Node( string s, Node* parent ) { left = right = NULL; this->parent = parent; name = s; } }; class Tree { public : Node* root; // 根节点 Node* cur; // 当前节点 /* * 构造,析构函数 */ Tree( void ); ~Tree( void ); /* * 0.建树(即建立文件) */ void Build( Node* &p, Node* parent ); void Init( void ); /* * 1.显示子树(即显示文件列表) */ void ShowChild( void ); /* * 2.进入左子树(即打开文件) */ void Open( string s ); /* * 3.返回到父节点(即关闭文件) */ void Close( void ); /* * 4.新建节点(即在当前目录下新建文件) */ void New( string s ); /* * 5.删除节点(即删除当前目录下的给定目录) */ void Delete( string s ); /* * 显示全部目录 */ void Show( const Node* p, const int level ); /* * 显示当前目录名 */ void ShowCurrent( void ); private : /* * 功能 : 搜索一个指定名称的文件 */ Node* Search( string s ) { Node* p = cur->left; while( p && p->name != s ) p = p->right; return p; } /* * 功能 : 删除子树 */ void Remove( Node* p ) { if( p == NULL ) return; Remove( p->left ); Remove( p->right ); delete p; } }; //--------------------函数实现----------------------// Tree::Tree( void ) { root = cur = NULL; } Tree::~Tree( void ) { Remove( root ); } void Tree::Build( Node* &p, Node* parent ) { string name; printf( "请输入文件名:" ); cin >> name; if( name == "^" ) return; else { p = new Node( name, parent ); Build( p->left, p ); // 建子目录 Build( p->right, p->parent ); // 建同级目录 } } void Tree::Init() { root->parent = root; cur = root; } void Tree::ShowChild() { Node* p = cur->left; while( p ) { cout << p->name << " "; p = p->right; } cout << "/n"; } void Tree::Open( string s ) { Node* p = Search( s ); if( p ) cur = p; else printf("输入文件名无效!/n"); } void Tree::Close() { cur = cur->parent; } void Tree::New( string s ) { Node* p = cur->left; if( !p ) cur->left = new Node( s, cur ); else { while( p->right ) p = p->right; p->right = new Node( s, cur ); } } void Tree::Delete( string s ) { Node* p = Search( s ); if( p ) { // 找到要删除的文件 // 首先删除该文件的所有子文件 Remove( p->left ); // 再删除该文件 // 1.该文件是当前目录的第一个文件 if( p == cur->left ) { cur->left = p->right; delete p; } // 2.该文件不是当前目录的第一个文件 else { Node* q = cur->left; while( q->right != p ) q = q->right; q->right = p->right; delete p; } } else printf("输入文件名无效!/n"); } void Tree::Show( const Node* p, const int level ) { if( p == NULL ) return; for( int i = 1; i < level; ++ i ) printf( "/t" ); cout << p->name << "/n"; Show( p->left, level + 1 ); Show( p->right, level ); } void Tree::ShowCurrent() { cout << "当前目录 : " << cur->name << "/n"; } //--------------------------------------------------// int main() { Tree tree; cout << "首先创建文件系统/n"; tree.Build( tree.root, tree.root ); tree.Init(); string s; tree.ShowCurrent(); cout << "Input Instruction >> "; while( cin >> s && s != "Quit" ) { if( s == "dir" ) { tree.ShowChild(); tree.Show( tree.root, 1 ); } else if( s == "close" ) { tree.Close(); tree.Show( tree.root, 1 ); } else if( s == "create" ) { getchar(); string name; cin >> name; tree.New( name ); tree.Show( tree.root, 1 ); } else if( s == "delete" ) { getchar(); string name; cin >> name; tree.Delete( name ); tree.Show( tree.root, 1 ); } else if( s == "open" ) { getchar(); string name; cin >> name; tree.Open( name ); tree.Show( tree.root, 1 ); } tree.ShowCurrent(); cout << "Input Instruction >> "; } cout << "演示结束/n"; /*tree.Show( tree.root, 1 ); tree.Open( "child_1" ); tree.Open( "yx" ); tree.Close(); tree.New( "LiuLiCen.." ); tree.Show( tree.root, 1 ); tree.Delete( "Q" ); tree.Show( tree.root, 1 );*/ system( "pause" ); return 0; }

 

 

可以用以下的测试数据

 

========== 1.首先建树，即创建一个文件系统,按以下输入 ===========
root
child_1
zfz
^
yx
^
Q
^
^
child_2
WuGui
^
^
child_3
^
child_4
^
^
^
可以获得如下图的文件系统

root
          child_1
                        zfz
                        yx
                        Q
          child_2
                        WuGui
          child_3
          child_4

=========== 2.输入 "dir" (查看当前目录下所有文件) ===========
=========== 3.输入 "open child_1" (进入子目录root/child_1) ============
=========== 4.输入 "open 123" (会提示文件不存在) ==========
=========== 5.输入 "open yx" (进入root/child_1/yx)===========
=========== 6.输入 "create yx97" ============
=========== 7.输入 "create yx98" ============
=========== 8.输入 "create yx99" ============
=========== 9.输入 "close" (返回root/child_1)============
===========10.输入 "close" (返回root)============
===========11.输入 "delete 123" (会提示文件不存在) =============
===========12.输入 "delete child_1" (删除child_1目录及它的所有子目录和文件) =============
===========13.输入 "dir" ============
===========14.输入 "open child_2" ============
===========15.输入 "Quit" (退出)===========