(root drive_util.EntryTreeNode)
| 13 | } |
| 14 | |
| 15 | func convertEntryTreeNode(root drive_util.EntryTreeNode) entryTreeNode { |
| 16 | var children []entryTreeNode |
| 17 | if root.Children != nil { |
| 18 | children = make([]entryTreeNode, 0, len(root.Children)) |
| 19 | for _, e := range root.Children { |
| 20 | children = append(children, convertEntryTreeNode(e)) |
| 21 | } |
| 22 | } |
| 23 | return entryTreeNode{NewEntry(root.Entry), children, root.Excluded} |
| 24 | } |
| 25 | |
| 26 | func flattenEntriesTree(root entryTreeNode, result []entryTreeNode, deepFirst bool) []entryTreeNode { |
| 27 | if !deepFirst && !root.Excluded { |
no test coverage detected