re-dict | redis的dict结构移植成通用模块

TL;DR: How can you compare two python dictionaries if some of them have values which are unhashable/mutable (e.g. lists or pandas Dataframes)?

I have to compare dictionary pairs for equality. In that sense, this question is similar to these two, but their solutions only seem to work for immutable objects...

• Is there a better way to compare dictionary values
• Comparing two dictionaries in Python

My problem, is that I'm dealing with pairs of highly nested dictionaries where the unhashable objects could be found in different places depending on which pair of dictionaries I'm comparing. My thinking is that I'll need to iterate across the deapest values contained in the dictionary and can't just rely on the dict.iteritems() which only unrolls the highest key-value pairs. I'm not sure how iterate across all the possible key-value pairs contained in the dictionary and compare them either using sets/== for the hashable objects and in the cases of pandas dataframes, running df1.equals(df2). (Note for pandas dataframe, just running df1==df2 does a piecewise comparison and NA's are poorly handled. df1.equals(df2) gets around that does the trick.)

So for example:

I understand dictionaries are insertion ordered in Python 3.6+, as an implementation detail in 3.6 and official in 3.7+.

Given they are ordered, it seems strange that no methods exist to retrieve the i^th item of a dictionary by insertion order. The only solutions available appear to have O(n) complexity, either:

1. Convert to a list via an O(n) process and then use list.__getitem__.
2. enumerate dictionary items in a loop and return the value when the desired index is reached. Again, with O(n) time complexity.

Since getting an item from a list has O(1) complexity, is there a way to achieve the same complexity with dictionaries? Either with regular dict or collections.OrderedDict would work.

If it's not possible, is there a structural reason preventing such a method, or is this just a feature which has not yet been considered / implemented?

I have two json files, each in the form of a dictionary. I would like to compare them but ignore the 'ver' key when doing so. I've looked at the following question and implemented the answer as my function: Compare dictionaries ignoring specific keys

However, the function is still returning false when comparing two files that only have a difference in the 'ver' key.

I'm reading @Martijn Pieters' response to Converting dict to OrderedDict. The main point of his answer is that passing a regular dict to OrderedDict() will not retain the order as desired, because the dict that you are passing has already "lost" any semblance of order. His solution is to pass tuples that make up the dict's key/value pairs instead.

However, I also noticed the following in the docs:

Changed in version 3.6: With the acceptance of PEP 468, order is retained for keyword arguments passed to the OrderedDict

Does this invalidate the issue that Martijn points out (can you now pass a dict to OrderedDict), or am I misinterpreting?

I'm trying to scrape the example sentences for a specific french word using python, but the page I get back into python doesn't seem to have any results.

I've inspected the element of the search box and search button and included them as parameters. Perhaps I'm missing something?

http://www.online-languages.info/french/examples.php