Add `value` to sorted set. Runtime complexity: `O(log(n))` -- approximate. >>> ss = SortedSet() >>> ss.add(3) >>> ss.add(1) >>> ss.add(2) >>> ss SortedSet([1, 2, 3]) :param value: value to add to sorted set
(self, value)
| 339 | |
| 340 | |
| 341 | def add(self, value): |
| 342 | """Add `value` to sorted set. |
| 343 | |
| 344 | Runtime complexity: `O(log(n))` -- approximate. |
| 345 | |
| 346 | >>> ss = SortedSet() |
| 347 | >>> ss.add(3) |
| 348 | >>> ss.add(1) |
| 349 | >>> ss.add(2) |
| 350 | >>> ss |
| 351 | SortedSet([1, 2, 3]) |
| 352 | |
| 353 | :param value: value to add to sorted set |
| 354 | |
| 355 | """ |
| 356 | _set = self._set |
| 357 | if value not in _set: |
| 358 | _set.add(value) |
| 359 | self._list.add(value) |
| 360 | |
| 361 | _add = add |
| 362 |
no outgoing calls