class cymel.pyutils.immutables.ImmutableDict

Inheritance diagram of ImmutableDict
class cymel.pyutils.immutables.ImmutableDict

ベースクラス: dict

イミュータブル dict

Methods:

clear(*args, **kwargs)

Remove all items from the dict.

pop(k[,d])

If the key is not found, return the default if given; otherwise, raise a KeyError.

popitem(*args, **kwargs)

Remove and return a (key, value) pair as a 2-tuple.

setdefault(*args, **kwargs)

Insert key with a value of default if key is not in the dictionary.

update([E, ]**F)

If E is present and has a .keys() method, then does: for k in E.keys(): D[k] = E[k] If E is present and lacks a .keys() method, then does: for k, v in E: D[k] = v In either case, this is followed by: for k in F: D[k] = F[k]

Methods Details:

clear(*args, **kwargs)

Remove all items from the dict.

pop(k[, d]) v, remove specified key and return the corresponding value.

If the key is not found, return the default if given; otherwise, raise a KeyError.

popitem(*args, **kwargs)

Remove and return a (key, value) pair as a 2-tuple.

Pairs are returned in LIFO (last-in, first-out) order. Raises KeyError if the dict is empty.

setdefault(*args, **kwargs)

Insert key with a value of default if key is not in the dictionary.

Return the value for key if key is in the dictionary, else default.

update([E, ]**F) None.  Update D from mapping/iterable E and F.

If E is present and has a .keys() method, then does: for k in E.keys(): D[k] = E[k] If E is present and lacks a .keys() method, then does: for k, v in E: D[k] = v In either case, this is followed by: for k in F: D[k] = F[k]