)]}'
{"swift/common/ring/builder.py":[{"author":{"_account_id":1179,"name":"Clay Gerrard","email":"clay.gerrard@gmail.com","username":"clay-gerrard"},"change_message_id":"77de07193604ac7cd424217c80a5f24ca96f8cc4","unresolved":false,"context_lines":[{"line_number":1134,"context_line":"        return (dev[\u0027parts_wanted\u0027], random.randint(0, 0xFFFF), dev[\u0027id\u0027])"},{"line_number":1135,"context_line":""},{"line_number":1136,"context_line":"    def _build_max_replicas_by_tier(self):"},{"line_number":1137,"context_line":"        \"\"\""},{"line_number":1138,"context_line":"        Returns a dict of (tier: replica_count) for all tiers in the ring."},{"line_number":1139,"context_line":""},{"line_number":1140,"context_line":"        There will always be a () entry as the root of the structure, whose"}],"source_content_type":"text/x-python","patch_set":1,"id":"3a961159_2247534d","line":1137,"updated":"2015-01-16 22:30:57.000000000","message":"\"Returns a defaultdict of ... in the ring excluding zero weight devices.\"???","commit_id":"64c5740b99b7ab91ba69f6496da89f15789b832f"},{"author":{"_account_id":2622,"name":"Samuel Merritt","email":"spam+launchpad@andcheese.org","username":"torgomatic"},"change_message_id":"0ef5c132e2a162b8f28c060ad8e24ab6e7bd9dc0","unresolved":false,"context_lines":[{"line_number":1184,"context_line":"        # Used by walk_tree to know what entries to create for each recursive"},{"line_number":1185,"context_line":"        # call."},{"line_number":1186,"context_line":"        tier2children \u003d build_tier_tree("},{"line_number":1187,"context_line":"            self._iter_devs(skip_zero_weight\u003dTrue))"},{"line_number":1188,"context_line":""},{"line_number":1189,"context_line":"        def walk_tree(tier, replica_count):"},{"line_number":1190,"context_line":"            mr \u003d {tier: replica_count}"}],"source_content_type":"text/x-python","patch_set":1,"id":"3a961159_ffd7a44c","line":1187,"updated":"2015-01-16 21:53:28.000000000","message":"How about\n\n    d for d in self._iter_devs() if d[\u0027weight\u0027] \u003e 0\n\ninstead of adding new behavior to _iter_devs?","commit_id":"64c5740b99b7ab91ba69f6496da89f15789b832f"},{"author":{"_account_id":1179,"name":"Clay Gerrard","email":"clay.gerrard@gmail.com","username":"clay-gerrard"},"change_message_id":"77de07193604ac7cd424217c80a5f24ca96f8cc4","unresolved":false,"context_lines":[{"line_number":1184,"context_line":"        # Used by walk_tree to know what entries to create for each recursive"},{"line_number":1185,"context_line":"        # call."},{"line_number":1186,"context_line":"        tier2children \u003d build_tier_tree("},{"line_number":1187,"context_line":"            self._iter_devs(skip_zero_weight\u003dTrue))"},{"line_number":1188,"context_line":""},{"line_number":1189,"context_line":"        def walk_tree(tier, replica_count):"},{"line_number":1190,"context_line":"            mr \u003d {tier: replica_count}"}],"source_content_type":"text/x-python","patch_set":1,"id":"3a961159_c2568f04","line":1187,"in_reply_to":"3a961159_ffd7a44c","updated":"2015-01-16 22:30:57.000000000","message":"oh yeah, i\u0027m sure I had it written like that at least once, wasn\u0027t obvious to me it was better.  #willfix","commit_id":"64c5740b99b7ab91ba69f6496da89f15789b832f"}]}