binaryninja.queue.deque

class deque

deque([iterable[, maxlen]]) –> deque object

A list-like sequence optimized for data accesses near its endpoints.

__init__(*args, **kwargs)

Initialize self. See help(type(self)) for accurate signature.

Methods

__init__(*args, **kwargs)

Initialize self.

append

Add an element to the right side of the deque.

appendleft

Add an element to the left side of the deque.

clear

Remove all elements from the deque.

copy

Return a shallow copy of a deque.

count(value)

extend

Extend the right side of the deque with elements from the iterable

extendleft

Extend the left side of the deque with elements from the iterable

index(value, [start, [stop]])

Raises ValueError if the value is not present.

insert

D.insert(index, object) – insert object before index

pop

Remove and return the rightmost element.

popleft

Remove and return the leftmost element.

remove

D.remove(value) – remove first occurrence of value.

reverse

D.reverse() – reverse IN PLACE

rotate

Rotate the deque n steps to the right (default n=1).

Attributes

maxlen

maximum size of a deque or None if unbounded