| Name : python-odict
| |
| Version : 1.5.1
| Vendor : openSUSE
|
| Release : bp151.2.11
| Date : 2019-05-18 23:20:08
|
| Group : Development/Languages/Python
| Source RPM : python-odict-1.5.1-bp151.2.11.src.rpm
|
| Size : 0.05 MB
| |
| Packager : https://bugs_opensuse_org
| |
| Summary : Ordered dictionary
|
Description :
Dictionary in which the *insertion* order of items is preserved (using an
internal double linked list). In this implementation replacing an existing
item keeps it at its original position.
Internal representation: values of the dict::
[pred_key, val, succ_key]
The sequence of elements uses as a double linked list. The ``links`` are dict
keys. ``self.lh`` and ``self.lt`` are the keys of first and last element
inseted in the odict. In a C reimplementation of this data structure, things
can be simplified (and speed up) a lot if given a value you can at the same
time find its key. With that, you can use normal C pointers.
|
RPM found in directory: /packages/linux-pbone/ftp5.gwdg.de/pub/opensuse/repositories/openSUSE:/Backports:/SLE-15-SP1/standard/noarch |
