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

2016-10-07 17:28:58

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.count() count(x) Count the number of deque elements equal to x. New in version 3.2.

collections.deque.pop() pop() Remove and return an element from the right side of the deque. If no elements are present, raises an IndexError.

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