+1
.gitignore
+1
.gitignore
+17
.golangci.yaml
+17
.golangci.yaml
···
···
1
+
version: "2"
2
+
3
+
issues:
4
+
max-issues-per-linter: 0
5
+
max-same-issues: 0
6
+
7
+
linters:
8
+
disable:
9
+
- errcheck
10
+
- gocritic
11
+
- unused
12
+
settings:
13
+
errcheck:
14
+
check-type-assertions: true
15
+
disable-default-exclusions: true
16
+
gocritic:
17
+
enable-all: true
-5
atproto/identity/apidir/apidir.go
-5
atproto/identity/apidir/apidir.go
+1
-1
atproto/identity/directory.go
+1
-1
atproto/identity/directory.go
+3
atproto/lexicon/cmd/lextool/net.go
+3
atproto/lexicon/cmd/lextool/net.go
+1
-2
atproto/repo/mst/mst_interop_test.go
+1
-2
atproto/repo/mst/mst_interop_test.go
+1
-1
atproto/repo/mst/mst_test.go
+1
-1
atproto/repo/mst/mst_test.go
+1
-1
atproto/repo/mst/node.go
+1
-1
atproto/repo/mst/node.go
+4
-1
atproto/repo/mst/node_insert.go
+4
-1
atproto/repo/mst/node_insert.go
···
1
package mst
2
3
import (
4
+
"errors"
5
"fmt"
6
"slices"
7
···
67
}
68
69
// include "covering" proof for this operation
70
+
if err := proveMutation(n, key); err != nil && !errors.Is(err, ErrPartialTree) {
71
+
return nil, nil, err
72
+
}
73
74
if !split {
75
// TODO: is this really necessary? or can we just slices.Insert beyond the end of a slice?
+4
-1
atproto/repo/mst/node_remove.go
+4
-1
atproto/repo/mst/node_remove.go
···
1
package mst
2
3
import (
4
+
"errors"
5
"fmt"
6
"slices"
7
···
62
}
63
64
// marks adjacent child nodes dirty to include as "proof"
65
+
if err := proveMutation(n, key); err != nil && !errors.Is(err, ErrPartialTree) {
66
+
return nil, nil, err
67
+
}
68
69
// check if top of node is now just a pointer
70
if top {
+1
-1
atproto/repo/operation.go
+1
-1
atproto/repo/operation.go
+3
-2
atproto/repo/operation_test.go
+3
-2
atproto/repo/operation_test.go
···
91
assert.NoError(err)
92
assert.Error(CheckOp(tree, op))
93
94
-
op, err = ApplyOp(tree, "color/pink", &c3)
95
assert.NoError(err)
96
op, err = ApplyOp(tree, "color/pink", &c2)
97
assert.NoError(CheckOp(tree, op))
98
assert.True(op.IsUpdate())
99
err = InvertOp(tree, op)
···
130
}
131
mapKeys := make([]string, len(startMap))
132
i := 0
133
-
for k, _ := range startMap {
134
mapKeys[i] = k
135
i++
136
}
···
91
assert.NoError(err)
92
assert.Error(CheckOp(tree, op))
93
94
+
_, err = ApplyOp(tree, "color/pink", &c3)
95
assert.NoError(err)
96
op, err = ApplyOp(tree, "color/pink", &c2)
97
+
assert.NoError(err)
98
assert.NoError(CheckOp(tree, op))
99
assert.True(op.IsUpdate())
100
err = InvertOp(tree, op)
···
131
}
132
mapKeys := make([]string, len(startMap))
133
i := 0
134
+
for k := range startMap {
135
mapKeys[i] = k
136
i++
137
}
-1
atproto/syntax/did.go
-1
atproto/syntax/did.go
+1
-1
atproto/syntax/tid.go
+1
-1
atproto/syntax/tid.go