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
Currently, on each iteration of rclrs::spin(), the wait set is regenerated from scratch.
It would be more efficient to be able to push new waitable entities, if any, into the existing wait set – and re-allocating storage if the capacity is not sufficient. This could work a bit like a Vec – doubling capacity each time the capacity is exceeded.
The text was updated successfully, but these errors were encountered:
Currently, on each iteration of
rclrs::spin()
, the wait set is regenerated from scratch.It would be more efficient to be able to push new waitable entities, if any, into the existing wait set – and re-allocating storage if the capacity is not sufficient. This could work a bit like a
Vec
– doubling capacity each time the capacity is exceeded.The text was updated successfully, but these errors were encountered: