You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
In the find_compatible_compressed_loc_in_range function (Link), after an x location is chosen (in the compressed grid), the function retrieves the y locations of the corresponding x location (where blocks of the given type exist in that column) and checks if search_range.ymin exists in the column. If it doesn't, the search range is expanded to include the entire column (Link). I was wondering if expanding the search range to the entire column when ymax doesn't exist has been tried. The current implementation effectively moves IO blocks from the top edge to the bottom edge, but not vice versa. @vaughnbetz: I can implement it if you think it is worth trying, and let you know the results.
The text was updated successfully, but these errors were encountered:
In the
find_compatible_compressed_loc_in_range
function (Link), after an x location is chosen (in the compressed grid), the function retrieves the y locations of the corresponding x location (where blocks of the given type exist in that column) and checks if search_range.ymin exists in the column. If it doesn't, the search range is expanded to include the entire column (Link). I was wondering if expanding the search range to the entire column when ymax doesn't exist has been tried. The current implementation effectively moves IO blocks from the top edge to the bottom edge, but not vice versa.@vaughnbetz: I can implement it if you think it is worth trying, and let you know the results.
The text was updated successfully, but these errors were encountered: