MCPcopy Create free account
hub / github.com/dask/dask / tree_groups

Function tree_groups

dask/dataframe/partitionquantiles.py:180–199  ·  view source on GitHub ↗

Split an integer N into evenly sized and spaced groups. >>> tree_groups(16, 6) [3, 2, 3, 3, 2, 3]

(N, num_groups)

Source from the content-addressed store, hash-verified

178
179
180def 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
202def create_merge_tree(func, keys, token, level=0):

Callers 1

create_merge_treeFunction · 0.85

Calls

no outgoing calls

Tested by

no test coverage detected