codespell cleanup

docs/feed-proposal.md

@@ -4,7 +4,7 @@ Some thoughts on a new format for feeds.
 
 ## Motivation
 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. 
-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.
+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.
 
 
 ```go

indexer/indexer.go

@@ -307,7 +307,7 @@ func (ix *Indexer) addNewPostNotification(ctx context.Context, post *bsky.FeedPo
 	if post.Reply != nil {
 		replyto, err := ix.GetPost(ctx, post.Reply.Parent.Uri)
 		if err != nil {
-			log.Error("probably shouldnt error when processing a reply to a not-found post")
+			log.Error("probably shouldn't error when processing a reply to a not-found post")
 			return err
 		}
 

lex/gen.go

@@ -555,7 +555,7 @@ func WriteServerHandlers(w io.Writer, schemas []*Schema, pkg string, impmap map[
 
 		main, ok := s.Defs["main"]
 		if !ok {
-			return fmt.Errorf("schema %q doesnt have a main def", s.ID)
+			return fmt.Errorf("schema %q doesn't have a main def", s.ID)
 		}
 
 		if main.Type == "procedure" || main.Type == "query" {
@@ -642,7 +642,7 @@ func WriteXrpcServer(w io.Writer, schemas []*Schema, pkg string, impmap map[stri
 
 			main, ok := s.Defs["main"]
 			if !ok {
-				return fmt.Errorf("schema %q doesnt have a main def", s.ID)
+				return fmt.Errorf("schema %q doesn't have a main def", s.ID)
 			}
 
 			if main.Type == "procedure" || main.Type == "query" {

mst/diff.go

@@ -26,7 +26,7 @@ func checkDiffSort(diffs []*DiffOp) {
 	}
 }
 
-// TODO: this code isnt great, should be rewritten on top of the baseline datastructures once functional and correct
+// TODO: this code isn't great, should be rewritten on top of the baseline datastructures once functional and correct
 func DiffTrees(ctx context.Context, bs blockstore.Blockstore, from, to cid.Cid) ([]*DiffOp, error) {
 	cst := cbor.NewCborStore(bs)
 

mst/mst.go

@@ -483,7 +483,7 @@ func (mst *MerkleSearchTree) replaceWithSplit(ctx context.Context, ix int, left
 func checkTreeInvariant(ents []NodeEntry) {
 	for i := 0; i < len(ents)-1; i++ {
 		if ents[i].isTree() && ents[i+1].isTree() {
-			panic(fmt.Sprintf("two trees next to eachother! %d %d", i, i+1))
+			panic(fmt.Sprintf("two trees next to each other! %d %d", i, i+1))
 		}
 	}
 }

server/auth.go

@@ -54,7 +54,7 @@ func (s *Server) createCrossServerAuthToken(ctx context.Context, otherpds string
 	accessTok := makeToken(otherpds, "com.atproto.federation", time.Now().Add(24*time.Hour))
 
 	// setting this is a little weird,
-	// since the token isnt signed by this key, we dont have a way to validate...
+	// since the token isn't signed by this key, we dont have a way to validate...
 	accessTok.Set("pds", s.signingKey.DID())
 
 	rval := make([]byte, 10)