Trees | Index | Help |
|
---|
Module __builtin__ :: Class list |
|
object
--+
|
list
RelationshipMap
Method Summary | |
---|---|
x.__init__(...) initializes x; see x.__class__.__doc__ for signature | |
x.__add__(y) <==> x+y | |
x.__contains__(y) <==> y in x | |
x.__delitem__(y) <==> del x[y] | |
Use of negative indices is not supported. | |
x.__eq__(y) <==> x==y | |
x.__ge__(y) <==> x>=y | |
x.__getattribute__('name') <==> x.name | |
x.__getitem__(y) <==> x[y] | |
Use of negative indices is not supported. | |
x.__gt__(y) <==> x>y | |
x.__hash__() <==> hash(x) | |
x.__iadd__(y) <==> x+=y | |
x.__imul__(y) <==> x*=y | |
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 | |
x.__repr__() <==> repr(x) | |
L.__reversed__() -- return a reverse iterator over the list | |
x.__rmul__(n) <==> n*x | |
x.__setitem__(i, y) <==> x[i]=y | |
Use of negative indices is not supported. | |
L.append(object) -- append object to end | |
L.count(value) -> integer -- return number of occurrences of value | |
L.extend(iterable) -- extend list by appending elements from the iterable | |
L.index(value, [start, [stop]]) -> integer -- return first index of value | |
L.insert(index, object) -- insert object before index | |
L.pop([index]) -> item -- remove and return item at index (default last) | |
L.remove(value) -- remove first occurrence of value | |
L.reverse() -- reverse *IN PLACE* | |
L.sort(cmp=None, key=None, reverse=False) -- stable sort *IN PLACE*; cmp(x, y) -> -1, 0, 1 | |
Inherited from object :
__delattr__ ,
__reduce__ ,
__reduce_ex__ ,
__setattr__ ,
__str__
|
Method Details |
---|
__init__(...)
x.__init__(...) initializes x; see x.__class__.__doc__ for
signature
|
__add__(x,
y)
x.__add__(y) <==> x+y
|
__contains__(x,
y)
x.__contains__(y) <==> y in x
|
__delitem__(x,
y)
x.__delitem__(y) <==> del x[y]
|
__delslice__(x,
i,
j)
Use of negative indices is not supported.
|
__eq__(x,
y)
x.__eq__(y) <==> x==y
|
__ge__(x,
y)
x.__ge__(y) <==> x>=y
|
__getattribute__(...)x.__getattribute__('name') <==> x.name
|
__getitem__(x,
y)
x.__getitem__(y) <==> x[y]
|
__getslice__(x,
i,
j)
Use of negative indices is not supported.
|
__gt__(x,
y)
x.__gt__(y) <==> x>y
|
__hash__(x)
x.__hash__() <==> hash(x)
|
__iadd__(x, y)x.__iadd__(y) <==> x+=y
|
__imul__(x, y)x.__imul__(y) <==> x*=y
|
__iter__(x)x.__iter__() <==> iter(x)
|
__le__(x,
y)
x.__le__(y) <==> x<=y
|
__len__(x)
x.__len__() <==> len(x)
|
__lt__(x,
y)
x.__lt__(y) <==> x<y
|
__mul__(x, n)x.__mul__(n) <==> x*n
|
__ne__(x, y)x.__ne__(y) <==> x!=y
|
__new__(T, S, ...)T.__new__(S, ...) -> a new object with type S, a subtype of T
|
__repr__(x)
x.__repr__() <==> repr(x)
|
__reversed__(...)L.__reversed__() -- return a reverse iterator over the list |
__rmul__(x, n)x.__rmul__(n) <==> n*x
|
__setitem__(x,
i,
y)
x.__setitem__(i, y) <==> x[i]=y
|
__setslice__(x,
i,
j,
y)
Use of negative indices is not supported.
|
append(...)L.append(object) -- append object to end |
count(L, value)L.count(value) -> integer -- return number of occurrences of value
|
extend(...)L.extend(iterable) -- extend list by appending elements from the iterable |
index(...)L.index(value, [start, [stop]]) -> integer -- return first index of value |
insert(...)L.insert(index, object) -- insert object before index |
pop(L, index=...)L.pop([index]) -> item -- remove and return item at index (default last)
|
remove(...)L.remove(value) -- remove first occurrence of value |
reverse(...)L.reverse() -- reverse *IN PLACE* |
sort(...)L.sort(cmp=None, key=None, reverse=False) -- stable sort *IN PLACE*; cmp(x, y) -> -1, 0, 1 |
Trees | Index | Help |
|
---|
Generated by Epydoc 2.1 on Thu Aug 16 09:55:16 2007 | http://epydoc.sf.net |