Skip to content
Projects
Groups
Snippets
Help
Loading...
Help
Submit feedback
Contribute to GitLab
Sign in
Toggle navigation
G
Geth-Modification
Project
Project
Details
Activity
Releases
Cycle Analytics
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Charts
Issues
0
Issues
0
List
Board
Labels
Milestones
Merge Requests
0
Merge Requests
0
CI / CD
CI / CD
Pipelines
Jobs
Schedules
Charts
Wiki
Wiki
Snippets
Snippets
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Charts
Create a new issue
Jobs
Commits
Issue Boards
Open sidebar
张蕾
Geth-Modification
Commits
eb948962
Unverified
Commit
eb948962
authored
Jun 10, 2022
by
Gustavo Silva
Committed by
GitHub
Jun 10, 2022
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
Chore: Minimal gramatical errors (signleton -> singleton) (#25057)
core: fix typos
parent
3f5b5ec3
Changes
3
Hide whitespace changes
Inline
Side-by-side
Showing
3 changed files
with
5 additions
and
5 deletions
+5
-5
blockchain_test.go
core/blockchain_test.go
+1
-1
matcher_test.go
core/bloombits/matcher_test.go
+2
-2
bloom.go
core/state/pruner/bloom.go
+2
-2
No files found.
core/blockchain_test.go
View file @
eb948962
...
...
@@ -503,7 +503,7 @@ func TestReorgShortBlocks(t *testing.T) { testReorgShort(t, true) }
func
testReorgShort
(
t
*
testing
.
T
,
full
bool
)
{
// Create a long easy chain vs. a short heavy one. Due to difficulty adjustment
// we need a fairly long chain of blocks with different difficulties for a short
// one to become heav
y
er than a long one. The 96 is an empirical value.
// one to become heav
i
er than a long one. The 96 is an empirical value.
easy
:=
make
([]
int64
,
96
)
for
i
:=
0
;
i
<
len
(
easy
);
i
++
{
easy
[
i
]
=
60
...
...
core/bloombits/matcher_test.go
View file @
eb948962
...
...
@@ -124,13 +124,13 @@ func makeRandomIndexes(lengths []int, max int) [][]bloomIndexes {
// testMatcherDiffBatches runs the given matches test in single-delivery and also
// in batches delivery mode, verifying that all kinds of deliveries are handled
// correctly withn.
// correctly with
i
n.
func
testMatcherDiffBatches
(
t
*
testing
.
T
,
filter
[][]
bloomIndexes
,
start
,
blocks
uint64
,
intermittent
bool
,
retrievals
uint32
)
{
singleton
:=
testMatcher
(
t
,
filter
,
start
,
blocks
,
intermittent
,
retrievals
,
1
)
batched
:=
testMatcher
(
t
,
filter
,
start
,
blocks
,
intermittent
,
retrievals
,
16
)
if
singleton
!=
batched
{
t
.
Errorf
(
"filter = %v blocks = %v intermittent = %v: request count mismatch, %v in si
gn
leton vs. %v in batched mode"
,
filter
,
blocks
,
intermittent
,
singleton
,
batched
)
t
.
Errorf
(
"filter = %v blocks = %v intermittent = %v: request count mismatch, %v in si
ng
leton vs. %v in batched mode"
,
filter
,
blocks
,
intermittent
,
singleton
,
batched
)
}
}
...
...
core/state/pruner/bloom.go
View file @
eb948962
...
...
@@ -39,7 +39,7 @@ func (f stateBloomHasher) BlockSize() int { panic("not implem
func
(
f
stateBloomHasher
)
Size
()
int
{
return
8
}
func
(
f
stateBloomHasher
)
Sum64
()
uint64
{
return
binary
.
BigEndian
.
Uint64
(
f
)
}
// stateBloom is a bloom filter used during the state convesion(snapshot->state).
// stateBloom is a bloom filter used during the state conve
r
sion(snapshot->state).
// The keys of all generated entries will be recorded here so that in the pruning
// stage the entries belong to the specific version can be avoided for deletion.
//
...
...
@@ -100,7 +100,7 @@ func (bloom *stateBloom) Commit(filename, tempname string) error {
}
f
.
Close
()
// Move the teporary file into it's final location
// Move the te
m
porary file into it's final location
return
os
.
Rename
(
tempname
,
filename
)
}
...
...
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment