Python List
class list(object)
list() -> new empty list
list(iterable) -> new list initialized from iterables items(Type Casting)
append(...)
L.append(object) -> None - - append object to end
clear(...)
L.clear() -> None - - remove all items from L
copy(...)
L.copy() -> list - - a shallow copy of L
count(...)
L.count(value) -> integer - - return number of occurrences of value
extend(...)
L.extend(iterable) -> None - - extend list by appending elements from the iterable
index(...)
L.index(value, [start, [stop]]) -> integer - - return first index of value.
Raises ValueError if the value is not present.
insert(...)
L.insert(index, object) - - insert object before index
pop(...)
L.pop([index]) -> item - - remove and return item at index(default last).
Raises IndexError if list is empty or index is out of range.
remove(...)
L.remove(value) -> None - - remove first occurrence of value.
Raises ValueError if the value is not present.
reverse(...)
L.reverse() - - reverse * IN PLACE*
sort(...)
L.sort(key=None, reverse=False) -> None - - stable sort * IN PLACE*
__delitem__(self, key, / )
Delete self[key]. (works like pop(index) method)
__setitem__(self, key, value, / )
Set self[key] to value.
__getitem__(...)
x.__getitem__(y) <= = > x[y]
# Other Methods:
__add__(self, value, / )
Return self + value. (works like extend ,original list unchanged)
__iadd__(self, value, / )
Implement self += value.
__mul__(self, value, / )
Return self * value.n
> l , 2, 3]
> l.__mul__(3)
[1, 2, 3, 1, 2, 3, 1, 2, 3]
__imul__(self, value, / )
Implement self *= value.
__len__(self, / )
Return len(self).
__iter__(self, / )
Implement iter(self). (convert list into iterator object)
__reversed__(...)
L.__reversed__() - - return a reverse iterator over the list
__sizeof__(...)
L.__sizeof__() - - size of L in memory, in bytes
list() -> new empty list
list(iterable) -> new list initialized from iterables items(Type Casting)
append(...)
L.append(object) -> None - - append object to end
clear(...)
L.clear() -> None - - remove all items from L
copy(...)
L.copy() -> list - - a shallow copy of L
count(...)
L.count(value) -> integer - - return number of occurrences of value
extend(...)
L.extend(iterable) -> None - - extend list by appending elements from the iterable
index(...)
L.index(value, [start, [stop]]) -> integer - - return first index of value.
Raises ValueError if the value is not present.
insert(...)
L.insert(index, object) - - insert object before index
pop(...)
L.pop([index]) -> item - - remove and return item at index(default last).
Raises IndexError if list is empty or index is out of range.
remove(...)
L.remove(value) -> None - - remove first occurrence of value.
Raises ValueError if the value is not present.
reverse(...)
L.reverse() - - reverse * IN PLACE*
sort(...)
L.sort(key=None, reverse=False) -> None - - stable sort * IN PLACE*
__delitem__(self, key, / )
Delete self[key]. (works like pop(index) method)
__setitem__(self, key, value, / )
Set self[key] to value.
__getitem__(...)
x.__getitem__(y) <= = > x[y]
# Other Methods:
__add__(self, value, / )
Return self + value. (works like extend ,original list unchanged)
__iadd__(self, value, / )
Implement self += value.
__mul__(self, value, / )
Return self * value.n
> l , 2, 3]
> l.__mul__(3)
[1, 2, 3, 1, 2, 3, 1, 2, 3]
__imul__(self, value, / )
Implement self *= value.
__len__(self, / )
Return len(self).
__iter__(self, / )
Implement iter(self). (convert list into iterator object)
__reversed__(...)
L.__reversed__() - - return a reverse iterator over the list
__sizeof__(...)
L.__sizeof__() - - size of L in memory, in bytes
# Comparing the lists
__eq__(self, value, / )
Return self == value.
__ge__(self, value, / )
Return self >= value.
__gt__(self, value, / )
Return self > value.
__le__(self, value, / )
Return self <= value.
__lt__(self, value, / )
Return self < value.
__ne__(self, value, / )
Return self != value.
Note : Can use the comparison operators > < <= >= != .
0 comments:
Post a Comment