Add multiple sets and store the resulting set in a key.
437348
def sunionstore(self, destkey, key, *keys):
        """"""
        return self.execute(b'SUNIONSTORE', destkey, key, *keys)
344261
def _dict_set(self, key, val):
        '''
        
        '''
        if key != None and self.stringify_keys:
            key = str(key)
        db = self._keyed_db[self.split_func(key)]
        db._dict_set(key, val)
1297512
def add(self, key, value):
        
        if key.endswith('_'):
            key = key[:-1]
        if key in self.attributes:
            self.attributes[key] = self.attributes[key] + ' ' + value
        else:
            self.attributes[key] = value
391580
def on_set(self, key, value):
    """"""
    if self._on_set is not None:
      self._on_set(key, value)
432262
function setCardCodes(set) {
  const codeSet = new Set()
  for (const v of set) codeSet.add(cardCode(v))
  return codeSet
}
1267724
def set_many(self, block, update_dict):
        """"""
        updated_dict = {}

        # Generate a new dict with the correct mappings.
        for (key, value) in six.iteritems(update_dict):
            updated_dict[self._key(block, key)] = value

        self._kvs.set_many(updated_dict)
26379
protected function _addKey($key)
    {
        if ($key == '__stored_keys__') {
            return $this;
        }

        $keys = $this->get('__stored_keys__', []);
        if (!in_array($key, $keys)) {
            array_push($keys, $key);
        }
        $this->set('__stored_keys__', $keys, 24*60*60);
        return $this;
    }
450033
function set (data, key, value) {
  if (Object(key) === key) {
    mix(data, key);
    return;
  }

  var keys = _keys(key);
  keys && _set(data, keys, value);
}
1133611
def add_exp_key(self, key, value, ex):
        ""
        return self.c.set(key, value, ex)
573447
def add(self, key, item):
        """"""
        mmkeys = self.mmkeys
        if mmkeys is not None and not (key in self.data):
            # add abbreviations as short as minkeylength
            # always add at least one entry (even for key="")
            lenkey = len(key)
            start = min(self.minkeylength,lenkey)
            # cache references to speed up loop a bit
            mmkeysGet = mmkeys.setdefault
            for i in range(start,lenkey+1):
                mmkeysGet(key[0:i],[]).append(key)
        self.data[key] = item
694256
function add(key, value, postfix) {
  if (value > 0) {
    key.push(value + postfix);
  }

  return key;
}
495981
def set(self, key, *args):
        """"""
        return self.cache.set(self._hashed(key), *args)
1231343
public B set(String key, int value) {
        this.data.put(key, value);
        return (B) this;
    }
520802
public void addAll(IntBitSet set) {
        int i;

        if (set.data.length > data.length) {
            resize(set.data.length);
        }

        for (i = 0; i < set.data.length; i++) {
            data[i] |= set.data[i];
        }
    }
1264047
def add_set(self):
        
        self.__label_counter += 1
        new_label = self.__label_counter
        self.__forest[new_label] = -1  # All new sets have their parent set to themselves
        self.__set_counter += 1
        return new_label
188294
def add(self, key, value=None):
        
        if value is None:
            value = 2 ** (len(self))

        self[key] = value
        setattr(self, key, self[key])
        return value
1192219
public Environment add(@NonNull String key, @NonNull Object value) {
        return set(key, value);
    }