-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathutil.go
More file actions
97 lines (86 loc) · 1.92 KB
/
Copy pathutil.go
File metadata and controls
97 lines (86 loc) · 1.92 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
package gcsfs
import (
"errors"
"io/fs"
"path"
"strings"
"cloud.google.com/go/storage"
)
func isNotExist(err error) bool {
if errors.Is(err, fs.ErrNotExist) {
return true
}
var pathErr *fs.PathError
return errors.As(err, &pathErr) && pathErr.Err == fs.ErrNotExist
}
func isObjectNotExist(err error) bool {
return errors.Is(err, storage.ErrObjectNotExist)
}
func toPathError(err error, op, name string) error {
if err == nil {
return nil
}
if isObjectNotExist(err) {
err = fs.ErrNotExist
}
return &fs.PathError{Op: op, Path: name, Err: err}
}
func toObjectNotExistIfNoExist(err error) error {
if err == nil {
return nil
}
if isNotExist(err) {
return storage.ErrObjectNotExist
}
return err
}
func normalizePrefix(prefix string) string {
prefix = path.Clean(prefix)
if prefix == "." || prefix == "/" {
return ""
}
if prefix != "" && !strings.HasSuffix(prefix, "/") {
prefix = prefix + "/"
}
return prefix
}
func normalizePrefixPattern(prefix, pattern string) string {
prefix = normalizePrefix(prefix)
LOOP:
for i, c := range pattern {
switch c {
case '*', '?', '[', '\\':
pattern = pattern[:i]
break LOOP
}
}
joined := path.Join(prefix, pattern)
if strings.HasSuffix(pattern, "/") || (joined != "" && pattern == "") {
return joined + "/"
}
return joined
}
func newQuery(delim, prefix, offset string) *storage.Query {
query := &storage.Query{
Delimiter: delim,
Prefix: prefix,
StartOffset: offset,
IncludeTrailingDelimiter: delim == "/",
}
_ = query.SetAttrSelection([]string{"Prefix", "Name", "Size", "Updated"})
return query
}
func contains(keys []string, key string) bool {
for _, k := range keys {
if k == key {
return true
}
}
return false
}
func appendIfMatch(keys []string, key, pattern string) []string {
if ok, _ := path.Match(pattern, key); ok && !contains(keys, key) {
keys = append(keys, key)
}
return keys
}