graphorge.gnn_base_model.model.model_summary.OrderedDict¶

class OrderedDict[source]¶

Bases: dict

Dictionary that remembers insertion order

List of Public Methods

`clear`	od.clear() -> None.
`copy`	od.copy() -> a shallow copy of od
`fromkeys`	Create a new ordered dictionary with keys from iterable and values set to value.
`get`	Return the value for key if key is in the dictionary, else default.
`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
`move_to_end`	Move an existing element to the end (or beginning if last is false).
`pop`	od.pop(key[,default]) -> v, remove specified key and return the corresponding value.
`popitem`	Remove and return a (key, value) pair from the dictionary.
`setdefault`	Insert key with a value of default if key is not in the dictionary.
`update`	D.update([E, ]**F) -> None.
`values`	D.values() -> an object providing a view on D's values

Methods

classmethod fromkeys(iterable, value=None)¶: Create a new ordered dictionary with keys from iterable and values set to value.

get(key, default=None, /)¶: Return the value for key if key is in the dictionary, else default.

move_to_end(key, last=True)¶

Move an existing element to the end (or beginning if last is false).

Raise KeyError if the element does not exist.

pop(key[, default]) → 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(last=True)¶

Remove and return a (key, value) pair from the dictionary.

Pairs are returned in LIFO order if last is true or FIFO order if false.

setdefault(key, default=None)¶

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 dict/iterable E and F.¶: If E is present and has a .keys() method, then does: for k in E: 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]