mirror/prysm-pulse
1
0
Fork 0
mirror of https://gitlab.com/pulsechaincom/prysm-pulse.git synced 2024-12-22 03:30:35 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

Simplify comparisons ​(X-Y) == 0 (#7495)

Browse Source
This commit is contained in:
terence tsao 2020-10-10 09:19:59 -07:00 committed by GitHub
parent 43765b5cb0
commit b5a913d862
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
shared/sliceutil/slice.go
View File

@ -48,7 +48,7 @@ func IntersectionUint64(s ...[]uint64) []uint64 {
for i, num := 1, len(s); i < num; i++ {
for _, k := range s[i] {
// Increment and check only if item is present in both, and no increment has happened yet.
if _, found := m[k]; found && (i-m[k]) == 0 {
if _, found := m[k]; found && i == m[k] {
m[k]++
if m[k] == num {
intersect = append(intersect, k)
@ -163,7 +163,7 @@ func IntersectionInt64(s ...[]int64) []int64 {
}
for i, num := 1, len(s); i < num; i++ {
for _, k := range s[i] {
if _, found := m[k]; found && (i-m[k]) == 0 {
if _, found := m[k]; found && i == m[k] {
m[k]++
if m[k] == num {
intersect = append(intersect, k)
@ -269,7 +269,7 @@ func IntersectionByteSlices(s ...[][]byte) [][]byte {
}
for i, num := 1, len(s); i < num; i++ {
for _, k := range s[i] {
if _, found := m[string(k)]; found && (i-m[string(k)]) == 0 {
if _, found := m[string(k)]; found && i == m[string(k)] {
m[string(k)]++
if m[string(k)] == num {
inter = append(inter, k)