英文:
how to recursively traverse files and directories
问题
尝试运行程序时，需要显示所有的 .md 文件，我有一个名为 test 的子文件夹，其中有一个 .md 文件，但是脚本找不到它？
import (
"fmt"
"log"
"strings"
"os"
)
func main() {
dir, err := os.ReadDir(".")
if err != nil {
log.Fatal(err)
}
for _, x := range dir {
if strings.HasSuffix(x.Name(), ".md") {
fmt.Println(x.Name())
}
}
}
英文:
When trying to run the program is need to show all .md files, i have a test subfolder with a .md in it, but the scripts dose not find it?
import (
"fmt"
"log"
"strings"
"os"
)
func main() {
dir, err := os.ReadDir(".")
if err != nil {
log.Fatal(err)
}
for _, x := range dir {
if strings.HasSuffix(x.Name(), ".md") {
fmt.Println(x.Name())
}
}
}
</details>
# 答案1
**得分**: 1
你可以使用[Walkdir][1]：
```go
package main
import (
"io/fs"
"path/filepath"
)
func main() {
filepath.WalkDir(".", func(s string, d fs.DirEntry, e error) error {
if e != nil { return e }
if !d.IsDir() {
println(s)
}
return nil
})
}
英文:
You can use Walkdir:
package main
import (
"io/fs"
"path/filepath"
)
func main() {
filepath.WalkDir(".", func(s string, d fs.DirEntry, e error) error {
if e != nil { return e }
if ! d.IsDir() {
println(s)
}
return nil
})
}
答案2
得分: 0
你需要使用filepath.WalkDir来递归检查目录，或者你可以使用在1.16版本中引入的filepath.Walk。os.ReadDir只能在提供的目录内工作。
filepath.Walk(".", func(path string, info fs.FileInfo, err error) error {
if err != nil {
fmt.Printf("处理访问路径 %q 失败时防止 panic: %v\n", path, err)
return err
}
if strings.HasSuffix(info.Name(), ".md") {
fmt.Printf("访问的文件或目录：%q\n", path)
}
return nil
})
英文:
You need to use filepath.WalkDir to check directories recursively or you can use introduced in 1.16 filepath.Walk. os.ReadDir will work only within provided directory.
filepath.Walk(".", func(path string, info fs.FileInfo, err error) error {
if err != nil {
fmt.Printf("prevent panic by handling failure accessing a path %q: %v\n", path, err)
return err
}
if strings.HasSuffix(info.Name(), ".md") {
fmt.Printf("visited file or dir: %q\n", path)
}
return nil
})
答案3
得分: 0
以下是使用container/ring结构的实现代码：
type (
DirectoryGraph struct {
RootPath string
root *ring.Ring
Node *ring.Ring
}
)
func NewDirectoryGraph(root string) DirectoryGraph {
r := ring.New(1)
graph := DirectoryGraph{
RootPath: root,
root: r,
Node: r,
}
filepath.WalkDir(graph.RootPath, graph.walk)
return graph
}
func (g DirectoryGraph) walk(s string, d fs.DirEntry, e error) error {
if e != nil {
return e
}
next := ring.New(1)
node := g.serialize(s, d, e)
next.Value = node
g.root.Link(next).Next()
return nil
}
// Serializes a file-node
func (g DirectoryGraph) serialize(s string, d fs.DirEntry, e error) FileNode {
n := FileNode{
Path: s,
Dir: d,
Sys: SysInfo{},
}
...
return n
}
完整代码请参考这里。
英文:
To add onto the already sufficient responses here is my implementation using the container/ring structure
full code here
type (
DirectoryGraph struct {
RootPath string
root *ring.Ring
Node *ring.Ring
}
)
func NewDirectoryGraph(root string) DirectoryGraph {
r := ring.New(1)
graph := DirectoryGraph{
RootPath: root,
root: r,
Node: r,
}
filepath.WalkDir(graph.RootPath, graph.walk)
return graph
}
func (g DirectoryGraph) walk(s string, d fs.DirEntry, e error) error {
if e != nil {
return e
}
next := ring.New(1)
node := g.serialize(s, d, e)
next.Value = node
g.root.Link(next).Next()
return nil
}
// Serializes a file-node
func (g DirectoryGraph) serialize(s string, d fs.DirEntry, e error) FileNode {
n := FileNode{
Path: s,
Dir: d,
Sys: SysInfo{},
}
...
return n
}
通过集体智慧和协作来改善编程学习和解决问题的方式。致力于成为全球开发者共同参与的知识库，让每个人都能够通过互相帮助和分享经验来进步。
评论