if str1 == str2 {
str1 = str2 // give up str2's underlying bytes memory block
}
func CanonicalizeStrings(ss []string) {
type S struct {
str string
index int
}
var temp = make([]S, len(ss))
for i := range temp {
temp[i] = S {
str: ss[i],
index: i,
}
}
for i := 0; i < len(temp); {
var k = i+1
for j := k; j < len(temp); j++ {
if temp[j].str == temp[i].str {
temp[j].str = temp[i].str
temp[k], temp[j] = temp[j], temp[k]
k++
}
}
i = k
}
for i := range temp {
ss[temp[i].index] = temp[i].str
}
}
unique.Handle
unique.Handle
is a convenient way to canonicalize strings.
import "unique"
func CanonicalizeString(s string) string {
return unique.Make(s).Value()
}
func CanonicalizeStrings(ss []string) {
for i, s := range ss {
ss[i] = CanonicalizeString(s)
}
}
CanonicalizeString
function for every string used at run time, then all equal strings will share the same underlying bytes memory blocks.
unique.Make
way is not always suitable for every situation. The unique.Make
function will allocate a backing bytes memory blcok for each distinct string. So if some unequal strings to be canonicalized share the same backing bytes memory block, the unique.Make
function will allocate a new backing byte sequence memory block for each of the strings. Doing this actually allocates more memory (than using a single memory block).
The Go 101 project is hosted on Github. Welcome to improve Go 101 articles by submitting corrections for all kinds of mistakes, such as typos, grammar errors, wording inaccuracies, description flaws, code bugs and broken links.
If you would like to learn some Go details and facts every serveral days, please follow Go 101's official Twitter account @zigo_101.