django_evolution.compat.datastructures

Compatibility imports for data structures.

This provides imports for data structures that are needed internally, to provide compatibility with different versions of Django.

class django_evolution.compat.datastructures.OrderedDict

Bases: dict

Dictionary that remembers insertion order

__init__(*args, **kwargs)

__setitem__(key, value, /)

Set self[key] to value.

__delitem__(key, /)

Delete self[key].

__iter__()

Implement iter(self).

__reversed__() <==> reversed(od)

clear() → None.  Remove all items from od.

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.

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.

__sizeof__() → size of D in memory, in bytes

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]

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

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

values() → an object providing a view on D's values

__ne__(value, /)

Return self!=value.

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.

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.

__repr__()

Return repr(self).

__reduce__()

Return state information for pickling

copy() → a shallow copy of od

fromkeys(value=None)

Create a new ordered dictionary with keys from iterable and values set to value.

__eq__(value, /)

Return self==value.

__ge__(value, /)

Return self>=value.

__gt__(value, /)

Return self>value.

__hash__ = None

__le__(value, /)

Return self<=value.

__lt__(value, /)

Return self<value.