Login Register

collections.deque.insert()

insert(i, x)

Insert x into the deque at position i.

If the insertion would cause a bounded deque to grow beyond maxlen, an IndexError is raised.

New in version 3.5.

Links:

https://docs.python.org/3.5/library/collections.html#collections.deque.insert

doc_python

2025-01-10 15:47:30

Comments

Leave a Comment

Please login to continue.

Popular Articles

collections.deque class collections.deque([iterable[, maxlen]]) Returns a new deque object initialized left-to-right (using append()) with data from iterable. If it

std::deque::insert (1) iterator insert( iterator pos, const T& value ); (until C++11) iterator insert( const_iterator pos, const T& value ); (since C

collections.deque.clear() clear() Remove all elements from the deque leaving it with length 0.

collections.deque.copy() copy() Create a shallow copy of the deque. New in version 3.5.

collections.deque.reverse() reverse() Reverse the elements of the deque in-place and then return None. New in version 3.2.