code: func (self *tree) Set(key string, value interface{}) Map {
  	hash := hashKey(key)
  	return setLowLevel(self, hash, hash, key, value)
  }
docs: // Set returns a new map similar to this one but with key and value
  // associated.  If the key didn't exist, it's created; otherwise, the
  // associated value is changed.