)]}'
{"cliff/app.py":[{"author":{"_account_id":9107,"name":"Victor Stinner","email":"vstinner@redhat.com","username":"haypo"},"change_message_id":"0d3c2ba822e4e0a4728c9124ed1ab33a8b963cd6","unresolved":false,"context_lines":[{"line_number":318,"context_line":"                continue"},{"line_number":319,"context_line":"            # Levenshtein distance"},{"line_number":320,"context_line":"            dist.append((candidate, damerau_levenshtein(cmd, prefix, COST)+1))"},{"line_number":321,"context_line":"        dist \u003d sorted(dist, key\u003doperator.itemgetter(1, 0))"},{"line_number":322,"context_line":"        matches \u003d []"},{"line_number":323,"context_line":"        i \u003d 0"},{"line_number":324,"context_line":"        # Find the best similarity"}],"source_content_type":"text/x-python","patch_set":3,"id":"da85f559_61575d26","side":"PARENT","line":321,"updated":"2015-11-12 13:38:19.000000000","message":"Hum, building items in the reverse order would avoid operator.itemgetter here:\n\nfor ...\n  dist.append((distance, candidate))\ndist.sort()\n\n# using my code proposed below, dist items are unpacked, so it\u0027s (distance, candidate) is ok","commit_id":"25cce67529d70e3aab8653946fdf1eda12ded9b9"},{"author":{"_account_id":9107,"name":"Victor Stinner","email":"vstinner@redhat.com","username":"haypo"},"change_message_id":"0d3c2ba822e4e0a4728c9124ed1ab33a8b963cd6","unresolved":false,"context_lines":[{"line_number":328,"context_line":"        best_similarity \u003d dist[i][1]"},{"line_number":329,"context_line":"        while (dist[i][1] \u003d\u003d best_similarity):"},{"line_number":330,"context_line":"            matches.append(dist[i][0])"},{"line_number":331,"context_line":"            i +\u003d 1"},{"line_number":332,"context_line":""},{"line_number":333,"context_line":"        return matches"},{"line_number":334,"context_line":""}],"source_content_type":"text/x-python","patch_set":3,"id":"da85f559_a1054546","side":"PARENT","line":331,"updated":"2015-11-12 13:38:19.000000000","message":"Hum, I liked the old code. Why not fixing it? Example:\n\nmatch_distance \u003d 0\nfor candidate, distance in dist:\n  if distance \u003e match_distance:\n    if match_distance:\n      # we copied all items with minimum distance, we are done\n      break\n    # we copied all items with distance\u003d0,\n    # now we match all candidates at the minimum distance\n    match_distance \u003d distance\n  matches.append((candidate, distance))","commit_id":"25cce67529d70e3aab8653946fdf1eda12ded9b9"}]}