mirror of
https://github.com/vale981/ray
synced 2025-03-06 10:31:39 -05:00
![]() Why are these changes needed? Introduce a stable version of split with hints with a stable equalizing algorithm: use the greedy algorithm to generate the initial unbalanced splits. for each splits, first shave them so the number for rows are below the target_size based on how many rows needed for each split, do a one time split_at_index to the left over blocks. merge the shaved splits with the leftover splits. The guarantee of this algorithm is we at most need to split O(split) number of blocks. |
||
---|---|---|
.. | ||
ray | ||
requirements | ||
asv.conf.json | ||
build-wheel-macos-arm64.sh | ||
build-wheel-macos.sh | ||
build-wheel-manylinux2014.sh | ||
build-wheel-windows.sh | ||
MANIFEST.in | ||
README-building-wheels.md | ||
requirements.txt | ||
requirements_linters.txt | ||
requirements_ml_docker.txt | ||
setup.py |