Skip to content

Commit 9dfd15c

Browse files
cuinixthomas-nguy
andauthored
chore: fix some typos (#1802)
Signed-off-by: cuinix <[email protected]> Co-authored-by: Thomas N. <[email protected]>
1 parent 842c681 commit 9dfd15c

File tree

3 files changed

+4
-4
lines changed

3 files changed

+4
-4
lines changed

docs/gravity-bridge/dev-setup-guide.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -118,7 +118,7 @@ message DelegateKeysSignMsg {
118118
}
119119
```
120120

121-
Use your favorite protobuf library to encode the message, and use your favorite web3 library to do the messge signing,
121+
Use your favorite protobuf library to encode the message, and use your favorite web3 library to do the message signing,
122122
for example, this is how it could be done in python:
123123

124124
```python

memiavl/snapshot.go

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -67,7 +67,7 @@ func OpenSnapshot(snapshotDir string) (snapshot *Snapshot, err error) {
6767
return nil, err
6868
}
6969
if len(bz) != SizeMetadata {
70-
return nil, fmt.Errorf("wrong metadata file size, expcted: %d, found: %d", SizeMetadata, len(bz))
70+
return nil, fmt.Errorf("wrong metadata file size, expected: %d, found: %d", SizeMetadata, len(bz))
7171
}
7272

7373
magic := binary.LittleEndian.Uint32(bz)

versiondb/extsort/sort.go

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,4 @@
1-
// Package extsort implements external sorting algorithm, it has several differnet design choices compared with alternatives like https://github.com/lanrat/extsort:
1+
// Package extsort implements external sorting algorithm, it has several different design choices compared with alternatives like https://github.com/lanrat/extsort:
22
// - apply efficient compressions(delta encoding + snappy) to the chunk files to reduce IO cost,
33
// since the items are sorted, delta encoding should be effective to it, and snappy is pretty efficient.
44
// - chunks are stored in separate temporary files, so the chunk sorting and saving can run in parallel (eats more ram though).
@@ -25,7 +25,7 @@ type Options struct {
2525
DeltaEncoding bool
2626
// if apply snappy compression to the items in sorted chunk
2727
SnappyCompression bool
28-
// Maxiumum uncompressed size of the sorted chunk
28+
// Maximum uncompressed size of the sorted chunk
2929
MaxChunkSize int64
3030
// function that compares two items
3131
LesserFunc LesserFunc

0 commit comments

Comments
 (0)