A mutable mapping data structure which compares using "is".

This is necessary because we have trackable objects (_ListWrapper) which have behavior identical to built-in Python lists (including being unhashable and comparing based on the equality of their contents by default).



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


Retrieve the corresponding layout by the string key.

When there isn't an exact match, all the existing keys in the layout map will be treated as a regex and map against the input key again. The first match will be returned, based on the key insertion order. Return None if there isn't any match found.

key the string key as the query for the layout.

Corresponding layout based on the query.


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


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


D.pop(k[,d]) -> v, remove specified key and return the corresponding value. If key is not found, d is returned if given, otherwise KeyError is raised.


D.popitem() -> (k, v), remove and return some (key, value) pair as a 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. 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


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



Return self==value.


View source


View source


View source