// Less return true if the entry has smaller priority
Less return true if the entry has smaller priority
// Less return true if the entry has smaller priority
func (r *Entry) Less(other btree.Item) bool {
	left := r.Priority
	right := other.(*Entry).Priority
	return left > right
}
func ( r * Entry ) Less ( other btree . Item ) bool { left := r . Priority right := other . ( * Entry ) . Priority return left > right }
Less return true if the entry has smaller priority
Less return true if the entry has smaller priority