)]}'
{"nova/tests/integrated/test_api_samples.py":[{"author":{"_account_id":3217,"name":"Ian Wells","username":"ijw-ubuntu"},"change_message_id":"e52410b39d2df66e6cdad92170324f1aaadf40a8","unresolved":false,"context_lines":[{"line_number":120,"context_line":"        elif isinstance(expected, list):"},{"line_number":121,"context_line":"            if not isinstance(result, list):"},{"line_number":122,"context_line":"                raise NoMatch("},{"line_number":123,"context_line":"                        _(\u0027Result: %(result)s is not a list.\u0027) % locals())"},{"line_number":124,"context_line":"            for ex_obj in sorted(expected):"},{"line_number":125,"context_line":"                for res_obj in sorted(result):"},{"line_number":126,"context_line":"                    try:"}],"source_content_type":"text/x-python","patch_set":1,"id":"AAAALH%2F%2Fj%2F4%3D","line":123,"updated":"2012-08-30 22:11:55.000000000","message":"Either a. you compare all of a with all of b and you are O(n^2) - and sorting is of no benefit; or b. you sort both lists, compare in lockstep (\u0027does the first element of list a match list b, if so skip both\u0027) and you\u0027re O(n).  There\u0027s no reason to sort before comparing all combinations, is there?","commit_id":"cdea236065d985b3dc42e89140f9b87c7ad7cf1b"},{"author":{"_account_id":67,"name":"Vish Ishaya","email":"vishvananda@gmail.com","username":"vishvananda"},"change_message_id":"cd3e53f4dc527c3277fedff8196f63e346ebe5eb","unresolved":false,"context_lines":[{"line_number":120,"context_line":"        elif isinstance(expected, list):"},{"line_number":121,"context_line":"            if not isinstance(result, list):"},{"line_number":122,"context_line":"                raise NoMatch("},{"line_number":123,"context_line":"                        _(\u0027Result: %(result)s is not a list.\u0027) % locals())"},{"line_number":124,"context_line":"            for ex_obj in sorted(expected):"},{"line_number":125,"context_line":"                for res_obj in sorted(result):"},{"line_number":126,"context_line":"                    try:"}],"source_content_type":"text/x-python","patch_set":1,"id":"AAAALH%2F%2Fj%2Fc%3D","line":123,"in_reply_to":"AAAALH%2F%2Fj%2F4%3D","updated":"2012-08-30 22:22:02.000000000","message":"good point. I switched to this method because I was having trouble with my lists sorting in the same order, but I realize now it was due to a bug in my _objectify method for xml. I switched back to comparing in lockstep.","commit_id":"cdea236065d985b3dc42e89140f9b87c7ad7cf1b"}]}