Docs for cache

x.__add__(y) <==> x+y

tuple() -> empty tuple tuple(iterable) -> tuple initialized from iterable's items

If the argument is a tuple, the return value is the same object.

x.__contains__(y) <==> y in x

x.__delattr__('name') <==> del x.name

str(object='') -> string

Return a nice string representation of the object. If the argument is a string, the return value is the same object.

x.__eq__(y) <==> x==y

default object formatter

x.__ge__(y) <==> x>=y

x.__getattribute__('name') <==> x.name

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

x.__getslice__(i, j) <==> x[i:j]

Use of negative indices is not supported.

x.__gt__(y) <==> x>y

x.__hash__() <==> hash(x)

x.__init__(...) initializes x; see help(type(x)) for signature

x.__iter__() <==> iter(x)

x.__le__(y) <==> x<=y

x.__len__() <==> len(x)

x.__lt__(y) <==> x<y

x.__mul__(n) <==> x*n

x.__ne__(y) <==> x!=y

T.__new__(S, ...) -> a new object with type S, a subtype of T

helper for pickle

helper for pickle

x.__repr__() <==> repr(x)

x.__rmul__(n) <==> n*x

x.__setattr__('name', value) <==> x.name = value

T.__sizeof__() -- size of T in memory, in bytes

x.__str__() <==> str(x)

Abstract classes can override this to customize issubclass().

This is invoked early on by abc.ABCMeta.__subclasscheck__(). It should return True, False or NotImplemented. If it returns NotImplemented, the normal algorithm is used. Otherwise, it overrides the normal algorithm (and the outcome is cached).

T.count(value) -> integer -- return number of occurrences of value

T.index(value, [start, [stop]]) -> integer -- return first index of value. Raises ValueError if the value is not present.