OrderedDict in Python - GeeksforGeeks

22 Jan, 2022
An OrderedDict is a dictionary subclass that remembers the order that keys were first inserted. The only difference between dict() and OrderedDict() is that:
OrderedDict preserves the order in which the keys are inserted. A regular dict doesn’t track the insertion order and iterating it gives the values in an arbitrary order. By contrast, the order the items are inserted is remembered by OrderedDict.
Python3
# A Python program to demonstrate working of OrderedDictfrom collections import OrderedDict print("This is a Dict:\n")d = {}d['a'] = 1d['b'] = 2d['c'] = 3d['d'] = 4 for key, value in d.items():    print(key, value) print("\nThis is an Ordered Dict:\n")od = OrderedDict()od['a'] = 1od['b'] = 2od['c'] = 3od['d'] = 4 for key, value in od.items():    print(key, value)
Output: 
This is a Dict:
a 1
c 3
b 2
d 4

This is an Ordered Dict:
a 1
b 2
c 3
d 4
Important Points: 
1. Key value Change: If the value of a certain key is changed, the position of the key remains unchanged in OrderedDict.
Python3
# A Python program to demonstrate working of key# value change in OrderedDictfrom collections import OrderedDict print("Before:\n")od = OrderedDict()od['a'] = 1od['b'] = 2od['c'] = 3od['d'] = 4for key, value in od.items():    print(key, value) print("\nAfter:\n")od['c'] = 5for key, value in od.items():    print(key, value)
Output: 
Before:

a 1
b 2
c 3
d 4

After:

a 1
b 2
c 5
d 4
2. Deletion and Re-Inserting: Deleting and re-inserting the same key will push it to the back as OrderedDict, however, maintains the order of insertion.
Python3
# A Python program to demonstrate working of deletion# re-insertion in OrderedDictfrom collections import OrderedDict print("Before deleting:\n")od = OrderedDict()od['a'] = 1od['b'] = 2od['c'] = 3od['d'] = 4 for key, value in od.items():    print(key, value) print("\nAfter deleting:\n")od.pop('c')for key, value in od.items():    print(key, value) print("\nAfter re-inserting:\n")od['c'] = 3for key, value in od.items():    print(key, value)
Output: 
Before deleting:

a 1
b 2
c 3
d 4

After deleting:

a 1
b 2
d 4

After re-inserting:

a 1
b 2
d 4
c 3
Other Considerations:  
Ordered dict in Python version 2.7 consumes more memory than normal dict. This is due to the underlying Doubly Linked List implementation for keeping the order. In Python 2.7 Ordered Dict is not dict subclass, it’s a specialized container from collections module.
Starting from Python 3.7, insertion order of Python dictionaries is guaranteed.
Ordered Dict can be used as a stack with the help of popitem function. Try implementing LRU cache with Ordered Dict.
This article is contributed by Sri Sanketh Uppalapati. If you like GeeksforGeeks and would like to contribute, you can also write an article using write.geeksforgeeks.org or mail your article to review-team@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.
nickzuck_007
simmytarika5
wakchauresiddhi
amartyaghoshgfg
Python collections-module
Python
Writing code in comment?
Please use ide.geeksforgeeks.org,
generate link and share the link here.
Read JSON file using Python
Adding new column to existing DataFrame in Pandas
Python map() function
How to get column names in Pandas dataframe
Read a file line by line in Python
How to Install PIP on Windows ?
Enumerate() in Python
Different ways to create Pandas Dataframe
Iterate over a list in Python
Python String | replace()