Trees | Index | Help |
|
---|
Module __builtin__ :: Class dict |
|
object
--+
|
dict
FakeRequest
dict() -> new empty dictionary. dict(mapping) -> new dictionary initialized from a mapping object's (key, value) pairs. dict(seq) -> new dictionary initialized as if via: d = {} for k, v in seq: d[k] = v dict(**kwargs) -> new dictionary initialized with the name=value pairs in the keyword argument list. For example: dict(one=1, two=2)
Method Summary | |
---|---|
x.__init__(...) initializes x; see x.__class__.__doc__ for signature | |
x.__cmp__(y) <==> cmp(x,y) | |
D.__contains__(k) -> True if D has a key k, else False | |
x.__delitem__(y) <==> del x[y] | |
x.__eq__(y) <==> x==y | |
x.__ge__(y) <==> x>=y | |
x.__getattribute__('name') <==> x.name | |
x.__getitem__(y) <==> x[y] | |
x.__gt__(y) <==> x>y | |
x.__hash__() <==> hash(x) | |
x.__iter__() <==> iter(x) | |
x.__le__(y) <==> x<=y | |
x.__len__() <==> len(x) | |
x.__lt__(y) <==> x<y | |
x.__ne__(y) <==> x!=y | |
T.__new__(S, ...) -> a new object with type S, a subtype of T | |
x.__repr__() <==> repr(x) | |
x.__setitem__(i, y) <==> x[i]=y | |
D.clear() -> None. | |
D.copy() -> a shallow copy of D | |
D.get(k[,d]) -> D[k] if k in D, else d. | |
D.has_key(k) -> True if D has a key k, else False | |
D.items() -> list of D's (key, value) pairs, as 2-tuples | |
D.iteritems() -> an iterator over the (key, value) items of D | |
D.iterkeys() -> an iterator over the keys of D | |
D.itervalues() -> an iterator over the values of D | |
D.keys() -> list of D's keys | |
If key is not found, d is returned if given, otherwise KeyError is raised | |
2-tuple; but raise KeyError if D is empty | |
D.setdefault(k[,d]) -> D.get(k,d), also set D[k]=d if k not in D | |
D.update(E, **F) -> None. | |
D.values() -> list of D's values | |
Inherited from object :
__delattr__ ,
__reduce__ ,
__reduce_ex__ ,
__setattr__ ,
__str__
Inherited from type :
fromkeys
|
Method Details |
---|
__init__(...)
x.__init__(...) initializes x; see x.__class__.__doc__ for
signature
|
__cmp__(x,
y)
x.__cmp__(y) <==> cmp(x,y)
|
__contains__(D,
k)
D.__contains__(k) -> True if D has a key k, else False
|
__delitem__(x,
y)
x.__delitem__(y) <==> del x[y]
|
__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]
|
__gt__(x,
y)
x.__gt__(y) <==> x>y
|
__hash__(x)
x.__hash__() <==> hash(x)
|
__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
|
__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)
|
__setitem__(x,
i,
y)
x.__setitem__(i, y) <==> x[i]=y
|
clear(D)D.clear() -> None. Remove all items from D.
|
copy(D)D.copy() -> a shallow copy of D
|
get(D, k, d=...)D.get(k[,d]) -> D[k] if k in D, else d. d defaults to None.
|
has_key(D, k)D.has_key(k) -> True if D has a key k, else False
|
items(D)D.items() -> list of D's (key, value) pairs, as 2-tuples
|
iteritems(D)D.iteritems() -> an iterator over the (key, value) items of D
|
iterkeys(D)D.iterkeys() -> an iterator over the keys of D
|
itervalues(D)D.itervalues() -> an iterator over the values of D
|
keys(D)D.keys() -> list of D's keys
|
pop(D, k, d=...)If key is not found, d is returned if given, otherwise KeyError is raised
|
popitem(D)2-tuple; but raise KeyError if D is empty
|
setdefault(D, k, d=...)D.setdefault(k[,d]) -> D.get(k,d), also set D[k]=d if k not in D
|
update(...)D.update(E, **F) -> None. Update D from E and F: for k in E: D[k] = E[k] (if E has keys else: for (k, v) in E: D[k] = v) then: for k in F: D[k] = F[k] |
values(D)D.values() -> list of D's values
|
Trees | Index | Help |
|
---|
Generated by Epydoc 2.1 on Thu Aug 16 09:55:11 2007 | http://epydoc.sf.net |