组合模式实现树形结构支持查询返回查找遍历删除等

Qter

https://blog.csdn.net/LoveLion/article/details/7956898

https://blog.csdn.net/liyf2/article/details/109019508  
组合模式：如何设计实现支持递归遍历的文件系统目录树结构？

1. public class FileSystemNode {
   
2.   private String path;
   
3.   private boolean isFile;
   
4.   private List<FileSystemNode> subNodes = new ArrayList<>();
   
5. 
   
6.   public FileSystemNode(String path, boolean isFile) {
   
7.     this.path = path;
   
8.     this.isFile = isFile;
   
9.   }
   
10. 
    
11.   public int countNumOfFiles() {
    
12.     // TODO:...
    
13.   }
    
14. 
    
15.   public long countSizeOfFiles() {
    
16.     // TODO:...
    
17.   }
    
18. 
    
19.   public String getPath() {
    
20.     return path;
    
21.   }
    
22. 
    
23.   public void addSubNode(FileSystemNode fileOrDir) {
    
24.     subNodes.add(fileOrDir);
    
25.   }
    
26. 
    
27.   public void removeSubNode(FileSystemNode fileOrDir) {
    
28.     int size = subNodes.size();
    
29.     int i = 0;
    
30.     for (; i < size; ++i) {
    
31.       if (subNodes.get(i).getPath().equalsIgnoreCase(fileOrDir.getPath())) {
    
32.         break;
    
33.       }
    
34.     }
    
35.     if (i < size) {
    
36.       subNodes.remove(i);
    
37.     }
    
38.   }
    
39. 
    

复制代码

https://www.jianshu.com/p/853748b177bf

1. const Folder = function (name) {
   
2.   this.name = name
   
3.   this.parent = null
   
4.   this.files = []
   
5. }
   
6. 
   
7. Folder.prototype.add = function (file) {
   
8.   file.parent = this
   
9.   this.files.push(file)
   
10. }
    
11. 
    
12. Folder.prototype.scan = function () {
    
13.   console.log('开始扫描文件夹: ' + this.name)
    
14.   for (let i = 0, file, files = this.files; file = files[i++];) {
    
15.     file.scan()
    
16.   }
    
17. }
    
18. 
    
19. Folder.prototype.remove = function () {
    
20.   if (!this.parent) {
    
21.     return
    
22.   }
    
23.   for (let files = this.parent.files, len = files.length - 1; len >= 0; len--) {
    
24.     let file = files[len]
    
25.     if (file === this) {
    
26.       files.splice(len, 1)
    
27.     }
    
28.   }
    
29. }
    
30. 
    
31. const File = function (name) {
    
32.   this.name = name
    
33.   this.parent = null
    
34. }
    
35. 
    
36. File.prototype.add = function () {
    
37.   throw new Error('文件下面不能再添加文件')
    
38. }
    
39. 
    
40. File.prototype.remove = function () {
    
41.   if (!this.parent) {
    
42.     return
    
43.   }
    
44.   for (let files = this.parent.files, len = files.length - 1; len >= 0; len--) {
    
45.     let file = files[len]
    
46.     if (file === this) {
    
47.       files.splice(len, 1)
    
48.     }
    
49.   }
    
50. }
    
51. 
    
52. File.prototype.scan = function () {
    
53.   console.log('开始扫描文件: ' + this.name)
    
54. }
    

复制代码