wx.lib.agw.fmcustomizedlg.OrderedDict

An ordered dictionary implementation.

Class Hierarchy

Inheritance diagram for class OrderedDict:

Known Superclasses

collections.UserDict

Methods Summary

__init__	Initialize self. See help(type(self)) for accurate signature.
clear	D.clear() -> None. Remove all items from D.
copy
items	D.items() -> a set-like object providing a view on D’s items
keys	D.keys() -> a set-like object providing a view on D’s keys
popitem	D.popitem() -> (k, v), remove and return some (key, value) pair
setdefault	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 mapping/iterable E and F.
values	D.values() -> an object providing a view on D’s values

Class API

class OrderedDict(UserDict)

An ordered dictionary implementation.

Methods

__init__(self, dict = None)

Initialize self. See help(type(self)) for accurate signature.

---

clear(self)

D.clear() -> None. Remove all items from D.

---

copy(self)

---

items(self)

D.items() -> a set-like object providing a view on D’s items

---

keys(self)

D.keys() -> a set-like object providing a view on D’s keys

---

popitem(self)

D.popitem() -> (k, v), remove and return some (key, value) pair as a 2-tuple; but raise KeyError if D is empty.

---

setdefault(self, key, failobj = None)

D.setdefault(k[,d]) -> D.get(k,d), also set D[k]=d if k not in D

---

update(self, dict)

D.update([E, ]**F) -> None. Update D from mapping/iterable E and F. If E present and has a .keys() method, does: for k in E: D[k] = E[k] If E present and lacks .keys() method, does: for (k, v) in E: D[k] = v In either case, this is followed by: for k, v in F.items(): D[k] = v

---

values(self)

D.values() -> an object providing a view on D’s values