Skip to content

Commit bf26ce2

Browse files
authored
fix: range over int vs 3-clause conditional (#347)
Signed-off-by: Chris Gianelloni <[email protected]>
1 parent b3cdc63 commit bf26ce2

File tree

3 files changed

+6
-6
lines changed

3 files changed

+6
-6
lines changed

internal/dns/dns.go

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -409,7 +409,7 @@ func findNameserversForDomain(
409409
}
410410

411411
// Check on-chain domains first
412-
for startLabelIdx := 0; startLabelIdx < len(queryLabels); startLabelIdx++ {
412+
for startLabelIdx := range queryLabels {
413413
lookupDomainName := strings.Join(queryLabels[startLabelIdx:], ".")
414414
// Convert to canonical form for consistency
415415
lookupDomainName = dns.CanonicalName(lookupDomainName)

internal/handshake/domain.go

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -246,7 +246,7 @@ func (t *TextDomainRecord) decode(r *BytesReader) error {
246246
return err
247247
}
248248
var size uint8
249-
for i := 0; i < int(length); i++ {
249+
for range int(length) {
250250
// Read item size
251251
if err := binary.Read(r, binary.LittleEndian, &size); err != nil {
252252
return err
@@ -297,7 +297,7 @@ func domainRecordNameDecode(r *BytesReader) (string, error) {
297297
if c > DnsMaxLabel {
298298
return "", errors.New("label too long")
299299
}
300-
for j := 0; j < int(c); j++ {
300+
for range int(c) {
301301
b, err := r.ReadByte()
302302
if err != nil {
303303
return "", err
@@ -329,7 +329,7 @@ func domainRecordNameDecode(r *BytesReader) (string, error) {
329329
data := r.OriginalBytes()
330330
r = NewBytesReader(data)
331331
// Read and discard bytes until we reach the calculated offset
332-
for j := 0; j < offset; j++ {
332+
for range offset {
333333
if _, err := r.ReadByte(); err != nil {
334334
return "", err
335335
}

internal/handshake/spv.go

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -106,7 +106,7 @@ func (p *Proof) Decode(r *bytes.Buffer) error {
106106
return err
107107
}
108108
p.Nodes = make([]ProofNode, count)
109-
for i := 0; i < int(count); i++ {
109+
for i := range int(count) {
110110
item := &ProofNode{}
111111
if hasBit(bitMap, i) {
112112
bits, bytes, err := readBitlen(r)
@@ -279,7 +279,7 @@ func (p *Proof) has(
279279
x := 0
280280
y := depth
281281
var c uint16
282-
for i := 0; i < int(tmpLen); i++ {
282+
for range int(tmpLen) {
283283
if hasBit(prefix, int(x)) != hasBit(key, int(y)) {
284284
break
285285
}

0 commit comments

Comments
 (0)