community
/
dns
3
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

moving logic from idna_table.go to punycode.go

This commit is contained in:
Rafael Dantas Justo 2015-07-15 16:28:22 -03:00
parent 340d862d2f
commit 0096e2aae0
2 changed files with 29 additions and 29 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

29
idn/idna_table.go
View File

@ -13,35 +13,6 @@ const (
// section 1
type idnaProperty int
// isValidRune checks if the character is valid. We will look for the
// character property in the IDNA table. For now we aren't checking special
// rules in case of contextual property
func isValidRune(r rune) bool {
return findProperty(r) == idnaPropertyPVALID
}
// findIDNProperty will try to check the code point property of the give
// character. It will use a binary search algorithm as we have a slice of
// ordered ranges (average case performance O(log n))
func findProperty(r rune) idnaProperty {
imin, imax := 0, len(idnaTable)
for imax >= imin {
imid := (imin + imax) / 2
codePoint := idnaTable[imid]
if (codePoint.start == r && codePoint.end == 0) || (codePoint.start <= r && codePoint.end >= r) {
return codePoint.state
} else if (codePoint.end > 0 && codePoint.end < r) || (codePoint.end == 0 && codePoint.start < r) {
imin = imid + 1
} else {
imax = imid - 1
}
}
return idnaPropertyUnknown
}
// idnaTable list all code points in Unicode Character Database (UCD) Format
// according to RFC 5892, appendix B.1. Thanks to libidn2 (GNU) -
// http://www.gnu.org/software/libidn/libidn2/

29
idn/punycode.go
View File

@ -272,3 +272,32 @@ func decode(b []byte) []byte {
}
return ret.Bytes()
}
// isValidRune checks if the character is valid. We will look for the
// character property in the IDNA table. For now we aren't checking special
// rules in case of contextual property
func isValidRune(r rune) bool {
return findProperty(r) == idnaPropertyPVALID
}
// findIDNProperty will try to check the code point property of the give
// character. It will use a binary search algorithm as we have a slice of
// ordered ranges (average case performance O(log n))
func findProperty(r rune) idnaProperty {
imin, imax := 0, len(idnaTable)
for imax >= imin {
imid := (imin + imax) / 2
codePoint := idnaTable[imid]
if (codePoint.start == r && codePoint.end == 0) || (codePoint.start <= r && codePoint.end >= r) {
return codePoint.state
} else if (codePoint.end > 0 && codePoint.end < r) || (codePoint.end == 0 && codePoint.start < r) {
imin = imid + 1
} else {
imax = imid - 1
}
}
return idnaPropertyUnknown
}