func (r *SortedBytesSet) Put(k []byte) (already bool) {
	r.root, already = r.put(r.root, k)
	return
}
Put the key `k` in the sorted set. If the value was already there,
true is returned.
package codegen
import "bytes"
func (r SortedBytesSet) compare(a, b []byte) int { return bytes.Compare(a, b) }
type SortedBytesSet struct {
	root *nodeBytes
}
func NewSortedBytesSet() *SortedBytesSet { return &SortedBytesSet{} }
func (r SortedBytesSet) IsEmpty() bool {
	return r.root == nil
}
func (r SortedBytesSet) Size() int { return r.root.size() }
func (r *SortedBytesSet) Clear() { r.root = nil }