fork of indigo with slightly nicer lexgen

codespell cleanup

Changed files
+11 -11
api
docs
indexer
lex
mst
repo
server
+2 -2
api/cbor_gen.go
··· 792 case cbg.MajNegativeInt: 793 extraI = int64(extra) 794 if extraI < 0 { 795 - return fmt.Errorf("int64 negative oveflow") 796 } 797 extraI = -1 - extraI 798 default: ··· 818 case cbg.MajNegativeInt: 819 extraI = int64(extra) 820 if extraI < 0 { 821 - return fmt.Errorf("int64 negative oveflow") 822 } 823 extraI = -1 - extraI 824 default:
··· 792 case cbg.MajNegativeInt: 793 extraI = int64(extra) 794 if extraI < 0 { 795 + return fmt.Errorf("int64 negative overflow") 796 } 797 extraI = -1 - extraI 798 default: ··· 818 case cbg.MajNegativeInt: 819 extraI = int64(extra) 820 if extraI < 0 { 821 + return fmt.Errorf("int64 negative overflow") 822 } 823 extraI = -1 - extraI 824 default:
+1 -1
docs/feed-proposal.md
··· 4 5 ## Motivation 6 The interface for requesting and getting back feeds is something that I feel is really at the core of what bluesky offers. The user should be able to choose what feeds they subscribe to, feeds should be first class objects, they should be able to be efficiently generated and consumed, and they should be able to trustlessly come from anywhere. 7 - Theres a lot of changes we *could* make to the current structure, but I don't want to stray too far from where we are at right now. 8 9 10 ```go
··· 4 5 ## Motivation 6 The interface for requesting and getting back feeds is something that I feel is really at the core of what bluesky offers. The user should be able to choose what feeds they subscribe to, feeds should be first class objects, they should be able to be efficiently generated and consumed, and they should be able to trustlessly come from anywhere. 7 + There are a lot of changes we *could* make to the current structure, but I don't want to stray too far from where we are at right now. 8 9 10 ```go
+1 -1
indexer/indexer.go
··· 307 if post.Reply != nil { 308 replyto, err := ix.GetPost(ctx, post.Reply.Parent.Uri) 309 if err != nil { 310 - log.Error("probably shouldnt error when processing a reply to a not-found post") 311 return err 312 } 313
··· 307 if post.Reply != nil { 308 replyto, err := ix.GetPost(ctx, post.Reply.Parent.Uri) 309 if err != nil { 310 + log.Error("probably shouldn't error when processing a reply to a not-found post") 311 return err 312 } 313
+2 -2
lex/gen.go
··· 555 556 main, ok := s.Defs["main"] 557 if !ok { 558 - return fmt.Errorf("schema %q doesnt have a main def", s.ID) 559 } 560 561 if main.Type == "procedure" || main.Type == "query" { ··· 642 643 main, ok := s.Defs["main"] 644 if !ok { 645 - return fmt.Errorf("schema %q doesnt have a main def", s.ID) 646 } 647 648 if main.Type == "procedure" || main.Type == "query" {
··· 555 556 main, ok := s.Defs["main"] 557 if !ok { 558 + return fmt.Errorf("schema %q doesn't have a main def", s.ID) 559 } 560 561 if main.Type == "procedure" || main.Type == "query" { ··· 642 643 main, ok := s.Defs["main"] 644 if !ok { 645 + return fmt.Errorf("schema %q doesn't have a main def", s.ID) 646 } 647 648 if main.Type == "procedure" || main.Type == "query" {
+1 -1
mst/cbor_gen.go
··· 344 case cbg.MajNegativeInt: 345 extraI = int64(extra) 346 if extraI < 0 { 347 - return fmt.Errorf("int64 negative oveflow") 348 } 349 extraI = -1 - extraI 350 default:
··· 344 case cbg.MajNegativeInt: 345 extraI = int64(extra) 346 if extraI < 0 { 347 + return fmt.Errorf("int64 negative overflow") 348 } 349 extraI = -1 - extraI 350 default:
+1 -1
mst/diff.go
··· 26 } 27 } 28 29 - // TODO: this code isnt great, should be rewritten on top of the baseline datastructures once functional and correct 30 func DiffTrees(ctx context.Context, bs blockstore.Blockstore, from, to cid.Cid) ([]*DiffOp, error) { 31 cst := cbor.NewCborStore(bs) 32
··· 26 } 27 } 28 29 + // TODO: this code isn't great, should be rewritten on top of the baseline datastructures once functional and correct 30 func DiffTrees(ctx context.Context, bs blockstore.Blockstore, from, to cid.Cid) ([]*DiffOp, error) { 31 cst := cbor.NewCborStore(bs) 32
+1 -1
mst/mst.go
··· 483 func checkTreeInvariant(ents []NodeEntry) { 484 for i := 0; i < len(ents)-1; i++ { 485 if ents[i].isTree() && ents[i+1].isTree() { 486 - panic(fmt.Sprintf("two trees next to eachother! %d %d", i, i+1)) 487 } 488 } 489 }
··· 483 func checkTreeInvariant(ents []NodeEntry) { 484 for i := 0; i < len(ents)-1; i++ { 485 if ents[i].isTree() && ents[i+1].isTree() { 486 + panic(fmt.Sprintf("two trees next to each other! %d %d", i, i+1)) 487 } 488 } 489 }
+1 -1
repo/cbor_gen.go
··· 303 case cbg.MajNegativeInt: 304 extraI = int64(extra) 305 if extraI < 0 { 306 - return fmt.Errorf("int64 negative oveflow") 307 } 308 extraI = -1 - extraI 309 default:
··· 303 case cbg.MajNegativeInt: 304 extraI = int64(extra) 305 if extraI < 0 { 306 + return fmt.Errorf("int64 negative overflow") 307 } 308 extraI = -1 - extraI 309 default:
+1 -1
server/auth.go
··· 54 accessTok := makeToken(otherpds, "com.atproto.federation", time.Now().Add(24*time.Hour)) 55 56 // setting this is a little weird, 57 - // since the token isnt signed by this key, we dont have a way to validate... 58 accessTok.Set("pds", s.signingKey.DID()) 59 60 rval := make([]byte, 10)
··· 54 accessTok := makeToken(otherpds, "com.atproto.federation", time.Now().Add(24*time.Hour)) 55 56 // setting this is a little weird, 57 + // since the token isn't signed by this key, we dont have a way to validate... 58 accessTok.Set("pds", s.signingKey.DID()) 59 60 rval := make([]byte, 10)