MCPcopy Index your code
hub / github.com/TheAlgorithms/Python / extendleft

Method extendleft

data_structures/queues/double_ended_queue.py:212–239  ·  view source on GitHub ↗

Appends every value of iterable to the beginning of the deque. Time complexity: O(n) >>> our_deque_1 = Deque([1, 2, 3]) >>> our_deque_1.extendleft([0, -1]) >>> our_deque_1 [-1, 0, 1, 2, 3] >>> our_deque_2 = Deque('cd') >>> our_deque_2.

(self, iterable: Iterable[Any])

Source from the content-addressed store, hash-verified

210 self.append(val)
211
212 def extendleft(self, iterable: Iterable[Any]) -> None:
213 """
214 Appends every value of iterable to the beginning of the deque.
215 Time complexity: O(n)
216 >>> our_deque_1 = Deque([1, 2, 3])
217 >>> our_deque_1.extendleft([0, -1])
218 >>> our_deque_1
219 [-1, 0, 1, 2, 3]
220 >>> our_deque_2 = Deque('cd')
221 >>> our_deque_2.extendleft('ba')
222 >>> our_deque_2
223 ['a', 'b', 'c', 'd']
224 >>> from collections import deque
225 >>> deque_collections_1 = deque([1, 2, 3])
226 >>> deque_collections_1.extendleft([0, -1])
227 >>> deque_collections_1
228 deque([-1, 0, 1, 2, 3])
229 >>> deque_collections_2 = deque('cd')
230 >>> deque_collections_2.extendleft('ba')
231 >>> deque_collections_2
232 deque(['a', 'b', 'c', 'd'])
233 >>> list(our_deque_1) == list(deque_collections_1)
234 True
235 >>> list(our_deque_2) == list(deque_collections_2)
236 True
237 """
238 for val in iterable:
239 self.appendleft(val)
240
241 def pop(self) -> Any:
242 """

Callers

nothing calls this directly

Calls 1

appendleftMethod · 0.95

Tested by

no test coverage detected