class NodeList

def __add__(self, value)

Return self+value.

def __class_getitem__(self)

See PEP 585

def __contains__(self, key)

Return key in self.

def __delitem__(self, key)

Delete self[key].

def __eq__(self, value)

Return self==value.

def __ge__(self, value)

Return self>=value.

def __getattribute__(self, name)

Return getattr(self, name).

def __getitem__(self)

x.__getitem__(y) <==> x[y]

def __gt__(self, value)

Return self>value.

def __iadd__(self, value)

Implement self+=value.

def __imul__(self, value)

Implement self*=value.

def __init__(self, *args, **kwargs)

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

def __iter__(self)

Implement iter(self).

def __le__(self, value)

Return self<=value.

def __len__(self)

Return len(self).

def __lt__(self, value)

Return self<value.

def __mul__(self, value)

Return self*value.

def __ne__(self, value)

Return self!=value.

def __new__(type, *args, **kwargs)

Create and return a new object.  See help(type) for accurate signature.

def __repr__(self)

Return repr(self).

def __reversed__(self)

Return a reverse iterator over the list.

def __rmul__(self, value)

Return value*self.

def __setitem__(self, key, value)

Set self[key] to value.

def __sizeof__(self)

Return the size of the list in memory, in bytes.

def append(self, object)

Append object to the end of the list.

def clear(self)

Remove all items from list.

def copy(self)

Return a shallow copy of the list.

def count(self, value)

Return number of occurrences of value.

def extend(self, iterable)

Extend list by appending elements from the iterable.

def get_nodes_by_type(self, nodetype)

Return a list of all nodes of the given type

    def get_nodes_by_type(self, nodetype):
        "Return a list of all nodes of the given type"
        nodes = []
        for node in self:
            nodes.extend(node.get_nodes_by_type(nodetype))
        return nodes

def index(self, value, start=0, stop=9223372036854775807)

Return first index of value.

Raises ValueError if the value is not present.

def insert(self, index, object)

Insert object before index.

def pop(self, index=-1)

Remove and return item at index (default last).

Raises IndexError if list is empty or index is out of range.

def remove(self, value)

Remove first occurrence of value.

Raises ValueError if the value is not present.

def render(self, context)

    def render(self, context):
        return SafeString("".join([node.render_annotated(context) for node in self]))

def reverse(self)

Reverse *IN PLACE*.

def sort(self)

Sort the list in ascending order and return None.

The sort is in-place (i.e. the list itself is modified) and stable (i.e. the
order of two equal elements is maintained).

If a key function is given, apply it once to each list item and sort them,
ascending or descending, according to their function values.

The reverse flag can be set to sort in descending order.