mirror of
https://github.com/strongdm/comply
synced 2024-11-24 16:44:53 +00:00
30 lines
520 B
Go
30 lines
520 B
Go
|
package cli
|
||
|
|
|
||
|
|
import "unicode"
|
||
|
|
|
||
|
|
// lexicographicLess compares strings alphabetically considering case.
|
||
|
|
func lexicographicLess(i, j string) bool {
|
||
|
|
iRunes := []rune(i)
|
||
|
|
jRunes := []rune(j)
|
||
|
|
|
||
|
|
lenShared := len(iRunes)
|
||
|
|
if lenShared > len(jRunes) {
|
||
|
|
lenShared = len(jRunes)
|
||
|
|
}
|
||
|
|
|
||
|
|
for index := 0; index < lenShared; index++ {
|
||
|
|
ir := iRunes[index]
|
||
|
|
jr := jRunes[index]
|
||
|
|
|
||
|
|
if lir, ljr := unicode.ToLower(ir), unicode.ToLower(jr); lir != ljr {
|
||
|
|
return lir < ljr
|
||
|
|
}
|
||
|
|
|
||
|
|
if ir != jr {
|
||
|
|
return ir < jr
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
return i < j
|
||
|
|
}
|