code: func (blink *blink) Get(keys ...Key) Keys {
  	found := make(Keys, 0, len(keys))
  	for _, k := range keys {
  		found = append(found, blink.get(k))
  	}
  
  	return found
  }
docs: // Get will retrieve the keys if they exist in this tree.  If not,
  // a nil is returned in the proper place in the list of keys.  Each
  // lookup is O(log n) time complexity.