From b8bfa474b3084aee8e0949ef32cdba127889b3eb Mon Sep 17 00:00:00 2001 From: suiyuan1314 Date: Tue, 4 Jun 2024 16:10:10 +0800 Subject: [PATCH] fix function name --- share/eds/store.go | 2 +- share/eds/store_test.go | 2 +- share/getters/cascade.go | 2 +- 3 files changed, 3 insertions(+), 3 deletions(-) diff --git a/share/eds/store.go b/share/eds/store.go index 249555d69e..aa2ee6ae99 100644 --- a/share/eds/store.go +++ b/share/eds/store.go @@ -307,7 +307,7 @@ func (s *Store) put(ctx context.Context, root share.DataHash, square *rsmt2d.Ext return nil } -// waitForResult waits for a result from the res channel for a maximum duration specified by +// trackLateResult waits for a result from the res channel for a maximum duration specified by // maxWait. If the result is not received within the specified duration, it logs an error // indicating that the parent context has expired and the shard registration is stuck. If a result // is received, it checks for any error and logs appropriate messages. diff --git a/share/eds/store_test.go b/share/eds/store_test.go index 6bc6972bb4..e20e777598 100644 --- a/share/eds/store_test.go +++ b/share/eds/store_test.go @@ -382,7 +382,7 @@ func Test_CachedAccessor(t *testing.T) { require.Equal(t, firstBlock, secondBlock) } -// Test_CachedAccessor verifies that the reader represented by a accessor obtained directly from +// Test_NotCachedAccessor verifies that the reader represented by a accessor obtained directly from // dagstore can be read from multiple times, without exhausting the underlying reader. func Test_NotCachedAccessor(t *testing.T) { ctx, cancel := context.WithCancel(context.Background()) diff --git a/share/getters/cascade.go b/share/getters/cascade.go index 3875127580..0b6abe229b 100644 --- a/share/getters/cascade.go +++ b/share/getters/cascade.go @@ -88,7 +88,7 @@ func (cg *CascadeGetter) GetSharesByNamespace( return cascadeGetters(ctx, cg.getters, get) } -// cascade implements a cascading retry algorithm for getting a value from multiple sources. +// cascadeGetters implements a cascading retry algorithm for getting a value from multiple sources. // Cascading implies trying the sources one-by-one in the given order with the // given interval until either: // - One of the sources returns the value