1. Kkey,
2. Vvalue

Associates thekey with the givenvalue.

If the key was already in the map, its associated value is changed.Otherwise the key/value pair is added to the map.

Implementation

void operator []=(K key, V value) {  // Splay on the key to move the last node on the search path for  // the key to the root of the tree.  int comparison = _splay(key);  if (comparison == 0) {    _root!.value = value;    return;  }  _addNewRoot(_SplayTreeMapNode(key, value), comparison);}