Home | Trees | Index | Help |
|
---|
Package aquarium :: Package util :: Module FormDict :: Class FormDict |
|
object
--+ |dict
--+ | FormDict
Translate a cgi.FieldStorage into a (possibly recursive) dict.
If you've used cgi.FieldStorage from the Python standard library, you've probably translated it into a dict, which has a more friendly API. Then, at some point (either before or after you wrote the translation), you probably realized why cgi.FieldStorage is the way it is--because the same field can have multiple values.
This code works around this requirement in a more friendly way that is inspired by PHP. Specifically:
XXX Below here doesn't actually work and is more of a TODO:
The following attributes are used:
Method Summary | |
---|---|
Accept a cgi.FieldStorage as an initializer. | |
Takes a list of idxs to follow down the nested dicts contained in thardict where it will insert val. | |
extractIndexes(self,
key)
| |
Inherited from dict | |
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 | |
x.__delattr__('name') <==> del x.name... | |
helper for pickle... | |
helper for pickle... | |
x.__setattr__('name', value) <==> x.name = value... | |
x.__str__() <==> str(x)... | |
Inherited from type | |
v defaults to None. |
Method Details |
---|
__init__(self,
fieldStorage)
|
buildDict(self, idxs, val, thardict)Takes a list of idxs to follow down the nested dicts contained in thardict where it will insert val.
|
Home | Trees | Index | Help |
|
---|
Generated by Epydoc 2.1 on Mon Jan 1 16:34:19 2007 | http://epydoc.sf.net |