| package iradix | |
| import "sort" | |
| type edges []edge | |
| func (e edges) Len() int { | |
| return len(e) | |
| } | |
| func (e edges) Less(i, j int) bool { | |
| return e[i].label < e[j].label | |
| } | |
| func (e edges) Swap(i, j int) { | |
| e[i], e[j] = e[j], e[i] | |
| } | |
| func (e edges) Sort() { | |
| sort.Sort(e) | |
| } |