mirrors/dns
1
0
Fork 0
mirror of https://github.com/miekg/dns.git synced 2025-10-13 19:01:01 +02:00
Code Issues Packages Projects Releases Wiki Activity

Small cleanups

Browse Source
This commit is contained in:
Miek Gieben 2014-09-18 09:11:16 +00:00
parent f94a958587
commit a8b5ce58e5
1 changed files with 3 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

7
idn/punycode.go
View File

@ -8,10 +8,9 @@ import (
"unicode" "unicode"
) )
// See http://tools.ietf.org/html/rfc3492
// Implementation idea from RFC itself and from from IDNA::Punycode created by // Implementation idea from RFC itself and from from IDNA::Punycode created by
// Tatsuhiko Miyagawa <miyagawa@bulknews.net> and released under Perl Artistic // Tatsuhiko Miyagawa <miyagawa@bulknews.net> and released under Perl Artistic
// License in 2002 // License in 2002.
const ( const (
_MIN rune = 1 _MIN rune = 1
@ -89,7 +88,7 @@ func lettercode(digit rune) rune {
panic("dns: not reached") panic("dns: not reached")
} }
// adapt calculates next bias to be used for next iteration delta // adapt calculates next bias to be used for next iteration delta.
func adapt(delta rune, numpoints int, firsttime bool) rune { func adapt(delta rune, numpoints int, firsttime bool) rune {
if firsttime { if firsttime {
delta /= _DAMP delta /= _DAMP
@ -108,7 +107,7 @@ func adapt(delta rune, numpoints int, firsttime bool) rune {
// next finds minimal rune (one with lowest codepoint value) that should be equal or above boundary. // next finds minimal rune (one with lowest codepoint value) that should be equal or above boundary.
func next(b []rune, boundary rune) rune { func next(b []rune, boundary rune) rune {
if len(b) == 0 { if len(b) == 0 {
panic("invalid set of runes to determine next one") panic("dns: invalid set of runes to determine next one")
} }
m := b[0] m := b[0]
for _, x := range b[1:] { for _, x := range b[1:] {