diff --git a/event/feed.go b/event/feed.go index d94bd820f0..6ecacf2333 100644 --- a/event/feed.go +++ b/event/feed.go @@ -220,19 +220,3 @@ func (cs caseList) deactivate(index int) caseList { cs[index], cs[last] = cs[last], cs[index] return cs[:last] } - -// func (cs caseList) String() string { -// s := "[" -// for i, cas := range cs { -// if i != 0 { -// s += ", " -// } -// switch cas.Dir { -// case reflect.SelectSend: -// s += fmt.Sprintf("%v<-", cas.Chan.Interface()) -// case reflect.SelectRecv: -// s += fmt.Sprintf("<-%v", cas.Chan.Interface()) -// } -// } -// return s + "]" -// } diff --git a/trie/iterator.go b/trie/iterator.go index 83ccc0740f..21a7e709c4 100644 --- a/trie/iterator.go +++ b/trie/iterator.go @@ -268,10 +268,11 @@ func (it *nodeIterator) NodeBlob() []byte { } func (it *nodeIterator) Error() error { - if it.err == errIteratorEnd { + if errors.Is(it.err, errIteratorEnd) { return nil } - if seek, ok := it.err.(seekError); ok { + var seek seekError + if errors.As(it.err, &seek) { return seek.err } return it.err @@ -282,10 +283,11 @@ func (it *nodeIterator) Error() error { // sets the Error field to the encountered failure. If `descend` is false, // skips iterating over any subnodes of the current node. func (it *nodeIterator) Next(descend bool) bool { - if it.err == errIteratorEnd { + if errors.Is(it.err, errIteratorEnd) { return false } - if seek, ok := it.err.(seekError); ok { + var seek seekError + if errors.As(it.err, &seek) { if it.err = it.seek(seek.key); it.err != nil { return false } @@ -307,7 +309,7 @@ func (it *nodeIterator) seek(prefix []byte) error { // Move forward until we're just before the closest match to key. for { state, parentIndex, path, err := it.peekSeek(key) - if err == errIteratorEnd { + if errors.Is(err, errIteratorEnd) { return errIteratorEnd } else if err != nil { return seekError{prefix, err}