From a8b5ce58e5b2599cb0008ed30273af1eaa34def3 Mon Sep 17 00:00:00 2001 From: Miek Gieben Date: Thu, 18 Sep 2014 09:11:16 +0000 Subject: [PATCH] Small cleanups --- idn/punycode.go | 7 +++---- 1 file changed, 3 insertions(+), 4 deletions(-) diff --git a/idn/punycode.go b/idn/punycode.go index d9c9ff27..faab4027 100644 --- a/idn/punycode.go +++ b/idn/punycode.go @@ -8,10 +8,9 @@ import ( "unicode" ) -// See http://tools.ietf.org/html/rfc3492 // Implementation idea from RFC itself and from from IDNA::Punycode created by // Tatsuhiko Miyagawa and released under Perl Artistic -// License in 2002 +// License in 2002. const ( _MIN rune = 1 @@ -89,7 +88,7 @@ func lettercode(digit rune) rune { 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 { if firsttime { 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. func next(b []rune, boundary rune) rune { 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] for _, x := range b[1:] {