Split an integer N into evenly sized and spaced groups. >>> tree_groups(16, 6) [3, 2, 3, 3, 2, 3]
(N, num_groups)
| 178 | |
| 179 | |
| 180 | def tree_groups(N, num_groups): |
| 181 | """Split an integer N into evenly sized and spaced groups. |
| 182 | |
| 183 | >>> tree_groups(16, 6) |
| 184 | [3, 2, 3, 3, 2, 3] |
| 185 | """ |
| 186 | # Bresenham, you so smooth! |
| 187 | group_size = N // num_groups |
| 188 | dx = num_groups |
| 189 | dy = N - group_size * num_groups |
| 190 | D = 2 * dy - dx |
| 191 | rv = [] |
| 192 | for _ in range(num_groups): |
| 193 | if D < 0: |
| 194 | rv.append(group_size) |
| 195 | else: |
| 196 | rv.append(group_size + 1) |
| 197 | D -= 2 * dx |
| 198 | D += 2 * dy |
| 199 | return rv |
| 200 | |
| 201 | |
| 202 | def create_merge_tree(func, keys, token, level=0): |